The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/29584
Record Status Checked
Record Id 29584
Title Two-stage ordering for unsymmetric parallel row-by-row frontal solvers
Abstract The row-by-row frontal method may be used to solve general large sparse linear systems of equations. By partitioning the matrix into (nearly) independent blocks and applying the frontal method to each block, a coarse-grained parallel frontal algorithm is obtained. The success of this approach depends on preordering the matrix. This can be done in two stages: (1) order the matrix to bordered block diagonal form (2) order the rows within each block to minimise the size of the frontal matrix. A number of recent papers have considered stage (1). In this paper, an algorithm is proposed for stage (2). For a range of practical examples from chemical process engineering it is shown that the proposed algorithm substantially reduces the block frontal matrix size and, for suffciently large problems, this can lead to signifcant reductions in the factorization times when the row-by-row frontal method is implemented in parallel.
Organisation CCLRC
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2000-030. 2000. raltr-2000030.pdf 2000