arXiv Analytics

Sign in

arXiv:1511.07694 [math.NA]AbstractReferencesReviewsResources

Geometrical inverse preconditioning for symmetric positive definite matrices

Jean-Paul Chehab, Marcos Raydan

Published 2015-11-24Version 1

We focus on inverse preconditioners based on minimizing $F(X) = 1-\cos(XA,I)$, where $XA$ is the preconditioned matrix and $A$ is symmetric and positive definite. We present and analyze gradient-type methods to minimize $F(X)$ on a suitable compact set. For that we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of $F(X)$ on the feasible set. Preliminary and encouraging numerical results are also presented in which dense and sparse approximations are included.

Related articles: Most relevant | Search more
arXiv:2410.22014 [math.NA] (Published 2024-10-29)
A preconditioning technique of Gauss--Legendre quadrature for the logarithm of symmetric positive definite matrices
arXiv:1312.1553 [math.NA] (Published 2013-12-05)
Efficiently preconditioned Inexact Newton methods for large symmetric eigenvalue problems
arXiv:1809.03736 [math.NA] (Published 2018-09-11)
Determinants of Interval Matrices