On the convergence rates of Legendre approximation
From MaRDI portal
Publication:5389436
DOI10.1090/S0025-5718-2011-02549-4zbMath1242.41016MaRDI QIDQ5389436
Publication date: 26 April 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
41A25: Rate of convergence, degree of approximation
Related Items
Spectral Approximation of Convolution Operators, An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation, Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness, Difference inequalities and barycentric identities for classical discrete iterated weights, A Hybrid Analytical-Numerical Technique for Elliptic PDEs, On exponential convergence of Gegenbauer interpolation and spectral differentiation, Density Estimation in Uncertainty Propagation Problems Using a Surrogate Model, Monte Carlo integration with a growing number of control variates, The Fast Implementation of Higher Order Hermite--Fejér Interpolation, On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity, Superconvergence of Jacobi-Gauss-type spectral interpolation, Rapidly computing sparse Legendre expansions via sparse Fourier transforms, Numerical solution of Volterra-Fredholm integral equations using parameterized pseudospectral integration matrices, High-order, stable, and efficient pseudospectral method using barycentric Gegenbauer quadratures, A new computational model of high-order stochastic simulation based on spatial Legendre moments, Barycentric Jacobi spectral method for numerical solutions of the generalized Burgers-Huxley equation, Fast multipole methods for approximating a function from sampling values, Computing eigenvalues and eigenfunctions of the Laplacian for convex polygons, Global optimization in Hilbert space, An iterative spatial-stepping numerical method for linear elliptic PDEs using the unified transform, A Legendre-based computational method for solving a class of Itô stochastic delay differential equations, Representation of solutions to the one-dimensional Schrödinger equation in terms of Neumann series of Bessel functions, Jacobi polynomials on the Bernstein ellipse, Chebfun and numerical quadrature, Pointwise error estimate of the Legendre expansion: the known and unknown features, A new and sharper bound for Legendre expansion of differentiable functions, Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations, Recent advances in linear barycentric rational interpolation, Analysis of spectral approximations using eigenfunctions of fractional Sturm-Liouville problems, On the Fokas method for the solution of elliptic problems in both convex and non-convex polygonal domains, Spectral Levin-type methods for calculation of generalized Fourier transforms, The spatial distribution in infinite dimensional spaces and related quantiles and depths, Option pricing with Legendre polynomials, A discontinuous Galerkin reduced basis element method for elliptic problems, On the Optimal Estimates and Comparison of Gegenbauer Expansion Coefficients, Explicit barycentric formulae for osculatory interpolation at roots of classical orthogonal polynomials, Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast and simple algorithm for the computation of Legendre coefficients
- Error bounds for approximation in Chebyshev points
- A method for numerical integration on an automatic computer
- On the numerical convergence with the inverse polynomial reconstruction method for the resolution of the Gibbs phenomenon
- Spectral elements for transport-dominated equations
- The computation of the spectra of highly oscillatory Fredholm integral operators
- Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Spectral Methods for Time-Dependent Problems
- Numerical Methods in Scientific Computing, Volume I
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- Lagrange interpolation for continuous functions of bounded variation
- Spectral Methods and Their Applications
- Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
- Efficient Spectral-Galerkin Method II. Direct Solvers of Second- and Fourth-Order Equations Using Chebyshev Polynomials
- Spectral Methods in MATLAB
- Barycentric Lagrange Interpolation
- The numerical stability of barycentric Lagrange interpolation
- An Introduction to Numerical Analysis
- A Practical Guide to Pseudospectral Methods
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- Spectral Methods
- Calculation of Gauss Quadrature Rules
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages