Back to results
US 8,805,912 B2Granted
Ordering generating method and storage medium, and shared memory scalar parallel computer
AssigneeFujitsu Limited
InventorMakoto Nakanishi
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
AssigneeFujitsu Limited
InventorMakoto Nakanishi
Estimating the term…
When a Cholesky decomposition or a modified Cholesky decomposition is performed on a sparse symmetric positive definite matrix using a shared memory parallel computer, the discrete space in a problem presented by the linear simultaneous equations expressed by the sparse matrix is recursively sectioned into two sectioned areas and a sectional plane between the areas. The sectioning operation is stopped when the number of nodes configuring the sectional plane reaches the width of a super node. Each time the recursively halving process is performed, a number is sequentially assigned to the node in the sectioned area in order from a farther node from the sectional plane. The node in the sectional plane is numbered after assigning a number to the sectioned area each time the recursively halving process is performed.
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:
A computer-readable, non-transitory medium storing a program for causing a shared memory scalar parallel computer to execute a method used when a sparse symmetric positive definite matrix is processed by a Cholesky decomposition or a modified Cholesky decomposition, the ordering generating method comprising:
A shared memory scalar parallel computer which executes an ordering generating method used when a sparse symmetric positive definite matrix is processed by a Cholesky decomposition or a modified Cholesky decomposition, the shared memory scalar parallel computer comprising:
Dependencies are inferred from the claim text.