Accession Number : ADA310613

Title :   A Way to Find the Most Redundant Equation in a Tridiagonal System,

Corporate Author : CALIFORNIA UNIV BERKELEY CENTER FOR PURE AND APPLIED MATHEMATICS

Personal Author(s) : Fernando, K. V. ; Parlett, Beresford N. ; Dhillon, Inderjit S.

PDF Url : ADA310613

Report Date : MAY 1995

Pagination or Media Count : 28

Abstract : Suppose that one knows a very accurate approximation delta to an eigenvalue lambda of a symmetric tridiagonal matrix T. A good way to approximate the eigenvector is to discard an appropriate equation, say the rth, from the system (T- delta I)x = 0 and then to solve the resulting underdetermined system in any of several stable ways. However the output can be completely inaccurate if r is chosen poorly and in the absence of a quick and reliable way to choose r this method has lain neglected for over 35 years. We show how double triangular factorization (down and up), which is closely related to 'twisted factorization', gives us directly the redundancy of each equation and so reveals the set of good choices for r. The results extend to band matrices and the applications go beyond eigenvector computation to determinant evaluation and solution of well conditioned systems.

Descriptors :   *MATRICES(MATHEMATICS), *EIGENVALUES, ALGORITHMS, COMPUTATIONS, EIGENVECTORS, ACCURACY, APPROXIMATION(MATHEMATICS), CONVERGENCE, VECTOR ANALYSIS, SYSTEMS ANALYSIS, REDUNDANCY, DETERMINANTS(MATHEMATICS), TRIANGULATION.

Subject Categories : Numerical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE