DSJM is a software toolkit written in portable C++ that enables direct determination of
sparse Jacobian matrices whose sparsity pattern is a priori known. Using the seed matrix
S 2 Rn×p, the Jacobian A 2 Rm×n can be determined by solving AS = B, where B 2 Rm×p
has been obtained via finite difference approximation or forward automatic differentiation.
Seed matrix S is defined by the nonzero unknowns in A. DSJM includes well-known as
well as new column ordering heuristics. Numerical testing is highly promising both in
terms of running time and the number of matrix-vector products needed to determine A. / x, 71 leaves : ill. ; 29 cm
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:ALU.w.uleth.ca/dspace#10133/3216 |
| Date | January 2011 |
| Creators | Hasan, Mahmudul |
| Contributors | Hossain, Shahadat |
| Publisher | Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011, Arts and Science, Department of Mathematics and Computer Science |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Relation | Thesis (University of Lethbridge. Faculty of Arts and Science) |
Page generated in 0.0023 seconds