| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a method of generating 'ordering' capable of speeding up parallel processing when performing Cholesky or modified Cholesky decomposition of a sparse positive definite symmetrical matrix. <P>SOLUTION: When the Cholesky or modified Cholesky decomposition of the sparse positive definite symmetrical matrix is performed using common memory type parallel computers, discrete spaces of a problem that simultaneous linear equations, represented by the sparse matrix represent, present are each recursively divided into two divided regions and a division plane therebetween. Division is quit when the number of nodes constituting a division plane substantially reaches the width of a supernode. Each time a space is divided into two, nodes in divided regions are numbered in order from a node which is farther away from the division plane. Nodes in the division plane are numbered after the divided regions are numbered each time recursive division into two is performed. <P>COPYRIGHT: (C)2012,JPO&INPIT |
