Construction of polynomials that are orthogonal with respect to a discrete bilinear form
type: Item
instance of: scholarly article
title: Construction of polynomials that are orthogonal with respect to a discrete bilinear form
zbMATH Open document ID: 0824.65007
DOI: 10.1007/BF02071388
published in: Advances in Computational Mathematics
publication date: 1995-11-13T00:00:00Z
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 42C05
zbMATH DE Number: 784477
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithm
zbMATH Keywords: recursion coefficients
zbMATH Keywords: discrete bilinear form
zbMATH Keywords: complex Givens rotations
zbMATH Keywords: orthogonally similar complex symmetric tridiagonal matrix
zbMATH Keywords: orthogonal polynomials
zbMATH Keywords: Fourier coefficients
zbMATH Keywords: inverse eigenvalue problem
zbMATH Keywords: Stieltjes procedure
author: Lothar Reichel
MaRDI profile type: Publication
cites work: Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing
cites work: Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights
cites work: A survey of matrix inverse eigenvalue problems
cites work: The numerically stable reconstruction of a Jacobi matrix from spectral data
cites work: Q3742612
cites work: Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
cites work: A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
cites work: Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
cites work: On Generating Orthogonal Polynomials
cites work: Orthogonal polynomials - Constructive theory and applications
cites work: Q4204593
cites work: Q3359644
cites work: Matrix interpretations and applications of the continued fraction algorithm
cites work: The numerically stable reconstruction of Jacobi matrices from spectral data
cites work: Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
cites work: Discrete Least Squares Approximation by Trigonometric Polynomials
cites work: A More Portable Fortran Random Number Generator
cites work: Orthogonal polynomials: Variable-signed weight functions
full work available at URL: https://doi.org/10.1007/bf02071388
OpenAlex ID: W2052779912
description: scientific article; zbMATH DE number 784477