Bibliographic Details
| Title: |
STRATEGIES FOR SCALING AND PIVOTING FOR SPARSE SYMMETRIC INDEFINITE PROBLEMS. |
| Source: |
SIAM Journal on Matrix Analysis & Applications. 2005, Vol. 27 Issue 2, p313-340. 28p. |
| Subjects: |
Matrices (Mathematics), Semiseparable matrices, Symmetric matrices, Factorization, Abstract algebra |
| Abstract: |
We consider ways of implementing preordering and scaling for symmetric systems and show the effect of using this technique with a multifrontal code for sparse symmetric indefinite systems. After having presented a new method for scaling, we propose a way of using an approximation to a symmetric weighted matching to predefine 1 × 1 and 2 × 2 pivots prior to the ordering and analysis phase. We also present new classes of orderings called “(relaxed) constrained orderings” that mix structural and numerical criteria. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
