Extended and rational Hessenberg methods for the evaluation of matrix functions
From MaRDI portal
Publication:1999718
Cites work
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- A flexible CMRH algorithm for nonsymmetric linear systems
- A generalization of the steepest descent method for matrix functions
- A new implementation of the CMRH method for solving dense linear systems
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- A new look at CMRH and its relation to GMRES
- A numerical method for calculating the Green's function arising from electronic structure theory
- A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
- A parallel implementation of the CMRH method for dense linear systems
- A rational Arnoldi process with applications.
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- An extended block Arnoldi algorithm for large-scale solutions of the continuous-time algebraic Riccati equation
- An Extension of the COCR Method to Solving Shifted Linear Systems with Complex Symmetric Matrices
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- Block Gauss and anti-Gauss quadrature with application to networks
- Calculation of functions of unsymmetric matrices using Arnoldi's method
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals
- Extended Arnoldi methods for large low-rank Sylvester matrix equations
- Extended Krylov subspace for parameter dependent systems
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Flexible and multi-shift induced dimension reduction algorithms for solving large sparse linear systems.
- Functions of Matrices
- Heavy ball restarted CMRH methods for linear systems
- scientific article; zbMATH DE number 592768 (Why is no real title available?)
- scientific article; zbMATH DE number 663838 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Iterative exponential filtering for large discrete ill-posed problems
- Iterative Krylov Methods for Large Linear Systems
- Iterative system solvers for the frequency analysis of linear mechanical systems
- Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
- Lanczos-based exponential filtering for discrete ill-posed problems
- Matrix Analysis
- Matrix Krylov subspace methods for linear systems with multiple right-hand sides
- Network analysis via partial spectral factorization and Gauss quadrature
- Numerical approximation of the product of the square root of a matrix with a vector
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Rational Krylov sequence methods for eigenvalue computation
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Recent computational developments in Krylov subspace methods for linear systems
- Recursion relations for the extended Krylov subspace method
- Restarted full orthogonalization method for shifted 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
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
- Restarted GMRES for Shifted Linear Systems
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Restarted weighted full orthogonalization method for shifted linear systems
- Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- The extended Krylov subspace method and orthogonal Laurent polynomials
- The global Hessenberg and CMRH methods for linear systems with multiple right-hand sides
- The numerical range is a \((1+\sqrt{2})\)-spectral set
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
- The Solution of Parametrized Symmetric Linear Systems
- Two polynomial methods of calculating functions of symmetric matrices
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
Cited in
(5)- Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side
- A Hessenberg-type algorithm for computing PageRank problems
- Hessenberg Matrix Properties and Ritz Vectors in the Finite-Precision Lanczos Tridiagonalization Process
- scientific article; zbMATH DE number 5666384 (Why is no real title available?)
- Global and extended global Hessenberg processes for solving Sylvester tensor equation with low-rank right-hand side
This page was built for publication: Extended and rational Hessenberg methods for the evaluation of matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999718)
