Sparsity Issues in the Computation of Jacobian Matrices

DMCA

Sparsity Issues in the Computation of Jacobian Matrices (2002)

Cached

Download Links

[www.ii.uib.no]
[www.ii.uib.no]
[www.ii.uib.no]

Other Repositories/Bibliography

DBLP

by Shahadat Hossain , Shahadat Hossain , Trond Steihaug , Trond Steihaug

Citations:

5 - 2 self

BibTeX

@MISC{Hossain02sparsityissues,
    author = {Shahadat Hossain and Shahadat Hossain and Trond Steihaug and Trond Steihaug},
    title = {Sparsity Issues in the Computation of Jacobian Matrices},
    year = {2002}
}

OpenURL

Abstract

The knowledge of sparsity information plays an important role in e#cient 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.

Keyphrases

jacobian matrix sparsity issue important role combinatorial problem new elimination technique sparsity-exploiting substitution technique usable sparsity cient determination sparse jacobian matrix recent work successive column sparsity information

DMCA