Krylov iterative methods for the geometric mean of two matrices times a vector

DOI10.1007/S11075-016-0161-4zbMATH Open1358.65025arXiv1903.01189OpenAlexW2415824460MaRDI QIDQ509648FDOQ509648

Authors: Jacopo Castellini 

Publication date: 17 February 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: In this work, we are presenting an efficient way to compute the geometric mean of two positive definite matrices times a vector. For this purpose, we are inspecting the application of methods based on Krylov spaces to compute the square root of a matrix. These methods, using only matrix-vector products, are capable of producing a good approximation of the result with a small computational cost.

Full work available at URL: https://arxiv.org/abs/1903.01189

Recommendations

• Numerical computation of the geometric matrix mean
• Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
• The geometric mean of two matrices from a computational viewpoint.
• A fast iterative method to find the matrix geometric mean of two HPD matrices
• An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign

zbMATH Keywords

sparse matricesiterative methodsnumerical examplepositive definite matricesgeometric meanKrylov methodsrational Arnoldi methodKrylov spaces

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Operator means involving linear operators, shorted linear operators, etc. (47A64)

Cites Work

• Functions of Matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical range and functional calculus in Hilbert space
• Positive definite matrices
• On the averaging of symmetric positive-definite tensors
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Title not available (Why is that?)
• Ladder networks, fixpoints, and the geometric mean
• Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
• 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
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logarithmic potential theory with applications to approximation theory
• Shift-invariant approximations of structured shift-variant blurring matrices
• Discrete interpolation norms with applications
• Discrete fractional Sobolev norms for domain decomposition preconditioning
• The geometric mean of two matrices from a computational viewpoint.

Cited In (2)

• Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
• A fast iterative method to find the matrix geometric mean of two HPD matrices

Uses Software

• mftoolbox

This page was built for publication: Krylov iterative methods for the geometric mean of two matrices times a vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q509648)