Computing the Roots of Complex Orthogonal and Kernel Polynomials

DOI10.1137/0909001zbMath0637.65042OpenAlexW2030489538MaRDI QIDQ3777332

Dennis C. Smolarski, Paul E. Saylor

Publication date: 1988

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0909001

zbMATH Keywords

stabilityorthogonal polynomialsnumerical exampleseigenvaluesGaussian eliminationkernel polynomialsStieltjes procedureHessenberg matrixtridiagonal Jacobi matrixnonsymmetric linear equationsacceleration of iterative methods

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Iterative numerical methods for linear systems (65F10) Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Approximation by polynomials (41A10)

Related Items

An optimum iterative method for solving any linear system with a square matrix, Leapfrog variants of iterative methods for linear algebraic equations, Kernels on the unit circle. Orthogonality, CCOMP: an efficient algorithm for complex roots computation of determinantal equations, On generating Sobolev orthogonal polynomials, Orthogonal polynomials on the unit circle: distribution of zeros, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, Convergence properties of block GMRES and matrix polynomials, Iterative solution of linear systems in the 20th century, Implementation of an adaptive algorithm for Richardson's method

Uses Software

• EISPACK