NUMERICAL METHODS FOR INVERTING POSITIVE DEFINITE MATRICES.
RAND CORP SANTA MONICA CALIF
Pagination or Media Count:
An explanation of four methods for inverting positive definite matrices the Gauss-Jordan and bordering methods, the square root procedure, and the Choleski method. The theory of positive definite matrices is summarized, and main applications of the matrices are discussed. A comparison of the accuracy of the inversion techniques is also made. Major conclusions are that matrices in many applications can be shown to be positive definite or partitionable into definite submatrices and, hence, can be inverted by means of special algorithms and that Choleskis method is faster and seems at least as accurate as the more common methods for solving simultaneous equations. Author
- Theoretical Mathematics