An Algorithm for Computing Geometric Mean of Two Hermitian Positive Definite Matrices via Matrix Sign
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 t...
Saved in:
| Main Authors: | F. Soleymani, M. Sharifi, S. Shateyi, F. Khaksar Haghani |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/978629 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Approximating the Matrix Sign Function Using a Novel Iterative
Method
by: F. Soleymani, et al.
Published: (2014-01-01) -
On a Cubically Convergent Iterative Method for Matrix Sign
by: M. Sharifi, et al.
Published: (2015-01-01) -
Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval
by: T. Lotfi, et al.
Published: (2014-01-01) -
A New High-Order Stable Numerical Method for Matrix Inversion
by: F. Khaksar Haghani, et al.
Published: (2014-01-01) -
New Mono- and Biaccelerator Iterative Methods with Memory for Nonlinear Equations
by: T. Lotfi, et al.
Published: (2014-01-01)