IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v382y2020ics0096300320303180.html
   My bibliography  Save this article

Adaptive procedures for meshfree RBF unsymmetric and symmetric collocation methods

Author

Listed:
  • Cavoretto, Roberto
  • De Rossi, Alessandra

Abstract

In this article we present an adaptive scheme for solving radial basis function collocation problems, which involve elliptic partial differential equations. The proposed algorithm is applied to two usual numerical methods, known as the nonsymmetric Kansa’s method and the symmetric Hermite-based approach. Basically, the refinement algorithm is firstly characterized by the use of an adaptive superimposition scheme, in which an error estimate compares two approximate solutions computed on a coarser and a finer set of collocation points, and then on a modified adaptive residual subsampling scheme. Blending these computational techniques we detect the areas that need to be refined, also having the chance to further add and/or remove adaptively collocation points. Our study is supported by several numerical results, which illustrate the performance of our iterative algorithm.

Suggested Citation

  • Cavoretto, Roberto & De Rossi, Alessandra, 2020. "Adaptive procedures for meshfree RBF unsymmetric and symmetric collocation methods," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    • Handle: RePEc:eee:apmaco:v:382:y:2020:i:c:s0096300320303180
    DOI: 10.1016/j.amc.2020.125354
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320303180
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125354?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Cavoretto, Roberto & De Rossi, Alessandra, 2020. "Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    2. Oanh, Dang Thi & Davydov, Oleg & Phu, Hoang Xuan, 2017. "Adaptive RBF-FD method for elliptic problems with point singularities in 2D," Applied Mathematics and Computation, Elsevier, vol. 313(C), pages 474-497.
    3. Kaennakham, S. & Chuathong, N., 2019. "An automatic node-adaptive scheme applied with a RBF-collocation meshless method," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 102-125.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chih-Yu Liu & Cheng-Yu Ku, 2022. "A Simplified Radial Basis Function Method with Exterior Fictitious Sources for Elliptic Boundary Value Problems," Mathematics, MDPI, vol. 10(10), pages 1-23, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cavoretto, Roberto & De Rossi, Alessandra & Lancellotti, Sandro & Romaniello, Federico, 2024. "Node-bound communities for partition of unity interpolation on graphs," Applied Mathematics and Computation, Elsevier, vol. 467(C).
    2. Nikan, O. & Avazzadeh, Z., 2022. "A locally stabilized radial basis function partition of unity technique for the sine–Gordon system in nonlinear optics," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 199(C), pages 394-413.
    3. Cavoretto, Roberto, 2022. "Adaptive LOOCV-based kernel methods for solving time-dependent BVPs," Applied Mathematics and Computation, Elsevier, vol. 429(C).
    4. Cavoretto, R. & De Rossi, A. & Perracchione, E., 2023. "Learning with Partition of Unity-based Kriging Estimators," Applied Mathematics and Computation, Elsevier, vol. 448(C).
    5. Cavoretto, Roberto & De Rossi, Alessandra, 2020. "Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    6. Nikan, O. & Avazzadeh, Z., 2021. "A localisation technique based on radial basis function partition of unity for solving Sobolev equation arising in fluid dynamics," Applied Mathematics and Computation, Elsevier, vol. 401(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:382:y:2020:i:c:s0096300320303180. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.