Extrapolation Models for Convergence Acceleration and Function ’ s Extension David Levin Tel-Aviv University MAIA Erice 2013.

Slides:



Advertisements
Similar presentations
Improper Integrals II. Improper Integrals II by Mika Seppälä Improper Integrals An integral is improper if either: the interval of integration is infinitely.
Advertisements

Differential Equations Brannan Copyright © 2010 by John Wiley & Sons, Inc. All rights reserved. Chapter 08: Series Solutions of Second Order Linear Equations.
Chapter 2: Second-Order Differential Equations
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
CE33500 – Computational Methods in Civil Engineering Differentiation Provided by : Shahab Afshari
Data mining and statistical learning - lecture 6
MATH 685/ CSI 700/ OR 682 Lecture Notes
Selected from presentations by Jim Ramsay, McGill University, Hongliang Fei, and Brian Quanz Basis Basics.
Basis Expansion and Regularization Presenter: Hongliang Fei Brian Quanz Brian Quanz Date: July 03, 2008.
1cs542g-term Notes  Added required reading to web (numerical disasters)
Kernel methods - overview
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Ch 3.5: Nonhomogeneous Equations; Method of Undetermined Coefficients
Finite Element Method Introduction General Principle
Curve-Fitting Regression
Ch 6.1: Definition of Laplace Transform Many practical engineering problems involve mechanical or electrical systems acted upon by discontinuous or impulsive.
Gradient Methods May Preview Background Steepest Descent Conjugate Gradient.
Approximation on Finite Elements Bruce A. Finlayson Rehnberg Professor of Chemical Engineering.
ON MULTIVARIATE POLYNOMIAL INTERPOLATION
CS Subdivision I: The Univariate Setting Peter Schröder.
Subdivision Analysis via JSR We already know the z-transform formulation of schemes: To check if the scheme generates a continuous limit curve ( the scheme.
Differential Equations and Boundary Value Problems
1 Introduction to Model Order Reduction Luca Daniel Massachusetts Institute of Technology
Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
CpE- 310B Engineering Computation and Simulation Dr. Manal Al-Bzoor
1 Preliminaries Precalculus Review I Precalculus Review II
ORDINARY DIFFERENTIAL EQUATION (ODE) LAPLACE TRANSFORM.
Chapter 9 Function Approximation
Math 3120 Differential Equations with Boundary Value Problems
Chapter 17 Boundary Value Problems. Standard Form of Two-Point Boundary Value Problem In total, there are n 1 +n 2 =N boundary conditions.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
1 Interpolation. 2 What is Interpolation ? Given (x 0,y 0 ), (x 1,y 1 ), …… (x n,y n ), find the value of ‘y’ at a.
Splines Vida Movahedi January 2007.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
Curve-Fitting Regression
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
SUPA Advanced Data Analysis Course, Jan 6th – 7th 2009 Advanced Data Analysis for the Physical Sciences Dr Martin Hendry Dept of Physics and Astronomy.
6. Introduction to Spectral method. Finite difference method – approximate a function locally using lower order interpolating polynomials. Spectral method.
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
MA3264 Mathematical Modelling Lecture 3 Model Fitting.
A Note on Rectangular Quotients By Achiya Dax Hydrological Service Jerusalem, Israel
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Jump to first page Chapter 3 Splines Definition (3.1) : Given a function f defined on [a, b] and a set of numbers, a = x 0 < x 1 < x 2 < ……. < x n = b,
Section 5.5 The Real Zeros of a Polynomial Function.
Principles of Extrapolation
Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.
Boyce/DiPrima 9 th ed, Ch 6.1: Definition of Laplace Transform Elementary Differential Equations and Boundary Value Problems, 9 th edition, by William.
Computacion Inteligente Least-Square Methods for System Identification.
Runge Kutta schemes Taylor series method Numeric solutions of ordinary differential equations.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 14: Applications of Filters.
Math for CS Fourier Transforms
Math for CS Fourier Transform
The simple linear regression model and parameter estimation
Computation of the solutions of nonlinear polynomial systems
Advanced Engineering Mathematics 6th Edition, Concise Edition
Chapter 22.
UNIT II Analysis of Continuous Time signal
Class Notes 18: Numerical Methods (1/2)
Copyright © Cengage Learning. All rights reserved.
Chapter 9 Function Approximation
Numerical Analysis Lecture 45.
Numerical Integration:
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Infinite Sequences and Series
SKTN 2393 Numerical Methods for Nuclear Engineers
Copyright © Cengage Learning. All rights reserved.
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Extrapolation Models for Convergence Acceleration and Function ’ s Extension David Levin Tel-Aviv University MAIA Erice 2013

Extrapolation – Given values at some domain, estimate values outside the domain. Prediction, Forecasting, Extension, Continuation Extrapolation to the limit: Infinite series, Infinite Integrals Convergence Acceleration Models Extension of Univariate and Bivariate Functions

Given N terms of an infinite series can we estimate the infinite sum ? We must assume that the unknown terms can be determined by the given terms, i.e., we must assume the existence of a model, a prediction model! A general model: For evaluating using values, a natural model would be a differential equation or a difference equation.

Q: What is a good model? A: A model which covers a large class of series, and can be used for extrapolation. Q: What about linear models? With constant coefficients? A: Exact for rational functions! Leading to Pade Approximations. Q: What about linear models with varying coefficients? A: They cover a very large class of series in applied math. Q: How to use linear models for convergence acceleration? Q: How to use linear models for function’s extension?

linear model with constant coefficients Given N terms of an infinite series let us assume that the unknown terms can be predicted by a linear model with constant coefficients: The coefficients of the model can be found by fitting this model to the given terms Assuming such a model is equivalent to assuming that the terms of the series, as function of their index, are sums of exponentials (including polynomials).

Using the model for approximating Apply to the model we obtain If we know we can find out S. The resulting approximation to S is the same as Wynn’s algorithm, and it also gives the Pade approximant in the case of power series. Pade Approximation is very good for series whose terms approximately satisfy a linear model with constant coefficients – i.e., sum of exponentials. What about other series, e.g., Which model is appropriate here?

A model with varying coefficients: Definition: Where have asymptotic expansions Examples:

A model with varying coefficients (cont.) Assuming, i.e., with leads to the transformation of series (Levin-Sidi 1980). Application of the transformation does not require knowledge of It involves solving a linear system for the approximation to the infinite sum S. It follows that Truncating the asymptotic expansions of we form a system of linear equations for S. For details and analysis see: Practical Extrapolation Methods, by A. Sidi

Linear Models for Double series: Here, even if we have the model, we cannot compute the terms of the series based upon a finite number of terms. This is due to the ODE – PDE difference: An ODE + initial conditions define the solution But a PDE requires boundary conditions to determine the solution in a domain! Yet, such models are related to multivariate Pade approximations, and to other rational approximations

Extension of functions Given function values in a domain D, we would like to extend it so that the extension continues the behavioral trends of the function. As in convergence acceleration, we assume a model, and use it for the extension: Ideally, we would like to find ‘THE’ differential equation which the function fulfills on D, and then use it to extend the function outside D. Since we assume discrete data on D, maybe noisy, we shall look instead for a difference equation which ‘best’ describes the behavior of the function on D. We shall discuss different models, and how to use them for extension.

Linear Model – Constant Coef. – Univariate case Given function values in [a,b]: Assume f is bandlimited, and let By Nyquist–Shannon sampling theorem sampling distance d is sufficient for Nyquist–Shannon sampling theorem reconstructing f. We use sequences of ‘mesh size’ To these sequences we fit a Linear Constant Coefficients Model of order m using least-squares minimization to find the model coefficients:

All sequences satisfying are of the form (*) where are roots of (if the roots are simple) The extension algorithm: 1. Find the model coefficients by least-squares minimization 2. Find the roots 3. Define the approximation on [a,b] and its extension by fitting This is nothing but Prony’s method (1795) Q: Is it applicable to varying coefficients models? or to the 2D case?

Example 1 – Fitting Exponentials

To enable varying coefficients models, and for 2D applications, we suggest an algorithm which does not require solving the difference equation: Denote a sequence satisfying a model We look for which approximates the given data, and is smooth The algorithm: Find which minimizes the functional Q: How to choose the parameter ?

Example 2 – Fitting Smooth Approximation-Extension

Example 3 – Approximation-Extension using varying coefficients

Bivariate case: 2D Linear Models – Constant Coef. Given function values in [a,b]x[a,b]: Assume f is bandlimited, and let By Nyquist–Shannon sampling theorem sampling distance d is sufficient for Nyquist–Shannon sampling theorem reconstructing f. We use sequences of ‘mesh size’ To these sequences we fit a Linear Constant Coefficients Model M of order mxm Note: This model includes bivariate exponentials, and much more. Unlike the 1D case, the dimension of is not finite.

Example 4 – 2D Approximation-Extension We look for which approximates the given data, and is smooth: The optimization problem is heavy!

Observation : Let And let then E.g., Choosing as a cubic tensor product B-spline, we can approximate well the unknown function by Using this observation we can now work with smooth functions satisfying linear models with constant coefficients, avoiding the high cost of the above optimization approach of finding minimizing

We can even define basis functions spanning within a given domain. Example of a basis function:

Example 5 – 2D Approximation-Extension using spline basis

Example 6 – Blending between models From noisy cos(2x) into exp(-2x)

Thank you!