
doi: 10.1137/0612041
Orthogonal polynomials with respect to a discrete inner product are computed via an inverse eigenvalue problem that is actually solved via Givens rotations. The algorithm is applied to factor Vandermonde-like matrices as \(QR\) and it provides a fast solver for overdetermined systems with such matrices.
\(QR\) factorization, overdetermined systems, Numerical solutions to overdetermined systems, pseudoinverses, algorithm, Vandermonde matrix, Algorithms for approximation of functions, discrete inner product, inverse eigenvalue problem, Givens rotations, Direct numerical methods for linear systems and matrix inversion, orthogonal polynomials, Orthogonalization in numerical linear algebra
\(QR\) factorization, overdetermined systems, Numerical solutions to overdetermined systems, pseudoinverses, algorithm, Vandermonde matrix, Algorithms for approximation of functions, discrete inner product, inverse eigenvalue problem, Givens rotations, Direct numerical methods for linear systems and matrix inversion, orthogonal polynomials, Orthogonalization in numerical linear algebra
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 28 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
