Accession Number : ADA131387
Title : A Combinatorial Approach to Some Sparse Matrix Problems.
Descriptive Note : Technical rept.,
Corporate Author : STANFORD UNIV CA SYSTEMS OPTIMIZATION LAB
Personal Author(s) : McCormick,S Thomas
PDF Url : ADA131387
Report Date : Jun 1983
Pagination or Media Count : 75
Abstract : This dissertation considers two combinatorial problems arising in large-scale, sparse optimizaton. The first is the problem of approximating the Hessian matrix of a smooth, non-linear function by finite differencing, where the object is to minimize the required number of gradient evaluations. The second is to find as sparse a representation as possible of a given set of linear constraints.
Descriptors : *Sparse matrix, *Combinatorial analysis, Methodology, Problem solving, Approximation(Mathematics), Nonlinear analysis, Finite difference theory, Elimination, Computations, Algorithms
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE