Isabella Carla Gonnella

2papers

2 Papers

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

Giacomo Venier, Isabella Carla Gonnella, Federico Pichi et al.

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.

NAJan 24, 2023
A two stages Deep Learning Architecture for Model Reduction of Parametric Time-Dependent Problems

Isabella Carla Gonnella, Martin W. Hess, Giovanni Stabile et al.

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.