Fast Simultaneous Orthogonal Reduction to Triangular Matrices

Ivan V. Oseledets, Dmitry V. Savostyanov, Eugene E. TyrtyshnikovSIAM J. Matrix Anal. Appl 2009 · DOI · OpenReview

Abstract

A new algorithm is presented for simultaneous reduction of a given finite sequence of square matrices to upper triangular matrices by means of orthogonal transformations. The reduction is performed through a series of deflation steps, where each step contains a simultaneous eigenvalue problem being a direct generalization of the generalized eigenvalue problem. To solve the latter, a fast variant of the Gauss–Newton algorithm is proposed with some results on its local convergence properties (quadratic for the exact and linear for the approximate reduction) and numerical examples are provided.
BibTeX
@article{oseledets2009fast,
  author = {Ivan V. Oseledets and Dmitry V. Savostyanov and Eugene E. Tyrtyshnikov},
  title = {{Fast Simultaneous Orthogonal Reduction to Triangular Matrices}},
  journal = {SIAM J. Matrix Anal. Appl.},
  year = {2009},
  doi = {10.1137/060650738},
}

Loading related content...

Figure