Computing the Roots of Complex Orthogonal and Kernel Polynomials
acceleration of iterative methodseigenvaluesGaussian eliminationHessenberg matrixkernel polynomialsnonsymmetric linear equationsnumerical examplesorthogonal polynomialsstabilityStieltjes proceduretridiagonal Jacobi matrix
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Approximation by polynomials (41A10) Computation of special functions and constants, construction of tables (65D20) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to single equations (65H05)
- Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
- scientific article; zbMATH DE number 811999
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- scientific article; zbMATH DE number 4142744
- Remarks on polynomial methods for solving systems of linear algebraic equations
- An optimum iterative method for solving any linear system with a square matrix
- Leapfrog variants of iterative methods for linear algebraic equations
- Orthogonal polynomials on the unit circle: distribution of zeros
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
- Iterative solution of linear systems in the 20th century
- Kernels on the unit circle. Orthogonality
- Convergence properties of block GMRES and matrix polynomials
- CCOMP: an efficient algorithm for complex roots computation of determinantal equations
- On generating Sobolev orthogonal polynomials
- Implementation of an adaptive algorithm for Richardson's method
This page was built for publication: Computing the Roots of Complex Orthogonal and Kernel Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777332)
