An algorithm for computing geometric mean of two hermitian positive definite matrices via matrix sign

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

References Powered by Scopus

Functional calculus for sesquilinear forms and the purification map

271Citations
N/AReaders
Get full text

A family of chebyshev-halley type methods in banach spaces

233Citations
N/AReaders
Get full text

The matrix sign function and computations in systems

215Citations
N/AReaders
Get full text

Cited by Powered by Scopus

An Integrated Approach for Developing an Urban Livability Composite Index—A Cities’ Ranking Road Map to Achieve Urban Sustainability

12Citations
N/AReaders
Get full text

A fast iterative method to find the matrix geometric mean of two HPD matrices

4Citations
N/AReaders
Get full text

A globally convergent variant of mid-point method for finding the matrix sign

3Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Soleymani, F., Sharifi, M., Shateyi, S., & Khaksar Haghani, F. (2014). An algorithm for computing geometric mean of two hermitian positive definite matrices via matrix sign. Abstract and Applied Analysis, 2014. https://doi.org/10.1155/2014/978629

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 1

50%

Researcher 1

50%

Readers' Discipline

Tooltip

Mathematics 3

60%

Engineering 1

20%

Chemistry 1

20%

Save time finding and organizing research with Mendeley

Sign up for free