Continuation of eigendecompositions

Future Generation Computer Systems

Volumn 19, Issue 7, 2003, Pages 1125-1137

  Dieci, L ^a   Papini, A ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Continuation; Riccati equations; Schur and Hessenberg forms; Smooth eigendecompositions

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING;

BIDIAGONAL STRUCTURES;

COMPUTER SYSTEMS;

EID: 0043194038     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(03)00039-6     Document Type: Conference Paper

References (19)

1. E. Allgower, K. Georg, Continuation and path following, Acta Numer. (1993) 1-64.
2. M. Baumann, U. Helmke, Diagonalization of time varying symmetric matrices, University of Wurzburg, Preprint, 2002.
3. Bavely C., Stewart G.W., An algorithm for computing reducing subspaces by block-diagonalization. SIAM J. Numer. Anal. 16:1979;359-367.
4. Beyn W.J., The numerical computation of connecting orbits in dynamical systems. IMA J. Numer. Anal. 10:1990;379-405.
5. Bunse-Gerstner A., Byers R., Mehrmann V., Nichols N.K., Numerical computation of an analytic singular value decomposition by a matrix valued function. Numer. Math. 60:1991;1-40.
6. Demmel J.W., Three methods for refining estimates of invariant subspaces. Computing. 38:1987;43-57.
7. Demmel J.W., Dieci L., Friedman M., An efficient algorithm for locating and continuing connecting orbits. SIAM J. Sci. Comput. 22:2001;81-94.
8. Dieci L., Eirola T., On smooth decomposition of matrices. SIAM J. Matrix Anal. Appl. 20:1999;800-819.
9. Dieci L., Friedman M., Continuation of invariant subspaces. Appl. Numer. Lin. Algebra. 8:2001;317-327.
10. Friedman M., An improved detection of bifurcations in large nonlinear systems via the continuation of invariant subspaces algorithm. Int. J. Bifurcat. Chaos. 11:2001;2277-2285.
11. Gingold H., Hsieh P.F., Globally analytic triangularization of a matrix function. Lin. Algebra Appl. 169:1992;75-101.
12. Golub G.H., Nash S., Van Loan C., A Hessenberg-Schur method for the problem. AX + XB = C IEEE Trans. Automat. Contr. 24:1979;909-913.
13. G.H. Golub, C.F. Van Loan, Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
14. B. Kagström, Computation of matrix functions. Technical Report, Report UMINF-58.77, Dept. Inf. Processing, University of Umea, Umea, Sweden, 1977.
15. T. Kato, Perturbation Theory for Linear Operators, 2nd ed., Springer, Berlin, 1976.
16. H. Keller, Numerical Methods in Bifurcation Problems, Tata Institute of Fundamental Research, Springer, Bombay, 1987.
17. Mehrmann V., Rath W., Numerical methods for the computation of analytic singular value decompositions. Electr. Trans. Numer. Anal. 1:1992;72-88.
18. Rheinboldt W., On the computation of multi-dimensional solution manifolds of parametrized equations. Numer. Math. 53:1988;165-181.
19. Wright K., Differential equations for the analytical singular value decomposition of a matrix. Numer. Math. 63:1992;283-295.