The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
type: Item
instance of: scholarly article
title: The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
zbMATH Open document ID: 0856.65034
DOI: 10.1007/BF02142503
published in: Numerical Algorithms
publication date: 1996-04-28T00:00:00Z
review text: An algorithm is presented for computing the characteristic polynomial of an \(n\times n\) normal matrix, using the elements of the last row and column and the eigenvalues and corresponding eigenvectors (but not explicitly the elements) of the top left \(n-1 \times n-1\) principal submatrix. The authors report that they have found this an effective method for computing eigenvalues and eigenvectors of a bordered matrix when sufficiently high precision is used, although it is known that well-conditioned matrix eigenvalues may be ill-conditioned zeros of the characteristic polynomial.
reviewed by: Alan L. Andrew
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 871289
zbMATH Keywords: bordering method
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: normal matrix
zbMATH Keywords: eigenvalues
zbMATH Keywords: eigenvectors
zbMATH Keywords: bordered matrix
author: M. Morandi Cecchi
author: E. Di Nardo
describes a project that uses: BRENT
describes a project that uses: EISPACK
MaRDI profile type: Publication
cites work: QR-Like Algorithms for Symmetric Arrow Matrices
cites work: Q5657612
cites work: Q3985593
cites work: Rank-one modification of the symmetric eigenproblem
cites work: Iterative Methods for Solving Bordered Systems with Applications to Continuation Methods
cites work: A Divide and Conquer method for the symmetric tridiagonal eigenproblem
cites work: Q3258508
cites work: ALTERNATIVE DERIVATIONS OF FOX'S ESCALATOR FORMULAE FOR LATENT ROOTS
cites work: ESCALATOR METHODS FOR LATENT ROOTS
cites work: Q5543004
cites work: Some Modified Matrix Eigenvalue Problems
cites work: Q3359644
cites work: Q5591853
cites work: Q5840814
cites work: Q5840842
cites work: Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
cites work: Q3868672
cites work: Matrix eigensystem routines - EISPACK guide. 2nd ed
cites work: On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
cites work: Numerical Solution of the Eigenvalue Problem for Hermitian Toeplitz Matrices
cites work: Note on the Escalator Method
cites work: Q5674306
full work available at URL: https://doi.org/10.1007/bf02142503
OpenAlex ID: W2092710552
description: scientific article; zbMATH DE number 871289