A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper J-Hessenberg form and related topics

DOI10.1016/J.CAM.2019.03.011MaRDI QIDQ2312666zbMATH OpenOpenAlexFDO

Authors Haithem Ben Kahla, Ahmed Salam

Publication date 17 July 2019

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.08224

zbMATH Keywords

\(SR\) decomposition\(SR\)-algorithmbreakdowns and near-breakdownssymplectic Householder transformationsupper \(J\)-Hessenberg form

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50)

Abstract: The reduction of a matrix to an upper $J$-Hessenberg form is a crucial step in the $SR$-algorithm (which is a $QR$-like algorithm), structure-preserving, for computing eigenvalues and vectors, for a class of structured matrices. This reduction may be handled via the algorithm JHESS or via the recent algorithm JHMSH and its variants. The main drawback of JHESS (or JHMSH) is that it may suffer from a fatal breakdown, causing a brutal stop of the computations and hence, the $SR$-algorithm does not run. JHESS may also encounter near-breakdowns, source of serious numerical instability. In this paper, we focus on these aspects. We first bring light on the necessary and sufficient condition for the existence of the $SR$-decomposition, which is intimately linked to $J$-Hessenberg reduction. Then we will derive a strategy for curing fatal breakdowns and also for treating near breakdowns. Hence, the $J$-Hessenberg form may be obtained. Numerical experiments are given, demonstrating the efficiency of our strategies to cure and treat breakdowns or near breakdowns.

Recommendations

• An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
• On the reduction of matrix polynomials to Hessenberg form
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• scientific article; zbMATH DE number 5252246
• scientific article; zbMATH DE number 558293
• A continuous Jacobi-like approach to the simultaneous reduction of real matrices
• Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
• Reduction of matrices to the Jordan normal form
• Jacobians and rank 1 perturbations relating to unitary Hessenberg matrices
• A new iterative criterion for \(H\)-matrices: The reducible case

Cites work

• A Schur decomposition for Hamiltonian matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
• Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
• scientific article; zbMATH DE number 3125713 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Matrix factorizations for symplectic QR-like methods
• Numerical linear algorithms and group theory
• On some algebraic problems in connection with general eigenvalue algorithms
• Optimal symplectic Householder transformations for \(SR\) decomposition
• Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
• The Matrix Eigenvalue Problem

Cited in

(1)

• An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations

This page was built for publication: A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2312666)