Construction of polynomials that are orthogonal with respect to a discrete bilinear form
DOI10.1007/BF02071388zbMath0824.65007OpenAlexW2052779912MaRDI QIDQ1895893
Publication date: 13 November 1995
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02071388
algorithmorthogonal polynomialsnumerical examplesFourier coefficientsinverse eigenvalue problemStieltjes procedurerecursion coefficientscomplex Givens rotationsdiscrete bilinear formorthogonally similar complex symmetric tridiagonal matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The numerically stable reconstruction of Jacobi matrices from spectral data
- Orthogonal polynomials: Variable-signed weight functions
- Orthogonal polynomials - Constructive theory and applications
- Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
- Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
- Matrix interpretations and applications of the continued fraction algorithm
- The numerically stable reconstruction of a Jacobi matrix from spectral data
- Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
- Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
- Discrete Least Squares Approximation by Trigonometric Polynomials
- A survey of matrix inverse eigenvalue problems
- A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
- On Generating Orthogonal Polynomials
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- A More Portable Fortran Random Number Generator