Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems
Antonio Celani, Massimo Cencini, Alain Noullez
Abstract
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the cost factor is only logarithmic in the number of time-steps. As an example, we discuss the solution of the final-value problem for a Fokker-Planck equation whose drift velocity solves a different initial-value problem -- a relevant issue in the context of turbulent scalar transport.
Create a lesson
Related papers
RAT-EC: Introducing a New Open-Source 3D Volume-Integral Eddy-Current Module
Daniel Mayr, Jeroen van Nugteren, Julien Dular et al.
A Scalable Sharp-Interface Immersed Boundary Method for Moving Boundary Flow Simulation on Multi-GPU Systems
Sushrut Kumar, Joshua Romero, Massimiliano Fatica et al.
A differentiable PCA-GPR surrogate framework for full-transient Bayesian inverse uncertainty quantification of black-box nuclear thermal-hydraulic systems
Zikang Yaoa, Eugene Yeea, Fue-Sang Lien
An implicit multiscale solver for steady kinetic equations based on wave-particle decomposition
Chang Liu, Kun Xu
LAO+: Focused, Multi-Replica Accelerated Orthogonal Sampling for Robust Binding Free Energy Predictions
Narjes Ansari, Florent Hédin, Jérôme Hénin et al.
Learning to reconstruct Germano Differential Filtered Fields with Convolutional Neural Networks for Large Eddy Simulation of Plasma Turbulence
Jony Castagna, Josh Williams