Developments in matching and scaling algorithms
Iain Duff · PAMM · 2007
Abstract We look at some recent work on scaling and matching algorithms. We show how these algorithms can be used as a preprocessor for direct methods for solving symmetric indefinite systems. We also discuss current work towards developing implementations for parallel machines. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)