A numerical comparison of methods for solving secular equations

DOI10.1016/S0377-0427(97)82122-XzbMath0889.65037OpenAlexW1974158798MaRDI QIDQ1379004

Aaron Melman

Publication date: 18 June 1998

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

Full work available at URL: https://doi.org/10.1016/s0377-0427(97)82122-x

zbMATH Keywords

eigenvaluesnumerical comparisonssecular equationrank one perturbation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to single equations (65H05)

Related Items

Orthogonal Cauchy-like matrices

Cites Work

• A divide and conquer method for unitary and orthogonal eigenproblems
• A constrained eigenvalue problem
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Rank-one modification of the symmetric eigenproblem
• Numerical solution of a secular equation
• An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• An Algorithm for Subspace Computation, with Applications in Signal Processing
• On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
• A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
• Analysis of third-order methods for secular equations
• Some Modified Matrix Eigenvalue Problems
• A unifying convergence analysis of second-order methods for secular equations
• Updating the singular value decomposition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item