Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
From MaRDI portal
Publication:521243
DOI10.1016/j.camwa.2016.06.009zbMath1359.65056OpenAlexW2466497148MaRDI QIDQ521243
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
accuracytridiagonal matrixpolynomial zerosfloating-point arithmeticmatrix eigenvaluesthree-term recurrence
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of roots of polynomial equations (65H04)
Related Items
On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Using parity to accelerate Hermite function computations: zeros of truncated Hermite series, Gaussian quadrature and Clenshaw summation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
- Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
- A scalable eigenvalue solver for symmetric tridiagonal matrices
- Accurate simple zeros of polynomials in floating point arithmetic
- Accurate singular values and differential qd algorithms
- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Accurate evaluation of the \(k\)-th derivative of a polynomial and its application
- A floating-point technique for extending the available precision
- Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems
- Accurate Singular Values of Bidiagonal Matrices
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- Error analysis of an algorithm for summing certain finite series
- Accurate Sum and Dot Product
- Automatic linear correction of rounding errors
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
