An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign (Q1725441): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2014/978629 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1979201748 / rank | |||
Normal rank |
Revision as of 20:22, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign |
scientific article |
Statements
An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign (English)
0 references
14 February 2019
0 references
Summary: Using the relation between a principal matrix square root and its inverse with the geometric mean, we present a fast algorithm for computing the geometric mean of two Hermitian positive definite matrices. The algorithm is stable and possesses a high convergence order. Some experiments are included to support the proposed computational algorithm.
0 references