Least squares fitting with elliptic paraboloids

Size: px
Start display at page:

Download "Least squares fitting with elliptic paraboloids"

Transcription

1 MATHEMATICAL COMMUNICATIONS 409 Math. Coun. 18(013), Least squares fitting with elliptic paraboloids Heluth Späth 1, 1 Departent of Matheatics, University of Oldenburg, Postfach 503, D Oldenburg, Gerany Received April 6, 013; accepted June 0, 013 Abstract. In [4], we discussed the proble of fitting soe rotated paraboloid to given easured data in 3-space. A nuerical ethod was developed and nuerical exaples were given. Recently that ethod was used to fit soe parabolic antenna filter [1]. In this connection the question arises whether this ethod could be extended for elliptic paraboloids needed for soe edical application []. We show how this could be done and recoend a nuerical ethod ore difficult but siilar to that one in [4]. AMS subject classifications: 65D10, 65C60 Key words: least squares fitting, elliptic paraboloids, nuerical ethod 1. The proble An elliptic paraboloid with the z-axis as the axis and the origin as the vertex is given by ( ) x z = d A + y B, (1) where A and B are the half axes of an ellipse and d is varying. For A = B = 1 we would have a rotated paraboloid [4]. Instead of (1), we will better use the canonical paraetric for x = Av cos u y = Bv sin u () z = dv, where u [0, π), < v <, If (a, b, c) T is soe shifting of the origin and cos β 0 sin β Q(β) = (3) sin β 0 cos β P (γ) = cos γ sin γ (4) 0 sin γ cos γ Corresponding author. Eail address: spaeth@atheatik.uni-oldenburg.de (H. Späth) c 013 Departent of Matheatics, University of Osijek

2 410 H. Späth are rotations in the x z plane and in the y z plane, then our extended odel () reads x a + Av cos u y = P (γ)q(β) b + Bv sin u. (5) z c + dv Reark: A third rotation could be included in the x z plane [], but this is oitted due to a larger extent. If now data points (x i,, ) T (i = 1,..., ) are given to which odel (5) should be fitted in the least square sense, then 1 x i P (γ)q(β) a + Av i cos u i b + Bv i sin u i c + dvi has to be iniized with respect to the 8 + unknowns a, A, b, B, c, d, β, γ, u, v, where u = (u 1,..., u ) T, v = (v 1,..., v ) T. (7) It turns out to be soewhat ore convenient transforing the given data (x i,, ) T by x i x i x i x i = P (γ) T, ỹ i = Q(β) T. (8) Note that P (γ) 1 = P (γ) T and Q(β) 1 = Q(β) T. Now the iniization of (6) is equivalent to the iniization of the following objective S(a,A, B, b, c, d, β, γ, u, v) = 1 x i a + Av i cos u i ỹ i b + Bv i sin u i c + dvi = 1 ( x i a Av i cos u i ) + (ỹ i b Bv i sin u i ) + ( c dvi ) (9) = 1 S i (a, A, b, B, c, d, β, γ, u i, v i ).. Necessary conditions for iniu All 8 + partial derivatives of S with respect to the 8 + unknowns ust becoe zero. This is a highly nonlinear syste of equations that can be solved neither explicitly nor easily nuerically (e. g. by NEWTON s ethod). Instead we will use a successive iniization ethod which is generally described in [4] and also realized for rotated paraboloids. But at first we explicitly need all partial derivatives of S. We will list the by the order of variables given in (7). (6)

3 Least squares fitting with elliptic paraboloids 411 We have a = 0 A = 0 b = 0 B = 0 c = 0 d = 0 a + Av i cos u i = av i cos u i + Av i cos u i = b + Bv i sin u i = bv i sin u i + Bv i sin u i = c + dv i = cv i + dv 4 i = x i, (10) v i cos u i, (11) ỹ i, (1) v i sin u i (13) (14) vi. (15) Further, = 0 + ( x i a Av i cos u i ) + Here corresponding to (8) we have (ỹ i b Av i sin u i ) ( c dv i ) = 0. (16) x i ỹ i = Q(β) T P (γ) T x i (17) and also z i = Q(β)T x i. (18) Inserting (17) and (18) into (16) we receive = 0 H sin β G cos β = 0, (19)

4 41 H. Späth where H = G = x i (a + Av i cos u i ) + (c + dvi ) (a + Av i cos u i ) + x i (c + dvi ). For a iniu we ust have In this case S = H cos β + G sin β > 0. β = atan ( ) G, (0) H else this value has to be replaced by β + π. Using (8) the variable β also depends on γ. Siilarly to (16)-(0) we have = 0 + ( x i a Av i cos u i ) + (ỹ i b Bv i sin u i ) ( c dv i ) = 0. (1) Using (8) we have z i T P (γ)t = Q(β) x i. () Putting (17) and () into (1) after lengthy calculations we get where U = V = = 0 U cos γ + V sin γ = 0, (3) sin β (a + Av i cos u i ) (b + Bv i sin u i ) + cos β (c + dvi ), sin β (a + Av i cos u i ) + (b + Bv i sin u i ) + cos β (c + dvi ).

5 For a iniu we ust have In this case Least squares fitting with elliptic paraboloids 413 S = U sin γ + V cos γ > 0. γ = ( ) U V else this value has to be replaced by γ + π. Finally, = = 0 (i = 1,..., ) v i v i ust be exained. First we consider v i = i v i = 0 A cos u i ( x i a Av i cos u i ) + B sin u i (ỹ i b Bv i sin u i ) (4) + dv i ( c dv i ) = 0 (5) d v 3 i (A cos u i + B sin u i d( c))v i [A cos u i ( x i a) + B sin u i (ỹ i b)] = 0. These are polynoial equations of degree three, each with one or three real solutions. If there are three real roots, then the one with the sallest value for S i (i = 1,..., ) ust be selected. Analogously, we have to look for Putting for (6) we get Substituting u i = i u i = 0 Av i sin u i ( x i a Av i cos u i ) Bv i cos u i (ỹ i b Bv i sin u i ) = 0 (6) (B A )v i sin u i cos u i + Av i sin u i ( x i a) Bv i cos u i (ỹ i b) = 0. u = u i, w = (B A )v i, p = Av i ( x i a), q = Bv i (ỹ i b) w sin u cos u + p sin u q cos u = 0. (7) r = tgu for (7) we receive again a polynoial equation but now of degree four. It can be shown that it has at least one real root [3]. This eans that there exist two or four real solutions. Again for each i = 1..., this one with the sallest value of S i has to be chosen. Note that polynoial equations of degree three and four can be solved exactly, i.e. without soe iterative nuerical ethod.

6 414 H. Späth 3. Nuerical algoriths There are any possible sequences of the following series of necessary conditions (10) through (15), (18,3), and (5,6) for i = 1,..., to be always fulfilled during the iniization process. We will describe two possible sequences. All values of unknows newly calculated in previous steps ought to be used within Steps 1 4. Method I Step 0: Let starting values for β, γ, u and v be given (e.g. u i = πi, v i equidistant within the interval [in z k, ax z k ] for k = 1..., ). k k Step 1: Calculate (a, A), (b, B), and (c, d) using in each case the corresponding two linear equations (10,11), (1,13), and (14,15). Those will always have a unique solution corresponding to an absolute iniu. Step : Calculate β = β(a, A, c, d, γ) by (19) and also γ = γ(a, A, b, B, c, d, β) by (3) as described. Step 3: Calculate all real zeroes (1 or 3) for v i = v i (u i ) via (5,6) and also those ( or 4) for u i = u i (v i ) (i = 1,..., ) and select in each case the one with the sallest value of S i. Step 4: Calculate S. If it has decreased again, then go back to Step 1, else STOP. Check for soe iniu of S, i.e. if at least all necessary conditions are fulfilled. Method II Step 0: Let a, A, b, B, c, d, β, γ and u or v be given as starting values. Step 1: Calculate u = u(v) or v = v(u) for given v or u in Step 1 siilarly to Step 3 of Method I. Select the zeroes such that S i is inial. Step : Calculate β = β(γ) and γ = γ(β) by (19) and (3) as in Step of Method I. Step 3: Calculate (a, A), (b, B), and (c, d) as in Step 1 of Method I. Step 4: As decribed in Method I. There ay be other sequences for the variables resulting in other ethods, too. But it does not see possible to select soe best sequence in the sense that its success does not depend on the given data (x i,, ) T (i = 1,..., ) and with best convergence properties. There is also no convergence proof for any ethod. But as was indicated by nuerical experients for A = B = 1 [4], Method II perfectly worked and so we recoend it here, too. References [1] Pietro Cerveri, private counication, January 011. [] Guiseppe Orlando, private counication, May 011.

7 Least squares fitting with elliptic paraboloids 415 [3] H. Späth, Least squares fitting of ellipses and hyperbolas, Coput. Statist. 1(1997), [4] H. Späth, Least squares fitting with rotated paraboloids, Math. Coun. 6(001),

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

Fitting conic sections to measured data in 3-space

Fitting conic sections to measured data in 3-space MATHEMATICAL COMMUNICATIONS 143 Math. Commun. 18(2013), 143 150 Fitting conic sections to measured data in 3-space Helmuth Späth 1, 1 Department of Mathematics, University of Oldenburg, Postfach 2503,

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

An Approach to Conic Sections

An Approach to Conic Sections n pproach to Conic ections Jia. F. Weng 1998 1 Introduction. The study of conic sections can be traced back to ancient Greek atheaticians, usually to pplonious (ca. 220-190 bc) [2]. The nae conic section

More information

MA304 Differential Geometry

MA304 Differential Geometry MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question

More information

RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS

RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

More information

Support Vector Machines. Maximizing the Margin

Support Vector Machines. Maximizing the Margin Support Vector Machines Support vector achines (SVMs) learn a hypothesis: h(x) = b + Σ i= y i α i k(x, x i ) (x, y ),..., (x, y ) are the training exs., y i {, } b is the bias weight. α,..., α are the

More information

Ch 12: Variations on Backpropagation

Ch 12: Variations on Backpropagation Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

Solving initial value problems by residual power series method

Solving initial value problems by residual power series method Theoretical Matheatics & Applications, vol.3, no.1, 13, 199-1 ISSN: 179-9687 (print), 179-979 (online) Scienpress Ltd, 13 Solving initial value probles by residual power series ethod Mohaed H. Al-Sadi

More information

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

AN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION

AN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION Aksan, E..: An Applıcatıon of Cubıc B-Splıne Fınıte Eleent Method for... THERMAL SCIECE: Year 8, Vol., Suppl., pp. S95-S S95 A APPLICATIO OF CBIC B-SPLIE FIITE ELEMET METHOD FOR THE BRGERS EQATIO by Eine

More information

Polynomial Division By Convolution

Polynomial Division By Convolution Applied Matheatics E-Notes, (0), 9 c ISSN 0-0 Available free at irror sites of http://wwwathnthuedutw/aen/ Polynoial Division By Convolution Feng Cheng Chang y Received 9 March 0 Abstract The division

More information

Feedforward Networks

Feedforward Networks Feedforward Networks Gradient Descent Learning and Backpropagation Christian Jacob CPSC 433 Christian Jacob Dept.of Coputer Science,University of Calgary CPSC 433 - Feedforward Networks 2 Adaptive "Prograing"

More information

Research Article Approximate Multidegree Reduction of λ-bézier Curves

Research Article Approximate Multidegree Reduction of λ-bézier Curves Matheatical Probles in Engineering Volue 6 Article ID 87 pages http://dxdoiorg//6/87 Research Article Approxiate Multidegree Reduction of λ-bézier Curves Gang Hu Huanxin Cao and Suxia Zhang Departent of

More information

Feedforward Networks

Feedforward Networks Feedforward Neural Networks - Backpropagation Feedforward Networks Gradient Descent Learning and Backpropagation CPSC 533 Fall 2003 Christian Jacob Dept.of Coputer Science,University of Calgary Feedforward

More information

Efficient Filter Banks And Interpolators

Efficient Filter Banks And Interpolators Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical

More information

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Feedforward Networks. Gradient Descent Learning and Backpropagation. Christian Jacob. CPSC 533 Winter 2004

Feedforward Networks. Gradient Descent Learning and Backpropagation. Christian Jacob. CPSC 533 Winter 2004 Feedforward Networks Gradient Descent Learning and Backpropagation Christian Jacob CPSC 533 Winter 2004 Christian Jacob Dept.of Coputer Science,University of Calgary 2 05-2-Backprop-print.nb Adaptive "Prograing"

More information

Generalized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili,

Generalized AOR Method for Solving System of Linear Equations. Davod Khojasteh Salkuyeh. Department of Mathematics, University of Mohaghegh Ardabili, Australian Journal of Basic and Applied Sciences, 5(3): 35-358, 20 ISSN 99-878 Generalized AOR Method for Solving Syste of Linear Equations Davod Khojasteh Salkuyeh Departent of Matheatics, University

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Boosting with log-loss

Boosting with log-loss Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular

More information

Randomized Recovery for Boolean Compressed Sensing

Randomized Recovery for Boolean Compressed Sensing Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch

More information

Determining OWA Operator Weights by Mean Absolute Deviation Minimization

Determining OWA Operator Weights by Mean Absolute Deviation Minimization Deterining OWA Operator Weights by Mean Absolute Deviation Miniization Micha l Majdan 1,2 and W lodziierz Ogryczak 1 1 Institute of Control and Coputation Engineering, Warsaw University of Technology,

More information

Homework 3 Solutions CSE 101 Summer 2017

Homework 3 Solutions CSE 101 Summer 2017 Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

Combining Classifiers

Combining Classifiers Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/

More information

Analyzing Simulation Results

Analyzing Simulation Results Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient

More information

Rational Filter Wavelets*

Rational Filter Wavelets* Ž Journal of Matheatical Analysis and Applications 39, 744 1999 Article ID jaa19996550, available online at http:wwwidealibraryco on Rational Filter Wavelets* Kuang Zheng and Cui Minggen Departent of Matheatics,

More information

A Model for the Selection of Internet Service Providers

A Model for the Selection of Internet Service Providers ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,

More information

Bulletin of the. Iranian Mathematical Society

Bulletin of the. Iranian Mathematical Society ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Matheatical Society Vol. 41 (2015), No. 4, pp. 981 1001. Title: Convergence analysis of the global FOM and GMRES ethods for solving

More information

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol., No., 6, pp.-9 Bernoulli Wavelet Based Nuerical Method for Solving Fredhol Integral Equations of the Second Kind S. C. Shiralashetti*,

More information

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS

More information

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volue 3, Nuber 2, Pages 211 231 c 2006 Institute for Scientific Coputing and Inforation A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR

More information

Lower Bounds for Quantized Matrix Completion

Lower Bounds for Quantized Matrix Completion Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &

More information

Stability Ordinates of Adams Predictor-Corrector Methods

Stability Ordinates of Adams Predictor-Corrector Methods BIT anuscript No. will be inserted by the editor Stability Ordinates of Adas Predictor-Corrector Methods Michelle L. Ghrist Jonah A. Reeger Bengt Fornberg Received: date / Accepted: date Abstract How far

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS ISSN 1440-771X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS An Iproved Method for Bandwidth Selection When Estiating ROC Curves Peter G Hall and Rob J Hyndan Working Paper 11/00 An iproved

More information

Iterative Linear Solvers and Jacobian-free Newton-Krylov Methods

Iterative Linear Solvers and Jacobian-free Newton-Krylov Methods Eric de Sturler Iterative Linear Solvers and Jacobian-free Newton-Krylov Methods Eric de Sturler Departent of Matheatics, Virginia Tech www.ath.vt.edu/people/sturler/index.htl sturler@vt.edu Efficient

More information

Polytopes and arrangements: Diameter and curvature

Polytopes and arrangements: Diameter and curvature Operations Research Letters 36 2008 2 222 Operations Research Letters wwwelsevierco/locate/orl Polytopes and arrangeents: Diaeter and curvature Antoine Deza, Taás Terlaky, Yuriy Zinchenko McMaster University,

More information

Variations on Backpropagation

Variations on Backpropagation 2 Variations on Backpropagation 2 Variations Heuristic Modifications Moentu Variable Learning Rate Standard Nuerical Optiization Conjugate Gradient Newton s Method (Levenberg-Marquardt) 2 2 Perforance

More information

Complexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters

Complexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When

More information

Topic 5a Introduction to Curve Fitting & Linear Regression

Topic 5a Introduction to Curve Fitting & Linear Regression /7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

ma x = -bv x + F rod.

ma x = -bv x + F rod. Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations

Comparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah

More information

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse

Mathematical Model and Algorithm for the Task Allocation Problem of Robots in the Smart Warehouse Aerican Journal of Operations Research, 205, 5, 493-502 Published Online Noveber 205 in SciRes. http://www.scirp.org/journal/ajor http://dx.doi.org/0.4236/ajor.205.56038 Matheatical Model and Algorith

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science Proceedings of the 6th WSEAS International Conference on Applied Coputer Science, Tenerife, Canary Islands, Spain, Deceber 16-18, 2006 183 Qualitative Modelling of Tie Series Using Self-Organizing Maps:

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Explicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM

Explicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM Applied Matheatical Sciences Vol. 3 9 no. 1 13-13 Explicit Approxiate Solution for Finding the Natural Frequency of the Motion of Pendulu by Using the HAM Ahad Doosthoseini * Mechanical Engineering Departent

More information

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2

More information

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank

More information

A Note on A Solution Method to the Problem. Proposed by Wang in Voting Systems

A Note on A Solution Method to the Problem. Proposed by Wang in Voting Systems Applied Matheatical Sciences, Vol. 5, 0, no. 6, 305 3055 A Note on A Solution Method to the Proble Proposed by Wang in Voting Systes F. Hosseinzadeh Lotfi Departent of Matheatics, Science and Research

More information

A Quantum Observable for the Graph Isomorphism Problem

A Quantum Observable for the Graph Isomorphism Problem A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert

More information

An Optimal Family of Exponentially Accurate One-Bit Sigma-Delta Quantization Schemes

An Optimal Family of Exponentially Accurate One-Bit Sigma-Delta Quantization Schemes An Optial Faily of Exponentially Accurate One-Bit Siga-Delta Quantization Schees Percy Deift C. Sinan Güntürk Felix Kraher January 2, 200 Abstract Siga-Delta odulation is a popular ethod for analog-to-digital

More information

Controlled Flooding Search with Delay Constraints

Controlled Flooding Search with Delay Constraints Controlled Flooding Search with Delay Constraints Nicholas B. Chang and Mingyan Liu Departent of Electrical Engineering and Coputer Science University of Michigan, Ann Arbor, MI 4809-222 Eail: {changn,ingyan}@eecs.uich.edu

More information

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

More information

arxiv: v1 [cs.ds] 29 Jan 2012

arxiv: v1 [cs.ds] 29 Jan 2012 A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore

More information

Modified Systematic Sampling in the Presence of Linear Trend

Modified Systematic Sampling in the Presence of Linear Trend Modified Systeatic Sapling in the Presence of Linear Trend Zaheen Khan, and Javid Shabbir Keywords: Abstract A new systeatic sapling design called Modified Systeatic Sapling (MSS, proposed by ] is ore

More information

AN EFFICIENT CLASS OF CHAIN ESTIMATORS OF POPULATION VARIANCE UNDER SUB-SAMPLING SCHEME

AN EFFICIENT CLASS OF CHAIN ESTIMATORS OF POPULATION VARIANCE UNDER SUB-SAMPLING SCHEME J. Japan Statist. Soc. Vol. 35 No. 005 73 86 AN EFFICIENT CLASS OF CHAIN ESTIMATORS OF POPULATION VARIANCE UNDER SUB-SAMPLING SCHEME H. S. Jhajj*, M. K. Shara* and Lovleen Kuar Grover** For estiating the

More information

Supplementary Information

Supplementary Information Suppleentary Inforation Curved singular beas for three-diensional particle anipulation Juanying Zhao 1-3 *, Ioannis Chreos 4,5 *, Daohong Song 1, Deetrios N. Christodoulides, Nikolaos K. Efreidis 4, and

More information

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

AN ITERATIVE MAXIMUM EIGENVALUE METHOD FOR SQUARED DISTANCE SCALING 1. INTRODUCTION

AN ITERATIVE MAXIMUM EIGENVALUE METHOD FOR SQUARED DISTANCE SCALING 1. INTRODUCTION AN ITERATIVE MAXIMUM EIGENVALUE METHOD FOR SQUARED DISTANCE SCALING JAN DE LEEUW ABSTRACT. Meet the abstract. This is the abstract. 1. INTRODUCTION The proble we consider in this paper is a etric ultidiensional

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information

Pattern Classification using Simplified Neural Networks with Pruning Algorithm

Pattern Classification using Simplified Neural Networks with Pruning Algorithm Pattern Classification using Siplified Neural Networks with Pruning Algorith S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract: In recent years, any neural network odels have been proposed for pattern classification,

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition

More information

On the Existence of Pure Nash Equilibria in Weighted Congestion Games

On the Existence of Pure Nash Equilibria in Weighted Congestion Games MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure

More information

Controlled Flooding Search with Delay Constraints

Controlled Flooding Search with Delay Constraints Controlled Flooding Search with Delay Constraints Nicholas B. Chang and Mingyan Liu Departent of Electrical Engineering and Coputer Science University of Michigan, Ann Arbor, MI 48109-2122 Eail: {changn,ingyan}@eecs.uich.edu

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

ANALYSIS OF REFLECTOR AND HORN ANTENNAS USING MULTILEVEL FAST MULTIPOLE ALGORITHM

ANALYSIS OF REFLECTOR AND HORN ANTENNAS USING MULTILEVEL FAST MULTIPOLE ALGORITHM European Congress on Coputational Methods in Applied Sciences and Engineering ECCOMAS 2 Barcelona, 11-14 Septeber 2 ECCOMAS ANALYSIS OF REFLECTOR AND HORN ANTENNAS USING MULTILEVEL FAST MULTIPOLE ALGORITHM

More information

XV International PhD Workshop OWD 2013, October On the theory of generalized pendulum on a vibrating base

XV International PhD Workshop OWD 2013, October On the theory of generalized pendulum on a vibrating base XV International PhD Workshop OWD 03, 9 October 03 On the theory of generalized pendulu on a vibrating base Michail Geraichuk, Yuri Lazarev, Peter Aksonenko, College of Instruent Design and Engineering,

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is

More information

The Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method

The Solution of One-Phase Inverse Stefan Problem. by Homotopy Analysis Method Applied Matheatical Sciences, Vol. 8, 214, no. 53, 2635-2644 HIKARI Ltd, www.-hikari.co http://dx.doi.org/1.12988/as.214.43152 The Solution of One-Phase Inverse Stefan Proble by Hootopy Analysis Method

More information

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn

More information

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65 The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA, Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu

More information

arxiv:math/ v1 [math.co] 22 Jul 2005

arxiv:math/ v1 [math.co] 22 Jul 2005 Distances between the winning nubers in Lottery Konstantinos Drakakis arxiv:ath/0507469v1 [ath.co] 22 Jul 2005 16 March 2005 Abstract We prove an interesting fact about Lottery: the winning 6 nubers (out

More information

Lecture 13 Eigenvalue Problems

Lecture 13 Eigenvalue Problems Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

IAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems

IAENG International Journal of Computer Science, 42:2, IJCS_42_2_06. Approximation Capabilities of Interpretable Fuzzy Inference Systems IAENG International Journal of Coputer Science, 4:, IJCS_4 6 Approxiation Capabilities of Interpretable Fuzzy Inference Systes Hirofui Miyajia, Noritaka Shigei, and Hiroi Miyajia 3 Abstract Many studies

More information

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography

Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it

More information