Changeset 3108 for trunk/test_more
 Timestamp:
 Feb 20, 2014 8:51:45 AM (6 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

trunk/test_more/sparse_jacobian.cpp
r2870 r3108 1 1 /* $Id$ */ 2 2 /*  3 CppAD: C++ Algorithmic Differentiation: Copyright (C) 20031 3Bradley M. Bell3 CppAD: C++ Algorithmic Differentiation: Copyright (C) 200314 Bradley M. Bell 4 4 5 5 CppAD is distributed under multiple licenses. This distribution is under … … 319 319 } 320 320 p = f.RevSparseJac(m, s); 321 jac = f.SparseJacobian(x );321 jac = f.SparseJacobian(x, p); 322 322 for(k = 0; k < 12; k++) 323 323 ok &= NearEqual(check[k], jac[k], 1e10, 1e10 ); … … 376 376 s[i].insert(i); 377 377 p = f.RevSparseJac(m, s); 378 jac = f.SparseJacobian(x );378 jac = f.SparseJacobian(x, p); 379 379 for(k = 0; k < 12; k++) 380 380 ok &= NearEqual(check[k], jac[k], 1e10, 1e10 ); … … 440 440 } 441 441 p = f.ForSparseJac(n, r); 442 jac = f.SparseJacobian(x );442 jac = f.SparseJacobian(x, p); 443 443 for(k = 0; k < 12; k++) 444 444 ok &= NearEqual(check[k], jac[k], 1e10, 1e10 ); … … 500 500 r[j].insert(j); 501 501 p = f.ForSparseJac(n, r); 502 jac = f.SparseJacobian(x );502 jac = f.SparseJacobian(x, p); 503 503 for(k = 0; k < 12; k++) 504 504 ok &= NearEqual(check[k], jac[k], 1e10, 1e10 );
Note: See TracChangeset
for help on using the changeset viewer.