The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 17, 2004

Filed:

Feb. 08, 2001
Applicant:
Inventors:

John Joseph Forrest, Peekskill, NY (US);

Nimrod Megiddo, Palo Alto, CA (US);

John Anthony Tomlin, Sunnyvale, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 7/32 ; G06F 7/38 ;
U.S. Cl.
CPC ...
G06F 7/32 ; G06F 7/38 ;
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.


Find Patent Forward Citations

Loading…