Sparsity issues in the computation of Jacobian Matrices

Shahadat Hossain (hossaincs.uleth.ca)
Trond Steihaug (trondii.uib.no)

Abstract: The knowledge of sparsity information plays an important role in efficient determination of sparse Jacobian matrices. In a recent work, we have proposed sparsity-exploiting substitution techniques to determine Jacobian matrices. In this paper, we take a closer look at the underlying combinatorial problem. We propose a column ordering heuristic to augment the ``usable sparsity'' in the Jacobian matrix. Furthermore, we present a new elimination technique based on merging of successive columns.

Keywords: Sparse Jacobian, Substitution methods, Partition, Merging

Category 1: Nonlinear Optimization

Citation: Report 223, Department of Informatics, University of Bergen, January 2002.

Download: [Postscript]

Entry Submitted: 02/17/2002
Entry Accepted: 02/17/2002
Entry Last Modified: 04/11/2002

Modify/Update this entry