Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: A Chordal Preconditioner for Large Scale Optimization
Authors: Coleman, Thomas F.
Keywords: computer science
technical report
Issue Date: Jun-1986
Publisher: Cornell University
Abstract: We propose an automatic preconditioning scheme for large sparse numerical optimization. The strategy is based on an examination of the sparsity pattern of the Hessian matrix: using a graph-theoretic heuristic, a block diagonal approximation to the Hessian matrix is induced. The blocks are submatrices of the Hessian matrix; furthermore, each block is chordal. That is, under a positive definiteness assumption, each block can be Cholesky factored without creating new nonzeroes (fill). Therefore the preconditioner is space efficient. We conduct a number of numerical experiments to determine the effectiveness of the preconditioner in the context of a linear conjugate gradient algorithm for optimization.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
86-762.pdf2.25 MBAdobe PDFView/Open
86-762.ps679.58 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us