Pith. sign in

REVIEW 1 cited by

MgFNO: Multi-grid Architecture Fourier Neural Operator for Parametric Partial Differential Equations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.08615 v3 pith:T55Y5LFR submitted 2024-07-11 math.NA cs.NA

classification math.NAcs.NA
keywords mgfnoneuralequationsfourierfrequencymultigridnetworknetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neural operators are a new type of models that can map between function spaces, allowing trained models to emulate the solution operators of partial differential equations (PDEs). This paper proposes a multigrid Fourier neural operator (MgFNO) that accelerates the training of traditional Fourier neural operators through a novel three-level hierarchical architecture. The key innovation of MgFNO lies in its decoupled training strategy employing three distinct networks at different resolution levels: a coarse-level network first learns low-resolution approximations, an intermediate network refines the solution, and a fine-level network achieves high-resolution accuracy. By combining the frequency principle of deep neural networks with multigrid methodology, MgFNO effectively bridges the complementary learning patterns of neural networks (low-to-high frequency) and multigrid methods (high-to-low frequency error reduction).Experimental results demonstrate that MgFNO achieves relative errors of 0.17%, 0.28%, and 0.22% on the Burgers' equation, Darcy flow, and Navier-Stokes equations, respectively, representing reductions of 89%, 71%, and 83% compared to the conventional FNO. Furthermore, MgFNO supports zero-shot super-resolution prediction, enabling direct application to high-resolution scenarios after training on coarse grids. This study establishes an efficient and high-accuracy new paradigm for solving complex PDEs dominated by high-frequency dynamics. Code and data used are available on https://github.com/guozihao-hub/MgFNO/tree/master.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Spectral Embedding via Chebyshev Bases for Robust DeepONet Approximation

    cs.LG 2025-12 conditional novelty 5.0 of 10

    Replacing the coordinate-input trunk of a DeepONet with a fixed Chebyshev polynomial dictionary lowers reported reconstruction error on bounded non-periodic PDE benchmarks.

Pith tools