MA57---a code for the solution of sparse symmetric definite and indefinite systems
By Iain S. Duff. TOMS, 2004
421 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/e80a3255b16cb39a973ec1290d49530cb318cc75
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Guangchao Geng
- Quanyuan Jiang
- Manfred Morari
- Alexander Domahidi
- Colin Neil Jones
- Melanie Nicole Zeilinger
- Aldo U. Zgraggen
- Timothy A. Davis
In Numerical Analysis
- Manfred Morari
- Quanyuan Jiang
- Alexander Domahidi
- Colin Neil Jones
- Guangchao Geng
- Melanie Nicole Zeilinger
- Aldo U. Zgraggen
- Timothy A. Davis
Citations in the corpus
- Efficient interior point methods for multistage problems arising in receding horizon control (2012, methodology): “Furthermore, we include timings of the sparse factorization code MA57 [14] as called from OOQP [15] in order to show the merits of problem specific vs. general sparse factorization.”
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (2004, background): “…[Ashcraft and Grimes 1989; Heath and Raghavan 1995; Gupta et al. 1999; Liu 1992], (2) symmetric inde.nite matrices [Duff and Reid 1982, 1983a; Duff 2002], (3) unsymmetric matrices with actual or implied symmetric nonzero pattern [Amestoy and Duff 1989; Amestoy et al. 2001a; Duff 1984;…”
- A Reduced-Space Interior Point Method for Transient Stability Constrained Optimal Power Flow (2010, methodology): “[16] I. S. Duff, “MA57—”