A numerical comparison of methods for solving secular equations

Journal of Computational and Applied Mathematics

Volumn 86, Issue 1, 1997, Pages 237-249

  Melman, A ^a,b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Stanford University   (United States)

Author keywords

Numerical comparisons; Secular equation; Starting points

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; PROBLEM SOLVING;

SECULAR EQUATIONS;

NUMERICAL METHODS;

EID: 0031276783     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(97)82122-X     Document Type: Article

References (20)

1. C.F. Borges, W.B. Gragg, A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem, in: L. Reichel, A. Ruttan, R.S. Varga (Eds.), Numerical Linear Algebra and Scientific Computing, de Gruyter, Berlin, 1993, pp. 10-28.
2. J.R. Bunch, C.P. Nielsen, Updating the singular value decomposition, Numer. Math. 31 (1978) 111-129.
3. J.R. Bunch, C.P. Nielsen, D.C. Sorensen, Rank-one modification of the symmetric eigenproblem, Numer. Math. 31 (1978) 31-48.
4. J.J.M. Cuppen, A divide and conquer method for the symmetric tridiagonal eigenvalue problem, Numer. Math. 36 (1981) 177-195.
5. J.J. Dongarra, D.C. Sorensen, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput. 8 (2) (1987) s139-s154.
6. W.F. Donoghue, Jr., Monotone matrix Functions and Analytic Continuation, Springer, Berlin, 1974.
7. D.R. Fuhrmann, An algorithm for subspace computation with applications in signal processing, SIAM J. Matrix Anal. Appl. 9 (2) (1988) 213-220.
8. W. Gander, G.H. Golub, U. von Matt, A constrained eigenvalue problem, Linear Algebra Appl. 114-115 (1989) 815-839.
9. 2) method for computing the eigensystem of N × N symmetric tridiagonal matrices by the divide and conquer approach, SIAM J. Sci. Statist. Comput. 11 (1) (1990) 161-173.
10. G.H. Golub, Some modified matrix eigenvalue problems, SIAM Rev. 15 (2) (1973) 318-334.
11. W.B. Gragg, L. Reichel, A divide and conquer method for unitary and orthogonal eigenproblems, Numer. Math. 57 (1990) 695-718.
12. W.B. Gragg, J.R. Thornton, D.D. Warner, Parallel divide and conquer algorithms for the symmetric tridiagonal eigenproblem and the bidiagonal singular value problem, in: W.G. Vogt, M.H. Mickle (Eds.), Modeling and Simulation, vol. 3, Part 1, University of Pittsburgh School of Engineering, Pittsburgh, PA, 1992, pp. 49-56.
13. M. Gu, S.C. Eisenstat, A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem, SIAM J. Matrix Anal. Appl. 15 (4) (1994) 1266-1276.
14. R.C. Li, Solving secular equations stably and efficiently, Tech. Report UCB//CSD-94-851, Computer Science Division, University of California, Berkeley, CA. Also: LAPACK Working Notes 89, 1994.
15. A. Melman, Numerical solution of a secular equation, Numer. Math. 69 (1995) 483-493.
16. A. Melman, A unifying convergence analysis of second-order methods for secular equations, Math. Comp. 66 (217) (1997) 333-344.
17. A. Melman, Analysis of third order methods for secular equations, Math. Comp., to appear.
18. G.S. Salehov, On the convergence of the process of tangent hyperbolas, Dokl. Akad. Nauk SSSR 82 (1952) 525-528 (in Russian).
19. D.C. Sorensen, P.T.P. Tang, On the orthogonality of eigenvectors computed by divide-and-conquer techniques, SIAM J. Numer. Anal. 28 (28), (1991) 1752-1775.
20. J.F. Traub, Iterative Methods for the Solution of Equations, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1964.