arXiv subjects

Serge Prudhomme

Publications and source records attributed to Serge Prudhomme.

13 recordsLinked to original sources

arXiv2026

Waves 2026 Book of Abstracts

WAVES 2026, 17th International Conference on Mathematical and Numerical Aspects of Wave Propagation Concordia University (John Molson Building), Montreal, Canada, June 22-26, 2026 WAVES 2026 is the seventeenth meeting in a long-running biennial series that has, throughout its history, alternated between Europe and North America to advance the mathematical and numerical study of wave propagation. Hosted at the John Molson Building of Concordia University in Montreal from June 22 to 26, 2026, the conference continues this tradition as a leading international forum where theory, computation, and application meet. The scientific program spans the full breadth of mathematical and numerical techniques for wave phenomena, from the modeling and analysis of the governing partial differential equations to the design, analysis, and implementation of efficient computational methods. Representative themes include acoustic, electromagnetic, elastic, and seismic wave propagation; scattering and inverse problems; high-frequency and asymptotic methods; finite element, boundary integral, and time-domain discretizations; and absorbing boundary conditions and domain truncation, with applications reaching across the physical sciences and engineering.

math.NA↗

arXiv2026

Accelerated estimation of quantities of interest via adjoint-based model reduction

We introduce an adjoint-based reduced-order model framework for fast and accurate estimation of quantities of interest for many-query linear problems. The method builds a reduced-order model with respect to the adjoint problem, thus bypassing the solution of the primal problem and drastically reducing computational cost. It creates a surrogate model that is independent of the loading configurations. It enables fast evaluation across multiple load cases and the generation of virtual charts to support decision-making. Numerical experiments on the Poisson equation and a plane-stress elasticity problem demonstrate that the adjoint reduced-order model converges rapidly, outperforms its primal counterpart, and provides reliable estimates of the quantities of interest. Importantly, it is often more practical to parameterize a kernel function than an entire set of external loads, making the method generic and particularly suited for early-stage prototyping and design optimization.

cs.CE↗

arXiv2025

Coupling approaches with non-matching grids for classical linear elasticity and bond-based peridynamic models in 1D

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. The effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.

cs.CE↗

arXiv2024

An Efficient PGD Solver for Structural Dynamics Applications

We propose in this paper a Proper Generalized Decomposition (PGD) solver for reduced-order modeling of linear elastodynamic problems. It primarily focuses on enhancing the computational efficiency of a previously introduced PGD solver based on the Hamiltonian formalism. The novelty of this work lies in the implementation of a solver that is halfway between Modal Decomposition and the conventional PGD framework, so as to accelerate the fixed-point iteration algorithm. Additional procedures such that Aitken's delta-squared process and mode-orthogonalization are incorporated to ensure convergence and stability of the algorithm. Numerical results regarding the ROM accuracy, time complexity, and scalability are provided to demonstrate the performance of the new solver when applied to dynamic simulation of a three-dimensional structure.

cs.CE↗

arXiv2024

ML-based identification of the interface regions for coupling local and nonlocal models

Local-nonlocal coupling approaches combine the computational efficiency of local models and the accuracy of nonlocal models. However, the coupling process is challenging, requiring expertise to identify the interface between local and nonlocal regions. This study introduces a machine learning-based approach to automatically detect the regions in which the local and nonlocal models should be used in a coupling approach. This identification process uses the loading functions and provides as output the selected model at the grid points. Training is based on datasets of loading functions for which reference coupling configurations are computed using accurate coupled solutions, where accuracy is measured in terms of the relative error between the solution to the coupling approach and the solution to the nonlocal model. We study two approaches that differ from one another in terms of the data structure. The first approach, referred to as the full-domain input data approach, inputs the full load vector and outputs a full label vector. In this case, the classification process is carried out globally. The second approach consists of a window-based approach, where loads are preprocessed and partitioned into windows and the problem is formulated as a node-wise classification approach in which the central point of each window is treated individually. The classification problems are solved via deep learning algorithms based on convolutional neural networks. The performance of these approaches is studied on one-dimensional numerical examples using F1-scores and accuracy metrics. In particular, it is shown that the windowing approach provides promising results, achieving an accuracy of 0.96 and an F1-score of 0.97. These results underscore the potential of the approach to automate coupling processes, leading to more accurate and computationally efficient solutions for material science applications.

cs.LG↗

arXiv2023

Multi-level Neural Networks for Accurate Solutions of Boundary-Value Problems

The solution to partial differential equations using deep learning approaches has shown promising results for several classes of initial and boundary-value problems. However, their ability to surpass, particularly in terms of accuracy, classical discretization methods such as the finite element methods, remains a significant challenge. Deep learning methods usually struggle to reliably decrease the error in their approximate solution. A new methodology to better control the error for deep learning methods is presented here. The main idea consists in computing an initial approximation to the problem using a simple neural network and in estimating, in an iterative manner, a correction by solving the problem for the residual error with a new network of increasing complexity. This sequential reduction of the residual of the partial differential equation allows one to decrease the solution error, which, in some cases, can be reduced to machine precision. The underlying explanation is that the method is able to capture at each level smaller scales of the solution using a new network. Numerical examples in 1D and 2D are presented to demonstrate the effectiveness of the proposed approach. This approach applies not only to physics informed neural networks but to other neural network solvers based on weak or strong formulations of the residual.

math.NA↗

arXiv2023

Operator approximation of the wave equation based on deep learning of Green's function

Deep operator networks (DeepONets) have demonstrated their capability of approximating nonlinear operators for initial- and boundary-value problems. One attractive feature of DeepONets is their versatility since they do not rely on prior knowledge about the solution structure of a problem and can thus be directly applied to a large class of problems. However, convergence in identifying the parameters of the networks may sometimes be slow. In order to improve on DeepONets for approximating the wave equation, we introduce the Green operator networks (GreenONets), which use the representation of the exact solution to the homogeneous wave equation in term of the Green's function. The performance of GreenONets and DeepONets is compared on a series of numerical experiments for homogeneous and heterogeneous media in one and two dimensions.

math.NA↗

arXiv2023

Optimal Design of Validation Experiments for the Prediction of Quantities of Interest

Numerical predictions of quantities of interest measured within physical systems rely on the use of mathematical models that should be validated, or at best, not invalidated. Model validation usually involves the comparison of experimental data (outputs from the system of interest) and model predictions, both obtained at a specific validation scenario. The design of this validation experiment should be directly relevant to the objective of the model, that of predicting a quantity of interest at a prediction scenario. In this paper, we address two specific issues arising when designing validation experiments. The first issue consists in determining an appropriate validation scenario in cases where the prediction scenario cannot be carried out in a controlled environment. The second issue concerns the selection of observations when the quantity of interest cannot be readily observed. The proposed methodology involves the computation of influence matrices that characterize the response surface of given model functionals. Minimization of the distance between influence matrices allow one for selecting a validation experiment most representative of the prediction scenario. We illustrate our approach on two numerical examples. The first example considers the validation of a simple model based on an ordinary differential equation governing an object in free fall to put in evidence the importance of the choice of the validation experiment. The second numerical experiment focuses on the transport of a pollutant and demonstrates the impact that the choice of the quantity of interest has on the validation experiment to be performed.

cs.CE↗

arXiv2023

PGD reduced-order modeling for structural dynamics applications

We propose in this paper a Proper Generalized Decomposition (PGD) approach for the solution of problems in linear elastodynamics. The novelty of the work lies in the development of weak formulations of the PGD problems based on the Lagrangian and Hamiltonian Mechanics, the main objective being to devise numerical methods that are numerically stable and energy conservative. We show that the methodology allows one to consider the Galerkin-based version of the PGD and numerically demonstrate that the PGD solver based on the Hamiltonian formulation offers better stability and energy conservation properties than the Lagrangian formulation. The performance of the two formulations is illustrated and compared on several numerical examples describing the dynamical behavior of a one-dimensional bar.

cs.CE↗

arXiv2022

Coupling approaches for classical linear elasticity and bond-based peridynamic models

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. This paper studies the continuous and discrete formulations of three existing approaches for the coupling of classical linear elasticity and bond-based peridynamic models, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. The performance of the three coupling approaches is compared on a series of one-dimensional numerical examples that involve cubic and quartic manufactured solutions. Accuracy of the proposed methods is measured in terms of the difference between the solution to the coupling approach and the solution to the classical linear elasticity model, which can be viewed as a modeling error. The objective of the paper is to assess the quality and performance of the discrete formulation for this class of force-based coupling methods.

cs.CE↗

arXiv2020

On the treatment of boundary conditions for bond-based peridynamic models

In this paper, we propose two approaches to apply boundary conditions for bond-based peridynamic models. There has been in recent years a renewed interest in the class of so-called non-local models, which include peridynamic models, for the simulation of structural mechanics problems as an alternative approach to classical local continuum models. However, a major issue, which is often disregarded when dealing with this class of models, is concerned with the manner by which boundary conditions should be prescribed. Our point of view here is that classical boundary conditions, since applied on surfaces of solid bodies, are naturally associated with local models. The paper describes two methods to incorporate classical Dirichlet and Neumann boundary conditions into bond-based peridynamics. The first method consists in artificially extending the domain with a thin boundary layer over which the displacement field is required to behave as an odd function with respect to the boundary points. The second method resorts to the idea that peridynamic models and local models should be compatible in the limit that the so-called horizon vanishes. The approach consists then in decreasing the horizon from a constant value in the interior of the domain to zero at the boundary so that one can directly apply the classical boundary conditions. We present the continuous and discrete formulations of the two methods and assess their performance on several numerical experiments dealing with the simulation of a one-dimensional bar.

cs.CE↗

arXiv2018

Probabilistic modeling and global sensitivity analysis for $CO_2$ storage in geological formations: a spectral approach

This work focuses on the simulation of $CO_2$ storage in deep underground formations under uncertainty and seeks to understand the impact of uncertainties in reservoir properties on $CO_2$ leakage. To simulate the process, a non-isothermal two-phase two-component flow system with equilibrium phase exchange is used. Since model evaluations are computationally intensive, instead of traditional Monte Carlo methods, we rely on polynomial chaos (PC) expansions for representation of the stochastic model response. A non-intrusive approach is used to determine the PC coefficients. We establish the accuracy of the PC representations within a reasonable error threshold through systematic convergence studies. In addition to characterizing the distributions of model observables, we compute probabilities of excess $CO_2$ leakage. Moreover, we consider the injection rate as a design parameter and compute an optimum injection rate that ensures that the risk of excess pressure buildup at the leaky well remains below acceptable levels. We also provide a comprehensive analysis of sensitivities of $CO_2$ leakage, where we compute the contributions of the random parameters, and their interactions, to the variance by computing first, second, and total order Sobol' indices.

stat.CO↗

arXiv2011

Optimal Data Split Methodology for Model Validation

The decision to incorporate cross-validation into validation processes of mathematical models raises an immediate question - how should one partition the data into calibration and validation sets? We answer this question systematically: we present an algorithm to find the optimal partition of the data subject to certain constraints. While doing this, we address two critical issues: 1) that the model be evaluated with respect to predictions of a given quantity of interest and its ability to reproduce the data, and 2) that the model be highly challenged by the validation set, assuming it is properly informed by the calibration set. This framework also relies on the interaction between the experimentalist and/or modeler, who understand the physical system and the limitations of the model; the decision-maker, who understands and can quantify the cost of model failure; and the computational scientists, who strive to determine if the model satisfies both the modeler's and decision maker's requirements. We also note that our framework is quite general, and may be applied to a wide range of problems. Here, we illustrate it through a specific example involving a data reduction model for an ICCD camera from a shock-tube experiment located at the NASA Ames Research Center (ARC).

physics.data-an↗