Continuation of eigendecompositions

Authors:
L. Dieci;A. Papini
Affiliations:
School of Mathematics, Georgia Tech., Atlanta, GA;Dipartimento di Energetica, Univ. of Florence, 50134 Florence, Italy
Venue:
Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
Year:
2003

Citing 5
Cited 1

Three methods for refining estimates of invariant subspaces

Computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
On Smooth Decompositions of Matrices

SIAM Journal on Matrix Analysis and Applications
Computing Connecting Orbits via an Improved Algorithm for Continuing Invariant Subspaces

SIAM Journal on Scientific Computing
Diagonalization of Time Varying Symmetric Matrices

ICCS '02 Proceedings of the International Conference on Computational Science-Part III

New algorithms for the iterative refinement of estimates of invariant subspaces

Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we consider continuation of block eigendecompositions of a matrix valued function. We give new theoretical results on reduction to Hessenberg and bidiagonal forms, introduce and implement algorithms to continue eigendecompositions, and give numerical examples.