Advertisement

Fast RBF

  • Marco Evangelos BiancoliniEmail author
Chapter

Abstract

Fast RBF foundation concepts are described in this chapter. Details are provided for an effective usage of the direct method using advanced linear algebra strategies and libraries. Methods for data compression which allow to represent the same information with a smaller and less expensive cloud are introduced. Space localization methods are successively considered firstly with compact supported RBF, whose interaction distance is limited in the RBF function itself, and then with partition of unity (POU) that consists of the superposition and blending of smaller clouds. Approximated evaluation of the far field of full supported RBF is described and an overview of the fast multipole method (FMM) is given. Information about iterative solvers and parallel computing are finally provided to complete the chapter.

References

  1. Babuška I, Melenk JM (1997) The partition of unity method. Int J Numer Meth Eng 40(4):727–758,  https://doi.org/10.1002/(SICI)1097-0207(19970228)40:4:727::AID-NME86:3.0.CO;2-N
  2. Beatson RK, Greengard L (1997) A short course on fast multipole methods. In: Ainsworth M, Levesley J, Light WA. Marletta M (eds) Wavelets, multilevel methods and elliptic PDEs, Oxford University Press, pp 1–37Google Scholar
  3. Beatson RK, Powell MJD (1993) An iterative method for thin plate spline interpolation that employs approximations to Lagrange functions. Numerical Analysis, Griffiths D.F & Watson G.A. (eds), London: Longmans, pp 17–39Google Scholar
  4. Beatson RK, Cherrie JB, Mouat CT (1999) Fast fitting of radial basis functions: methods based on preconditioned GMRES iteration, Adv Comput Math 11:253–270Google Scholar
  5. Beatson RK, Powell MJD, Tan AM (2007) Fast evaluation of polyharmonic splines in three dimensions. IMA J Numer Anal 27:427–450.  https://doi.org/10.1093/imanum/drl027
  6. Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517Google Scholar
  7. Biancolini ME (2012) Mesh morphing and smoothing by means of Radial Basis Functions (RBF): a practical example using Fluent and RBF morph. In: Handbook of research on computational science and engineering: theory and practice, pp 34,  https://doi.org/10.4018/978-1-61350-116-0.ch015
  8. Botsch M, Kobbelt L (2005) Real-time shape editing using radial basis functions. In: Marks J, Alexa M (eds) Computer graphics, 24(3), EurographicsGoogle Scholar
  9. Buhmann MD (2003) Radial basis functions: theory and implmentation. Cambridge University Press, New YorkGoogle Scholar
  10. Carr JC, Beatson R, Cherri J, Mitchell T, Fright W, McCallum B (2001) Reconstruction and representation of 3D objects with radial basis functions. In: Proceedings of the 28th annual conference on Computer graphics and interactive techniques, Los Angeles, CA, p 67–76Google Scholar
  11. Carr JC, Beatson RK, McCallum BC, Fright WR, McLennan TJ, Mitchell TJ (2003) Smooth surface reconstruction from noisy range data. In: First international conference on computer graphics and interactive techniques, p 119Google Scholar
  12. Cipra BA (2010) The best of the 20th century: Editors name top 10 algorithms. SIAM News Soc Ind Appl Math. 33 (4):2. Retrieved 23 DecGoogle Scholar
  13. European Commision (2013) RBF4AERO Project. http://cordis.europa.eu/project/rcn/109141_en.html
  14. Faul AC, Goodsell G, Powell MJD (2005) A Krylov subspace algorithm for multiquadric interpolation in many dimensions. IMA J Numer Anal 25:1–24MathSciNetCrossRefzbMATHGoogle Scholar
  15. Greengard L, Rokhlin V (1987) A fast algorithm for particle simulations. J Comput Phys 73:325–348MathSciNetCrossRefzbMATHGoogle Scholar
  16. Gumerov NA, Duraiswami R (2007) Fast radial basis function interpolation via preconditioned Krylov Iteration. SIAM J Sci Comput 29(5):1876–1899.  https://doi.org/10.1137/060662083MathSciNetCrossRefzbMATHGoogle Scholar
  17. Kojekine N, Savchenko V, Seni M, Hagiwara I (2002) Real-time 3D Deformations by means of compactly supported radial basis functions, EUROGRAPHICS 2002/ Navazo Al I and Slusallek P (Guest Editors)Google Scholar
  18. Krasny R, Wang L (2011) Fast evaluation of multiquadric RBF fums by a Cartesian Treecode. SIAM Soc Ind Appl Math 33:2341–2355MathSciNetzbMATHGoogle Scholar
  19. LAPACK (2017a) Linear Algebra PACKage. http://www.netlib.org/lapack/
  20. Lexing Y (2006) A kernel independent fast multipole algorithm for radial basis functions. J Comput Phys 21:451–457zbMATHGoogle Scholar
  21. Press WH, Flannery BP, Teukolsky SA (1992) Numerical recipes in C. In: The art of scientific computing, 2nd edn. ISBN 0-521-43108-5Google Scholar
  22. Rendall TCS, Allen CB (2009) Efficient mesh motion using radial basis functions with data reduction algorithms. J Comput Phys 228(17):6231–6249CrossRefzbMATHGoogle Scholar
  23. ScaLAPACK (2017) Scalable linear algebra package. http://www.netlib.org/scalapack/
  24. Sieger D, Menzel S, Botsch M (2014) RBF morphing techniques for simulation-based design optimization. Eng Comput 30(2):161–174CrossRefzbMATHGoogle Scholar
  25. Tobor I, Reuter P, Schlick C (2006) Reconstructing multi-scale variational partition of unity implicit surfaces with attributes. Graph Models 68(1):25–41.  https://doi.org/10.1016/j.gmod.2005.09.003CrossRefzbMATHGoogle Scholar
  26. Wendland H (2002) Fast evaluation of radial basis functions: methods based on partition of unity. In: Chui CK, Schumaker LL, Stöckler J (eds) Approximation theory X: wavelets, splines, and applications, Vanderbilt University Press, Nashville, pp 473–483Google Scholar
  27. Yokota R, Barba LA (2011) Treecode and fast multipole method for n-body simulation with cuda. GPU Comput Gems Emerald Ed, p 113Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of Enterprise Engineering “Mario Lucertini”University of Rome “Tor Vergata”RomeItaly

Personalised recommendations