DSJM : a software toolkit for direct determination of sparse Jacobian matrices
| dc.contributor.author | Hasan, Mahmudul | |
| dc.contributor.supervisor | Hossain, Shahadat | |
| dc.date.accessioned | 2012-11-08T18:43:09Z | |
| dc.date.available | 2012-11-08T18:43:09Z | |
| dc.date.issued | 2011 | |
| dc.degree.level | Masters | |
| dc.description | x, 71 leaves : ill. ; 29 cm | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10133/3216 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011 | en_US |
| dc.publisher.department | Department of Mathematics and Computer Science | en_US |
| dc.publisher.faculty | Arts and Science | en_US |
| dc.relation.ispartofseries | Thesis (University of Lethbridge. Faculty of Arts and Science) | en_US |
| dc.subject | Sparse matrices | en_US |
| dc.subject | Sparse matrices -- Computer programs | en_US |
| dc.subject | Jacobians -- Data processing | en_US |
| dc.subject | Dissertations, Academic | en_US |
| dc.title | DSJM : a software toolkit for direct determination of sparse Jacobian matrices | en_US |
| dc.type | Thesis | en_US |