N roots of the secular equation in O(N) operations

SIAM Journal on Matrix Analysis and Applications

Volumn 24, Issue 2, 2003, Pages 439-453

  Livne, Oren E ^a   Brandt, Achi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Fast multilevel summation; Root search; Secular equation

Indexed keywords

EID: 0037262119     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801383695     Document Type: Article

References (45)

1. P. ARBENZ AND G. H. GOLUB, On the spectral decomposition of Hermitian matrices modified by low rank perturbations with applications, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 40-58.
2. D. BAI AND A. BRANDT, Local mesh refinement multilevel techniques, SIAM J. Sci. Statist. Comput., 8 (1987), pp. 109-134.
3. D. BAI AND A. BRANDT, Multiscale computation of polymer models, in Multiscale Computational Methods in Chemistry and Physics, A. Brandt, J. Bernholc, and K. Binder, eds., NATO Science Series III: Computer and Systems Sciences, NATO Science Series 177, IOS Press, The Netherlands, 2001, pp. 250-266.
4. A. BRANDT, Guide to multigrid development, in Multigrid Methods (Cologne, 1981), W. Hackbusch and U. Trottenberg, eds., Lecture Notes in Math. 960, Springer-Verlag, Berlin, 1982, pp. 220-312.
5. A. BRANDT, Multilevel computations of integral transforms and particle interactions with oscillatory kernels, Comput. Phys. Comm., 65 (1991), pp. 471-476.
6. A. BRANDT, Multiscale scientific computation: Review 2001, in Multiscale and Multiresolution Methods: Theory and Applications, T. J. Barth, T. F. Chan, and R. Haimes, eds., Lect. Notes Comput. Sci. Eng. 20, Springer-Verlag, Heidelberg, 2001, pp. 3-96.
7. A. BRANDT AND A. A. LUBRECHT, Multilevel matrix multiplication and the fast solution of integral equations. J. Comput. Phys., 90 (1990), pp. 348-370.
8. A. BRANDT AND C. H. VENNER, Multilevel Evaluation of Integral Transforms on Adaptive Grids, Report WI/GC-5, Weizmann Institute of Science, Rehovot, Israel, 1996.
9. A. BRANDT AND C. H. VENNER, Multilevel evaluation of integral transforms with asymptotically smooth kernels, SIAM J. Sci. Comput., 19 (1998), pp. 468-492.
10. J. R. BUNCH AND C. P. NIELSEN, Updating the singular value decomposition, Numer. Math., 31 (1978), pp. 111-129.
11. J. R. BUNCH, C. P. NIELSEN, AND D. C. SORENSEN, Rank-one modification of the symmetric eigenproblem, Numer. Math., 31 (1978), pp. 31-48.
12. J. CARRIER, L. GREENGARD, AND V. ROKHLIN, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 669-686.
13. T. F. CHAN, J. A. OLKIN, AND D. W. COOLEY, Solving quadratically constrained least squares using black box solvers, BIT, 32 (1992), pp. 481-495.
14. J. J. M. CUPPEN, A divide and conquer method for the tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
15. J. J. DONGARRA AND D. C. SORENSEN, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput., 8 (1987), pp. S139-S154.
16. V. N. FADDEEVA, Computational Methods of Linear Algebra, Dover, New York, 1959.
17. G. E. FORSYTHE AND G. H. GOLUB, On the stationary values of a second-degree polynomial on the unit sphere, J. Soc. Indust. Appl. Math., 13 (1965), pp. 1050-1068.
18. D. R. FUHRMANN, An algorithm for subspace computation with applications in signal processing, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 213-220.
19. W. GANDER, Least squares with a quadratic constraint, Numer. Math., 36 (1981), pp. 291-307.
20. W. GANDER, G. H. GOLUB, AND U. VON MATT, A constrained eigenvalue problem, Linear Algebra Appl., 114/115 (1989), pp. 815-839.
21. 2) method for computing the eigensystem of N × N symmetric tridiagonal matrices by the divide and conquer approach, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 161-173.
22. G. H. GOLUB, Some modified matrix eigenvalue problems, SIAM Rev., 15 (1973) pp. 318-334.
23. G. H. GOLUB AND U. VON MATT, Quadratically constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
24. W. B. GRAGG AND L. REICHEL, A divide and conquer method for unitary and orthogonal eigenproblems, Numer. Math., 57 (1990), pp. 695-718.
25. M. GU AND S. C. EISENSTAT, A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl., 15 (1994), pp. 1266-1276.
26. M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 172-191.
27. S. L. HANDY AND J. L. BARLOW, Numerical solution of the eigenproblem for banded, symmetric Toeplitz matrices, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 205-214.
28. R. HANSON AND J. PHILLIPS, An adaptive numerical method for solving linear Fredholm integral equations of the first kind, Numer. Math., 24 (1975), pp. 291-307.
29. O. E. LIVNE, Multiscale Eigenbasis Algorithms, Ph. D. Thesis, Weizmann Institute of Science, Rehovot, Israel, 2000.
30. O. E. LIVNE AND A. BRANDT, O(N log N) multilevel calculation of N eigenfunctions, in Multiscale Computational Methods in Chemistry and Physics, A. Brandt, J. Bernholc, and K. Binder, eds., NATO Science Series III: Computer and Systems Sciences, NATO Science Series 177, IOS Press, The Netherlands, 2001, pp. 123-148.
31. O. E. LIVNE AND A. BRANDT, Multiscale eigenbasis calculations: N eigenfunctions in O(N log N), in Multiscale and Multiresolution Methods: Theory and Applications, T. J. Barth, T. F. Chan, and R. Haimes, eds., Lect. Notes Comput. Sci. Eng. 20, Springer-Verlag, Heidelberg, 2001, pp. 347-358.
32. A. MELMAN, Numerical solution of a secular equation, Numer. Math., 69 (1995), pp. 483-493.
33. A. MELMAN, A unifying convergence analysis of second-order methods for secular equations,Math. Comp., 66 (1997), pp. 333-344.
34. A. MELMAN, A numerical comparison of methods for solving secular equations, J. Comput. Appl. Math., 86 (1997), pp. 237-249.
35. A. MELMAN, Analysis of third-order methods for secular equations, Math. Comp., 67 (1998), pp. 271-286.
36. C. H. REINSCH, Smoothing by spline functions, Numer. Math., 10 (1967), pp. 167-183.
37. C. H. REINSCH, Smoothing by spline functions II, Numer. Math., 16 (1971), pp. 451-454.
38. R. C. LI, Solving the Secular Equation Stably and Efficiently, Technical report, Department of Mathematics, University of California, Berkeley, CA, 1993. LAPACK Working Note 89.
39. D. RON AND A. BRANDT, Renormalization multigrid (RMG): Coarse-to-fine Monte Carlo acceleration and optimal derivation of macroscopic actions, in Multiscale Computational Methods in Chemistry and Physics, A. Brandt, J. Bernholc, and K. Binder, eds., NATO Science Series III: Computer and Systems Sciences, NATO Science Series 177, IOS Press, The Netherlands, 2001, pp. 163-186.
40. B. SANDAK AND A. BRANDT, Multiscale fast summation of long range charge and dipolar interactions, J. Comput. Chem., to appear.
41. M. I. SKOLNIK, ED., Radar Handbook, McGraw-Hill, New York, 1970.
42. M. I. SKOLNIK, ED., Introduction to Radar Systems, 2nd ed., McGraw-Hill, Tokyo, 1983.
43. J. STOER AND R. BULIRSCH, Introduction to Numerical Analysis, translation of Einführung in die Numerische, Springer-Verlag, New York, 1980.
44. U. VON MATT, Large Constrained Quadratic Problems, Verlag dr Eachvereine, Zürich, 1993.
45. M. WEISS, Analysis of some modified cell-averaging CFAR processes in multiple-target situations, IEEE Trans. Aerospace Electron. Systems, 18 (1982), pp. 102-114.