arXiv subjects

Isabella Carla Gonnella

Publications and source records attributed to Isabella Carla Gonnella.

5 recordsLinked to original sources

arXiv2026

A Dynamical Approximation Scheme on the Stiefel manifold for Wasserstein Gradient Flows

We propose a meshless Lagrangian dynamical method for approximating Wasserstein gradient flows (WGFs). The evolving measure is represented as the pushforward of the initial measure $μ_0$ through a transport map in the weighted Hilbert space $L^2_{μ_0}$. We approximate this map in time-dependent linear subspaces of $L^2_{μ_0}$, whose orthonormal frames are evolved by a Dirac--Frenkel dynamical principle on a Stiefel manifold constrained to a finite-dimensional background space, adaptively constructed via local approximations of the WGF velocity field. We prove that the resulting transport map induces an absolutely continuous curve of probability measures in Wasserstein space, whose velocity is obtained by projecting the exact WGF velocity onto the background space, and we show that the approximation preserves the energy dissipation structure up to the projection error of the velocity. Moreover, for geodesically convex energies, we derive an a posteriori estimate controlling such projection error through the adaptive construction of the background space, yielding as well a bound on the approximation error of the pushforward measure in the Wasserstein metric. Numerical experiments on linear and nonlinear Fokker--Planck equations, porous-medium diffusion, and interaction energies demonstrate the accuracy of the method, its energy-dissipation properties, and the advantages of the adaptive construction.

math.NA↗

arXiv2026

Stochastic bifurcation analysis via polynomial chaos: consistency and convergence of branch-approximating solutions

Parameter-dependent dynamical systems that exhibit bifurcations pose significant computational challenges, as traditional continuation methods require repeated, costly simulations across large ranges of parameter values to capture sudden qualitative changes in the solution. In this work, we propose a systematic approach to reconstruct the branches of the entire bifurcation diagram in a single numerical solver leveraging generalized Polynomial Chaos (PC) expansion. By treating the parameter as a random variable, we cast the deterministic parameter-dependent model in a weak stochastic form, and then use a Galerkin projection to recover bifurcation branches globally across the parameter domain without iterative pointwise continuation. We show that the resulting Galerkin system, in the non-uniqueness regime, produces many discrete algebraic roots that naturally split into two classes: highly oscillatory solutions and branch-approximating ones. We develop a rigorous theoretical framework that establishes consistency, proves convergence of the branch-approximating solutions to the true steady states, and guarantees uniqueness of the Galerkin solution under suitable assumptions. Finally, we confirm these theoretical results with numerical experiments on several parameter-dependent ordinary differential equations (ODEs), demonstrating the accuracy and computational efficiency of our single-run framework in capturing complex bifurcation diagrams for both scalar and vector-valued systems.

math.NA↗

arXiv2026

A stochastic perturbation approach to nonlinear bifurcating problems

Incorporating probabilistic terms in mathematical models is crucial for capturing and quantifying uncertainties in real-world systems, especially when the solution is not unique or exhibits sudden qualitative changes as parameters vary. However, stochastic models typically require large computational resources to produce meaningful statistics. In this work, we leverage the Polynomial Chaos (PC) expansion to propose a systematic approach for bifurcation detection in parametric systems of equations. We show that the method, exploiting a perturbed version of the deterministic model, avoids repeated costly simulations across multiple parameter values and requires no prior information for initializing numerical solvers, while still providing accurate characterization of the bifurcation branches. We argue that the PC solutions of the perturbed model not only provide access to statistical information about the deterministic branches, but also approximate these branches in a meaningful sense. Finally, we validate our claims by means of numerical tests on the pitchfork bifurcation, examining both its normal form and a classical realization in fluid-dynamics PDEs, namely the Coanda effect.

math.NA↗

arXiv2026

Nonlinear reduction strategies for data compression: a comprehensive comparison from diffusion to advection problems

This work presents an overview of several nonlinear reduction strategies for data compression from various research fields, and a comparison of their performance when applied to problems characterized by diffusion and/or advection terms. We aim to create a common framework by unifying the notation referring to a common two-stage pipeline. At the same time, we underline their main differences and objectives by highlighting the diverse choices made for each stage. We test the considered approaches on three test cases belonging to the family of Advection-Diffusion problems, also focusing on the pure Advection and pure Diffusion benchmarks, studying their reducibility while varying the latent dimension. Finally, we interpret the numerical results under the lens of the discussed theoretical considerations, offering a comprehensive landscape for nonlinear reduction methods for general Advection-Diffusion dynamics.

math.NA↗

arXiv2023

A two stages Deep Learning Architecture for Model Reduction of Parametric Time-Dependent Problems

Parametric time-dependent systems are of a crucial importance in modeling real phenomena, often characterized by non-linear behaviors too. Those solutions are typically difficult to generalize in a sufficiently wide parameter space while counting on limited computational resources available. As such, we present a general two-stages deep learning framework able to perform that generalization with low computational effort in time. It consists in a separated training of two pipe-lined predictive models. At first, a certain number of independent neural networks are trained with data-sets taken from different subsets of the parameter space. Successively, a second predictive model is specialized to properly combine the first-stage guesses and compute the right predictions. Promising results are obtained applying the framework to incompressible Navier-Stokes equations in a cavity (Rayleigh-Bernard cavity), obtaining a 97% reduction in the computational time comparing with its numerical resolution for a new value of the Grashof number.

math.NA↗