Skip to main content

Adaptive Refinement Techniques for RBF-PU Collocation

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2019)

Abstract

We propose new adaptive refinement techniques for solving Poisson problems via a collocation radial basis function partition of unity (RBF-PU) method. As the construction of an adaptive RBF-PU method is still an open problem, we present two algorithms based on different error indicators and refinement strategies that turn out to be particularly suited for a RBF-PU scheme. More precisely, the first algorithm is characterized by an error estimator based on the comparison of two collocation solutions evaluated on a coarser set and a finer one, while the second one depends on an error estimate that is obtained by a comparison between the global collocation solution and the associated local RBF interpolant. Numerical results support our study and show the effectiveness of our algorithms.

The authors acknowledge support from the Department of Mathematics “Giuseppe Peano” of the University of Torino via Project 2019 “Mathematics for applications”. Moreover, this work was partially supported by INdAM – GNCS Project 2019 “Kernel-based approximation, multiresolution and subdivision methods and related applications”. This research has been accomplished within RITA (Research ITalian network on Approximation).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cavoretto, R., De Rossi, A.: Adaptive meshless refinement schemes for RBF-PUM collocation. Appl. Math. Lett. 90, 131–138 (2019)

    Article  MathSciNet  Google Scholar 

  2. Driscoll, T.A., Heryudono, A.R.H.: Adaptive residual subsampling methods for radial basis function interpolation and collocation problems. Comput. Math. Appl. 53, 927–939 (2007)

    Article  MathSciNet  Google Scholar 

  3. Fasshauer, G.E., McCourt, M.J.: Kernel-Based Approximation Methods Using MATLAB. Interdisciplinary Mathematical Sciences, vol. 19. World Scientific Publishing Co., Singapore (2015)

    Book  Google Scholar 

  4. Heryudono, A., Larsson, E., Ramage, A., Sydow, L.V.: Preconditioning for radial basis function partition of unity methods. J. Sci. Comput. 67, 1089–1109 (2016)

    Article  MathSciNet  Google Scholar 

  5. Safdari-Vaighani, A., Heryudono, A., Larsson, E.: A radial basis function partition of unity collocation method for convection-diffusion equations. J. Sci. Comput. 64, 341–367 (2015)

    Article  MathSciNet  Google Scholar 

  6. Wendland, H.: Scattered Data Approximation. Cambridge Monographs on Applied and Computational Mathematics, vol. 17. Cambridge University Press, Cambridge (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. De Rossi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cavoretto, R., De Rossi, A. (2020). Adaptive Refinement Techniques for RBF-PU Collocation. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2019. Lecture Notes in Computer Science(), vol 11958. Springer, Cham. https://doi.org/10.1007/978-3-030-41032-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41032-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41031-5

  • Online ISBN: 978-3-030-41032-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics