Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems

DOI10.1016/J.CAMWA.2016.06.009MaRDI QIDQ521243zbMATH OpenOpenAlexFDO

Authors L. Gemignani

Publication date 7 April 2017

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2016.06.009

zbMATH Keywords

accuracyfloating-point arithmeticmatrix eigenvaluespolynomial zerosthree-term recurrencetridiagonal matrix

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• scientific article; zbMATH DE number 741157
• Reliable Eigenvalues of Symmetric Tridiagonals
• Durand-Kerner root-finding method for the generalized tridiagonal eigenproblem
• Root-finding with eigen-solving
• The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited

Cites work

• A Divide-and-Conquer Algorithm for the Bidiagonal SVD
• A floating-point technique for extending the available precision
• A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
• A scalable eigenvalue solver for symmetric tridiagonal matrices
• Accurate evaluation of the k-th derivative of a polynomial and its application
• Accurate simple zeros of polynomials in floating point arithmetic
• Accurate singular values and differential qd algorithms
• Accurate Singular Values of Bidiagonal Matrices
• Accurate Sum and Dot Product
• An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
• Automatic linear correction of rounding errors
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Error analysis of an algorithm for summing certain finite series
• Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
• Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
• scientific article; zbMATH DE number 3735764 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 193017 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method

Cited in

(6)

• Durand-Kerner root-finding method for the generalized tridiagonal eigenproblem
• On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
• A comparison of companion matrix methods to find roots of a trigonometric polynomial
• scientific article; zbMATH DE number 3965321 (Why is no real title available?)
• Reliable numerical methods for polynomial matrix triangularization
• Using parity to accelerate Hermite function computations: zeros of truncated Hermite series, Gaussian quadrature and Clenshaw summation

Describes a project that uses

Uses Software

• FastGaussQuadrature
• na20

This page was built for publication: Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521243)