New matrix function approximations and quadrature rules based on the Arnoldi process
From MaRDI portal
Publication:2656093
DOI10.1016/j.cam.2021.113442zbMath1464.65043OpenAlexW3126683224WikidataQ114202011 ScholiaQ114202011MaRDI QIDQ2656093
Thomas Mach, Nasim Eshghi, Lothar Reichel
Publication date: 10 March 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113442
Numerical quadrature and cubature formulas (65D32) Matrix exponential and similar functions of matrices (15A16) Numerical computation of matrix exponential and similar matrix functions (65F60)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Any finite convergence curve is possible in the initial iterations of restarted FOM
- Estimates for the bilinear form \(x^T A^{-1} y\) with applications to linear algebra problems
- Efficient numerical methods for non-local operators. \(\mathcal H^2\)-matrix compression, algorithms and analysis.
- Simplified anti-Gauss quadrature rules with applications in linear algebra
- An analysis of the pole placement problem I: The single-input case
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- Enhanced matrix function approximation
- On the selection of poles in the single-input pole placement problem
- Any admissible harmonic Ritz value set is possible for GMRES
- Analysis of directed networks via the matrix exponential
- Estimations of the trace of powers of positive self-adjoint operators by extrapolation of the moments
- Moments of a linear operator, with applications to the trace of the inverse of matrices and the solution of equations
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- Network Properties Revealed through Matrix Functions
- On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$
- Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
- Projection and deflation method for partial pole assignment in linear state feedback
- 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
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
- Quadrature Rules Based on the Arnoldi Process
- The Radau--Lanczos Method for Matrix Functions
- Block Gauss and Anti-Gauss Quadrature with Application to Networks
- Functions of Matrices
- Two polynomial methods of calculating functions of symmetric matrices
- Lanczos-based exponential filtering for discrete ill-posed problems
This page was built for publication: New matrix function approximations and quadrature rules based on the Arnoldi process
