Patent ID: 8805912
Filing Date: 2014-08-12
Classification: G06F

Abstract:
1. An ordering generating method used when a sparse symmetric positive definite matrix is processed by a Cholesky decomposition or a modified Cholesky decomposition using a shared memory scalar parallel computer, the ordering generating method comprising: recursively performing, by the shared memory scalar parallel computer, a process of sectioning a set of component nodes configuring a graph expressing the sparse symmetric positive definite matrix into two sectioned areas and a sectional plane excluding a halving sectional plane until a width of a super node generated for coupling data of component nodes and holding the data in cache memory, is reached, and sequentially assigning numbers to component nodes in order from farther component nodes from the sectional plane on one sectioned area generated by sectioning the set of component nodes by one sectioning operation, assigning numbers to component nodes in order from farther component nodes from the sectional plane on the other sectioned area, and finally assigning numbers to component nodes belonging to the sectional plane by the shared memory scalar parallel computer.