Commun. Comput. Phys.,
The Discrete Orthogonal Polynomial Least Squares Method for Approximation and Solving Partial Differential Equations
Anne Gelb 1*, Rodrigo B. Platte 1, W. Steven Rosenthal 11 Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287, USA.
Received 10 August 2007; Accepted (in revised version) 3 September 2007
Available online 27 November 2007
We investigate numerical approximations based on polynomials that are orthogonal with respect to a weighted discrete inner product and develop an algorithm for solving time dependent differential equations. We focus on the family of super Gaussian weight functions and derive a criterion for the choice of parameters that provides good accuracy and stability for the time evolution of partial differential equations. Our results show that this approach circumvents the problems related to the Runge phenomenon on equally spaced nodes and provides high accuracy in space. For time stability, small corrections near the ends of the interval are computed using local polynomial interpolation. Several numerical experiments illustrate the performance of the method.AMS subject classifications: 41A10, 65D15, 65M70
Notice: Undefined variable: pac in /var/www/html/issue/abstract/readabs.php on line 164
Key words: Discrete least-squares, orthogonal polynomials, spectral methods, high order numerical methods, uniform grid.
Email: email@example.com (A. Gelb), firstname.lastname@example.org (R. B. Platte), William.Rosenthal@asu.edu (W. S. Rosenthal)