Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems
From MaRDI portal
(Redirected from Publication:1641996)
Abstract: We revisit the numerical stability of the two-level orthogonal Arnoldi (TOAR) method for computing an orthonormal basis of a second--order Krylov subspace associated with two given matrices. We show that the computed basis is close (on certain subspace metric sense) to a basis for a second-order Krylov subspace associated with nearby coefficient matrices, provided that the norms of the given matrices are not too large or too small. Thus, the results in this work provide for the first time conditions that guarantee the numerical stability of the TOAR method in computing orthonormal bases of second-order Krylov subspaces. We also study scaling the quadratic problem for improving the numerical stability of the TOAR procedure when the norms of the matrices are too large or too small. We show that in many cases the TOAR procedure applied to scaled matrices is numerically stable when the scaling introduced by Fan, Lin and Van Dooren is used.
Recommendations
- Stability analysis of the two-level orthogonal Arnoldi procedure
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Implicitly restarted two-level orthogonal Arnoldi algorithms
- The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- A variant of second-order Arnoldi method for solving the quadratic eigenvalue problem
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- A memory-efficient model order reduction for time-delay systems
- An algorithm for the complete solution of quadratic eigenvalue problems
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Dimension Reduction of Large-Scale Second-Order Dynamical Systems via a Second-Order Arnoldi Method
- Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis.
- Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem
- Normwise Scaling of Second Order Polynomial Matrices
- On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems
- On the stability of computing polynomial roots via confederate linearizations
- Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Stability analysis of the two-level orthogonal Arnoldi procedure
- The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
Cited in
(3)
This page was built for publication: Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1641996)