The physics-informed neural operator (PINO) is a machine learning paradigm that has demonstrated promising results for learning solutions to partial differential equations (PDEs). It leverages the Fourier Neural Operator to learn solution operators in function spaces and leverages physics losses during training to penalize deviations from known physics laws. Spectral differentiation provides an efficient way to compute derivatives for the physics losses, but it inherently assumes periodicity. When applied to non-periodic functions, this assumption can lead to significant errors, including Gibbs phenomena near domain boundaries which degrade the accuracy of both function representations and derivative computations. To overcome this limitation, we introduce the FC-PINO (Fourier-Continuation-based Physics-Informed Neural Operator) architecture which extends the accuracy and efficiency of PINO and spectral differentiation to non-periodic and non-smooth PDEs. In FC-PINO, we propose integrating Fourier continuation into the PINO framework, and test two different continuation approaches: FC-Legendre and FC-Gram. By transforming non-periodic signals into periodic functions on extended domains in a well-conditioned manner, Fourier continuation enables fast and accurate derivative computations. This approach avoids the discretization sensitivity of finite differences and the memory overhead of automatic differentiation. We demonstrate that standard PINO fails (without padding) or struggles (even with padding) to solve non-periodic and non-smooth PDEs with high precision, across challenging benchmarks. In contrast, the proposed FC-PINO provides accurate, robust, and scalable solutions, substantially outperforming PINO alternatives, and demonstrating that Fourier continuation is critical for extending PINO to a wider range of PDE problems when high-precision solutions are needed.
Figures & tables
Figure 1: Examples of periodic extensions obtained using the Fourier continuation methods. (top) Extensions of f(x)=sin(16x)−cos(8x) from [0,1] to [−0.25,1.25] . (bottom) Extensions of f(x,y)=sin(12x)−cos(14y)+3xy from [0,1]2 to [−0.25,1.25]2 .
Figure 2: The Fourier Neural Operator (FNO) architecture (extracted from ( Li et al., 2020 ) ).
Figure 3: Visualization of the Gibbs phenomenon when applying spectral differentiation to a non-periodic solution U(y) to the 1D Burgers’ equation ( 14 ). ( top ) Applying spectral differentiation on the extended domain after using FC–Gram . ( bottom two ) Applying spectral differentiation on the original domain without Fourier continuation. We observe large spurious oscillations, whose magnitude grows rapidly with the derivative order.
Figure 4Figure 5
Figure 4: Illustration of the various variables used in the Fourier continuation. The given signal f of n points given on [a,b] is extended to a periodic signal with (n+c) points, and the extension is split and appended on both sides (each with c/2 points). FC–Legendre and FC–Gram construct periodic extension using only the information contained in the boundary vectors fℓ and fr of width d , and not the remaining part fint of the signal.
Model
PDE Residual
BC Loss
Smoothness
Total Loss
FC–Gram
FC–PINO
1.9×10−11
9.2×10−15
5.5×10−9
6.7×10−10
FC–Legendre
FC–PINO
1.8×10−12
1.9×10−14
2.8×10−8
2.8×10−9
Baselines
Pad–PINO
1.4×10−8
1.1×10−10
4.9×10−5
4.9×10−6
Table 1: PDE residual, boundary condition (BC) loss, smoothness loss, and total loss for FC–PINO with FC–Gram and FC–Legendre , and baseline PINO architectures when solving the self-similar Burgers’ equation ( 14 ) for λ=0.5 .
Model ( FC–Gram)
PDE Residual
BC Loss
Smoothness
λ=1/2
8.8×10−10
3.7×10−12
5.9×10−8
λ=1/12
2.3×10−10
6.7×10−13
6.1×10−8
λ=1/22
1.5×10−10
8.3×10−11
1.3×10−7
λ=1/32
8.3×10−10
1.8×10−10
1.6×10−7
λ=1/52
2.2×10−9
8.6×10−10
3.4×10−7
Fine-tuning Average
8.6×10−10
2.3×10−10
1.5×10−7
Table 2: PDE residual, boundary condition (BC) loss, and smoothness loss when solving the self-similar Burgers’ equation with FC–PINO over a family of values of λ . Here, we report the errors obtained when fine-tuning the pretrained model on the individual values λ∈{1/2,1/12,1/22,1/32,1/52} , and the average over these 5 instances.
Figure 5: PDE residual loss across different λ ’s when fine-tuning the pretrained FC–PINO . The black curve represents the pretrain phase where we use the Adam optimizer for 3000 epochs, learning a solution operator over multiple λ values. We subsequently switch to the L–BFGS optimizer, as signified by the dashed line, and fine-tune the operator individually on 5 different PDE instances corresponding to different values of λ .
Model
PDE Residual
IC Loss
BC Loss
FC–Gram
FC–PINO
1.35×10−7
7.46×10−7
5.09×10−7
FC–Legendre
FC–PINO
1.17×10−7
8.25×10−7
5.06×10−7
Baselines
Pad–PINO
2.8×10−5
7.0×10−6
5.3×10−7
Table 3: PDE residual, initial condition (IC) and boundary condition (BC) losses for FC–PINO with FC–Gram and FC–Legendre , and baseline PINO architectures for the 2D Burgers’ equation ( 17 ).
Model
PDE Residual
IC Loss
BC Loss
FC–Gram
FC–PINO
7.5×10−7
4.5×10−7
6.7×10−7
FC–Legendre
FC–PINO
1.1×10−6
1.4×10−6
1.1×10−6
Baselines
Pad–PINO
8.0×10−6
9.2×10−6
3.5×10−6
Table 4: PDE residual, initial condition (IC) loss, and boundary condition (BC) loss for FC–PINO with FC–Gram and FC–Legendre , and baseline PINO architectures for the Navier–Stokes equations ( 19 ).
Appendix figures & tables21 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 12Figure 13
Model
PDE Residual
BC Loss
Smoothness
Total Loss
FC–Gram
FC–PINO
1.9×10−11
9.2×10−15
5.5×10−9
6.7×10−10
PINO In–FC
7.9×10−13
2.9×10−14
8.3×10−8
8.3×10−9
PINO Out–FC
2.1×10−12
2.1×10−13
1.3×10−7
1.3×10−8
FC–Legendre
FC–PINO
1.8×10−12
2.2×10−15
2.8×10−8
2.8×10−9
Appendix
Table 5: PDE residual, boundary condition (BC) loss, smoothness loss, and total loss for the FC-based PINO architectures using FC–Legendre and FC–Gram when solving the 1D Burgers’ equation for λ=0.5 .
Model
PDE Residual
IC Loss
BC Loss
FC–Gram
FC–PINO
1.35×10−7
7.46×10−7
5.09×10−7
PINO In–FC
1.73×10−7
7.55×10−7
5.21×10−7
PINO Out–FC
3.48×10−5
6.89×10−6
6.21×10−7
FC–Legendre
FC–PINO
1.17×10−7
8.25×10−7
5.06×10−7
Appendix
Table 6: PDE residual, initial condition (IC) loss, and boundary condition (BC) loss for the FC-based PINO architectures using FC–Legendre and FC–Gram when solving the 2D Burgers’ equation ( 17 ).
Model
PDE Residual
IC Loss
BC Loss
FC–Gram
FC–PINO
7.5×10−7
4.5×10−7
6.7×10−7
PINO In–FC
1.3×10−6
9.6×10−7
1.9×10−6
PINO Out–FC
1.3×10−5
1.7×10−6
7.2×10−6
FC–Legendre
FC–PINO
1.1×10−6
1.4×10−6
1.1×10−6
Appendix
Table 7: PDE residual, initial condition (IC) loss, and boundary condition (BC) loss for the FC-based PINO architectures using FC–Legendre and FC–Gram when solving the Navier–Stokes equations ( 19 ).
Figure 6: Effect of varying continuation parameters c (continuation points) and d (degree) for FC–Legendre on Total Loss (left) and PDE Residual (right)
Total Loss
PDE Residual
d=2
1.05×10−8
3.74×10−10
d=3
4.89×10−9
9.52×10−10
d=4
7.34×10−10
1.25×10−10
d=5
8.29×10−10
1.12×10−9
d=6
6.72×10−10
1.92×10−11
d=7
6.60×10−9
1.07×10−9
Appendix
Table 8: Effect of the choice of continuation parameters d for FC–Gram on the Total Loss and PDE Residual when using FC–PINO to solve the 1D Burgers’ equation ( 14 ).
Model
FC Method
d
c
Fourier Modes
Learning Rate
FC–PINO
FC–Gram
6
50
24
0.0001
FC–Legendre
4
70
48
0.001
PINO In–FC
FC–Gram
4
50
24
0.005
FC–Legendre
5
70
24
0.0001
PINO Out–FC
FC–Gram
4
50
24
0.001
FC–Legendre
6
50
48
0.005
Appendix
Table 9: Optimal Hyperparameters for the PINO models for the 1D Burgers equation.
Model
FC Method
d
c
Learning Rate
FC–PINO
FC–Gram
4
50
0.0001
FC–Legendre
6
30
0.001
PINO In–FC
FC–Gram
6
50
0.0001
FC–Legendre
6
40
0.001
PINO Out–FC
FC–Gram
6
50
0.0001
FC–Legendre
6
80
0.001
Appendix
Table 10: Optimal Hyperparameters for the PINO models for the 2D Burgers equation.
Model
FC Method
d
c
Spatial Modes
Temporal Modes
FC–PINO
FC–Gram
8
50
32
20
FC–Legendre
7
40
32
20
PINO In–FC
FC–Gram
7
50
32
24
FC–Legendre
8
60
32
24
PINO Out–FC
FC–Gram
8
50
32
20
FC–Legendre
8
60
32
24
Appendix
Table 11: Optimal Hyperparameters for the PINO models for the 3D Navier–Stokes equation.
Figure 7: Predicted solutions of PINO architectures for the 1D Burger’s equation.
Figure 8: Predicted solutions when fine-tuning pretrained FC–PINO models on different λ values for the 1D Burgers’ equation.
Figure 9: Predicted solutions ( top five ) and corresponding PDE residuals ( bottom five ) for baseline PINO architectures and FC–PINO variants for the 2D Burgers’ equation.
Figure 10: Predicted solutions ( top five ) and corresponding PDE residuals ( bottom five ) for baseline PINO architectures and FC–PINO variants for the horizontal velocity component of the Navier–Stokes equations.
Figure 11: Predicted solutions ( top five ) and corresponding PDE residuals ( bottom five ) for baseline PINO architectures and FC–PINO variants for the horizontal velocity component of the Navier–Stokes equations.
Figure 12: Evolution of the PDE residual loss for the 1D Burgers’ equation with FC–PINO .
Figure 13: Evolution of the PDE residual loss for the 2D Burgers’ equation with FC–PINO .
Figure 14: Evolution of the PDE residual for the Navier–Stokes equations with FC–PINO .
Figure 15: Evolution of the total loss as a function of time for the 1D Burgers’ equation with the different PINO approaches. To allow for a cleaner visualization, we display the time taken to reach certain threshold loss values for the first time as a solid line. The dotted line then connects the loss at the last threshold value and the loss at 360 seconds.
Figure 16: Evolution of the PDE residual loss as a function of time for the 2D Burgers’ equation with the different PINO approaches. To allow for a cleaner visualization, we display the time taken to reach certain threshold loss values for the first time as a solid line. The dotted line then connects the loss at the last threshold value and the loss at 60 minutes.
Figure 17: Evolution of the PDE residual as a function of time for the Navier–Stokes equations with the different PINO approaches. To allow for a cleaner visualization, we display the time taken to reach certain threshold loss values for the first time as a solid line. The dotted line then connects the loss at the last threshold value and the final loss at the final value.
Physics-informed neural operators learn mappings between physical fields while embedding governing equations or structural constraints for faster, more reliable simulation.
National Center for Artificial Intelligence, Santiago, Chile · Department of Mechanical Engineering and Applied Mechanics, University of Pennsylvania, Philadelphia, PA, USA · Department of Mathematics, Pontificia Universidad Católica de Chile, Santiago, Chile +3
College of Civil Engineering, Tongji University, Shanghai 200092 · Department of Engineering Science, University of Oxford, Oxford OX1 3PJ · Institute for Foundations of Data Science, Yale University, New Haven, CT 06520