Fast conversion algorithms for orthogonal polynomials
basis conversioncomplexityconversion algorithmsfast algorithmsorthogonal polynomialstransposed algorithms
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical approximation and evaluation of special functions (33F05) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)
Efficient conversion algorithms for orthogonal polynomials are presented. A known conversion algorithm from an arbitrary orthogonal basis to the monomial basis is described first and a new algorithm with same complexity is deduced for the conversion operation.
- Fast algorithms using orthogonal polynomials
- Fast associated classical orthogonal polynomial transforms
- Fast algorithms for discrete polynomial transforms
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- A new algorithm for computing orthogonal polynomials
- Fast decreasing and orthogonal polynomials
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
- Acceleration of Convergence of Sequences via Orthogonal Polynomials
- A fast algorithm for expansion over spherical harmonics
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
- Combinatorial aspects of continued fractions
- Fast algorithms for discrete polynomial transforms
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Fast inversion of triangular Toeplitz matrices
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 1617990 (Why is no real title available?)
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151179 (Why is no real title available?)
- Modern computer algebra
- New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
- On fast multiplication of polynomials over arbitrary algebras
- Power series composition and change of basis
- The middle product algorithm. I: Speeding up the division and square root of power series
- The Relation of the Classical Orthogonal Polynomials to the Polynomials of Appell
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
- A fast discrete spectral method for stochastic partial differential equations
- Fast associated classical orthogonal polynomial transforms
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- scientific article; zbMATH DE number 3850444 (Why is no real title available?)
- Orthogonal polynomial expansions on sparse grids
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Enclosing Chebyshev expansions in linear time
- Power series composition and change of basis
- Fast algorithms using orthogonal polynomials
- Composite functions in an orthogonal polynomial base
This page was built for publication: Fast conversion algorithms for orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044602)
