A unifying convergence analysis of second-order methods for secular equations
Author:
Open Access
- 1 January 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (217) , 333-345
Abstract
Existing numerical methods of second-order are considered for a so-called secular equation. We give a brief description of the most important of these methods and show that all of them can be interpreted as improvements of Newton's method for an equivalent problem for which Newton's method exhibits convergence from any point in a given interval. This interpretation unifies the convergence analysis of these methods, provides convergence proofs where they were lacking and furnishes ways to construct improved methods. In addition, we show that some of these methods are, in fact, equivalent. A second secular equation is also briefly considered.Keywords
This publication has 18 references indexed in Scilit:
- Solving quadratically constrained least squares using black box solversBIT Numerical Mathematics, 1992
- A constrained eigenvalue problemLinear Algebra and its Applications, 1989
- An Algorithm for Subspace Computation, with Applications in Signal ProcessingSIAM Journal on Matrix Analysis and Applications, 1988
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with ApplicationsSIAM Journal on Matrix Analysis and Applications, 1988
- A Fully Parallel Algorithm for the Symmetric Eigenvalue ProblemSIAM Journal on Scientific and Statistical Computing, 1987
- Least squares with a quadratic constraintNumerische Mathematik, 1980
- A divide and conquer method for the symmetric tridiagonal eigenproblemNumerische Mathematik, 1980
- Updating the singular value decompositionNumerische Mathematik, 1978
- Rank-one modification of the symmetric eigenproblemNumerische Mathematik, 1978
- On the Stationary Values of a Second-Degree Polynomial on the Unit SphereJournal of the Society for Industrial and Applied Mathematics, 1965