Parallel Scientific Computing pp 21-44 | Cite as
Supporting Algorithms
Chapter
First Online:
Abstract
Essential supporting algorithms for discretization of the domain, finding the nearest nodes, numerical integration, MLS approximation or interpolation, and solution of linear system of equations, which are all needed in the implementation of PDE solution methodologies, are discussed and evaluated from the aspect of their programming and computational complexity.
Keywords
kD tree Spatial discretization Support domain Moving least squares Interpolation Approximation Numerical integration Linear system of equationCopyright information
© The Author(s) 2015