IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v246y2026icp78-97.html

A fictitious domain spectral method for time-dependent Sobolev equations in complex domains

Author

Listed:
  • Li, Shan
  • Sun, Chen
  • Yang, Tianyu

Abstract

Numerical simulation of time-dependent Sobolev-type equations in complex domains remains challenging, primarily due to the interplay of high-order derivatives, nonlinearities, and irregular boundaries. While spectral methods offer high accuracy, their application is largely confined to regular domains. To overcome this limitation, we propose an efficient spectral framework based on a fictitious domain formulation. The physical domain is embedded into a larger, circular auxiliary domain. A polar coordinate transformation is employed, enabling discretization via a Fourier spectral method in the angular direction. This reduces the problem to a set of one-dimensional radial subproblems, which are solved with high accuracy using a Legendre spectral-Galerkin method. For time integration, high-order Backward Differentiation Formula (BDFk) and Implicit–Explicit (IMEX) schemes are applied to the linear and nonlinear terms, respectively. Numerical experiments demonstrate the method’s spectral accuracy, robustness, and effectiveness across diverse challenging cases, including smooth solutions and those with singularities or sharp gradients. This work provides a flexible and powerful computational paradigm for simulating complex transient phenomena governed by Sobolev-type equations.

Suggested Citation

  • Li, Shan & Sun, Chen & Yang, Tianyu, 2026. "A fictitious domain spectral method for time-dependent Sobolev equations in complex domains," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 246(C), pages 78-97.
  • Handle: RePEc:eee:matcom:v:246:y:2026:i:c:p:78-97
    DOI: 10.1016/j.matcom.2026.01.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426000224
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.01.022?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:matcom:v:246:y:2026:i:c:p:78-97. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.