| S. Hossain and T. Steihaug. Reducing the number of AD passes for computing a sparse Jacobian matrix. In Corliss et al. [6], chapter 31, pages 263--270. |
No context found.
S. Hossain and T. Steihaug. Reducing the number of AD passes for computing a sparse Jacobian matrix. In Corliss et al. [6], chapter 31, pages 263--270.
No context found.
S. Hossain and T. Steihaug. Reducing the number of AD passes for computing a sparse Jacobian matrix. In Corliss et al. [6], chapter 31, pages 263--270.
....describes an application of graph coloring ideas in the numerical determination of large sparse derivative matrices. Other related work can be found in [2, 5, 6, 13] We also note that the procedure for the determination of Jacobian matrices as outlined in Page 2 can be given in a more general way [14, 15] and a different graph coloring formulation of the problem is currently under investigation. ....
S. Hossain and T. Steihaug. Reducing the number of AD passes for computing a sparse JacobJan matrix. In Corliss et al. [7], chapter 31, pages 263-270.
No context found.
S. Hossain and T. Steihaug. Reducing the number of AD passes for computing a sparse Jacobian matrix. In G. Corliss, C. Faure, A. Griewank, L. Hascoet, and U. Naumann, editors, Authomatic Di#erentiation of Algorithms: From Simulation to Optimization, pages 263 -- 270. Springer, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC