Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs

DOI10.1016/0024-3795(94)90492-8zbMath0810.65031OpenAlexW1993384420WikidataQ94861080 ScholiaQ94861080MaRDI QIDQ1319992

Publication date: 9 April 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)90492-8

zbMATH Keywords

numerical example eigenvalues estimates perturbations bounds Arnoldi algorithm nonsymmetric matrix pencil rational Krylov algorithms Ritz approximations shifted Lanczos algorithm small Hessenberg pencil

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

An adaptive rational block Lanczos-type algorithm for model reduction of large scale dynamical systems, An implicit filter for rational Krylov using core transformations, The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices, A computational global tangential Krylov subspace method for model reduction of large-scale MIMO dynamical systems, Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, The implicit application of a rational filter in the RKS method, Generalized conjugate gradient squared, A rational Lanczos algorithm for model reduction, Adaptive rational interpolation: Arnoldi and Lanczos-like equations, Adaptive-order rational Arnoldi-type methods in computational electromagnetism, On a family of low-rank algorithms for large-scale algebraic Riccati equations, Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators, The RKFIT Algorithm for Nonlinear Rational Approximation, The Block Rational Arnoldi Method, Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector, A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems., Rational $QR$-iteration without inversion, Extended and rational Hessenberg methods for the evaluation of matrix functions, An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems, Conversions between barycentric, RKFUN, and Newton representations of rational interpolants, An adaptive-order rational Arnoldi method for model-order reductions of linear time-invariant systems, Model reduction of large-scale systems by least squares, Model-order reductions for MIMO systems using global Krylov subspace methods, Biorthogonal rational Krylov subspace methods, Adaptive eigenfrequency analysis by superconvergent patch recovery, Generation of orthogonal rational functions by procedures for structured matrices, A Rational QZ Method, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems, Using implicitly filtered RKS for generalised eigenvalue problems, Restrictions on implicit filtering techniques for orthogonal projection methods, Eigenvalue computation in the 20th century, Generalized Rational Krylov Decompositions with an Application to Rational Approximation, Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction, A matrix rational Lanczos method for model reduction in large‐scale first‐ and second‐order dynamical systems, The Sylvester equation and approximate balanced reduction

Cites Work