Extended and rational Hessenberg methods for the evaluation of matrix functions
From MaRDI portal
Publication:1999718
DOI10.1007/s10543-018-0742-9OpenAlexW2904140675MaRDI QIDQ1999718
Z. Ramezani, Faezeh Toutounian
Publication date: 27 June 2019
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-018-0742-9
Krylov subspace methodsHessenberg processmatrix functionrational Krylov subspaceextended Krylov subspaceshifted linear system
Related Items
Unnamed Item, Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side, A Hessenberg-type algorithm for computing PageRank problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- A new look at CMRH and its relation to GMRES
- Extended Arnoldi methods for large low-rank Sylvester matrix equations
- Recursion relations for the extended Krylov subspace method
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- Rational Krylov sequence methods for eigenvalue computation
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- A generalization of the steepest descent method for matrix functions
- Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- An extended block Arnoldi algorithm for large-scale solutions of the continuous-time algebraic Riccati equation
- Restarted weighted full orthogonalization method for shifted linear systems
- Extended Krylov subspace for parameter dependent systems
- The extended Krylov subspace method and orthogonal Laurent polynomials
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- Restarted full orthogonalization method for shifted linear systems
- Heavy ball restarted CMRH methods for linear systems
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Iterative system solvers for the frequency analysis of linear mechanical systems
- A parallel implementation of the CMRH method for dense linear systems
- Iterative exponential filtering for large discrete ill-posed problems
- Numerical approximation of the product of the square root of a matrix with a vector
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- A new implementation of the CMRH method for solving dense linear systems
- A flexible CMRH algorithm for nonsymmetric linear systems
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- A Numerical Method for Calculating the Green's Function Arising from Electronic Structure Theory
- Network Analysis via Partial Spectral Factorization and Gauss Quadrature
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems
- A rational Arnoldi process with applications
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- Recent computational developments in Krylov subspace methods for linear systems
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Matrix Analysis
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Restarted GMRES for Shifted Linear Systems
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- The Solution of Parametrized Symmetric Linear Systems
- Restarted Gmres Augmented With Eigenvectors For Shifted Linear Systems * Supported by the National Natural Science Foundation of China and the Science and Technology Developing Foundation of University in Shanghai of China
- Iterative Krylov Methods for Large Linear Systems
- Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
- The Numerical Range is a $(1+\sqrt{2})$-Spectral Set
- An Extension of the COCR Method to Solving Shifted Linear Systems with Complex Symmetric Matrices
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Functions of Matrices
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
- Two polynomial methods of calculating functions of symmetric matrices
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- Lanczos-based exponential filtering for discrete ill-posed problems
