Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 52 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

A universal solution scheme for fractional and classical PDEs (2102.00113v1)

Published 30 Jan 2021 in math.NA and cs.NA

Abstract: We propose a unified meshless method to solve classical and fractional PDE problems with $(-\Delta){\frac{\alpha}{2}}$ for $\alpha \in (0, 2]$. The classical ($\alpha = 2$) and fractional ($\alpha < 2$) Laplacians, one local and the other nonlocal, have distinct properties. Therefore, their numerical methods and computer implementations are usually incompatible. We notice that for any $\alpha \ge 0$, the Laplacian $(-\Delta){\frac{\alpha}{2}}$ of generalized inverse multiquadric (GIMQ) functions can be analytically written by the Gauss hypergeometric function, and thus propose a GIMQ-based method. Our method unifies the discretization of classical and fractional Laplacians and also bypasses numerical approximation to the hypersingular integral of fractional Laplacian. These two merits distinguish our method from other existing methods for the fractional Laplacian. Extensive numerical experiments are carried out to test the performance of our method. Compared to other methods, our method can achieve high accuracy with fewer number of unknowns, which effectively reduces the storage and computational requirements in simulations of fractional PDEs. Moreover, the meshfree nature makes it free of geometric constraints and enables simple implementation for any dimension $d \ge 1$. Additionally, two approaches of selecting shape parameters, including condition number-indicated method and random-perturbed method, are studied to avoid the ill-conditioning issues when large number of points.

Citations (4)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)