Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations

zbMath1188.65045MaRDI QIDQ964072

B. E. Eshmatov

Publication date: 14 April 2010

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/229924

zbMATH Keywords

complexityalgorithmnumerical exampleserror analysisimplementationfactored formskew-symmetric inner productbackward and forward errorsoptimal symplectic Householder transformationsSR factorizationstructured eigenvalue problemssymplectic QR like methodsWY factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (4)

An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations ⋮ Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms ⋮ A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics ⋮ Refined rigorous perturbation bounds for the SR decomposition

This page was built for publication: Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations