On the condition number of some Gram matrices arising from least squares approximation in the complex plane

DOI10.1007/BF01389479zbMath0602.65025OpenAlexW2000974088MaRDI QIDQ1082036

Yousef Saad

Publication date: 1986

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133073

zbMATH Keywords

Chebyshev polynomialsGram matricescondition numbersleast square polynomials

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of matrix norms, conditioning, scaling (65F35) Algorithms for approximation of functions (65D15)

Related Items (max. 100)

Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for Gaussian quadrature given modified moments
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems
• On Generating Orthogonal Polynomials
• Construction of Gauss-Christoffel Quadrature Formulas

This page was built for publication: On the condition number of some Gram matrices arising from least squares approximation in the complex plane