Method for solving a large sparse triangular system of linear equations
US6694343B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 8, 2001 |
| Grant date | Feb 17, 2004 |
| Priority date | — |
| Expiry date | May 26, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/12
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-based method and system comprising three data structures: partially ordered data structure (or simply ordered data structure), contiguous list v, and vector p, is used for solving a large sparse triangular system of linear equations which utilizes only the non-zero components of a matrix to solve large sparse triangular linear equations and generates explicitly only the non-zero entries of the solution. A list of the row indices of the known non-zero values of x which require further processing is stored in the ordered data structure. Actual non-zero values of x are stored in the contiguous list v and the corresponding pointers to the location of these values are stored in the vector p. The computer-based method manipulates these three matrices to find a solution to an upper or lower sparse triangular system of linear equations. In addition, in the instance a matrix becomes dense (or increases in density) by the presence of many active rows, a partitioning method is described via which the dense matrix problem is solved.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.