Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
type: Item
instance of: scholarly article
title: Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
zbMATH Open document ID: 1359.65056
author: L. Gemignani
publication date: 2017-04-07T00:00:00Z
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 65H04
zbMATH DE Number: 6702176
zbMATH Keywords: polynomial zeros
zbMATH Keywords: tridiagonal matrix
zbMATH Keywords: matrix eigenvalues
zbMATH Keywords: three-term recurrence
zbMATH Keywords: floating-point arithmetic
zbMATH Keywords: accuracy
describes a project that uses: FastGaussQuadrature
describes a project that uses: na20
MaRDI profile type: Publication
full work available at URL: j.camwa.2016.06.009
OpenAlex ID: W2466497148
cites work: Solving polynomial eigenvalue problems by means of the Ehrlich-Aberth method
cites work: A Divide-and-Conquer Algorithm for the Bidiagonal SVD
cites work: A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
cites work: An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
cites work: Fast variants of the Golub and Welsch algorithm for symmetric weight functions in Matlab
cites work: Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
cites work: Accurate Singular Values of Bidiagonal Matrices
cites work: A scalable eigenvalue solver for symmetric tridiagonal matrices
cites work: Accurate singular values and differential qd algorithms
cites work: Q4039860
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: Q3922639
cites work: Accurate simple zeros of polynomials in floating point arithmetic
cites work: Accurate Sum and Dot Product
cites work: Q4349924
cites work: A floating-point technique for extending the available precision
cites work: Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
cites work: Automatic linear correction of rounding errors
cites work: Accurate evaluation of the \(k\)-th derivative of a polynomial and its application
cites work: Error analysis of an algorithm for summing certain finite series
cites work: Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
cites work: Q4039888
DOI: 10.1016/J.CAMWA.2016.06.009
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 6702176