International Journal for Numerical Methods in Engineering · 2003 · 13 citations · 6 references
ComputingComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingMatrix ComputationMatrix SystemsNumerical AlgorithmsNumerical AnalysisNumerical Linear AlgebraComputational Matrix TheoryCongruence TransformationsSparse Matrix Computation
Abstract We show how to simultaneously reduce a pair of symmetric matrices to tridiagonal form by congruence transformations. No assumptions are made on the non‐singularity or definiteness of the two matrices. The reduction follows a strategy similar to the one used for the tridiagonalization of a single symmetric matrix via Householder reflectors. Two algorithms are proposed, one using non‐orthogonal rank‐one modifications of the identity matrix and the other, more costly but more stable, using a combination of Householder reflectors and non‐orthogonal rank‐one modifications of the identity matrix with minimal condition numbers. Each of these tridiagonalization processes requires O ( n 3 ) arithmetic operations and respects the symmetry of the problem. We illustrate and compare the two algorithms with some numerical experiments. Copyright © 2003 John Wiley & Sons, Ltd.
6
Accuracy and stability of numerical algorithms
Choice Reviews Online · 1996 · 2.1K citations
The Quadratic Eigenvalue Problem
Françoise Tisseur, Karl Meerbergen · SIAM Review · 2001 · 1.4K citations
Natural Sciences, Computer Science, Computational Physics +11