Home
Precond.
Mod. Barrier
Complexity
SUMT
Extrapolation
Multigrid
TN Survey
AIAA 2000
VLSI-CAD
Model Problems
Preconditioning Reduced Matrices

Precondition Reduced Matrices

By Stephen G. Nash and Ariela Sofer


Abstract

We study preconditioning strategies for linear systems with positive-definite matrices of the form ZTZG, where Z is rectangular and G is symmetric but not necessarily positive definite. The preconditioning strategies are designed to be used in the context of a conjugate-gradient iteration, and are suitable within algorithms for constrained optimization problems. The  techniques have other uses, however, and are applied here to a class of problems in the calculus of variations. Numerical tests are also included.


Complete Text (postscript file)

 “Preconditioning Reduced Matrices”, SIAM Journal on Matrix Analysis and Applications, 17 (1996), pp. 47-68.


Links

(snash@gmu.edu)

[Home] [Precond.] [Mod. Barrier] [Complexity] [SUMT] [Extrapolation] [Multigrid] [TN Survey] [AIAA 2000] [VLSI-CAD] [Model Problems]