Alexander, can you be more specific about what they do not know how to do?
There are two problems. For the second problem, a code example is provided.


On Wed, Jan 29, 2014 at 3:35 PM, AZaitzeff <notifications@github.com> wrote:

> In Algorithms/MonteCarloIntegration/MonteCarloIntegration.tex:
>
> > +\end{problem}
> > +
> > +\begin{problem}
> > +\label{prob:fab}
> > +Define a function that accepts an $N \times d$ dimensional array, makes a random
> > +choice for ${\bf a}$ and ${\bf b}$, and returns $\fab({\bf x}_n)$ evaluated for
> > +each of the $N$ vectors. Restrict your choice of ${\bf a}$ to the set
> > +$\{1,2,\ldots,9\}^d$.
> > +\end{problem}
> > +
> > +\begin{problem}
> > +\label{prob:grid}
> > +Estimate $\int_{\Omega} \fab({\bf x}) \;d{\bf x}$ using rectangular quadrature
> > +(or another method), for many values of ${\bf a}, {\bf b}, d, N$. How large can
> > +you make $d$?  What problems do you face as $d$ increases? What happens to the
> > +average error as $d$ and $N$ vary?
>
> The students do not know how to do that. We would need to provide the code.
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/byuimpact/numerical_computing/pull/447/files#r9288137>
> .
>