Sparsity issues in the computation of Jacobian Matrices
Shahadat Hossain (hossaincs.uleth.ca)
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.
Entry Submitted: 02/17/2002
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|