Ok. Thanks for clearing this up. This helps a lot. Kyle
On Dec 29, 2014, at 11:45 AM, Daniel Wheeler <[email protected]> wrote: > On Wed, Dec 24, 2014 at 5:04 PM, Kyle Briton Lawlor > <[email protected]> wrote: >> Thanks, Daniel. >> Is the function .getGrad() built to handle irregular meshes as well? > > It handles irregular meshes but the accuracy decreases based on the > reduction in mesh orthogonality and conjunctionality. > >> I’ll be honest I have no intuition for what is meant by the first index >> being the “direction” and the second index being the direction for the >> gradient operator. > > Another way of writing a vector on a discretized domain is > > x_i [j] > > where the i refers to the Cartesian direction and the [j] is the > discretized cell index. In FiPy, that correstponds to x[i, j], the > cell index is always the last index. If we take the gradient of x, we > get > > \partial_k x_i [j] > > and in FiPy that corresponds to x.getGrad()[i, k, j] > > -- > Daniel Wheeler > > _______________________________________________ > fipy mailing list > [email protected] > http://www.ctcms.nist.gov/fipy > [ NIST internal ONLY: https://email.nist.gov/mailman/listinfo/fipy ] _______________________________________________ fipy mailing list [email protected] http://www.ctcms.nist.gov/fipy [ NIST internal ONLY: https://email.nist.gov/mailman/listinfo/fipy ]
