ON FAST FACTORIZATION PIVOTING METHODS FOR SPARSE SYMMETRI C INDEFINITE SYSTEMS

472 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Advances in Iterative Methods and Preconditioners for the Helmholtz Equation (2008, background): “lel direct solvers for sparse linear systems have also been quite advanced nowadays (see, e.g., PARDISO [107, 108 ]), cheaper alternatives—less memory requirement and hopefully faster—are still sought.”
Neurobiology of Aging: Contents (2005, unknown): “For instance, Schenk and Gärtner (2004) report that their code factors a saddle point matrix from optimization of order approximately 2 million (with 6 million nonzeros) in less than a minute on a 2.4 GHz Intel 32-bit processor, producing a factor with about 1.4 × 108 nonzeros.”
Discontinuous Galerkin methods in nanophotonics (2011, methodology): “To this end, sophisticated column-reordering strategies are employed [80, 81].”
Electrokinetic locomotion due to reaction-induced charge auto-electrophoresis (2010, methodology): “In particular, we implement the pardiso linear system solver developed by Schenk & Gärtner (2004, 2006).”