Skip to main content

Supporting Algorithms

  • 2047 Accesses

Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

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 equation

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-17073-2_3
  • Chapter length: 24 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   54.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-17073-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   69.99
Price excludes VAT (USA)
Fig. 3.1
Fig. 3.2
Fig. 3.3
Fig. 3.4
Fig. 3.5
Fig. 3.6
Fig. 3.7
Fig. 3.8
Fig. 3.9

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roman Trobec .

Rights and permissions

Reprints 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)