Krylov Iterative Methods for the Geometric Mean of Two Matrices Times a Vector

03/04/2019
by   Jacopo Castellini, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2020

Efficient construction of an HSS preconditioner for symmetric positive definite ℋ^2 matrices

In an iterative approach for solving linear systems with ill-conditioned...
research
05/26/2015

Approximate Joint Diagonalization and Geometric Mean of Symmetric Positive Definite Matrices

We explore the connection between two problems that have arisen independ...
research
10/08/2011

Positive definite matrices and the S-divergence

Positive definite matrices abound in a dazzling variety of applications....
research
07/26/2023

Stochastic pth root approximation of a stochastic matrix: A Riemannian optimization approach

We propose two approaches, based on Riemannian optimization, for computi...
research
12/25/2021

On computing HITS ExpertRank via lumping the hub matrix

The dangling nodes is the nodes with no out-links in the web graph. It s...
research
05/09/2022

Towards a median signal detector through the total Bregman divergence and its robust analysis

A novel family of geometric signal detectors are proposed through median...
research
01/25/2022

Computing the logarithmic capacity of compact sets having (infinitely) many components with the Charge Simulation Method

We apply the Charge Simulation Method (CSM) in order to compute the loga...

Please sign up or login with your details

Forgot password? Click here to reset