• Aucun résultat trouvé

Parareal algorithm

An Adaptive Parareal Algorithm

An Adaptive Parareal Algorithm

... an algorithm where the accuracy of these computations is increased across the ...the parareal algorithm in an infinite dimensional function ...the algorithm, the new approach presents several ...

21

Multi-step variant of parareal algorithm

Multi-step variant of parareal algorithm

... the parareal method ...the parareal algorithm to multi- step schemes that is not implemented in the ...the parareal algorithm, and then detail the variant that allows us to use ...

10

An adaptive parareal algorithm: application to the simulation of molecular dynamics trajectories

An adaptive parareal algorithm: application to the simulation of molecular dynamics trajectories

... 2.2.3 Parareal within a single well of the potential energy In all the experiments on LJ7-2d, we work with parameters (time horizon T , friction coefficient γ, inverse temperature β, ...the parareal ...

37

PARAOPT: A parareal algorithm for optimality systems

PARAOPT: A parareal algorithm for optimality systems

... the parareal algorithm [45, 2, 30, 33, 20, 11, 18, 40], methods based on waveform relaxation [32, 8, 19, 21, 13, 14, 31, 39, 1, 15], methods based on multigrid [27, 34, 53, 28, 6, 17, 7, 41, 4], and direct ...

32

An Adaptive Parareal Algorithm

An Adaptive Parareal Algorithm

... the parareal algorithm opens the door to improve significantly the parallel efficiency of the method provided that the cost of the coarse solver is ...adaptive parareal with adaptive space-time ...

22

Coupling Parareal with Optimized Schwarz waveform relaxation for parabolic problems

Coupling Parareal with Optimized Schwarz waveform relaxation for parabolic problems

... coupled Parareal - OSWR method on one- dimensional parabolic ...coupled Parareal-OSWR algorithm and prove a general convergence result for the method via energy estimates in Section ...(OSWR, ...

22

Stable time-parallel integration of advection dominated problems using Parareal with space coarsening

Stable time-parallel integration of advection dominated problems using Parareal with space coarsening

... [R1] Ruprecht and Krause, "Explicit parallel-in-time integration of a linear acoustic-advection system" 2012 [R2] Gander, "Analysis of the Parareal algorithm applied to hyperbolic proble[r] ...

19

Reduced model-based parareal simulations of oscillatory singularly perturbed ordinary differential equations

Reduced model-based parareal simulations of oscillatory singularly perturbed ordinary differential equations

... the parareal method and describe our strategy as applied in the context of stiff ordinary differential ...the parareal strategy provides accurate results together with computational efficiency through ...

26

Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model

Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model

... the parareal in time algorithm [5, 6] on neutron diffu- sion equation that governs the time-dependent flux distribution in the reactor ...The parareal in time algorithm is an iterative scheme, ...

17

TOWARDS A FULLY SCALABLE BALANCED PARAREAL METHOD: APPLICATION TO NEUTRONICS

TOWARDS A FULLY SCALABLE BALANCED PARAREAL METHOD: APPLICATION TO NEUTRONICS

... a parareal scheme in which these alternative iterations are truncated ...each parareal iteration but in which convergence is nevertheless achieved across the parareal ...the parareal ...

27

Monotonic Parareal Control for Quantum Systems

Monotonic Parareal Control for Quantum Systems

... and the fine propagators for these numerical tests. In particular, a coarser propagator should improve this result. 5.4. About the full efficiency. Consider again N = 10 identical subintervals. An ideal time ...

15

A hybrid parareal Monte Carlo algorithm for parabolic problems *

A hybrid parareal Monte Carlo algorithm for parabolic problems *

... the parareal procedure are deterministic. For instance a parareal procedure for the Navier–Stokes equation in the context of finite elements and spectral methods has been proposed in [ 21 ...the ...

22

States based evolutionary algorithm

States based evolutionary algorithm

... is different than those of the meta-parameters. A crucial point is to well adjust the two dynamics in order they work in concordance. Like the bandit methods used in previous works, the SEA uses an exploitation ...

11

Formally-Proven Kosaraju's algorithm

Formally-Proven Kosaraju's algorithm

... Wf r (s, x :: l) ⇒ (x ←→ ∗ r,s y) = ((y ∈ x :: l) && y −→ ∗ r,s x). With these two properties, it is almost direct to prove the correctness of Kosaraju’s algorithm. We only use notions that are present in ...

13

Katz's middle convolution algorithm

Katz's middle convolution algorithm

... − {q 1 , . . . , q n }. We describe the Betti and de Rham versions, and point out that they give isomorphisms between different moduli spaces of local systems, following V¨ olklein, Dettweiler-Reiter, Haraoka-Yokoyama. ...

54

The Tamed Unadjusted Langevin Algorithm

The Tamed Unadjusted Langevin Algorithm

... Langevin Algorithm (ULA) first introduced in the physics literature by [ Par81 ] and popularised in the computational statistics community by [ Gre83 ] and [ GM94 ] is a technique to sample complex and ...

36

The Support Splitting Algorithm

The Support Splitting Algorithm

... Unit´e de recherche INRIA Lorraine, Technopˆole de Nancy-Brabois, Campus scientifique, ` NANCY 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LES Unit´e de recherche INRIA Rennes, Ir[r] ...

37

An iterative Euclidean algorithm

An iterative Euclidean algorithm

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

46

Fast adaptive ESPRIT algorithm

Fast adaptive ESPRIT algorithm

... ESPRIT algorithm for track- ing the spectral matrix were already proposed in the literature, based on specific subspace ...updating algorithm [3], and that proposed in [4] is based on the rank-revealing URV ...

6

Dynamic Evidential Clustering Algorithm

Dynamic Evidential Clustering Algorithm

... means algorithm [5] can be regarded as the representative of hard ...c-means algorithm (FCM) [6], [8] is the ...clustering algorithm is introduced by modifying ...

15

Show all 1564 documents...

Sujets connexes