Square-root method

A method for solving a system of linear algebraic equations with a non-degenerate Hermitian matrix . Among the direct methods it is most efficient when implemented on a computer.

The computing scheme of the method in the general case is based on a factorization of in the form

(1)

where is an upper-triangular matrix with real positive diagonal entries and is a diagonal matrix with diagonal entries or . From (1) one immediately obtains the recurrence relations for the calculation of the elements and of the matrices and :

(2)

After the factorization (1) is carried out, the solution of the original system is reduced to the successive solution of the two systems and with triangular matrices. In this aspect, the square-root method is the same as the inverse of most direct methods for solving a system (see Gauss method).

In the real case, when is a symmetric matrix, the scheme (2) corresponds to the factorization with a real matrix, and is somewhat simplified. A substantial simplification of the scheme (2) occurs when is a positive-definite matrix. In this case, and .

Variants of the square-root method are known for non-positive definite matrices, based on a factorization of the form . There are recurrence relations similar to (2) for the calculation of the entries of . However, this factorization is not efficient for computer implementation if is a real matrix, since in the calculation of the matrix an output in complex arithmetic may be involved.

The following are important characteristics of the square-root method.

1) Among the direct methods for solving systems based on factorization of a matrix, the square-root method has the highest speed (twice that of the Gauss method).

2) For the factorization of a matrix by the square-root method it suffices to provide compact information concerning the matrix, in the form of the entries of a triangular half of it. Furthermore, the scheme (2) allows one to store the matrix in the computer memory instead of the original information about . This, in essence, increases the orders of the systems that can be solved.

The computation scheme of the square-root method admits distributed processing of the initial matrix by sets of successive rows. Here the use of an external memory enables one to solve systems of high order.

3) The square-root method preserves the band structure of the matrix, that is, the matrix has the same shape as the upper half of the initial matrix.

4) The square-root method is especially efficient for systems with positive-definite matrices. In this case the entries of the matrix do not increase in the calculation process. This property ensures stability of the calculating process with regard to round-off errors. The upper bound on the accuracy of the calculated solution in this case is minimal in the class of direct methods. A still further decrease of the general level of errors is obtained by the possibility of calculating the scalar products of vectors in the scheme (2) with double precision.

The absence of increase in the elements in the calculating process provides a convenient computer implementation of the square-root method when working with fixed-point arithmetic.

5) The decomposition (1) can be used for the calculation of the determinant and inverse of a matrix.

References

[1]	V.V. Voevodin, "Numerical methods of algebra" , Moscow (1966) (In Russian)
[2]	N.S. Bakhvalov, "Numerical methods: analysis, algebra, ordinary differential equations" , MIR (1977) (Translated from Russian)
[3]	J.H. Wilkinson, "The algebraic eigenvalue problem" , Oxford Univ. Press (1969)
[4]	V.V. Voevodin, "Computational foundations of linear algebra" , Moscow (1977) (In Russian)