ePubs
The open archive for STFC research publications
Home
About ePubs
Content Policies
News
Help
Privacy/Cookies
Suggest an Enhancement
Contact ePubs
Full Record Details
Persistent URL
http://purl.org/net/epubs/work/65304
Record Status
Checked
Record Id
65304
Title
Preconditioners based on strong subgraphs
Contributors
IS Duff (STFC Rutherford Appleton Lab.)
,
K Kaya ( CERFACS)
Abstract
This paper proposes an approach for obtaining block diagonal and block triangular preconditioners that can be used for solving a linear system Ax = b, where A is a large,nonsingular, real, n × n sparse matrix. The proposed approach uses Tarjan's algorithm for hierarchically decomposing a digraph into its strong subgraphs. To the best of our knowledge, this is the first work that uses this algorithm for preconditioning purposes. We describe the method, analyse its performance, and compare it with preconditioners from the literature such as ILUT and XPABLO and show that it is highly competitive with them in terms of both memory and iteration count. In addition, our approach shares with XPABLO the benefit of being able to exploit parallelism through a version that uses a block diagonal preconditioner.
Organisation
STFC
,
SCI-COMP
Keywords
strong subgraphs
,
strong components
,
preconditioners
,
sparse matrices
Funding Information
Related Research Object(s):
Licence Information:
Language
English (EN)
Type
Details
URI(s)
Local file(s)
Year
Report
RAL Preprints
RAL-P-2013-003. 2013.
RAL-P-2013-003.pdf
2013
Showing record 1 of 1
Recent Additions
Browse Organisations
Browse Journals/Series
Login to add & manage publications and access information for OA publishing
Username:
Password:
Useful Links
Chadwick & RAL Libraries
SHERPA FACT
SHERPA RoMEO
SHERPA JULIET
Journal Checker Tool
Google Scholar