An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair
Linear Algebra and its Applications · 2026-10 · 746 · 111-139
DOI: 10.1016/j.laa.2026.05.020 ↗Kurz gefasst
Fachartikel in der Zeitschrift Linear Algebra and its Applications, 2026-10. Verfasst von Marija Miloloža Pandur. Die Arbeit nennt 46 Literaturangaben.
Abstract (Originalsprache)
A Hermitian matrix pair $(A,B)$ is called definite if some real linear combination of the matrices $A$ and $B$ is a positive definite matrix. Detection of the definiteness is not straightforward. We propose a basic subspace algorithm for detecting a large definite matrix pair $(A,B)$ with indefinite $B$. The proposed subspace algorithm is based on iterative testing of small projected Hermitian matrix pairs formed by using subspaces of small dimensions. Furthermore, we propose a specialized algorithm with parameter $m$, and its preconditioned variant. In the specialized algorithm with $m=3$ we choose the subspaces like in the indefinite locally optimal block preconditioned conjugate gradient (LOBPCG) method. Numerical experiments demonstrate the efficiency of our specialized algorithm, applied on medium-sized pairs, as well as, on large and banded pairs. Our algorithm very quickly detects (in)definiteness; much faster than some other algorithms.
Zitieren
APA
Pandur, M. M. (2026). An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair. Linear Algebra and its Applications, 746, 111-139. https://doi.org/10.1016/j.laa.2026.05.020
Vancouver
Pandur MM. An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair. Linear Algebra and its Applications. 2026;746:111-139. doi:10.1016/j.laa.2026.05.020
BibTeX
@article{Pandur2026,
author = {Pandur, Marija Miloloža},
title = {An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair},
journal = {Linear Algebra and its Applications},
year = {2026},
volume = {746},
pages = {111--139},
doi = {10.1016/j.laa.2026.05.020}
}
EUVIMED