Issues in the Design of Scalable Out-of-Core Dense Symmetric Indefinite Factorization Algorithms
In the factorization of indefinite symmetric linear systems, symmetric pivoting is required to maintain numerical stability, while attaining a reduced floating point operation count. However, symmetric pivoting presents many challenges in the design of efficient algorithms, and especially in the context of a parallel out-of-core solver for dense systems. Here, the search for a candidate pivot in order to eliminate a single column potentially requires a large number of messages and accesses of...[Show more]
|Collections||ANU Research Publications|
|Source:||Computational Science - ICCS 2003|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.