Numerical techniques for computing the inertia of products of matrices of rational numbers

Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively small entries. We report on a numerical algorithm which computes the inertia of such a matrix in the nonsingular case and effectively exploits the product structure. We offer a symbolic/numeric hybrid algorithm for the singular case. We compare these methods with previous purely symbolic ones. By "purely symbolic" we refer to methods which restrict themselves to exact arithmetic and can assure that errors of approximation do not affect the results. Using an application in the study of Lie Groups as a plentiful source of examples of problems of this nature we explore the relative speeds of the numeric and hybrid methods as well as the range of applicability without error.

[1]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[2]  Thomas Thierauf,et al.  The complexity of the inertia and some closure properties of GapL , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[3]  Thomas Thierauf,et al.  The Complexity of the Inertia , 2002, FSTTCS.

[4]  A. Laub,et al.  Computing the singular value decompostion of a product of two matrices , 1986 .

[5]  Steven Fortune,et al.  Exact computations of the inertia symmetric integer matrices , 2000, STOC '00.

[6]  Gilles Villard,et al.  Certification of the QR factor R and of lattice basis reducedness , 2007, ISSAC '07.

[7]  Jean-Guillaume Dumas,et al.  Integer Smith form via the valence: experience with large sparse matrices from homology , 2000, ISSAC.

[8]  Daniel Kressner,et al.  The periodic QR algorithm is a disguised QR algorithm , 2006 .

[9]  Gene H. Golub,et al.  Matrix computations , 1983 .

[10]  Doktor der Naturwissenschaften.  Numerical Methods and Software for General and Structured Eigenvalue Problems , 2004 .

[11]  David E. Stewart,et al.  A NEW ALGORITHM FOR THE SVD OF A LONG PRODUCT OF MATRICES AND THE STABILITY OF PRODUCTS , 1997 .

[12]  Adam W. Bojanczyk,et al.  Periodic Schur decomposition: algorithms and applications , 1992, Optics & Photonics.

[13]  David E. Stewart,et al.  Exponential splittings of products of matrices and accurately computing singular values of long products , 2000 .

[14]  David S. Watkins,et al.  Product Eigenvalue Problems , 2005, SIAM Rev..

[15]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[16]  Dan Barbasch.  The unitary spherical spectrum for split classical groups , 2010, Journal of the Institute of Mathematics of Jussieu.

[17]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[18]  B. David Saunders,et al.  Signature of symmetric rational matrices and the unitary dual of lie groups , 2005, ISSAC '05.

[19]  J. Humphreys.  Reflection groups and coxeter groups , 1990 .

[20]  G. Stewart.  On graded QR decompositions of products of matrices , 1994 .

[21]  Erich Kaltofen,et al.  On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.

[22]  Thomas Thierauf,et al.  The Complexity of the Minimal Polynomial , 2001, MFCS.

[23]  Jack Dongarra,et al.  LAPACK's user's guide , 1992 .

[24]  R. Carter.  REFLECTION GROUPS AND COXETER GROUPS (Cambridge Studies in Advanced Mathematics 29) , 1991 .

[25]  B. D. Saunders,et al.  Efficient matrix preconditioners for black box linear algebra , 2002 .

[26]  Charles Van Loan,et al.  A General Matrix Eigenvalue Algorithm , 1975 .