An Improved Arc Algorithm for Detecting Definite Hermitian Pairs
Authors:
- Chun-Hua GuoCGChun-Hua Guo
- Nicholas J. HighamNHNicholas J. Higham
- Françoise TisseurFTFrançoise Tisseur
- 1 January 2010
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 31 (3) , 1131-1151
Abstract
A 25-year-old and somewhat neglected algorithm of Crawford and Moon attempts to determine whether a given Hermitian matrix pair $(A,B)$ is definite by exploring the range of the function $f(x) = x^*(A+iB)x / | x^*(A+iB)x |$, which is a subset of the unit circle. We revisit the algorithm and show that with suitable modifications and careful attention to implementation details it provides a reliable and efficient means of testing definiteness. A clearer derivation of the basic algorithm is given that emphasizes an arc expansion viewpoint and makes no assumptions about the definiteness of the pair. Convergence of the algorithm is proved for all $(A,B$), definite or not. It is shown that proper handling of three details of the algorithm is crucial to the efficiency and reliability: how the midpoint of an arc is computed, whether shrinkage of an arc is permitted, and how directions of negative curvature are computed. For the latter, several variants of Cholesky factorization with complete pivoting are explored and the benefits of pivoting demonstrated. The overall cost of our improved algorithm is typically just a few Cholesky factorizations. Three applications of the algorithm are described: testing the hyperbolicity of a Hermitian quadratic matrix polynomial, constructing conjugate gradient methods for sparse linear systems in saddle point form, and computing the Crawford number of the pair $(A,B)$ via a quasiconvex univariate minimization problem.
Keywords
This publication has 20 references indexed in Scilit:
- Definite Matrix Polynomials and their Linearization by Definite PencilsSIAM Journal on Matrix Analysis and Applications, 2009
- Detecting and Solving Hyperbolic Quadratic Eigenvalue ProblemsSIAM Journal on Matrix Analysis and Applications, 2009
- An Extension of MATLAB to Continuous Functions and OperatorsSIAM Journal on Scientific Computing, 2004
- Analysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized EigenproblemSIAM Journal on Matrix Analysis and Applications, 2001
- Computing Modified Newton Directions Using a Partial Cholesky FactorizationSIAM Journal on Scientific Computing, 1995
- Computing a nearest symmetric positive semidefinite matrixLinear Algebra and its Applications, 1988
- Algorithm 646ACM Transactions on Mathematical Software, 1986
- Finding a positive definite linear combination of two Hermitian matricesLinear Algebra and its Applications, 1983
- Some theorems on the real pencil and simultaneous diagonalization of two hermitian bilinear functionsProceedings of the American Mathematical Society, 1969
- A theorem on a mapping from a sphere to the circle and the simultaneous diagonalization of two hermitian matricesProceedings of the American Mathematical Society, 1969