Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
From MaRDI portal
Recommendations
Cited in
(74)- Parallelization of the rational Arnoldi algorithm
- The Block Rational Arnoldi Method
- A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems
- Compact Rational Krylov for Parametrized Systems with Application to BEM Frequency Sweeping
- Adaptive Krylov Methods for Low-Rank Exponential Integrators
- Adaptive Rational Krylov Methods for Exponential Runge–Kutta Integrators
- Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces
- Reliable Krylov-based algorithms for matrix null space and rank
- Model order reduction of layered waveguides via rational Krylov fitting
- Numerical simulation of three dimensional pyramid quantum dot
- Reducing huge gyroscopic eigenproblems by automated multi-level substructuring
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- A survey on variational characterizations for nonlinear eigenvalue problems
- Numerical Linear Algebra for Model Reduction in Control and Simulation
- Optimal quotients for solving large eigenvalue problems
- Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
- A CJ-FEAST GSVDsolver for computing a partial gsvd of a large matrix pair with the generalized singular values in a given interval
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems
- Extended and rational Hessenberg methods for the evaluation of matrix functions
- A compact rational Krylov method for large‐scale rational eigenvalue problems
- A contour-integral based method for counting the eigenvalues inside a region
- A short-term rational Krylov method for linear inverse problems
- Rational Krylov for eigenvalue computation and model order reduction
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- A preconditioning technique for Krylov subspace methods in RKHSs
- Saving flops in LU based shift-and-invert strategy
- Adaptive rational interpolation: Arnoldi and Lanczos-like equations
- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Alternative correction equations in the Jacobi-Davidson method
- A rational QZ method
- On convergence of iterative projection methods for symmetric eigenvalue problems
- A new inexact inverse subspace iteration for generalized eigenvalue problems
- Inexact rational Krylov method for evolution equations
- Convergence of the iterative rational Krylov algorithm
- Gauss-Seidel-type methods for energy states of a multi-component Bose-Einstein condensate
- Rational Krylov methods for functions of matrices with applications to fractional partial differential equations
- A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems
- Low-rank updates and divide-and-conquer methods for quadratic matrix equations
- Bifurcation analysis of a two-component Bose-Einstein condensate
- The nonlinear eigenvalue problem
- A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping
- Biorthogonal rational Krylov subspace methods
- A reduced-\textsc{\textsc{irka}} method for large-scale \(\mathcal{H}_2\)-optimal model order reduction
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- The extended Krylov subspace method and orthogonal Laurent polynomials
- Computing approximate (block) rational Krylov subspaces without explicit inversion with extensions to symmetric matrices
- Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems
- Generalized Rational Krylov Decompositions with an Application to Rational Approximation
- A rational Arnoldi process with applications.
- An implicit filter for rational Krylov using core transformations
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
- The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
- A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
- Feast eigensolver for non-Hermitian problems
- On the conditioning for heavily damped quadratic eigenvalue problem solved by linearizations
- A class of Petrov-Galerkin Krylov methods for algebraic Riccati equations
- Computing interior eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation
- scientific article; zbMATH DE number 663838 (Why is no real title available?)
- An adaptive-order rational Arnoldi method for model-order reductions of linear time-invariant systems
- On convergence of Jacobi–Davidson method for solving Hermitian generalized eigenvalue problems
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Inexact inverse subspace iteration for generalized eigenvalue problems
- Computing eigenpairs of Hermitian matrices in augmented Krylov subspace produced by Rayleigh quotient iterations
- Krylov subspace methods for estimating operator-vector multiplications in Hilbert spaces
- The RKFIT algorithm for nonlinear rational approximation
- Critical delays and polynomial eigenvalue problems
- On a family of low-rank algorithms for large-scale algebraic Riccati equations
- Rational Krylov for nonlinear eigenproblems, an iterative projection method.
This page was built for publication: Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389308)
