Preordering saddle-point systems for sparse LDLT factorization without pivoting

Sangye Lungten, Wil H.A. Schilders, Jennifer A. Scott

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Uittreksel

This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equations in saddle-point form using a fill-reducing ordering technique with a direct solver. Row and column permutations partition the saddle-point matrix into a block structure constituting a priori pivots of order 1 and 2. The partitioned matrix is compressed by treating each nonzero block as a single entry, and a fill-reducing ordering is applied to the corresponding compressed graph. It is shown that, provided the saddle-point matrix satisfies certain criteria, a block LDLT factorization can be computed using the resulting pivot sequence without modification. Numerical results for a range of problems from practical applications using a modern sparse direct solver are presented to illustrate the effectiveness of the approach.

TaalEngels
Artikelnummere2173
Aantal pagina's13
TijdschriftNumerical Linear Algebra with Applications
Volume25
Nummer van het tijdschrift5
DOI's
StatusGepubliceerd - 1 okt 2018

Vingerafdruk

Saddle Point Systems
Pivoting
Saddlepoint
Factorization
Pivot
Partitioned Matrix
Indefinite Systems
Block Structure
System of Linear Equations
Linear equations
Permutation
Partition
Numerical Results
Graph in graph theory
Range of data

Trefwoorden

    Citeer dit

    @article{669107f8a01a4ef19e03f644fdcc9f65,
    title = "Preordering saddle-point systems for sparse LDLT factorization without pivoting",
    abstract = "This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equations in saddle-point form using a fill-reducing ordering technique with a direct solver. Row and column permutations partition the saddle-point matrix into a block structure constituting a priori pivots of order 1 and 2. The partitioned matrix is compressed by treating each nonzero block as a single entry, and a fill-reducing ordering is applied to the corresponding compressed graph. It is shown that, provided the saddle-point matrix satisfies certain criteria, a block LDLT factorization can be computed using the resulting pivot sequence without modification. Numerical results for a range of problems from practical applications using a modern sparse direct solver are presented to illustrate the effectiveness of the approach.",
    keywords = "Fill-reducing ordering, LDLfactorization, Saddle-point systems, Sparse symmetric indefinite matrices",
    author = "Sangye Lungten and Schilders, {Wil H.A.} and Scott, {Jennifer A.}",
    year = "2018",
    month = "10",
    day = "1",
    doi = "10.1002/nla.2173",
    language = "English",
    volume = "25",
    journal = "Numerical Linear Algebra with Applications",
    issn = "1070-5325",
    publisher = "Wiley",
    number = "5",

    }

    Preordering saddle-point systems for sparse LDLT factorization without pivoting. / Lungten, Sangye; Schilders, Wil H.A.; Scott, Jennifer A.

    In: Numerical Linear Algebra with Applications, Vol. 25, Nr. 5, e2173, 01.10.2018.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    TY - JOUR

    T1 - Preordering saddle-point systems for sparse LDLT factorization without pivoting

    AU - Lungten,Sangye

    AU - Schilders,Wil H.A.

    AU - Scott,Jennifer A.

    PY - 2018/10/1

    Y1 - 2018/10/1

    N2 - This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equations in saddle-point form using a fill-reducing ordering technique with a direct solver. Row and column permutations partition the saddle-point matrix into a block structure constituting a priori pivots of order 1 and 2. The partitioned matrix is compressed by treating each nonzero block as a single entry, and a fill-reducing ordering is applied to the corresponding compressed graph. It is shown that, provided the saddle-point matrix satisfies certain criteria, a block LDLT factorization can be computed using the resulting pivot sequence without modification. Numerical results for a range of problems from practical applications using a modern sparse direct solver are presented to illustrate the effectiveness of the approach.

    AB - This paper focuses on efficiently solving large sparse symmetric indefinite systems of linear equations in saddle-point form using a fill-reducing ordering technique with a direct solver. Row and column permutations partition the saddle-point matrix into a block structure constituting a priori pivots of order 1 and 2. The partitioned matrix is compressed by treating each nonzero block as a single entry, and a fill-reducing ordering is applied to the corresponding compressed graph. It is shown that, provided the saddle-point matrix satisfies certain criteria, a block LDLT factorization can be computed using the resulting pivot sequence without modification. Numerical results for a range of problems from practical applications using a modern sparse direct solver are presented to illustrate the effectiveness of the approach.

    KW - Fill-reducing ordering

    KW - LDLfactorization

    KW - Saddle-point systems

    KW - Sparse symmetric indefinite matrices

    UR - http://www.scopus.com/inward/record.url?scp=85044428405&partnerID=8YFLogxK

    U2 - 10.1002/nla.2173

    DO - 10.1002/nla.2173

    M3 - Article

    VL - 25

    JO - Numerical Linear Algebra with Applications

    T2 - Numerical Linear Algebra with Applications

    JF - Numerical Linear Algebra with Applications

    SN - 1070-5325

    IS - 5

    M1 - e2173

    ER -