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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Trobec, R., Kosec, G. (2015). Supporting Algorithms. In: Parallel Scientific Computing. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-17073-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-17073-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17072-5
Online ISBN: 978-3-319-17073-2
eBook Packages: Computer ScienceComputer Science (R0)