Krylov iterative methods for the geometric mean of two matrices times a vector
From MaRDI portal
Publication:509648
DOI10.1007/s11075-016-0161-4zbMath1358.65025arXiv1903.01189OpenAlexW2415824460MaRDI QIDQ509648
Publication date: 17 February 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01189
numerical examplepositive definite matricesiterative methodssparse matricesgeometric meanKrylov methodsrational Arnoldi methodKrylov spaces
Computational methods for sparse matrices (65F50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Iterative numerical methods for linear systems (65F10) Operator means involving linear operators, shorted linear operators, etc. (47A64)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ladder networks, fixpoints, and the geometric mean
- Numerical range and functional calculus in Hilbert space
- Shift-invariant approximations of structured shift-variant blurring matrices
- Positive definite matrices
- On the averaging of symmetric positive-definite tensors
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Error Estimates and Evaluation of Matrix Functions via the Faber Transform
- A new investigation of the extended Krylov subspace method for matrix function evaluations
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Discrete Interpolation Norms with Applications
- Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Discrete fractional Sobolev norms for domain decomposition preconditioning
- Logarithmic Potential Theory with Applications to Approximation Theory
- Functions of Matrices
- The geometric mean of two matrices from a computational viewpoint
