Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Physica D: Nonlinear Phenomena Année : 2004

Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems

Résumé

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.

Dates et versions

hal-00013147 , version 1 (03-11-2005)

Identifiants

Citer

Antonio Celani, Massimo Cencini, Alain Noullez. Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems. Physica D: Nonlinear Phenomena, 2004, 195, pp.283-291. ⟨10.1016/j.physd.2004.04.001⟩. ⟨hal-00013147⟩
190 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More