Hyman's method revisited

DOI10.1016/j.cam.2008.08.004zbMath1181.65053OpenAlexW2095279657MaRDI QIDQ1008688

Csaba J. Hegedűs, Aurel Galantai

Publication date: 30 March 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.08.004

zbMATH Keywords

Newton methodQR methodmultiple eigenvaluesHessenberg matricesHyman's methodJacobian canonical form

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21)

Related Items (2)

Tridiagonal test matrices for eigenvalue computations: two-parameter extensions of the Clement matrix ⋮ A Note on Perturbation Estimates for Invariant Subspaces of Hessenberg Matrices

Uses Software

• Matlab
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of transfer function matrices of linear multivariable systems
• Numerical methods for roots of polynomials. Part I
• An approach to backward analysis for linear and nonlinear iterative methods
• Numerical stability for solving nonlinear equations
• A multishift QR iteration without computation of the shifts
• The construction of practical general linear methods
• The effective order of singly-implicit Runge-Kutta methods
• Convergence of the shifted \(QR\) algorithm on \(3\times{} 3\) normal matrices
• Determinantal expression and recursion for Jack polynomials
• Hessenberg eigenvalue--eigenmatrix relations
• Perturbation bounds for polynomials
• Convergence of the Newton process to multiple solutions
• Rational QR transformation with Newton shift for symmetric tridiagonal matrices
• Error analysis for the Newton-Raphson method
• Matrix Algorithms
• Finding a Multiple Zero by Transformations and Newton-Like Methods
• Matrix Analysis
• Hessenberg-triangular reduction and transfer function matrices of singular systems
• The behavior of a multiplicity independent root-finding scheme in the presence of error
• The QR Algorithm and Hyman's Method on Vector Computers
• Sparse Hessenberg reduction and the eigenvalue problem for large sparse matrices
• The Homotopy Continuation Algorithm for the Real Nonsymmetric Eigenproblem: Further Development and Implementation
• Remark on Algorithms to Find Roots of Polynomials
• The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
• Laguerre's Method Applied to the Matrix Eigenvalue Problem
• Hyman's Method Applied to the General Eigenvalue Problem
• Canonical Decomposition of Hessenberg Matrices

This page was built for publication: Hyman's method revisited