On the convergence rates of Legendre approximation
From MaRDI portal
Publication:5389436
DOI10.1090/S0025-5718-2011-02549-4zbMath1242.41016OpenAlexW2034008227MaRDI QIDQ5389436
Publication date: 26 April 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02549-4
Related Items
A robust pseudospectral method for numerical solution of nonlinear optimal control problems ⋮ Barycentric prolate interpolation and pseudospectral differentiation ⋮ Superconvergence and fast implementation of the barycentric prolate differentiation ⋮ Spectral convergence of probability densities for forward problems in uncertainty quantification ⋮ A new computational model of high-order stochastic simulation based on spatial Legendre moments ⋮ Option pricing with Legendre polynomials ⋮ Sensitivity Analysis for Stability of Uncertain Delay Differential Equations Using Polynomial Chaos Expansions ⋮ Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials ⋮ Barycentric Jacobi spectral method for numerical solutions of the generalized Burgers-Huxley equation ⋮ Spectral Approximation of Convolution Operators ⋮ An efficient numerical method to solve 2-D interval bi-modular problems via orthogonal polynomial expansion ⋮ Fast multipole methods for approximating a function from sampling values ⋮ The degree of ill-posedness of composite linear ill-posed problems with focus on the impact of the non-compact Hausdorff moment operator ⋮ Optimal decay rates on the asymptotics of orthogonal polynomial expansions for functions of limited regularities ⋮ High-order spectral method of density estimation for stochastic differential equation driven by multivariate Gaussian random variables ⋮ Chebfun and numerical quadrature ⋮ An Introduction to Trajectory Optimization: How to Do Your Own Direct Collocation ⋮ Analysis of multivariate Gegenbauer approximation in the hypercube ⋮ A static memory sparse spectral method for time-fractional PDEs ⋮ Computing eigenvalues and eigenfunctions of the Laplacian for convex polygons ⋮ Parameter choice strategies for error expressions and the numerical stability of Tikhonov-regularized approximation formulae ⋮ Fast barycentric rational interpolations for complex functions with some singularities ⋮ Intrusive and non-intrusive chaos approximation for a two-dimensional steady state Navier-Stokes system with random forcing ⋮ New error bounds for Legendre approximations of differentiable functions ⋮ Fractional pseudospectral integration matrices for solving fractional differential, integral, and integro-differential equations ⋮ Fast computation of the spectral differentiation by the fast multipole method ⋮ Linear Barycentric Rational Interpolation with Guaranteed Degree of Exactness ⋮ Explicit barycentric formulae for osculatory interpolation at roots of classical orthogonal polynomials ⋮ Global optimization in Hilbert space ⋮ Superconvergence of Jacobi-Gauss-type spectral interpolation ⋮ Pricing European-type, early-exercise and discrete barrier options using an algorithm for the convolution of Legendre series ⋮ Difference inequalities and barycentric identities for classical discrete iterated weights ⋮ A Hybrid Analytical-Numerical Technique for Elliptic PDEs ⋮ 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 ⋮ Numerical solution of Volterra-Fredholm integral equations using parameterized pseudospectral integration matrices ⋮ Tikhonov regularization for polynomial approximation problems in Gauss quadrature points ⋮ Representation of solutions to the one-dimensional Schrödinger equation in terms of Neumann series of Bessel functions ⋮ Pointwise error estimate of the Legendre expansion: the known and unknown features ⋮ Jacobi polynomials on the Bernstein ellipse ⋮ A new and sharper bound for Legendre expansion of differentiable functions ⋮ On exponential convergence of Gegenbauer interpolation and spectral differentiation ⋮ Rapidly computing sparse Legendre expansions via sparse Fourier transforms ⋮ How much faster does the best polynomial approximation converge than Legendre projection? ⋮ Recent advances in linear barycentric rational interpolation ⋮ On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity ⋮ Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations ⋮ The spatial distribution in infinite dimensional spaces and related quantiles and depths ⋮ High-order, stable, and efficient pseudospectral method using barycentric Gegenbauer quadratures ⋮ Monte Carlo integration with a growing number of control variates ⋮ Boolean spectral analysis in categorical reservoir modeling ⋮ Analysis of spectral approximations using eigenfunctions of fractional Sturm-Liouville problems ⋮ A discontinuous Galerkin reduced basis element method for elliptic problems ⋮ Density Estimation in Uncertainty Propagation Problems Using a Surrogate Model ⋮ On the Optimal Estimates and Comparison of Gegenbauer Expansion Coefficients ⋮ Switching environments, synchronous sex, and the evolution of mating types ⋮ On the Fokas method for the solution of elliptic problems in both convex and non-convex polygonal domains ⋮ Convergence Rates on Spectral Orthogonal Projection Approximation for Functions of Algebraic and Logarithmatic Regularities ⋮ Spectral Levin-type methods for calculation of generalized Fourier transforms ⋮ Pointwise and uniform convergence of Fourier extensions ⋮ Extended barycentric rational schemes for functions of singularities ⋮ A robust spline approach in partially linear additive models ⋮ The Fast Implementation of Higher Order Hermite--Fejér Interpolation ⋮ A fast method for imposing periodic boundary conditions on arbitrarily-shaped lattices in two dimensions ⋮ Inferring the smoothness of the autocorrelation function from that of the initial state ⋮ Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation ⋮ The electrostatic equilibrium problem for classical discrete 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
