Sparsity issues in the computation of Jacobian matrices

  title={Sparsity issues in the computation of Jacobian matrices},
  author={Shahadat Hossain and Trond Steihaug},
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. 

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-5 of 5 references

Automatic Computation of Sparse Jacobians byApplying the Method of Newsam and Ramsdell

Uwe, Geitnery, +3 authors GriewankyAbstractThe
View 9 Excerpts
Highly Influenced

Sparse Jacobian Estimation and Factorization on Amultiprocessor

View 5 Excerpts
Highly Influenced

Software for estimating sparse Jacobian matrices

ACM Trans. Math. Softw. • 1984
View 4 Excerpts
Highly Influenced

Estimation of sparse Jacobian matrices

G. N. Newsam, J. D. Ramsdell
SIAM J. Alg. Disc. Meth., • 1983
View 7 Excerpts
Highly Influenced

Matrix computations (3. ed.)

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…