Development of decoupled numerical scheme in solving dynamical systems on parallel computing architecture

In this thesis, we are interested in parallelization algorithm for solving dynamical systems. Many industrial applications nowadays lead to large systems of huge number of variables. A such dynamical system requires parallel method in order to be solved on parallel computers. Our goal is to find a robust numerical method satisfying stability and consistency properties and suitable to be implemented in parallel machines. The first method developed in this thesis consists in decoupling dynamical system into independent subsystems and using polynomial extrapolation for coupled terms between subsystems. Such a method is called C(p; q; j).We have extended this numerical scheme to adaptive time steps. However, this method admits poor numerical properties and therefore cannot be applied in solving stiff systems with strong coupling terms.When dealing with systems whose variables are strongly coupled, contrary to the technique of using extrapolation for coupled terms, one may suggest to use reduced order models to replace those terms and solve separately each independent subsystems. Thus, we introduced the second approach consisting in using order reduction technique in decoupling dynamical systems. The order reduction method uses the Proper Orthogonal Decomposition. Therefore, when constructing reduced order models, we do not have all the solutions required for the POD basis, then we developed a technique of updating the POD during the simulation process. This method is applied successfully to solve different examples of dynamical systems : one example of stiff ODE provided from PDE and the other was the ODE system provided from the Nervier-Stokes equations. As a result, we have proposed a robust method of decoupling dynamical system based on reduced order technique. We have obtained good approximations to the reference solution with appropriated precision. Moreover, we obtained a great performance when solving the problem on parallel computers.

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00838596
Author Pham, Duc Toan
Maintainer CCSD
Last Updated May 10, 2026, 13:43 (UTC)
Created May 10, 2026, 13:43 (UTC)
Identifier NNT: 2010LYO10166
Language fr
Rights https://about.hal.science/hal-authorisation-v1/
contributor Institut Camille Jordan (ICJ) ; École Centrale de Lyon (ECL) ; Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL) ; Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon) ; Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM) ; Université Jean Monnet (EPSCPE) (UJM EPE)-Université Jean Monnet (EPSCPE) (UJM EPE)-Centre National de la Recherche Scientifique (CNRS)
creator Pham, Duc Toan
date 2010-09-30T00:00:00
harvest_object_id c2468c34-ae81-4cee-99b5-92986eded67e
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-04-23T00:00:00
set_spec type:THESE