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
DOI
10.5286/raltr.2009007
Persistent URL
http://purl.org/net/epubs/work/50208
Record Status
Checked
Record Id
50208
Title
A note on a simple constrained ordering for saddle-point systems
Contributors
JA Scott (STFC Rutherford Appleton Lab.)
Abstract
A well-known problem with sparse direct solvers is that, if numerical pivoting is required, the number of entries in the computed factors can be significantly greater than the number predicted on the basis of the sparsity pattern alone. In this note, we review a simple constrained ordering recently proposed by Bridson [1] for sadle-point systems. Bridson's approach allows the factorization to be computed without numerical pivoting but numerical experiments show that the computed factors are generally significantly denser that those obtained by prescaling the matrix and then using an unconstrianed ordering combined with threashold partial pivoting
Organisation
CSE
,
CSE-NAG
,
STFC
Keywords
large sparse symmetric linear systems
,
pivoting
,
scaling
,
direct solvers
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-2009-007. STFC, 2009.
sRAL2009007.pdf
2009
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