Parallelization of the Rational Arnoldi Algorithm
From MaRDI portal
Publication:5372625
DOI10.1137/16M1079178zbMath1376.65037MaRDI QIDQ5372625
Publication date: 27 October 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25)
Related Items (8)
Computation of generalized matrix functions with rational Krylov methods ⋮ Improved ParaDiag via low-rank updates and interpolation ⋮ Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods ⋮ The Block Rational Arnoldi Method ⋮ Iterative Stability Enforcement in Adaptive Antoulas–Anderson Algorithms for \({\boldsymbol{\mathcal{H}_2}}\) Model Reduction ⋮ Double-shift-invert Arnoldi method for computing the matrix exponential ⋮ Inexact rational Krylov method for evolution equations ⋮ Model order reduction of layered waveguides via rational Krylov fitting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational Krylov sequence methods for eigenvalue computation
- Rational Krylov for nonlinear eigenproblems, an iterative projection method.
- A rational Lanczos algorithm for model reduction
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey
- The university of Florida sparse matrix collection
- Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- $\mathcal{H}_2$ Model Reduction for Large-Scale Linear Dynamical Systems
- Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Templates for the Solution of Algebraic Eigenvalue Problems
- Low Rank Solution of Lyapunov Equations
- When modified Gram-Schmidt generates a well-conditioned set of vectors
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- NLEIGS: A Class of Fully Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Uniform Approximation of $\varphi$-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
- Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- The RKFIT Algorithm for Nonlinear Rational Approximation
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Backword error bounds for approximate Krylov subspaces
This page was built for publication: Parallelization of the Rational Arnoldi Algorithm
