Rational Krylov sequence methods for eigenvalue computation
From MaRDI portal
Publication:760159
DOI10.1016/0024-3795(84)90221-0zbMath0554.65025OpenAlexW2052604766MaRDI QIDQ760159
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90221-0
Lanczos methodArnoldi methodmatrix pencilrational Krylov subspaceRayleigh quotient iterationspectral transformationHessenberg matriceslarge sparse eigenvalue problems
Related Items (only showing first 100 items - show all)
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ A global rational Arnoldi method for model reduction ⋮ An efficient two-level preconditioner for multi-frequency wave propagation problems ⋮ Flow structures around a high-speed train extracted using proper orthogonal decomposition and dynamic mode decomposition ⋮ Numerical solution of large nonsymmetric eigenvalue problems ⋮ A preconditioned block Arnoldi method for large scale Lyapunov and algebraic Riccati equations ⋮ An application of the Arnoldi method to a geophysical fluid dynamics problem ⋮ Krylov type subspace methods for matrix polynomials ⋮ An implicit filter for rational Krylov using core transformations ⋮ The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices ⋮ A Lanczos model-order reduction technique to efficiently simulate electromagnetic wave propagation in dispersive media ⋮ Problems of parallel solution of large systems of linear algebraic equations ⋮ A model reduction method in large scale dynamical systems using an extended-rational block Arnoldi method ⋮ An extended-rational Arnoldi method for large matrix exponential evaluations ⋮ Multi-parameter polynomial order reduction of linear finite element models ⋮ Zero-free regions for a rational function with applications ⋮ A non-intrusive acceleration technique for compressible flow solvers based on dynamic mode decomposition ⋮ Computational Methods for Linear Matrix Equations ⋮ A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems ⋮ A computational global tangential Krylov subspace method for model reduction of large-scale MIMO dynamical systems ⋮ Applications of the dynamic mode decomposition ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ The implicit application of a rational filter in the RKS method ⋮ Acceleration of contour integration techniques by rational Krylov subspace methods ⋮ A rational Lanczos algorithm for model reduction ⋮ A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching ⋮ Iterative methods for the computation of a few eigenvalues of a large symmetric matrix ⋮ A numerical solution of the constrained weighted energy problem ⋮ Applied Koopmanism ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ On rational Krylov and reduced basis methods for fractional diffusion ⋮ Stein implicit Runge-Kutta methods with high stage order for large-scale ordinary differential equations ⋮ The Short-Term Rational Lanczos Method and Applications ⋮ A rational Arnoldi process with applications ⋮ A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems ⋮ Adaptive rational Krylov subspaces for large-scale dynamical systems ⋮ An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems ⋮ A multi-grid framework for the extraction of large-scale vortices in large-eddy simulation ⋮ The RKFIT Algorithm for Nonlinear Rational Approximation ⋮ Rational Krylov and ADI iteration for infinite size quasi-Toeplitz matrix equations ⋮ The Block Rational Arnoldi Method ⋮ Recursion relations for the extended Krylov subspace method ⋮ Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector ⋮ Strategies for spectrum slicing based on restarted Lanczos methods ⋮ Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions ⋮ A projection method for generalized eigenvalue problems using numerical integration. ⋮ Rational approximation preconditioners for sparse linear systems. ⋮ Recovery of the inherent dynamics of noise-driven amplifier flows ⋮ A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. ⋮ Parallelization of the Rational Arnoldi Algorithm ⋮ Mode decomposition on surface-mounted cube ⋮ A unification of unitary similarity transforms to compressed representations ⋮ On investigating GMRES convergence using unitary matrices ⋮ Structured eigenvalue problems for rational Gauss quadrature ⋮ Spectral analysis of nonlinear flows ⋮ Irr: An algorithm for computing the smallest singular value of large scale matrices ⋮ Order Reduction Methods for Solving Large-Scale Differential Matrix Riccati Equations ⋮ Rational approximation to trigonometric operators ⋮ Arnoldi Algorithms with Structured Orthogonalization ⋮ An extended shift-invert residual Arnoldi method ⋮ Computational hydrodynamic stability and flow control based on spectral analysis of linear operators ⋮ Rational \(QR\)-iteration without inversion ⋮ Double-shift-invert Arnoldi method for computing the matrix exponential ⋮ Balanced truncation model order reduction in limited time intervals for large systems ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem ⋮ Resolvent Krylov subspace approximation to operator functions ⋮ Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces ⋮ An adaptive-order rational Arnoldi method for model-order reductions of linear time-invariant systems ⋮ Description of complex flow behaviour using global dynamic modes ⋮ Dynamic mode decomposition of numerical and experimental data ⋮ Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems ⋮ Saving flops in LU based shift-and-invert strategy ⋮ Frequency-Limited Balanced Truncation with Low-Rank Approximations ⋮ Compressing Large-Scale Wave Propagation Models via Phase-Preconditioned Rational Krylov Subspaces ⋮ A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers ⋮ On preconditioned eigensolvers and invert-Lanczos processes ⋮ Functions of rational Krylov space matrices and their decay properties ⋮ Algorithms for the Rational Approximation of Matrix-Valued Functions ⋮ A conjugate-gradient-type rational Krylov subspace method for ill-posed problems ⋮ Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations ⋮ Biorthogonal rational Krylov subspace methods ⋮ Iterative preconditioned methods in Krylov spaces: trends of the 21st century ⋮ Optimal control of a separated boundary-layer flow over a bump ⋮ The extended Krylov subspace method and orthogonal Laurent polynomials ⋮ Generation of orthogonal rational functions by procedures for structured matrices ⋮ A Rational QZ Method ⋮ Analysis of the Rational Krylov Subspace Projection Method for Large-Scale Algebraic Riccati Equations ⋮ Using implicitly filtered RKS for generalised eigenvalue problems ⋮ Restrictions on implicit filtering techniques for orthogonal projection methods ⋮ A Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue Problems ⋮ Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ Compact Rational Krylov Methods for Nonlinear Eigenvalue Problems ⋮ Generalized Rational Krylov Decompositions with an Application to Rational Approximation ⋮ Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs ⋮ Automatic Smoothness Detection of the Resolvent Krylov Subspace Method for the Approximation of $C_0$-Semigroups ⋮ Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure ⋮ On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Eigenvalues of perturbed Hermitian matrices
- Lanczos versus subspace iteration for solution of eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Use of the Singular Value Decomposition with the Manteuffel Algorithm for Nonsymmetric Linear Systems
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems
- The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
- Estimates for Some Computational Techniques in Linear Algebra
- An Algorithm for Generalized Matrix Eigenvalue Problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Rational Krylov sequence methods for eigenvalue computation