SearcharxivSearch

arXiv subjects

Stephane Gaudreault

Publications and source records attributed to Stephane Gaudreault.

2 recordsLinked to original sources

Fast and Flexible Probabilistic Forecasting of Dynamical Systems using Flow Matching and Physical Perturbation

Learning dynamical systems from incomplete or noisy data is inherently ill-posed, as a single observation may correspond to multiple plausible futures. While physics-based ensemble forecasting relies on perturbing initial states to capture uncertainty, standard Gaussian or uniform perturbations often yield unphysical initial states in high-dimensional systems. Existing machine learning approaches address this via diffusion models, which rely on inference via computationally expensive stochastic differential equations (SDEs). We introduce a novel framework that decouples perturbation generation from propagation. First, we propose a flow matching-based generative approach to learn physically consistent perturbations of the initial conditions, avoiding artifacts caused by Gaussian noise. Second, we employ deterministic flow matching models with Ordinary Differential Equation (ODE) integrators for efficient ensemble propagation with fewer integration steps. We validate our method on nonlinear dynamical system benchmarks, including the Lotka-Volterra Predator-Prey system, MovingMNIST, and high-dimensional WeatherBench data (5.625$^\circ$). Our approach achieves state-of-the-art probabilistic scoring, as measured by the Continuous Ranked Probability Score (CRPS), and physical consistency, while offering significantly faster inference than diffusion-based baselines.

cs.LG

Augmented Block-Arnoldi Recycling CFD Solvers

One of the limitations of recycled GCRO methods is the large amount of computation required to orthogonalize the basis vectors of the newly generated Krylov subspace for the approximate solution when combined with those of the recycle subspace. Recent advancements in low synchronization Gram-Schmidt and generalized minimal residual algorithms, Swirydowicz et al.~\cite{2020-swirydowicz-nlawa}, Carson et al. \cite{Carson2022}, and Lund \cite{Lund2022}, can be incorporated, thereby mitigating the loss of orthogonality of the basis vectors. An augmented Arnoldi formulation of recycling leads to a matrix decomposition and the associated algorithm can also be viewed as a {\it block} Krylov method. Generalizations of both classical and modified block Gram-Schmidt algorithms have been proposed, Carson et al.~\cite{Carson2022}. Here, an inverse compact $WY$ modified Gram-Schmidt algorithm is applied for the inter-block orthogonalization scheme with a block lower triangular correction matrix $T_k$ at iteration $k$. When combined with a weighted (oblique inner product) projection step, the inverse compact $WY$ scheme leads to significant (over 10$\times$ in certain cases) reductions in the number of solver iterations per linear system. The weight is also interpreted in terms of the angle between restart residuals in LGMRES, as defined by Baker et al.\cite{Baker2005}. In many cases, the recycle subspace eigen-spectrum can substitute for a preconditioner.

math.NA