Transactions of the Japan Society for Industrial and Applied Mathematics
Online ISSN : 2424-0982
ISSN-L : 0917-2246
An Algorithm for Computing the Condition Number of a Symmetric Positive Definite Sparse Matrix
Hidehiko Hasegawa
Author information
JOURNAL FREE ACCESS

1991 Volume 1 Issue 2 Pages 169-176

Details
Abstract
In this paper, we study the method of roughly computing the condition number of a symmetric positive definite sparse matrix. The estimation of the condition number of a matrix relative to inversion is important for bounding the errors in computer solutions of a linear system of equations. We give an easy and fast algorithm based on power method and inverse iteration method using Preconditioned Conjugate Gradient method. This algorithm is applicable for large scale problems, and the computing time of the condition number is less than five times the computing time of solving given equations Ax=b using PCG method.
Content from these authors
© 1991 The Japan Society for Industrial and Applied Mathematics
Previous article Next article
feedback
Top