| |
| | Method for solving a large sparse triangular system of linear equations - Patent 6694343 (Site not responding. Last check: ) |
 | | Thus, the system of linear equations, in matrix form, given by 100 can be rewritten, as in 102, in terms of the matrix or array representative of x, wherein the matrix given by 112 is the inverse of A, denoted A.sup.-1. |
 | | Therefore, there is a need for a system which overcomes the shortcomings of prior methods (that perform more than necessary computations) and utilizes only the non-zero components of a matrix to solve large sparse triangular linear equations and generate explicitly only the non-zero entries of the solution. |
 | | A system of linear equations Ax=b has to be solved where A is a very large sparse triangular matrix of order n.times.n, b is a sparse n-vector, and x is the n-vector that has to be calculated. |
| www.freepatentsonline.com /6694343.html (3596 words) |
|