A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact. Data. Bob Anderssen and Frank de Hoog,
|
|
- Brittany Chase
- 5 years ago
- Views:
Transcription
1 A Stable Finite Dierence Ansatz for Higher Order Dierentiation of Non-Exact Data Bob Anderssen and Frank de Hoog, CSIRO Division of Mathematics and Statistics, GPO Box 1965, Canberra, ACT 2601, Australia and Markus Hegland, Computer Sciences Laboratory, RSISE, Australian National University, Canberra ACT 0200, Australia Abstract If standard central dierence formulas are used to compute second or third order derivatives from measured data even quite precise data can lead to totally unusable results due to the basic instability of the dierentiation process. Here an averaging procedure is presented and analysed which allows the stable computation of low order derivatives from measured data. The new method rst averages the data, then samples the averages and nally applies standard dierence formulas. The size of the averaging set acts like a regularization parameter and has to be chosen as a function of the grid size h Mathematics Subject Classication. 65D25. 1
2 1. Introduction Let the given (observational or non-exact) data be dened by d := fd j = f(t j ) + j ; t j = jh; h = 1=n; j = 0; 1; 2; ; ng; (1) where f(t) denotes the underlying, but unknown, signal process and the j denote the (observational or non-exact) errors which are assumed to be identical and independently distributed normal random variables with E[ j ] = 0 and E[ j k ] = 2 jk, where jk denotes the Kronecker delta function and E[] the expectation operator. In the numerical dierentiation of non-exact data, the goal is to recover, from the given data d, an estimate of some (lower order) derivative f (p) (t) := d p f(t)=dt p ; p = 1; 2; or 3; (say); rather than f itself. Often, it is only the rst derivative that is required. This situation has been examined in considerable detail in the literature, under the assumption that higher order dierentiation is some natural generalization of the results for rst order dierentiation. Clearly, even the fractional dierentiation of non-exact data (cf. Anderssen (1976) and Hegland and Anderssen (1995)) can, on occasions, be given a similar interpretation. However, though not incorrect, this assumption glosses over important practical details which are the focus of this paper. Notation and Assumptions. The notation j will be used to denote the nite dierence value of the p-th derivative evaluated at the grid point jh. The function f will be assumed to have the smoothness required by the formulas presented below in terms of the dierentiation they involve. 2. The Finite Dierence Ansatz for First Order Dierentiation Often, in the past (cf. Andersen (1963)), and even today, data are dierentiated using a ruler to obtain an estimate of the rst derivative of f. It is fast and has a natural intuitive appeal. In fact, for the practitioner, who has just measured or calculated (graphically) some specic data the rst derivative of which must be estimated before their interpretation is possible, the ruler approach represents a realistic alternative (cf. Anderssen and Bloomeld (1974)). It is the reason why it is still used today, at least as a quick exploratory tool. However, its greatest drawback is (and was) its lack of objectivity in that the form of the rst derivative determined by a particular individual will be inuenced by their level of familiarity with the context within which that data have been derived. 2
3 Mathematically, numerical dierentiation was initially seen as simply a special case of constructing nite dierence approximations to derivatives. Consequently, the earliest methods proposed for the numerical dierentiation of accurate numerical, though not necessarily exact, data were nite dierence formulas. They were derived, in one way or another, through the manipulation of either the denition of a derivative or Taylor's expansion (theorem). They predate the computer (cf. Hartree (1952)), and relate closely to the earliest ideas about the numerical approximation of derivatives in dierential equations (cf. Richardson (1910)). However, the interconnection is not clear cut. On the one hand, forward, backwards and central dierence approximations take center stage in the numerical solution of dierential equations, whereas it is only the central (centered) dierence formulas (or, equivalently, centered moving-averages) f [1] j [m] = d j+m? d j?m ; m = 1; 2; ; j = m; m + 1; ; n? m; (2) 2mh which are the key to the numerical dierentiation of data. Normally, m is chosen to have the value 1, but the possibility of choosing a greater value has been implicitly examined by a number of authors within the context of optimizing the choice of h (cf. Conte and de Boor (1980; Section 7.1)). In part, the advantage of a central dierence formula, over the alternatives such as forward and backwards dierences, is the associated higher order of convergence, which, in turn, can be explained algebraically and graphically as a practical realization of the mean value theorem. In fact, the ruler dierentiation simply corresponds to an analogue realization of the mean value theorem applied directly to the data. Statistically, the approach adopted was quite dierent. Whereas the nite dierence formula approach moreorless determines the derivatives at the data points directly and explicitly from the data, the statistical approach is indirect. Here, one rst estimates statistically the parameters in an assumed parametric estimate ^f(t; ) of f(t), and then estimates f (1) (t) as ^f [1] (t; ): This statistical approach leads naturally to the following two important generalizations: (a) Non-Parametric Dierentiation. This is simply the non-parametric counterpart to the parametric procedure outlined above, where one replaces the specic choice of a parametric model for f(t) by a non-parametric functional characterizing its structure. For example, a popular choice for the non-parametric functional is the least squares smoothing spline criterion (cf. Wahba (1990)) f (t) = argfmin f 2H 1 [ nx j=0 (f(t j )? d j ) 2 + Z tn t 0 (d 2 f(t)=dt 2 ) 2 dt]g; (3) where H 1 denotes the Sobolev space of absolutely continuous rst derivatives. 3
4 (b) Fourier-Wiener Dierentiation. If it is assumed that the data has been generated by a stationary stochastic process, then discrete Fourier analysis and Wiener ltering can be applied directly to the data to recover an estimate of the (rst) derivative of f(t) (cf. Anderssen and Bloomeld (1974)). Though the major emphasis in Anderssen and Bloomeld (1974) was on the implementation of numerical dierentiation as a Wiener ltering process, they showed how, for given data, the Wiener ltering theory could be used to construct a type of centered moving-average (local dierentiator) for performing the dierentiation. In essence, these local dierentiators are simply central dierence formulas. However, the utility of such formulas does not appear to have been pursued in any great detail. In an independent study, Anderssen and de Hoog (1984) analysed the stability properties of multipoint nite dierence dierentiators of the form f [1] j = f [1] (t j ) = k=?r W k d j+k ; (4) where the W k ; k =?r;?r + 1; ; r? 1; r, denote appropriately chosen weights. They rst observed that, if the weights satisfy W k =?W?k ; k = 0; 1; 2; ; r; which implies that W 0 = 0, then the multipoint nite dierence dierentiators (4) are exact for constant data, and can be rewritten as the following sum of the central dierence dierentiators [k] f [1] j where f [1] j = k=1 w k f [1] j [k]; W k = w k =(2kh); k = 1; 2; ; r; (5) k=1 w k = 1: (6) In part, the goal of that paper was to show that the stabilization of such formulas was controlled by its length r. In fact, it was established that the choice of the length r must be related to the size of the step-length h so that r increases appropriately as h decreases. Consequently, under such circumstances, the dierentiator (5) can be given a regularization interpretation in which the length r and the weights w j play, respectively, the role of the regularization parameter and the regularization. A formal characterization of this fact was also derived. In a spline-type context, such results can be formalized using mollication (cf. Anderssen (1995)). Hegland and 4
5 Pragmatically, this result yields a natural ansatz for the construction of nite dierence formulas for the stabilized numerical dierentiation of one-dimensional observational or non-exact data; namely, The Finite Dierence Ansatz for First Order Dierentiation: \Choose as the local dierentiator, a weighted sum of the central dierence dierentiators j [m] so that, when it is applied to the data as a centered moving-average, an appropriately smooth estimate of the derivative f (p) (t) of the signal f(t) results." The purpose of this paper is an examination of the applicability of this ansatz to higher order dierentiation, when, for a xed m, the averaging is performed with respect to j. A natural motivation for this approach can be based on the advantages of performing repeated measurements in a statistical analysis. In fact, if, relative to the smoothness of f, the size of h is very small, then, for small r, the values of f [1] j+l[m]; l =?r;?r + 1; ; r? 1; r; can be viewed as repeated measurements of f [1] j [m]. 3. The Finite Dierence Operators Let: (a) D p denote the dierential operator of order p dened by D p = dp ; p = 1; 2; : dtp (b) I correspond to the unit interval [0; 1] on IR. (c) f be a real-valued function dened on I with sucient regularity such that exists. (d) G h denote the uniform grid of points D p f(t) = dp f dt p (t); t j = jh; j = 0; 1; 2; ; n; h = 1=n: 5
6 (e) f = f G h denote the restriction of f to the grid G h. (f) (p) h;m denote a family, parameterized by m, of dierence operators, dened in terms of their action on f, which approximate (D p f)(ih), i 2 I, in the sense that (p) h;mf(ih) = (D p f)(ih) + O((kh) 2 ); (7) where (p) h;mf(ih) only acts on the grid values f imj for j = 0; 1; 2;. For the rst and second derivatives, the natural counterparts of such second order nite dierence formulas are, respectively, (1) h;mf(ih) = (2) h;mf(ih) = f(ih + mh)? f(ih? mh) ; (8) 2mh f(ih + mh)? 2f(ih) + f(ih? mh) (mh) 2 : (9) Note. Clearly, for a given j, there will be an upper bound on the value of m which guarantees that 0 (j? m)h < (j + m)h 1. However, this is a rather technical matter which can be circumvented by assuming that, with respect to a given choice of j, the value of n is such as to generate a suciently ne grid which guarantees the application of any particular formula considered. In other words, it is assumed that one has sucient data to perform the relevant operations examined and discussed below. Such situations occur naturally in situations where the data is collected by a computer in an on-line monitoring scenario The Averaged Finite Dierence Formulas Let i [m] = (p) h;mf(ih): (10) Here, we examine the following averaging of these nite dierence dierentiation formulas i [m] = 1 j=?r The repeated measurement interpretation follows from the fact that i+j[m]: (11) i [m] = i [m]; (12) 6
7 i.e. the above averaging of the nite dierence formulas corresponds to the application of the chosen nite dierence formula (for a xed m) to the averaging of the data at the grid points (i + m)h, ih and (i? m)h by the formula f i h = 1 j=?r where ih corresponds to (i + m)h, im and (i? m)h, respectively. f ih+j ; (13) In order to guarantee that the errors generated by the application of the numerical dierentiation formulas (10) to the observational data fd j g remain uncorrelated, one must ensure that, respect to a given r, the value of m is suitably large. The simplest strategy is to replace m in (10) by kr + 1 to obtain i [kr + 1] = 1 j=?r i+j[kr + 1]; (14) and to constrain k to satisfy k 2. If m =, then every consecutive point about the grid point ih is utilized in the evaluation of (13). This clearly represents the most ecient use of the data. 4. Convergence and Stability The proof of convergence and stability exploits the data-averaging duality of the formula (11). Without loss of generality, attention is restricted to the situation where p is an even integer 2q. In fact, since, for suitably smooth functions f, f ij = f i jhf (1) i it follows that, with p = 2q, f i = 1 j=?r f i+j = f i + + (jh)2 p+1 X f (2) i + 2! l=3 r(r + 1)h2 f (2) i + 12 where the P 2l (r) denote polynomials of degree 2l in r. It, therefore, follows that 7 (1) l (jh) l l! qx l=2 f (l) i + O((jh) p+2 ); (15) P 2l (r)h 2l f (2l) i + O((rh) 2q+2 ); (16)
8 i [kr + 1] = i [kr + 1] = (p) + h;kr+1f(ih) + qx l=2 r(r + 1)h2 (p) 12 h;kr+1f (2) (ih) P 2l (r)h 2l (p) h;kr+1f (2l) (ih) + O (rh) 2q+2 ((kr + 1)h) 2q )! : (17) If one recalls that (p) h;kr+1f (2l) (ih) = f (2l+p) i + K((kr + 1)h) 2 f (2l+p+2) (); K = constant; where the value of the constant K depends on the explicit form of the nite dierence formula used and denotes the appropriate mean value, this last result becomes i [kr + 1] = f (p) i + K((kr + 1)h) 2 f (p+2) ( 2 ) r(r + 1)h2 + f (p+2) i + Kr(r + 1)h2 (krh) 2 f (p+4) ( 4 ) qx P 2l+1 (r)h p+2l (f (p+2l) i + K((kr + 1)h) 2 f (p+2l+2) ( 2l+2 ) l=2 (rh) 2q+2 +O( ); (18) ((kr + 1)h) 2q where the 2, 4, etc denote the appropriate mean values. On recalling that (cf. Finney (1968), Section 5.8) 1 j=?r i+j = 1 p i ; where the i denote identically distributed Gaussian random variables with zero mean and variance 2, it follows that, because k 2, the i+(kr+1)j, for xed i and j = 0; 1; 2;, are independent and K (p) h;kr+1d(ih) = i [kr + 1] + q() ((kr + 1)h)?p i ; (19) 8
9 where the value of K depends on the nature of the nite dierence formula chosen. It follows immediately from (17) and (18) that i (i) krh! 0, (ii) rh! 0, (iii) r 1=2 (krh) p 1. [kr + 1] converges to f (p), if If it is assumed that krh = h s, then, from (iii), one obtains that r h?2ps. But, (ii) then implies that h 1?2ps must tend to zero, and thus that convergence is guaranteed if i 2ps < 1; k nite: (20) The size of the perturbation in the actual values obtained is clearly controlled by the value of k. In particular, the larger k the smaller the perturbation errors. Thus, for a very stable solution, one requires, as well as (i), (ii) and (iii), that (iv) k! 1. If it is again assumed that krh = h s, then it now follows that convergence is guaranteed if (2p + 1)s < 1: (21) y x Figure 1: Data y = x 3 + x 9
10 5. Implementation and Exemplication Once, for a given p, the form of the local dierentiator has been chosen, implementation reduces to choosing the values of k and r. Clearly, the actual choice of k and r will depend of the nature of the observational data. The eciency of the proposed dierentiator shall now be demonstrated on synthetic data. Let f(x) = x 3 and the standard deviation be = 0:001 such that the data is The data is plotted for h = 0:01 in Figure 1. y i = (ih) 3 + i : (22) y" x Figure 2: Central dierence approximation of 2nd derivative with measurement error The second derivative for this example is f (2) (x) = 6x. In Figure 2 the values of the second dierences are plotted. One sees that the variance is huge such that no trend can be detected even thogh the the synthetic data is quite precise. Using the new dierentiator with r = 4 and k = 2 (which is minimal) one obtains the approximations for f (2) displayed in Figure 3. There is now an obvious trend and the points are fairly close to the expected points. However, due to the sampling procedure, there are much fewer data points in the derivative. But an interpolation of these points still gives a good result in this case. When the original data has higher curvature one might require more data points to reconstruct the derivative. 10
11 6 5 r=4, k=2 4 y" x Figure 3: Central dierence approximation of the averaged function References Chr. Andersen (1963) The Ruler Method - An Examination of a Method for Numerical Determination of Fourier Coecients, Acta Polytechnica Scandinavica, AP 324, R. S. Anderssen and P. Bloomeld (1974) Numerical dierentiation procedures for non-exact data, Numer. Math. 22 (1974), R. S. Anderssen, Stable procedures for the inversion of Abel's equation, J.-Inst.-Math.-Appl. 17 (1976), no. 3, 329{342. R. S. Anderssen and F. R. de Hoog (1984) Finite dierence methods for the numerical dierentiation of non-exact data, Computing 33 (1984), S.D. Conte and C. de Boor, Elementary numerical analysis: an algorithmic approach, 2nd ed. N.Y. McGraw-Hill, D. R. Hartree (1952) Numerical Analysis, Clarendon Press, Oxford, M. Hegland and R.S.Anderssen, 1996, A Mollication Framework for Improperly Posed Problems, submitted, Mathematics Research Report MRR , CMA, ANU. L. F. Richardson (1910) The approximate arithmetic solution by nite dierence of physical problems involving dierential equations with an application to the stresses in a masonary dam, Philos. Trans. Roy. Soc. London, Series A, 210 (1910), G. Wahba (1990) Spline Models for Observational Data, SIAM, Philadelphia, Penn.,
Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr
HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts and Stephan Matthai Mathematics Research Report No. MRR 003{96, Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationSparse regularization of NIR spectra using implicit spiking and derivative spectroscopy
20th International Congress on Modelling and Simulation, Adelaide, Australia, 1 6 December 2013 www.mssanz.org.au/modsim2013 Sparse regularization of NIR spectra using implicit spiking and derivative spectroscopy
More informationComputation Of Asymptotic Distribution. For Semiparametric GMM Estimators. Hidehiko Ichimura. Graduate School of Public Policy
Computation Of Asymptotic Distribution For Semiparametric GMM Estimators Hidehiko Ichimura Graduate School of Public Policy and Graduate School of Economics University of Tokyo A Conference in honor of
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
More informationFunctions: A Fourier Approach. Universitat Rostock. Germany. Dedicated to Prof. L. Berg on the occasion of his 65th birthday.
Approximation Properties of Multi{Scaling Functions: A Fourier Approach Gerlind Plona Fachbereich Mathemati Universitat Rostoc 1851 Rostoc Germany Dedicated to Prof. L. Berg on the occasion of his 65th
More informationMODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione
MODELLING OF FLEXIBLE MECHANICAL SYSTEMS THROUGH APPROXIMATED EIGENFUNCTIONS L. Menini A. Tornambe L. Zaccarian Dip. Informatica, Sistemi e Produzione, Univ. di Roma Tor Vergata, via di Tor Vergata 11,
More informationStability of the Defect Renewal Volterra Integral Equations
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 211 http://mssanz.org.au/modsim211 Stability of the Defect Renewal Volterra Integral Equations R. S. Anderssen,
More informationMathematical Institute, University of Utrecht. The problem of estimating the mean of an observed Gaussian innite-dimensional vector
On Minimax Filtering over Ellipsoids Eduard N. Belitser and Boris Y. Levit Mathematical Institute, University of Utrecht Budapestlaan 6, 3584 CD Utrecht, The Netherlands The problem of estimating the mean
More information1 Ordinary points and singular points
Math 70 honors, Fall, 008 Notes 8 More on series solutions, and an introduction to \orthogonal polynomials" Homework at end Revised, /4. Some changes and additions starting on page 7. Ordinary points and
More informationPlan of Class 4. Radial Basis Functions with moving centers. Projection Pursuit Regression and ridge. Principal Component Analysis: basic ideas
Plan of Class 4 Radial Basis Functions with moving centers Multilayer Perceptrons Projection Pursuit Regression and ridge functions approximation Principal Component Analysis: basic ideas Radial Basis
More informationlimit of the time-step decreases as more resolutions are added requires the use of an eective multitime-stepping algorithm, that will maintain the req
Invited to the Session: "Wavelet and TLM Modeling Techniques" organized by Dr. W. J. R. Hoefer in ACES 2000 COMPUTATIONAL OPTIMIZATION OF MRTD HAAR-BASED ADAPTIVE SCHEMES USED FOR THE DESIGN OF RF PACKAGING
More informationSYSTEM RECONSTRUCTION FROM SELECTED HOS REGIONS. Haralambos Pozidis and Athina P. Petropulu. Drexel University, Philadelphia, PA 19104
SYSTEM RECOSTRUCTIO FROM SELECTED HOS REGIOS Haralambos Pozidis and Athina P. Petropulu Electrical and Computer Engineering Department Drexel University, Philadelphia, PA 94 Tel. (25) 895-2358 Fax. (25)
More information1. Introduction Let f(x), x 2 R d, be a real function of d variables, and let the values f(x i ), i = 1; 2; : : : ; n, be given, where the points x i,
DAMTP 2001/NA11 Radial basis function methods for interpolation to functions of many variables 1 M.J.D. Powell Abstract: A review of interpolation to values of a function f(x), x 2 R d, by radial basis
More informationPiecewise Constant Aquifer Parameter Identification Recovery
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 2011 http://mssanz.org.au/modsim2011 Piecewise Constant Aquifer Parameter Identification Recovery R. S. Anderssen
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Convergence of. Multipoint Iterations. G. W. Stewart y.
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{93{10 TR{3030 On the Convergence of Multipoint Iterations G. W. Stewart y February, 1993 Reviseed,
More informationAbstract Minimal degree interpolation spaces with respect to a nite set of
Numerische Mathematik Manuscript-Nr. (will be inserted by hand later) Polynomial interpolation of minimal degree Thomas Sauer Mathematical Institute, University Erlangen{Nuremberg, Bismarckstr. 1 1, 90537
More information460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationLECTURE 15 + C+F. = A 11 x 1x1 +2A 12 x 1x2 + A 22 x 2x2 + B 1 x 1 + B 2 x 2. xi y 2 = ~y 2 (x 1 ;x 2 ) x 2 = ~x 2 (y 1 ;y 2 1
LECTURE 5 Characteristics and the Classication of Second Order Linear PDEs Let us now consider the case of a general second order linear PDE in two variables; (5.) where (5.) 0 P i;j A ij xix j + P i,
More informationGeneralization of Hensel lemma: nding of roots of p-adic Lipschitz functions
Generalization of Hensel lemma: nding of roots of p-adic Lipschitz functions (joint talk with Andrei Khrennikov) Dr. Ekaterina Yurova Axelsson Linnaeus University, Sweden September 8, 2015 Outline Denitions
More informationPade approximants and noise: rational functions
Journal of Computational and Applied Mathematics 105 (1999) 285 297 Pade approximants and noise: rational functions Jacek Gilewicz a; a; b;1, Maciej Pindor a Centre de Physique Theorique, Unite Propre
More informationARTIFICIAL INTELLIGENCE LABORATORY. and CENTER FOR BIOLOGICAL INFORMATION PROCESSING. A.I. Memo No August Federico Girosi.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL INFORMATION PROCESSING WHITAKER COLLEGE A.I. Memo No. 1287 August 1991 C.B.I.P. Paper No. 66 Models of
More informationUpper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139
Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology
More informationMoment Computation in Shift Invariant Spaces. Abstract. An algorithm is given for the computation of moments of f 2 S, where S is either
Moment Computation in Shift Invariant Spaces David A. Eubanks Patrick J.Van Fleet y Jianzhong Wang ẓ Abstract An algorithm is given for the computation of moments of f 2 S, where S is either a principal
More informationOur goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always
October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.
More informationEngg. Math. II (Unit-IV) Numerical Analysis
Dr. Satish Shukla of 33 Engg. Math. II (Unit-IV) Numerical Analysis Syllabus. Interpolation and Curve Fitting: Introduction to Interpolation; Calculus of Finite Differences; Finite Difference and Divided
More informationA general theory of discrete ltering. for LES in complex geometry. By Oleg V. Vasilyev AND Thomas S. Lund
Center for Turbulence Research Annual Research Briefs 997 67 A general theory of discrete ltering for ES in complex geometry By Oleg V. Vasilyev AND Thomas S. und. Motivation and objectives In large eddy
More informationMultivariate Gaussian Random Fields with SPDEs
Multivariate Gaussian Random Fields with SPDEs Xiangping Hu Daniel Simpson, Finn Lindgren and Håvard Rue Department of Mathematics, University of Oslo PASI, 214 Outline The Matérn covariance function and
More informationComments on \Wavelets in Statistics: A Review" by. A. Antoniadis. Jianqing Fan. University of North Carolina, Chapel Hill
Comments on \Wavelets in Statistics: A Review" by A. Antoniadis Jianqing Fan University of North Carolina, Chapel Hill and University of California, Los Angeles I would like to congratulate Professor Antoniadis
More informationThe WENO Method for Non-Equidistant Meshes
The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationError Empirical error. Generalization error. Time (number of iteration)
Submitted to Neural Networks. Dynamics of Batch Learning in Multilayer Networks { Overrealizability and Overtraining { Kenji Fukumizu The Institute of Physical and Chemical Research (RIKEN) E-mail: fuku@brain.riken.go.jp
More informationDigital Filter Design Using Non-Uniform Sampling
Proceedings of the 6th WSEAS International Conference on Applications of Electrical Engineering, Istanbul, Turkey, May 27-29, 2007 120 Digital Filter Design Using Non-Uniform Sampling K. BUSAWON, WAI-PANG
More information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationShayne Waldron ABSTRACT. It is shown that a linear functional on a space of functions can be described by G, a
UNIVERSITY OF WISCONSIN-MADISON CENTER FOR THE MATHEMATICAL SCIENCES Symmetries of linear functionals Shayne Waldron (waldron@math.wisc.edu) CMS Technical Summary Report #95-04 October 1994 ABSTRACT It
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More information2 Tikhonov Regularization and ERM
Introduction Here we discusses how a class of regularization methods originally designed to solve ill-posed inverse problems give rise to regularized learning algorithms. These algorithms are kernel methods
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationThree Point Functions at Finite. T.S. Evans. Theoretical Physics Institute. Department of Physics. University of Alberta.
Three Point Functions at Finite Temperature T.S. Evans Theoretical Physics Institute Department of Physics University of Alberta Edmonton, Alberta T6G 2J1, Canada Bitnet: usero12n@ualtamts February 1990
More informationMaximum Likelihood Estimation
Connexions module: m11446 1 Maximum Likelihood Estimation Clayton Scott Robert Nowak This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License Abstract
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationMinimum and maximum values *
OpenStax-CNX module: m17417 1 Minimum and maximum values * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 In general context, a
More informationSPLITTING OF SEPARATRICES FOR (FAST) QUASIPERIODIC FORCING. splitting, which now seems to be the main cause of the stochastic behavior in
SPLITTING OF SEPARATRICES FOR (FAST) QUASIPERIODIC FORCING A. DELSHAMS, V. GELFREICH, A. JORBA AND T.M. SEARA At the end of the last century, H. Poincare [7] discovered the phenomenon of separatrices splitting,
More informationTowards a Mathematical Theory of Super-resolution
Towards a Mathematical Theory of Super-resolution Carlos Fernandez-Granda www.stanford.edu/~cfgranda/ Information Theory Forum, Information Systems Laboratory, Stanford 10/18/2013 Acknowledgements This
More informationERIK STERNER. Discretize the equations in space utilizing a nite volume or nite dierence scheme. 3. Integrate the corresponding time-dependent problem
Convergence Acceleration for the Navier{Stokes Equations Using Optimal Semicirculant Approximations Sverker Holmgren y, Henrik Branden y and Erik Sterner y Abstract. The iterative solution of systems of
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More informationThe restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics 149 (2002) 415 422 www.elsevier.com/locate/cam The restarted QR-algorithm for eigenvalue computation of structured matrices Daniela Calvetti a; 1, Sun-Mi
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More information1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r
DAMTP 2002/NA08 Least Frobenius norm updating of quadratic models that satisfy interpolation conditions 1 M.J.D. Powell Abstract: Quadratic models of objective functions are highly useful in many optimization
More informationt x 0.25
Journal of ELECTRICAL ENGINEERING, VOL. 52, NO. /s, 2, 48{52 COMPARISON OF BROYDEN AND NEWTON METHODS FOR SOLVING NONLINEAR PARABOLIC EQUATIONS Ivan Cimrak If the time discretization of a nonlinear parabolic
More informationNovel Approach to Analysis of Nonlinear Recursions. 1 Department of Physics, Bar-Ilan University, Ramat-Gan, ISRAEL
Novel Approach to Analysis of Nonlinear Recursions G.Berkolaiko 1 2, S. Rabinovich 1,S.Havlin 1 1 Department of Physics, Bar-Ilan University, 529 Ramat-Gan, ISRAEL 2 Department of Mathematics, Voronezh
More information= c c + g (n; c) (.b) on the interior of the unit square (; ) (; ) in space and for t (; t final ] in time for the unknown functions n(x; y; t)
Splitting Methods for Mixed Hyperbolic-Parabolic Systems Alf Gerisch, David F. Griths y, Rudiger Weiner, and Mark A. J. Chaplain y Institut fur Numerische Mathematik, Fachbereich Mathematik und Informatik
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationREDUNDANT TRINOMIALS FOR FINITE FIELDS OF CHARACTERISTIC 2
REDUNDANT TRINOMIALS FOR FINITE FIELDS OF CHARACTERISTIC 2 CHRISTOPHE DOCHE Abstract. In this paper we introduce so-called redundant trinomials to represent elements of nite elds of characteristic 2. The
More informationIntroduction and mathematical preliminaries
Chapter Introduction and mathematical preliminaries Contents. Motivation..................................2 Finite-digit arithmetic.......................... 2.3 Errors in numerical calculations.....................
More informationError formulas for divided difference expansions and numerical differentiation
Error formulas for divided difference expansions and numerical differentiation Michael S. Floater Abstract: We derive an expression for the remainder in divided difference expansions and use it to give
More informationSuper-resolution via Convex Programming
Super-resolution via Convex Programming Carlos Fernandez-Granda (Joint work with Emmanuel Candès) Structure and Randomness in System Identication and Learning, IPAM 1/17/2013 1/17/2013 1 / 44 Index 1 Motivation
More informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationlecture 4: Constructing Finite Difference Formulas
5 lecture 4: Constructing Finite Difference Formulas 17 Application: Interpolants for Finite Difference Formulas The most obvious use of interpolants is to construct polynomial models of more complicated
More informationREPORTRAPPORT. Centrum voor Wiskunde en Informatica. Asymptotics of zeros of incomplete gamma functions. N.M. Temme
Centrum voor Wiskunde en Informatica REPORTRAPPORT Asymptotics of zeros of incomplete gamma functions N.M. Temme Department of Analysis, Algebra and Geometry AM-R9402 994 Asymptotics of Zeros of Incomplete
More informationNumerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
Available online at http://ijim.srbiau.ac.ir Int. J. Industrial Mathematics Vol. 1, No. 2 (2009)147-161 Numerical Solution of Hybrid Fuzzy Dierential Equation (IVP) by Improved Predictor-Corrector Method
More informationg(.) 1/ N 1/ N Decision Decision Device u u u u CP
Distributed Weak Signal Detection and Asymptotic Relative Eciency in Dependent Noise Hakan Delic Signal and Image Processing Laboratory (BUSI) Department of Electrical and Electronics Engineering Bogazici
More informationLeast Squares Approximation
Chapter 6 Least Squares Approximation As we saw in Chapter 5 we can interpret radial basis function interpolation as a constrained optimization problem. We now take this point of view again, but start
More informationOn the Noise Model of Support Vector Machine Regression. Massimiliano Pontil, Sayan Mukherjee, Federico Girosi
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL AND COMPUTATIONAL LEARNING DEPARTMENT OF BRAIN AND COGNITIVE SCIENCES A.I. Memo No. 1651 October 1998
More informationEconomics 472. Lecture 10. where we will refer to y t as a m-vector of endogenous variables, x t as a q-vector of exogenous variables,
University of Illinois Fall 998 Department of Economics Roger Koenker Economics 472 Lecture Introduction to Dynamic Simultaneous Equation Models In this lecture we will introduce some simple dynamic simultaneous
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationNumerical Schemes from the Perspective of Consensus
Numerical Schemes from the Perspective of Consensus Exploring Connections between Agreement Problems and PDEs Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More information1 Lecture 8: Interpolating polynomials.
1 Lecture 8: Interpolating polynomials. 1.1 Horner s method Before turning to the main idea of this part of the course, we consider how to evaluate a polynomial. Recall that a polynomial is an expression
More informationStatistical Learning Theory
Statistical Learning Theory Fundamentals Miguel A. Veganzones Grupo Inteligencia Computacional Universidad del País Vasco (Grupo Inteligencia Vapnik Computacional Universidad del País Vasco) UPV/EHU 1
More informationSplines which are piecewise solutions of polyharmonic equation
Splines which are piecewise solutions of polyharmonic equation Ognyan Kounchev March 25, 2006 Abstract This paper appeared in Proceedings of the Conference Curves and Surfaces, Chamonix, 1993 1 Introduction
More informationPolynomial functions over nite commutative rings
Polynomial functions over nite commutative rings Balázs Bulyovszky a, Gábor Horváth a, a Institute of Mathematics, University of Debrecen, Pf. 400, Debrecen, 4002, Hungary Abstract We prove a necessary
More informationStochastic dominance with imprecise information
Stochastic dominance with imprecise information Ignacio Montes, Enrique Miranda, Susana Montes University of Oviedo, Dep. of Statistics and Operations Research. Abstract Stochastic dominance, which is
More informationInversion Base Height. Daggot Pressure Gradient Visibility (miles)
Stanford University June 2, 1998 Bayesian Backtting: 1 Bayesian Backtting Trevor Hastie Stanford University Rob Tibshirani University of Toronto Email: trevor@stat.stanford.edu Ftp: stat.stanford.edu:
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationApproximation by Conditionally Positive Definite Functions with Finitely Many Centers
Approximation by Conditionally Positive Definite Functions with Finitely Many Centers Jungho Yoon Abstract. The theory of interpolation by using conditionally positive definite function provides optimal
More information1/sqrt(B) convergence 1/B convergence B
The Error Coding Method and PICTs Gareth James and Trevor Hastie Department of Statistics, Stanford University March 29, 1998 Abstract A new family of plug-in classication techniques has recently been
More informationApplied Mathematics 505b January 22, Today Denitions, survey of applications. Denition A PDE is an equation of the form F x 1 ;x 2 ::::;x n ;~u
Applied Mathematics 505b January 22, 1998 1 Applied Mathematics 505b Partial Dierential Equations January 22, 1998 Text: Sobolev, Partial Dierentail Equations of Mathematical Physics available at bookstore
More informationMonte Carlo Methods for Statistical Inference: Variance Reduction Techniques
Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques Hung Chen hchen@math.ntu.edu.tw Department of Mathematics National Taiwan University 3rd March 2004 Meet at NS 104 On Wednesday
More informationCOS 424: Interacting with Data
COS 424: Interacting with Data Lecturer: Rob Schapire Lecture #14 Scribe: Zia Khan April 3, 2007 Recall from previous lecture that in regression we are trying to predict a real value given our data. Specically,
More informationHeisenberg's inequality for Fourier transform
Heisenberg's inequality for Fourier transform Riccardo Pascuzzo Abstract In this paper, we prove the Heisenberg's inequality using the Fourier transform. Then we show that the equality holds for the Gaussian
More information1 Introduction. Joseph{Louis Lagrange's work on the roots of algebraic equations extended over a signicant period of his professional life [3]. He saw
Lagrange and the Solution of Numerical Equations Reinhard Laubenbacher Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003, USA reinhard@nmsu.edu Gary McGrath Department
More informationECONOMETRIC MODELS. The concept of Data Generating Process (DGP) and its relationships with the analysis of specication.
ECONOMETRIC MODELS The concept of Data Generating Process (DGP) and its relationships with the analysis of specication. Luca Fanelli University of Bologna luca.fanelli@unibo.it The concept of Data Generating
More informationbelow, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing
Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,
More informationMath 497 R1 Winter 2018 Navier-Stokes Regularity
Math 497 R Winter 208 Navier-Stokes Regularity Lecture : Sobolev Spaces and Newtonian Potentials Xinwei Yu Jan. 0, 208 Based on..2 of []. Some ne properties of Sobolev spaces, and basics of Newtonian potentials.
More informationAdaptive sparse grids
ANZIAM J. 44 (E) ppc335 C353, 2003 C335 Adaptive sparse grids M. Hegland (Received 1 June 2001) Abstract Sparse grids, as studied by Zenger and Griebel in the last 10 years have been very successful in
More informationAnumerical and analytical study of the free convection thermal boundary layer or wall jet at
REVERSED FLOW CALCULATIONS OF HIGH PRANDTL NUMBER THERMAL BOUNDARY LAYER SEPARATION 1 J. T. Ratnanather and P. G. Daniels Department of Mathematics City University London, England, EC1V HB ABSTRACT Anumerical
More informationROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems
The Evil of Supereciency P. Stoica B. Ottersten To appear as a Fast Communication in Signal Processing IR-S3-SB-9633 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems Signal Processing
More informationLinear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
More informationJournal of Universal Computer Science, vol. 4, no. 1 (1998), submitted: 25/9/97, accepted: 1/11/97, appeared: 28/1/98 Springer Pub. Co.
Journal of Universal Computer Science, vol. 4, no. 1 (1998), 48-67 submitted: 25/9/97, accepted: 1/11/97, appeared: 28/1/98 Springer Pub. Co. Algebraic Solutions to a Class of Interval Equations Evgenija
More informationRATIONAL POINTS ON CURVES. Contents
RATIONAL POINTS ON CURVES BLANCA VIÑA PATIÑO Contents 1. Introduction 1 2. Algebraic Curves 2 3. Genus 0 3 4. Genus 1 7 4.1. Group of E(Q) 7 4.2. Mordell-Weil Theorem 8 5. Genus 2 10 6. Uniformity of Rational
More information390 Chapter 10. Survey of Descent Based Methods special attention must be given to the surfaces of non-dierentiability, it becomes very important toco
Chapter 10 SURVEY OF DESCENT BASED METHODS FOR UNCONSTRAINED AND LINEARLY CONSTRAINED MINIMIZATION Nonlinear Programming Problems Eventhough the title \Nonlinear Programming" may convey the impression
More informationCONTINUOUS TIME D=0 ZOH D 0 D=0 FOH D 0
IDENTIFICATION ASPECTS OF INTER- SAMPLE INPUT BEHAVIOR T. ANDERSSON, P. PUCAR and L. LJUNG University of Linkoping, Department of Electrical Engineering, S-581 83 Linkoping, Sweden Abstract. In this contribution
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationA Graph Based Parsing Algorithm for Context-free Languages
A Graph Based Parsing Algorithm for Context-free Languages Giinter Hot> Technical Report A 01/99 June 1999 e-mail: hotzocs.uni-sb.de VVVVVV: http://vwv-hotz.cs.uni-sb. de Abstract We present a simple algorithm
More informationXIII. Weyl's Dimension Formula. In this Section we derive the celebrated formula of Weyl for the dimensionality
10 III. Weyl's Dimension Formula III. Weyl's Dimension Formula In this Section we derive the celebrated formula of Weyl for the dimensionality of an irreducible representation of a simple Lie algebra in
More informationNumerical solution of the eigenvalue problem for Hermitian Toeplitz-like matrices
TR-CS-9-1 Numerical solution of the eigenvalue problem for Hermitian Toeplitz-like matrices Michael K Ng and William F Trench July 199 Joint Computer Science Technical Report Series Department of Computer
More information