<?xml version='1.0'?>
<html xmlns='http://www.w3.org/1999/xhtml'
      xmlns:math='http://www.w3.org/1998/Math/MathML'
>
<head>
<title>Double Speed: Sparse Jacobian</title>
<meta name="description" id="description" content="Double Speed: Sparse Jacobian"/>
<meta name="keywords" id="keywords" content=" double speed sparse jacobian link_sparse_jacobian "/>
<style type='text/css'>
body { color : black }
body { background-color : white }
A:link { color : blue }
A:visited { color : purple }
A:active { color : purple }
</style>
<script type='text/javascript' language='JavaScript' src='_double_sparse_jacobian.cpp_xml.js'>
</script>
</head>
<body>
<table><tr>
<td>
<a href="http://www.coin-or.org/CppAD/" target="_top"><img border="0" src="_image.gif"/></a>
</td>
<td><a href="double_sparse_hessian.cpp.xml" target="_top">Prev</a>
</td><td><a href="speed_adolc.xml" target="_top">Next</a>
</td><td>
<select onchange='choose_across0(this)'>
<option>Index-&gt;</option>
<option>contents</option>
<option>reference</option>
<option>index</option>
<option>search</option>
<option>external</option>
</select>
</td>
<td>
<select onchange='choose_up0(this)'>
<option>Up-&gt;</option>
<option>CppAD</option>
<option>Appendix</option>
<option>speed</option>
<option>speed_double</option>
<option>double_sparse_jacobian.cpp</option>
</select>
</td>
<td>
<select onchange='choose_down3(this)'>
<option>Appendix-&gt;</option>
<option>Faq</option>
<option>speed</option>
<option>Theory</option>
<option>glossary</option>
<option>Bib</option>
<option>Bugs</option>
<option>WishList</option>
<option>whats_new</option>
<option>deprecated</option>
<option>License</option>
</select>
</td>
<td>
<select onchange='choose_down2(this)'>
<option>speed-&gt;</option>
<option>speed_main</option>
<option>speed_utility</option>
<option>speed_double</option>
<option>speed_adolc</option>
<option>speed_cppad</option>
<option>speed_fadbad</option>
<option>speed_sacado</option>
</select>
</td>
<td>
<select onchange='choose_down1(this)'>
<option>speed_double-&gt;</option>
<option>double_det_minor.cpp</option>
<option>double_det_lu.cpp</option>
<option>double_mat_mul.cpp</option>
<option>double_ode.cpp</option>
<option>double_poly.cpp</option>
<option>double_sparse_hessian.cpp</option>
<option>double_sparse_jacobian.cpp</option>
</select>
</td>
<td>double_sparse_jacobian.cpp</td>
<td>
<select onchange='choose_current0(this)'>
<option>Headings-&gt;</option>
<option>link_sparse_jacobian</option>
</select>
</td>
</tr></table><br/>



<center><b><big><big>Double Speed: Sparse Jacobian</big></big></b></center>
<br/>
<b><big><a name="link_sparse_jacobian" id="link_sparse_jacobian">link_sparse_jacobian</a></big></b>


<code><font color='blue'><pre style='display:inline'> 
# include &lt;cppad/vector.hpp&gt;
# include &lt;cppad/speed/uniform_01.hpp&gt;

// must include cmath before sparse_evaluate so that exp is defined for double
# include &lt;cmath&gt;
# include &lt;cppad/speed/sparse_evaluate.hpp&gt;

bool link_sparse_jacobian(
	size_t                     repeat   , 
	CppAD::vector&lt;double&gt;     &amp;x        ,
	CppAD::vector&lt;size_t&gt;     &amp;i        ,
	CppAD::vector&lt;size_t&gt;     &amp;j        ,
	CppAD::vector&lt;double&gt;     &amp;jacobian )
{
	// -----------------------------------------------------
	// setup
	using CppAD::vector;
	size_t order = 1;        // derivative order for f'(x)
	size_t n     = x.size(); // argument space dimension
	size_t ell   = i.size(); // size of index vectors
	vector&lt;double&gt; fp(n);    // f'(x)
	vector&lt;double&gt; y(ell);   // function value y = g(x)

	// temporaries
	size_t k;
	vector&lt;double&gt; tmp(2 * ell);

	// choose a value for x
	CppAD::uniform_01(n, x);
	
	// ------------------------------------------------------

	while(repeat--)
	{
		// get the next set of indices
		CppAD::uniform_01(2 * ell, tmp);
		for(k = 0; k &lt; ell; k++)
		{	i[k] = size_t( n * tmp[k] );
			i[k] = std::min(n-1, i[k]);
			//
			j[k] = size_t( n * tmp[k + ell] );
			j[k] = std::min(n-1, j[k]);
		}

		// computation of the function
		CppAD::sparse_evaluate(x, i, j, order, fp);
		for(k = 0; k &lt; ell; k++)
			y[k] = fp[ i[k] ];
	}
	for(k = 0; k &lt; ell; k++)
		jacobian[k] = y[k];

	return true;
}
</pre></font></code>


<hr/>Input File: speed/double/sparse_jacobian.cpp

</body>
</html>

