A generalized Prony method for sparse approximation
|
|
- Marion Wiggins
- 6 years ago
- Views:
Transcription
1 A generalized Prony method for sparse approximation Gerlind Plonka and Thomas Peter Institute for Numerical and Applied Mathematics University of Göttingen Dolomites Research Week on Approximation September 2014
2 A generalized Prony method for sparse approximation Outline Original Prony method Reconstruction of sparse exponential sums Ben-Or & Tiwari method Reconstruction of sparse polynomials The generalized Prony method - Application to shift and dilation operator - Application to Sturm-Liouville operator - Recovery of sparse vectors Numerical issues 1
3 Reconstruction of sparse exponential sums (Prony s method) Function f(x) = M c j e T jx We have M, f(l), l = 0,..., 2M 1 We want c j, T j C, where π Im T j < π, j = 1,..., M. Consider the Prony polynomial P (z) := M ( ) M z e T j = with unknown parameters T j and p M = 1. p l z l M p l f(l + m) = M M p l c j e Tj(l+m) = M c j e T jm M = M p l e T jl c j e T jm P (e T j) = 0, m = 0,..., M 1. 2
4 Reconstruction algorithm Input: f(l), l = 0,..., 2M 1 Solve the Hankel system f(0) f(1)... f(m 1) f(1) f(2)... f(m)... f(m 1) f(m)... f(2m 2) p 0 p 1. p M 1 = f(m) f(m + 1). f(2m 1) Compute the zeros of the Prony polynomial P (z) = M p lz l and extract the parameters T j from its zeros z j = e T j, j = 1,..., M. Compute c j solving the linear system. f(l) = M c j e T jl, l = 0,..., 2M 1. Output: Parameters T j and c j, j = 1,..., M. 3
5 Literature [Prony] (1795): [Schmidt] (1979): [Roy, Kailath] (1989): [Hua, Sakar] (1990): [Stoica, Moses] (2000): [Potts, Tasche] (2010, 2011): Reconstruction of a difference equation MUSIC (Multiple Signal Classification) ESPRIT (Estimation of signal parameters via rotational invariance techniques) Matrix-pencil method Annihilating filters Approximate Prony method Golub, Milanfar, Varah ( 99); Vetterli, Marziliano, Blu ( 02); Maravić, Vetterli ( 04); Elad, Milanfar, Golub ( 04); Beylkin, Monzon ( 05, 10); Batenkov, Sarg, Yomdin ( 12, 13); Filbir, Mhaskar, Prestin ( 12); Peter, Potts, Tasche ( 11, 12, 13); Plonka, Wischerhoff ( 13);... 4
6 Reconstruction of M-sparse polynomials Ben-Or & Tiwari algorithm Function f(x) = M c j x d j 0 d 1 < d 2 <... < d M = N, d j N 0, c j C. We have We want M, f(x l 0 ), l = 0,..., 2M 1, (xl 0 pairwise different) coefficients c j C \ {0}, indices d j of active monomials Consider the Prony polynomial P (z) := M ( ) z x d j 0 = M p l z l with unknown zeros x d j 0 and p M = 1. 5
7 Prony polynomial Then P (z) := M ( ) z x d j 0 = M p l z l M p l f(x l+m 0 ) = M = M p l M c j x d j(l+m) 0 = M c j x d jm 0 M p l x d jl 0 c j x d jm 0 P (x d j 0 ) = 0, m = 0,..., M 1. Hence M 1 p l f(x l+m 0 ) = f(x l+m 0 ), m = 0,..., M 1. Compute p l P (z) zeros x d j 0 d j c j. 6
8 Literature [Ben-Or, Tiwari] (1988): [Grigoriev, Karpinski, Singer] (1990): [Dress, Grabmeir] (1991): [Lakshman, Saunders] (1995): [Kaltofen, Lee] (2003): [Giesbrecht, Labahn, Lee] (2008) Reconstruction of multivariate M-sparse polynomials Sparse polynomial interpolation over finite fields Interpolation of k-sparse character sums sparse polynomial interpolation in non-standard bases Early termination in sparse polynomial interpolation Sparse interpolation of multivariate polynomials 7
9 The generalized Prony method (Peter, Plonka (2013)) Let V be a normed vector space and let A : V V be a linear operator. Let {e n : n I} be a set of eigenfunctions of A to pairwise different eigenvalues λ n C, A e n = λ n e n. Let f = j J c j e j, J I with J = M, c j C. Let F : V C be a linear functional with F (e n ) 0 for all n I. We have M, F (A l f) for l = 0,..., 2M 1 We want J I, c j C for j J 8
10 Prony polynomial P (z) = j J(z λ j ) = M p l z l with unknown λ j, i.e., with unknown J. Hence, for m = 0, 1,... M p l F (A l+m f) = M = j J = j J p l F c j λ m j ( j J ( M c j A l+m e j ) p l λ l j ) F (e j ) c j λ m j P (λ j)f (e j ) = 0. = M p l F ( j J c j λj l+m e j ) Thus, if F (A l f), l = 0,..., 2M 1 is known, then we can compute the index set J I of the active eigenfunctions and the coefficients c j. 9
11 Application to linear operators: shift operator Choose the shift operator S h : C(R) C(R), h > 0 S h f(x) := f(x + h) Eigenfunctions of S h S h e Tjx = e Tj(x+h) = e Tjh e Tjx, T j C, Im T j [ π h, π h ). Prony method: For the reconstruction of f(x) = M c j e Tjx we need F (Sh l f) = F (f( + hl)), l = 0,..., 2M 1. Put F (f) := f(x 0 ). F (S l h f) = f(x 0 + hl) Put F (f) := x 0 +h x 0 f(x)dx. F (Sh l x 0 +(l+1)h f) = f(x)dx. x 0 +lh 10
12 Application to linear operators: dilation operator Choose the dilation operator D h : C(R) C(R), D h f(x) := f(hx) Eigenfunctions of D h : D h x p j = (hx) p j = h p jx p j, p j C, x R. We need: h p j are pairwise different for all j I. Ben-Or & Tiwari method: For reconstruction of f(x) = M c j x p j, we need F (D l h f) = F (f(hl )), l = 0,..., 2M 1. Put F (f) := f(x 0 ). F (D l h f) = f(hl x 0 ) Put F (f) := l 1 0 f(x)dx. F (Dl h f) = 1 h h l 0 f(x)dx. 11
13 Application to linear operators: Sturm-Liouville operator Choose the Sturm-Liouville operator L p,q : C (R) C (R), L p,q f(x) := p(x)f (x) + q(x)f (x), where p(x), q(x) are polynomials of degree 2 and 1, respectively. Eigenfunctions are orthogonal polynomials, where L p,q Q n = λ n Q n. p(x) q(x) λ n name symbol (1 x 2 ) (β α (α + β +2)x) n(n + α + β +1) Jacobi P n (α,β) (1 x 2 ) (2α +1)x n(n +2α) Gegenbauer C n (α) (1 x 2 ) 2x n(n +1) Legendre P n (1 x 2 ) x n 2 Chebyshev 1. kind T n (1 x 2 ) 3x n(n +2) Chebyshev 2. kind U n 1 2x 2n Hermite H n x (α +1 x) n Laguerre L (α) n 12
14 Sparse sums of orthogonal polynomials Function f(x) = M c nj Q nj (x). We want: c nj C \ {0}, indices n j of active basis polynomials Q nj Now, f can be uniquely recovered from F (L k p,qf) = L k p,qf(x 0 ) = M c nj λ k n j Q nj (x 0 ), k = 0,..., 2M 1. Theorem. For each polynomial f and each x R, the values L k p,qf(x), k = 0,..., 2M 1, are uniquely determined by f (m) (x), m = 0,..., 4M 2. If p(x 0 ) = 0, then L p,q f(x 0 ) reduces to L p,q f(x 0 ) = q(x 0 )f (x 0 ), and the values L k p,qf(x 0 ), k = 0,..., 2M 1, can be determined uniquely by f (m) (x 0 ), m = 0,..., 2M 1. 13
15 Example: Sparse Laguerre expansion Operator equation x(l (α) n ) (x) + (α + 1 x)(l (α) n Sparse Laguerre expansion f(x) = 6 Given values: f(0), f (0),..., f (11) (0). ) (x) = n L (α) n (x) c nj L (0) n j (x) (with α = 0) j n j c nj ñ j c nj
16 Application to linear operators: Recovery of sparse vectors Choose the operator D : C N C N Dx := diag(d 0,..., d N 1 ) x with pairwise different d j. Eigenvectors of D: D e j = d j e j j = 0,..., N 1. We want to reconstruct x = M c nj e nj c nj C, 0 n 1 <... < n M N 1. We need F (D l x), l = 0,... 2M 1. Let F (x) := 1 T x := N 1 j=0 x j. Then F (D l x) = 1 T D l x = a T l x, where a T l = (dl 0,..., dl N 1 ), l = 0,... 2M 1. 15
17 Example: Sparse vectors Choose D = diag(ω 0 N, ω1 N,..., ωn 1 N ), where ω N := e 2πi/N denotes the N-th root of unity. Then an M-sparse vector x can be recovered from y = F 2M,N x, where F 2M,N = (ω kl N )2M 1,N 1 k, C 2M N. More generally, choose σ N with (σ, N) = 1 and D = diag(ω 0 N, ωσ N,..., ωσ(n 1) N ), Then an M-sparse vector x can be recovered from y = F 2M,N x, where F 2M,N = (ωn σkl)2m 1,N 1 k, C 2M N. 16
18 Numerical issues Let f = j J c j e j with J I and J = M, Ae n = λ n v n for n I. Algorithm (Recovery of f) Input: M, F (A k f), k = 0,..., 2M 1. Solve the linear system M 1 k=0 p k F (A k+m f) = F (A M+m f), m = 0,..., M 1. (1) Form the Prony polynomial P (z) = M k=0 λ j, j J, of P (z) and determine v j, j J. p k z k. Compute the zeros Compute the coefficients c j by solving the overdetermined system F (A k f) = j J c j λ k j v j k = 0,..., 2M 1. Output: c j, v j, j J, determining f. 17
19 Numerical issues II (Generalization of [Potts,Tasche 13]) Numerically stable procedure for steps 1 and 2: Let g k := (F (A k+m f)) M 1 m=0, k = 0,..., M 1 and G := (F (A k+m f)) M 1 k,m=0 = (g 0... g M 1 ) and G = (g 1... g M ). Then (1) yields Gp = g M, Let C(P ) be the companion matrix of the Prony polynomial P (z) with eigenvalues λ j, j J. Then G C(P ) = G, Hence λ j are the eigenvalues of the matrix pencil zg G, z C. Now apply a QR-decomposition or SVD-decomposition to (g 0... g M ). 18
20 References Thomas Peter, Gerlind Plonka A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators. Inverse Problems 29 (2013), Thomas Peter, Gerlind Plonka, Daniela Roşca Representation of sparse Legendre expansions. Journal of Symbolic Computation 50 (2013), Gerlind Plonka, Marius Wischerhoff How many Fourier samples are needed for real function reconstruction? Journal of Appl. Math. and Computing 42 (2013), Thomas Peter Generalized Prony method. PhD thesis, University of Göttingen, September Gerlind Plonka, Manfred Tasche Prony methods for recovery of structured functions. GAMM Mitteilungen, 2014, to appear. 19
21 \thankyou 20
Reconstruction of non-stationary signals by the generalized Prony method
Reconstruction of non-stationary signals by the generalized Prony method Gerlind Plonka Institute for Numerical and Applied Mathematics, University of Göttingen Lille, June 1, 18 Gerlind Plonka (University
More informationSparse polynomial interpolation in Chebyshev bases
Sparse polynomial interpolation in Chebyshev bases Daniel Potts Manfred Tasche We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short)
More informationProny Methods for Recovery of Structured Functions
GAMM-Mitteilungen, 3 June 2014 Prony Methods for Recovery of Structured Functions Gerlind Plonka 1, and Manfred Tasche 2, 1 Institute of Numerical and Applied Mathematics, University of Göttingen, Lotzestraße
More informationParameter estimation for nonincreasing exponential sums by Prony like methods
Parameter estimation for nonincreasing exponential sums by Prony like methods Daniel Potts Manfred Tasche Let z j := e f j with f j (, 0] + i [ π, π) be distinct nodes for j = 1,..., M. With complex coefficients
More informationReconstruction of sparse Legendre and Gegenbauer expansions
Reconstruction of sparse Legendre and Gegenbauer expansions Daniel Potts Manfred Tasche We present a new deterministic algorithm for the reconstruction of sparse Legendre expansions from a small number
More informationHow many Fourier samples are needed for real function reconstruction?
How many Fourier samples are needed for real function reconstruction? Gerlind Plonka Marius Wischerhoff October 26, 2012 Abstract In this paper we present some new results on the reconstruction of structured
More informationReconstruction of Stationary and Non-stationary Signals by the Generalized Prony Method
Reconstruction of Stationary and Non-stationary Signals by the Generalized Prony Method Gerlind Plonka Kilian Stampfer Ingeborg Keller March 7, 018 Abstract. We employ the generalized Prony method to derive
More informationPARAMETER ESTIMATION FOR MULTIVARIATE EXPONENTIAL SUMS
PARAMETER ESTIMATION FOR MULTIVARIATE EXPONENTIAL SUMS DANIEL POTTS AND MANFRED TASCHE Abstract. The recovery of signal parameters from noisy sampled data is an essential problem in digital signal processing.
More informationReconstruction of Stationary and Non-stationary Signals by the Generalized Prony Method
Reconstruction of Stationary and Non-stationary Signals by the Generalized Prony Method Gerlind Plonka Kilian Stampfer Ingeborg Keller July 19, 018 Abstract. We employ the generalized Prony method in [15]
More informationError estimates for the ESPRIT algorithm
Error estimates for the ESPRIT algorithm Daniel Potts Manfred Tasche Let z j := e f j j = 1,..., M) with f j [ ϕ, 0] + i [ π, π) and small ϕ 0 be distinct nodes. With complex coefficients c j 0, we consider
More informationReconstruction of sparse Legendre and Gegenbauer expansions
BIT Numer Math 06 56:09 043 DOI 0.007/s0543-05-0598- Reconstruction of sparse Legendre and Gegenbauer expansions Daniel Potts Manfred Tasche Received: 6 March 04 / Accepted: 8 December 05 / Published online:
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 441 (2014 61 87 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Sparse polynomial
More informationParameter estimation for exponential sums by approximate Prony method
Parameter estimation for exponential sums by approximate Prony method Daniel Potts a, Manfred Tasche b a Chemnitz University of Technology, Department of Mathematics, D 09107 Chemnitz, Germany b University
More informationLecture 4.6: Some special orthogonal functions
Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4340, Advanced Engineering Mathematics
More informationApplication of the AAK theory for sparse approximation of exponential sums
Application of the AAK theory for sparse approximation of exponential sums Gerlind Plonka Vlada Pototskaia 26th September 216 In this paper, we derive a new method for optimal l 1 - and l 2 -approximation
More informationA multivariate generalization of Prony s method
A multivariate generalization of Prony s method Stefan Kunis Thomas Peter Tim Römer Ulrich von der Ohe arxiv:1506.00450v1 [math.na] 1 Jun 2015 Prony s method is a prototypical eigenvalue analysis based
More informationA multivariate generalization of Prony s method
A multivariate generalization of Prony s method Ulrich von der Ohe joint with Stefan Kunis Thomas Peter Tim Römer Institute of Mathematics Osnabrück University SPARS 2015 Signal Processing with Adaptive
More informationSpecial Functions of Mathematical Physics
Arnold F. Nikiforov Vasilii B. Uvarov Special Functions of Mathematical Physics A Unified Introduction with Applications Translated from the Russian by Ralph P. Boas 1988 Birkhäuser Basel Boston Table
More informationComputation of adaptive Fourier series by sparse approximation of exponential sums
Computation of adaptive Fourier series by sparse approximation of exponential sums Gerlind Plonka Vlada Pototskaia 3rd January 2018 Abstract. In this paper, we study the convergence of adaptive Fourier
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationSPECTRAL METHODS: ORTHOGONAL POLYNOMIALS
SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration
More informationFast algorithms for factoring polynomials A selection. Erich Kaltofen North Carolina State University google->kaltofen google->han lu
Fast algorithms for factoring polynomials A selection Erich Kaltofen North Carolina State University google->kaltofen google->han lu Overview of my work 1 Theorem. Factorization in K[x] is undecidable
More informationApplied Linear Algebra
Applied Linear Algebra Peter J. Olver School of Mathematics University of Minnesota Minneapolis, MN 55455 olver@math.umn.edu http://www.math.umn.edu/ olver Chehrzad Shakiban Department of Mathematics University
More informationSolutions: Problem Set 3 Math 201B, Winter 2007
Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If
More informationMATH 350: Introduction to Computational Mathematics
MATH 350: Introduction to Computational Mathematics Chapter V: Least Squares Problems Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2011 fasshauer@iit.edu MATH
More informationRoots and Coefficients Polynomials Preliminary Maths Extension 1
Preliminary Maths Extension Question If, and are the roots of x 5x x 0, find the following. (d) (e) Question If p, q and r are the roots of x x x 4 0, evaluate the following. pq r pq qr rp p q q r r p
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationDirection of Arrival Estimation: Subspace Methods. Bhaskar D Rao University of California, San Diego
Direction of Arrival Estimation: Subspace Methods Bhaskar D Rao University of California, San Diego Email: brao@ucsdedu Reference Books and Papers 1 Optimum Array Processing, H L Van Trees 2 Stoica, P,
More informationZeros and asymptotic limits of Löwdin orthogonal polynomials with a unified view
Applied and Computational Mathematics 2014; 3(2): 57-62 Published online May 10, 2014 (http://www.sciencepublishinggroup.com/j/acm) doi: 10.11648/j.acm.20140302.13 Zeros and asymptotic limits of Löwdin
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationOrthonormal Series Expansion and Laguerre-Finite Hankel Transform of Generalized Functions
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 10, Issue 4 Ver. IV (Jul-Aug. 2014), PP 96-101 Orthonormal Series Expansion and Laguerre-Finite Hankel Transform of Generalized
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
More informationLecture IX. Definition 1 A non-singular Sturm 1 -Liouville 2 problem consists of a second order linear differential equation of the form.
Lecture IX Abstract When solving PDEs it is often necessary to represent the solution in terms of a series of orthogonal functions. One way to obtain an orthogonal family of functions is by solving a particular
More informationRobust Recovery of Positive Stream of Pulses
1 Robust Recovery of Positive Stream of Pulses Tamir Bendory arxiv:1503.0878v3 [cs.it] 9 Jan 017 Abstract The problem of estimating the delays and amplitudes of a positive stream of pulses appears in many
More informationData representation and approximation
Representation and approximation of data February 3, 2015 Outline 1 Outline 1 Approximation The interpretation of polynomials as functions, rather than abstract algebraic objects, forces us to reinterpret
More informationPolynomial Chaos and Karhunen-Loeve Expansion
Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationRapidly Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs
Rapidly Computing Sparse Chebyshev and Legendre Coefficient Expansions via SFTs Mark Iwen Michigan State University October 18, 2014 Work with Janice (Xianfeng) Hu Graduating in May! M.A. Iwen (MSU) Fast
More informationPower Series Solutions to the Legendre Equation
Power Series Solutions to the Legendre Equation Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre
More informationLECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).
CE 025 - Lecture 6 LECTURE 6 GAUSS QUADRATURE In general for ewton-cotes (equispaced interpolation points/ data points/ integration points/ nodes). x E x S fx dx hw' o f o + w' f + + w' f + E 84 f 0 f
More informationDiscrete Orthogonal Harmonic Transforms
Discrete Orthogonal Harmonic Transforms Speaker: Chun-Lin Liu, Advisor: Soo-Chang Pei Ph. D Image Processing Laboratory, EEII 530, Graduate Institute of Communication Engineering, National Taiwan University.
More informationSparse representations from moments
Sparse representations from moments Bernard Mourrain Inria Méditerranée, Sophia Antipolis BernardMourrain@inriafr Sparse representation of signals Given a function or signal f (t): decompose it as f (t)
More informationLectures notes. Rheology and Fluid Dynamics
ÉC O L E P O L Y T E C H N IQ U E FÉ DÉR A L E D E L A U S A N N E Christophe Ancey Laboratoire hydraulique environnementale (LHE) École Polytechnique Fédérale de Lausanne Écublens CH-05 Lausanne Lectures
More informationSturm-Liouville operators have form (given p(x) > 0, q(x)) + q(x), (notation means Lf = (pf ) + qf ) dx
Sturm-Liouville operators Sturm-Liouville operators have form (given p(x) > 0, q(x)) L = d dx ( p(x) d ) + q(x), (notation means Lf = (pf ) + qf ) dx Sturm-Liouville operators Sturm-Liouville operators
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationL. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS
Rend. Sem. Mat. Univ. Pol. Torino Vol. 57, 1999) L. Levaggi A. Tabacco WAVELETS ON THE INTERVAL AND RELATED TOPICS Abstract. We use an abstract framework to obtain a multilevel decomposition of a variety
More information12.0 Properties of orthogonal polynomials
12.0 Properties of orthogonal polynomials In this section we study orthogonal polynomials to use them for the construction of quadrature formulas investigate projections on polynomial spaces and their
More informationKernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt.
SINGAPORE SHANGHAI Vol TAIPEI - Interdisciplinary Mathematical Sciences 19 Kernel-based Approximation Methods using MATLAB Gregory Fasshauer Illinois Institute of Technology, USA Michael McCourt University
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationMATH 235: Inner Product Spaces, Assignment 7
MATH 235: Inner Product Spaces, Assignment 7 Hand in questions 3,4,5,6,9, by 9:3 am on Wednesday March 26, 28. Contents Orthogonal Basis for Inner Product Space 2 2 Inner-Product Function Space 2 3 Weighted
More informationFast algorithms based on asymptotic expansions of special functions
Fast algorithms based on asymptotic expansions of special functions Alex Townsend MIT Cornell University, 23rd January 2015, CAM Colloquium Introduction Two trends in the computing era Tabulations Software
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationComputational Methods. Least Squares Approximation/Optimization
Computational Methods Least Squares Approximation/Optimization Manfred Huber 2011 1 Least Squares Least squares methods are aimed at finding approximate solutions when no precise solution exists Find the
More informationPARTIAL DIFFERENTIAL EQUATIONS and BOUNDARY VALUE PROBLEMS
PARTIAL DIFFERENTIAL EQUATIONS and BOUNDARY VALUE PROBLEMS NAKHLE H. ASMAR University of Missouri PRENTICE HALL, Upper Saddle River, New Jersey 07458 Contents Preface vii A Preview of Applications and
More informationSparse FFT for Functions with Short Frequency Support
Sparse FFT for Functions with Short Frequency Support Sina ittens May 10, 017 Abstract In this paper we derive a deterministic fast discrete Fourier transform algorithm for a π-periodic function f whose
More informationSparse Polynomial Interpolation and Berlekamp/Massey algorithms that correct Outlier Errors in Input Values
Sparse Polynomial Interpolation and Berlekamp/Massey algorithms that correct Outlier Errors in Input Values Clément PERNET joint work with Matthew T. COMER and Erich L. KALTOFEN : LIG/INRIA-MOAIS, Grenoble
More informationStructured Matrices and Solving Multivariate Polynomial Equations
Structured Matrices and Solving Multivariate Polynomial Equations Philippe Dreesen Kim Batselier Bart De Moor KU Leuven ESAT/SCD, Kasteelpark Arenberg 10, B-3001 Leuven, Belgium. Structured Matrix Days,
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More informationIn numerical analysis quadrature refers to the computation of definite integrals.
Numerical Quadrature In numerical analysis quadrature refers to the computation of definite integrals. f(x) a x i x i+1 x i+2 b x A traditional way to perform numerical integration is to take a piece of
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 16. f(x) dx,
Panel integration Week 12: Monday, Apr 16 Suppose we want to compute the integral b a f(x) dx In estimating a derivative, it makes sense to use a locally accurate approximation to the function around the
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationarxiv: v3 [math.ag] 20 Oct 2017
Polynomial-exponential decomposition from moments arxiv:160905720v3 [mathag] 20 Oct 2017 Bernard Mourrain Université Côte d Azur, Inria, aromath, France bernardmourrain@inriafr October 23, 2017 Abstract
More informationRational Chebyshev pseudospectral method for long-short wave equations
Journal of Physics: Conference Series PAPER OPE ACCESS Rational Chebyshev pseudospectral method for long-short wave equations To cite this article: Zeting Liu and Shujuan Lv 07 J. Phys.: Conf. Ser. 84
More informationA fast Chebyshev Legendre transform using an asymptotic formula
A fast Chebyshev Legendre transform using an asymptotic formula Alex Townsend MIT (Joint work with ick Hale) SIAM OPSFA, 5th June 2015 Introduction What is the Chebyshev Legendre transform? Suppose we
More informationWavelets in Scattering Calculations
Wavelets in Scattering Calculations W. P., Brian M. Kessler, Gerald L. Payne polyzou@uiowa.edu The University of Iowa Wavelets in Scattering Calculations p.1/43 What are Wavelets? Orthonormal basis functions.
More informationInterpolation. Chapter Interpolation. 7.2 Existence, Uniqueness and conditioning
76 Chapter 7 Interpolation 7.1 Interpolation Definition 7.1.1. Interpolation of a given function f defined on an interval [a,b] by a polynomial p: Given a set of specified points {(t i,y i } n with {t
More informationDunkl operators and Clifford algebras II
Translation operator for the Clifford Research Group Department of Mathematical Analysis Ghent University Hong Kong, March, 2011 Translation operator for the Hermite polynomials Translation operator for
More informationLecture 6. Numerical methods. Approximation of functions
Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation
More informationELE 538B: Sparsity, Structure and Inference. Super-Resolution. Yuxin Chen Princeton University, Spring 2017
ELE 538B: Sparsity, Structure and Inference Super-Resolution Yuxin Chen Princeton University, Spring 2017 Outline Classical methods for parameter estimation Polynomial method: Prony s method Subspace method:
More informationA FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS
Proceedings of ALGORITMY 2005 pp. 222 229 A FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS ELENA BRAVERMAN, MOSHE ISRAELI, AND ALEXANDER SHERMAN Abstract. Based on a fast subtractional
More informationInterpolation & Polynomial Approximation. Hermite Interpolation I
Interpolation & Polynomial Approximation Hermite Interpolation I Numerical Analysis (th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More informationSpatial Smoothing and Broadband Beamforming. Bhaskar D Rao University of California, San Diego
Spatial Smoothing and Broadband Beamforming Bhaskar D Rao University of California, San Diego Email: brao@ucsd.edu Reference Books and Papers 1. Optimum Array Processing, H. L. Van Trees 2. Stoica, P.,
More informationADVANCED ENGINEERING MATHEMATICS MATLAB
ADVANCED ENGINEERING MATHEMATICS WITH MATLAB THIRD EDITION Dean G. Duffy Contents Dedication Contents Acknowledgments Author Introduction List of Definitions Chapter 1: Complex Variables 1.1 Complex Numbers
More informationThe Perrin Conjugate and the Laguerre Orthogonal Polynomial
The Perrin Conjugate and the Laguerre Orthogonal Polynomial In a previous chapter I defined the conjugate of a cubic polynomial G(x) = x 3 - Bx Cx - D as G(x)c = x 3 + Bx Cx + D. By multiplying the polynomial
More informationAND NONLINEAR SCIENCE SERIES. Partial Differential. Equations with MATLAB. Matthew P. Coleman. CRC Press J Taylor & Francis Croup
CHAPMAN & HALL/CRC APPLIED MATHEMATICS AND NONLINEAR SCIENCE SERIES An Introduction to Partial Differential Equations with MATLAB Second Edition Matthew P Coleman Fairfield University Connecticut, USA»C)
More informationSAMPLING DISCRETE-TIME PIECEWISE BANDLIMITED SIGNALS
SAMPLIG DISCRETE-TIME PIECEWISE BADLIMITED SIGALS Martin Vetterli,, Pina Marziliano and Thierry Blu 3 LCAV, 3 IOA, Ecole Polytechnique Fédérale de Lausanne, Switzerland EECS Dept., University of California
More informationMethod of Finite Elements I
Method of Finite Elements I PhD Candidate - Charilaos Mylonas HIL H33.1 and Boundary Conditions, 26 March, 2018 Institute of Structural Engineering Method of Finite Elements I 1 Outline 1 2 Penalty method
More informationFast Estimates of Hankel Matrix Condition Numbers and Numeric Sparse Interpolation*
Fast Estimates of Hankel Matrix Condition Numbers and Numeric Sparse Interpolation* Erich L Kaltofen Department of Mathematics North Carolina State University Raleigh, NC 769-80, USA kaltofen@mathncsuedu
More informationProny s method under an almost sharp multivariate Ingham inequality
Prony s method under an almost sharp multivariate Ingham ineuality Stefan Kunis H. Michael Möller Thomas Peter Ulrich von der Ohe The parameter reconstruction problem in a sum of Dirac measures from its
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationINTEGRAL TRANSFORMS and THEIR APPLICATIONS
INTEGRAL TRANSFORMS and THEIR APPLICATIONS Lokenath Debnath Professor and Chair of Mathematics and Professor of Mechanical and Aerospace Engineering University of Central Florida Orlando, Florida CRC Press
More information(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB (Mathematical Operations with Arrays) Contents Getting Started Matrices Creating Arrays Linear equations Mathematical Operations with Arrays Using Script
More informationHilbert Space Problems
Hilbert Space Problems Prescribed books for problems. ) Hilbert Spaces, Wavelets, Generalized Functions and Modern Quantum Mechanics by Willi-Hans Steeb Kluwer Academic Publishers, 998 ISBN -7923-523-9
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 informationarxiv: v1 [math.na] 3 Aug 2013
Decimated generalized Prony systems Dmitry Batenkov arxiv:13080753v1 [mathna] 3 Aug 2013 October 18, 2018 Abstract We continue studying robustness of solving algebraic systems of Prony type (also known
More informationMain matrix factorizations
Main matrix factorizations A P L U P permutation matrix, L lower triangular, U upper triangular Key use: Solve square linear system Ax b. A Q R Q unitary, R upper triangular Key use: Solve square or overdetrmined
More informationDegree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m.
Degree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m. Candidates should submit answers to a maximum of four
More informationAn Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations
An Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations Moshe Israeli Computer Science Department, Technion-Israel Institute of Technology, Technion city, Haifa 32000, ISRAEL Alexander
More informationFrom continuous to the discrete Fourier transform: classical and q
From continuous to the discrete Fourier transform: classical and quantum aspects 1 Institut de Mathématiques de Bourgogne, Dijon, France 2 Sankt-Petersburg University of Aerospace Instrumentation (SUAI),
More informationSparse Legendre expansions via l 1 minimization
Sparse Legendre expansions via l 1 minimization Rachel Ward, Courant Institute, NYU Joint work with Holger Rauhut, Hausdorff Center for Mathematics, Bonn, Germany. June 8, 2010 Outline Sparse recovery
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationEquations (3) and (6) form a complete solution as long as the set of functions fy n (x)g exist that satisfy the Properties One and Two given by equati
PHYS/GEOL/APS 661 Earth and Planetary Physics I Eigenfunction Expansions, Sturm-Liouville Problems, and Green's Functions 1. Eigenfunction Expansions In seismology in general, as in the simple oscillating
More informationNIH Public Access Author Manuscript Proc Soc Photo Opt Instrum Eng. Author manuscript; available in PMC 2013 December 17.
NIH Public Access Author Manuscript Published in final edited form as: Proc Soc Photo Opt Instrum Eng. 2008 March 18; 6913:. doi:10.1117/12.769604. Tomographic Reconstruction of Band-limited Hermite Expansions
More informationThe Seven Dwarfs of Symbolic Computation and the Discovery of Reduced Symbolic Models. Erich Kaltofen North Carolina State University google->kaltofen
The Seven Dwarfs of Symbolic Computation and the Discovery of Reduced Symbolic Models Erich Kaltofen North Carolina State University google->kaltofen Outline 2 The 7 Dwarfs of Symbolic Computation Discovery
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. SCI. COMPUT. Vol. 7, No. 6, pp. 1903 198 c 006 Society for Industrial and Applied Mathematics FAST ALGORITHMS FOR SPHERICAL HARMONIC EXPANSIONS VLADIMIR ROKHLIN AND MARK TYGERT Abstract. An algorithm
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationProblem Set 8 Mar 5, 2004 Due Mar 10, 2004 ACM 95b/100b 3pm at Firestone 303 E. Sterl Phinney (2 pts) Include grading section number
Problem Set 8 Mar 5, 24 Due Mar 1, 24 ACM 95b/1b 3pm at Firestone 33 E. Sterl Phinney (2 pts) Include grading section number Useful Readings: For Green s functions, see class notes and refs on PS7 (esp
More information