Yvon Maday

Bio: Yvon Maday is an academic researcher from University of Paris. The author has contributed to research in topics: Discretization & Domain decomposition methods. The author has an hindex of 63, co-authored 321 publications receiving 13975 citations. Previous affiliations of Yvon Maday include Paris Diderot University & Southern University of Science and Technology.

Reliable Real-Time Solution of Parametrized Partial Differential Equations: Reduced-Basis Output Bound Methods

Abstract: We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential components are (i) (provably) rapidly convergent global reduced basis approximations, Galerkin projection onto a space W(sub N) spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation, relaxations of the error-residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs of interest; and (iii) off-line/on-line computational procedures, methods which decouple the generation and projection stages of the approximation process. The operation count for the on-line stage, in which, given a new parameter value, we calculate the output of interest and associated error bound, depends only on N (typically very small) and the parametric complexity of the problem; the method is thus ideally suited for the repeated and rapid evaluations required in the context of parameter estimation, design, optimization, and real-time control.

Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations

Abstract: In this paper, we extend the reduced-basis approximations developed earlier for linear elliptic and parabolic partial differential equations with affine parameter dependence to problems in- volving (a) nonaffine dependence on the parameter, and (b) nonlinear dependence on the field variable. The method replaces the nonaffine and nonlinear terms with a coefficient function approximation which then permits an efficient offline-online computational decomposition. We first review the coefficient function approximation procedure: the essential ingredients are (i) a good collateral reduced-basis approximation space, and (ii) a stable and inexpensive interpolation procedure. We then apply this approach to linear nonaffine and nonlinear elliptic and parabolic equations; in each instance, we discuss the reduced-basis approximation and the associated offline-online computational procedures. Numeri- cal results are presented to assess our approach.

Résolution d'EDP par un schéma en temps « pararéel »

Abstract: Resume On propose dans cette Note un schema permettant de profiter d'une architecture parallele pour la discretisation en temps d'une equation d'evolution aux derivees partielles. Cette methode, basee sur un schema d'Euler, combine des resolutions grossieres et des resolutions fines et independantes en temps en s'inspirant de ce qui est classique en espace. La parallelisation qui en resulte se fait dans la direction temporelle ce qui est en revanche non classique. Elle a pour principale motivation les problemes en temps reel, d'ou la terminologie proposee de «parareel ».

Spectral element methods for the incompressible Navier-Stokes equations

Abstract: Spectral element methods are high-order weighted-residual techniques for partial differential equations that combine the geometric flexibility of finite element techniques with the rapid convergence rate of spectral schemes. The theoretical foundations and numerical implementation of spectral element methods for the incompressible Navier-Stokes equations are presented, considering the construction and analysis of optimal-order spectral element discretizations for elliptic and saddle (Stokes) problems, as well as the efficient solution of the resulting discrete equations by rapidly convergent tensor-product-based iterative procedures. Several examples of spectral element simulation of moderate Reynolds number unsteady flow in complex geometry are presented.

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

Phd by thesis

Abstract: Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Numerical methods for conservation laws

Abstract: I Mathematical Theory- 1 Introduction- 11 Conservation laws- 12 Applications- 13 Mathematical difficulties- 14 Numerical difficulties- 15 Some references- 2 The Derivation of Conservation Laws- 21 Integral and differential forms- 22 Scalar equations- 23 Diffusion- 3 Scalar Conservation Laws- 31 The linear advection equation- 311 Domain of dependence- 312 Nonsmooth data- 32 Burgers' equation- 33 Shock formation- 34 Weak solutions- 35 The Riemann Problem- 36 Shock speed- 37 Manipulating conservation laws- 38 Entropy conditions- 381 Entropy functions- 4 Some Scalar Examples- 41 Traffic flow- 411 Characteristics and "sound speed"- 42 Two phase flow- 5 Some Nonlinear Systems- 51 The Euler equations- 511 Ideal gas- 512 Entropy- 52 Isentropic flow- 53 Isothermal flow- 54 The shallow water equations- 6 Linear Hyperbolic Systems 58- 61 Characteristic variables- 62 Simple waves- 63 The wave equation- 64 Linearization of nonlinear systems- 641 Sound waves- 65 The Riemann Problem- 651 The phase plane- 7 Shocks and the Hugoniot Locus- 71 The Hugoniot locus- 72 Solution of the Riemann problem- 721 Riemann problems with no solution- 73 Genuine nonlinearity- 74 The Lax entropy condition- 75 Linear degeneracy- 76 The Riemann problem- 8 Rarefaction Waves and Integral Curves- 81 Integral curves- 82 Rarefaction waves- 83 General solution of the Riemann problem- 84 Shock collisions- 9 The Riemann problem for the Euler equations- 91 Contact discontinuities- 92 Solution to the Riemann problem- II Numerical Methods- 10 Numerical Methods for Linear Equations- 101 The global error and convergence- 102 Norms- 103 Local truncation error- 104 Stability- 105 The Lax Equivalence Theorem- 106 The CFL condition- 107 Upwind methods- 11 Computing Discontinuous Solutions- 111 Modified equations- 1111 First order methods and diffusion- 1112 Second order methods and dispersion- 112 Accuracy- 12 Conservative Methods for Nonlinear Problems- 121 Conservative methods- 122 Consistency- 123 Discrete conservation- 124 The Lax-Wendroff Theorem- 125 The entropy condition- 13 Godunov's Method- 131 The Courant-Isaacson-Rees method- 132 Godunov's method- 133 Linear systems- 134 The entropy condition- 135 Scalar conservation laws- 14 Approximate Riemann Solvers- 141 General theory- 1411 The entropy condition- 1412 Modified conservation laws- 142 Roe's approximate Riemann solver- 1421 The numerical flux function for Roe's solver- 1422 A sonic entropy fix- 1423 The scalar case- 1424 A Roe matrix for isothermal flow- 15 Nonlinear Stability- 151 Convergence notions- 152 Compactness- 153 Total variation stability- 154 Total variation diminishing methods- 155 Monotonicity preserving methods- 156 l1-contracting numerical methods- 157 Monotone methods- 16 High Resolution Methods- 161 Artificial Viscosity- 162 Flux-limiter methods- 1621 Linear systems- 163 Slope-limiter methods- 1631 Linear Systems- 1632 Nonlinear scalar equations- 1633 Nonlinear Systems- 17 Semi-discrete Methods- 171 Evolution equations for the cell averages- 172 Spatial accuracy- 173 Reconstruction by primitive functions- 174 ENO schemes- 18 Multidimensional Problems- 181 Semi-discrete methods- 182 Splitting methods- 183 TVD Methods- 184 Multidimensional approaches

Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems

Abstract: We provide a framework for the analysis of a large class of discontinuous methods for second-order elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical treatment of elliptic problems.