Search results for "Numerical"
showing 10 items of 2002 documents
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Postprocessing of a Finite Element Scheme with Linear Elements
1987
In this contribution we first give a brief survey of postprocessing techniques for accelerating the convergence of finite element schemes for elliptic problems. We also generalize a local superconvergence technique recently analyzed by Křižek and Neittaanmaki ([20]) to a global technique. Finally, we show that it is possible to obtain O(h4) accuracy for the gradient in some cases when only linear elements are used. Numerical tests are presented.
Highly Accurate Conservative Finite Difference Schemes and Adaptive Mesh Refinement Techniques for Hyperbolic Systems of Conservation Laws
2007
We review a conservative finite difference shock capturing scheme that has been used by our research team over the last years for the numerical simulations of complex flows [3, 6]. This scheme is based on Shu and Osher’s technique [9] for the design of highly accurate finite difference schemes obtained by flux reconstruction procedures (ENO, WENO) on Cartesian meshes and Donat-Marquina’s flux splitting [4]. We then motivate the need for mesh adaptivity to tackle realistic hydrodynamic simulations on two and three dimensions and describe some details of our Adaptive Mesh Refinement (AMR) ([2, 7]) implementation of the former finite difference scheme [1]. We finish the work with some numerica…
The PCHIP subdivision scheme
2016
In this paper we propose and analyze a nonlinear subdivision scheme based on the monotononicity-preserving third order Hermite-type interpolatory technique implemented in the PCHIP package in Matlab. We prove the convergence and the stability of the PCHIP nonlinear subdivision process by employing a novel technique based on the study of the generalized Jacobian of the first difference scheme. MTM2011-22741
Algorithmic differentiation for cloud schemes (IFS Cy43r3) using CoDiPack (v1.8.1)
2019
Abstract. Numerical models in atmospheric sciences not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes have been proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive. We il…
Algorithmic Differentiation for Cloud Schemes
2019
<p>Numerical models in atmospheric sciences do not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes were proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive.…
New descent rules for solving the linear semi-infinite programming problem
1994
The algorithm described in this paper approaches the optimal solution of a continuous semi-infinite linear programming problem through a sequence of basic feasible solutions. The descent rules that we present for the improvement step are quite different when one deals with non-degenerate or degenerate extreme points. For the non-degenerate case we use a simplex-type approach, and for the other case a search direction scheme is applied. Some numerical examples illustrating the method are given.
xloops - Automated Feynman diagram calculation
1998
The program package xloops, a general, model independent tool for the calculation of high energy processes up to the two-loop level, is introduced. xloops calculates massive one- and two-loop Feynman diagrams in the standard model and related theories both analytically and numerically. A user-friendly Xwindows frontend is part of the package. xloops relies on the application of parallel space techniques. The treatment of tensor structure and the separation of divergences in analytic expressions is described in this scheme. All analytic calculations are performed with Maple. We describe the mathematical methods and computer algebra techniques xloops uses and give a brief introduction how to …
A Simple Method for the Consecutive Determination of Protonation Constants through Evaluation of Formation Curves
2013
A simple method is presented for the consecutive determination of protonation constants of polyprotic acids based on their formation curves. The procedure is based on generally known equations that describe dissociation equilibria. It has been demonstrated through simulation that the values obtained through the proposed method are sufficiently consistent with the actual values. In contrast with the universally known and applied Bjerrum’s method, no differences in the accuracy of determination of subsequent protonation constant values are observed. The proposed method requires the value of one of the protonation constants (e.g., of the first one, K1) of the polyprotic acid. An iterative meth…
Self-organization of active particles by quorum sensing rules
2018
Many microorganisms regulate their behaviour according to the density of neighbours. Such quorum sensing is important for the communication and organisation within bacterial populations. In contrast to living systems, where quorum sensing is determined by biochemical processes, the behaviour of synthetic active particles can be controlled by external fields. Accordingly they allow to investigate how variations of a density-dependent particle response affect their self-organisation. Here we experimentally and numerically demonstrate this concept using a suspension of light-activated active particles whose motility is individually controlled by an external feedback-loop, realised by a particl…