Collocation-based robust variational physics-informed neural networks (CRVPINNs)

Physics-informed neural networks (PINNs) have been widely used to solve partial differential equations (PDEs) through strong residual minimization formulations. Their extension to weak scenarios via Variational PINNs (VPINNs) has been shown to lack robustness when the discrete and continuous-level norms are mismatched. Robust Variational PINNs (RVPINNs) address this problem by appropriately incorporating the Gram matrix but suffer from high computational costs due to the weak residual integration and the Gram matrix inversion. In this work, we accelerate RVPINN computations by using a point-collocation approach similar to PINNs, and by employing an LU factorization of the sparse Gram matrix. This leads to the proposed Collocation-Based Robust Variational PINN (CRVPINN). We validate CRVPINN on Laplace, advection–diffusion, Stokes, non-linear stationary Navier–Stokes, and linear elasticity problems in two spatial dimensions, demonstrating improved efficiency without compromising robustness.

Authors

Publication Details

Journal
Computers & Structures
Published
2025-06-03
DOI
https://doi.org/10.1016/j.compstruc.2025.107839
Citations
6
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
7.94
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collocation-based robust variational physics-informed neural networks (CRVPINNs)

Carlos Uriarte, Paweł Maczuga, Marcin Łoś, Maciej Paszyński et al.
6 citations
Computers & Structures
Model Reduction and Neural Networks
7.94
article

Collocation-based robust variational physics-informed neural networks (CRVPINNs)

Carlos Uriarte, Paweł Maczuga, Marcin Łoś, Maciej Paszyński, Tomasz Służalec, Askold Vilkha
article en
6 citations

Abstract

Physics-informed neural networks (PINNs) have been widely used to solve partial differential equations (PDEs) through strong residual minimization formulations. Their extension to weak scenarios via Variational PINNs (VPINNs) has been shown to lack robustness when the discrete and continuous-level norms are mismatched. Robust Variational PINNs (RVPINNs) address this problem by appropriately incorporating the Gram matrix but suffer from high computational costs due to the weak residual integration and the Gram matrix inversion. In this work, we accelerate RVPINN computations by using a point-collocation approach similar to PINNs, and by employing an LU factorization of the sparse Gram matrix. This leads to the proposed Collocation-Based Robust Variational PINN (CRVPINN). We validate CRVPINN on Laplace, advection–diffusion, Stokes, non-linear stationary Navier–Stokes, and linear elasticity problems in two spatial dimensions, demonstrating improved efficiency without compromising robustness.

Computers & StructuresVol. 316
Openalex Percentile: Top 3%
Model Reduction and Neural Networks
7.94
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.