Burgers' PINNs with transfer learning by θ-scheme

The Burgers equation is a well-established test case in the computational modeling of several phenomena, such as fluid dynamics, gas dynamics, shock theory, cosmology and others. In this work, we present the application of physics-informed neural networks (PINNs) with a transfer learning approach using the θ-scheme to solve the Burgers' equation. The proposed approach consists of searching for a discrete solution in time through a sequence of artificial neural networks (ANNs). At each time step, the previous ANN transfers its learning to the next network model, which learns the solution in the current time by minimizing a loss function based on the θ-scheme approximation of the Burgers' equation. To test this approach, we present its application to two benchmark problems with known analytical solutions. Compared to usual PINN models, the proposed approach has the advantage of requiring smaller neural network architectures with similar accurate results and potentially decreasing computational costs.

Authors

Institutions

Publication Details

Journal
Ciência e Natura
Published
2025-01-15
DOI
https://doi.org/10.5902/2179460x89888
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Burgers' PINNs with transfer learning by θ-scheme

Vitória Biesek, Pedro Henrique de Almeida Konzen
Ciência e Natura
Model Reduction and Neural Networks
article

Burgers' PINNs with transfer learning by θ-scheme

Vitória Biesek, Pedro Henrique de Almeida Konzen
article en

Abstract

The Burgers equation is a well-established test case in the computational modeling of several phenomena, such as fluid dynamics, gas dynamics, shock theory, cosmology and others. In this work, we present the application of physics-informed neural networks (PINNs) with a transfer learning approach using the θ-scheme to solve the Burgers' equation. The proposed approach consists of searching for a discrete solution in time through a sequence of artificial neural networks (ANNs). At each time step, the previous ANN transfers its learning to the next network model, which learns the solution in the current time by minimizing a loss function based on the θ-scheme approximation of the Burgers' equation. To test this approach, we present its application to two benchmark problems with known analytical solutions. Compared to usual PINN models, the proposed approach has the advantage of requiring smaller neural network architectures with similar accurate results and potentially decreasing computational costs.

Ciência e NaturaVol. 47(esp. 1)
Universidade Federal do Rio Grande do Sul (BR)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Openalex Percentile: Top 97%
Model Reduction and Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Burgers' PINNs with transfer learning by θ-scheme — Vitória Biesek, Pedro Henrique de Almeida Konzen · Ciência e Natura (2025) | TGRS Research Map | TGRS