Search results for "Computational Mathematic"
showing 10 items of 987 documents
A dynamic load-balancing algorithm for molecular dynamics simulation on multi-processor systems
1991
Abstract A new algorithm for dynamic load-balancing on multi-processor systems and its application to the molecular dynamics simulation of the spinodal phase separation are presented. The load-balancer is distributed among the processors and embedded in the application itself. Tests performed on a transputer network show that the load-balancer behaves almost ideally in this application. The same approach can be easily extended to different multi-processor topologies or applications.
Hermite interpolation: The barycentric approach
1991
The barycentric formulas for polynomial and rational Hermite interpolation are derived; an efficient algorithm for the computation of these interpolants is developed. Some new interpolation principles based on rational interpolation are discussed.
Efficient numerical methods for pricing American options under stochastic volatility
2007
Five numerical methods for pricing American put options under Heston's stochastic volatility model are described and compared. The option prices are obtained as the solution of a two-dimensional parabolic partial differential inequality. A finite difference discretization on nonuniform grids leading to linear complementarity problems with M-matrices is proposed. The projected SOR, a projected multigrid method, an operator splitting method, a penalty method, and a componentwise splitting method are considered. The last one is a direct method while all other methods are iterative. The resulting systems of linear equations in the operator splitting method and in the penalty method are solved u…
Reconstructions that combine interpolation with least squares fitting
2015
We develop a reconstruction that combines interpolation and least squares fitting for point values in the context of multiresolution a la Harten. We study the smoothness properties of the reconstruction as well as its approximation order. We analyze how different adaptive techniques (ENO, SR and WENO) can be used within this reconstruction. We present some numerical examples where we compare the results obtained with the classical interpolation and the interpolation combined with least-squares approximation. We develop a reconstruction that combines interpolation and least squares fitting.We study the smoothness properties of the reconstruction and its approximation order.We present some nu…
Numerically stable computation of step-sizes for descent methods. The nonconvex case
1977
The computation of step-sizes which guarantee convergence in unconstrained minimization by descent methods is considered. The use of a “control” or “range” function is highly attractive for this purpose because of its simplicity. Since the Armijo-Goldstein test may fail prematurely due to numerical instability near the minimizer, we consider a range function based on gradient values alone as has been done forg convex in [8]. Numerical algorithms are given for the computation of step-sizes whose behaviour under roundoff is shown to be benign in the sense of F. L. Bauer [5].
Numerical Study of Two Sparse AMG-methods
2003
A sparse algebraic multigrid method is studied as a cheap and accurate way to compute approximations of Schur complements of matrices arising from the discretization of some symmetric and positive definite partial differential operators. The construction of such a multigrid is discussed and numerical experiments are used to verify the properties of the method.
Multiresolution based on weighted averages of the hat function I: Linear reconstruction techniques
1998
In this paper we analyze a particular example of the general framework developed in [A. Harten, {\it SIAM J. Numer. Anal}., 33 (1996) pp. 1205--1256], the case in which the discretization operator is obtained by taking local averages with respect to the hat function. We consider a class of reconstruction procedures which are appropriate for this multiresolution setting and describe the associated prediction operators that allow us to climb up the ladder from coarse to finer levels of resolution. In Part I we use data-independent (linear) reconstruction techniques as our approximation tool. We show how to obtain multiresolution transforms in bounded domains and analyze their stability with r…
Well-balanced bicharacteristic-based scheme for multilayer shallow water flows including wet/dry fronts
2013
The aim of this paper is to present a new well-balanced finite volume scheme for two-dimensional multilayer shallow water flows including wet/dry fronts. The ideas, presented here for the two-layer model, can be generalized to a multilayer case in a straightforward way. The method developed here is constructed in the framework of the Finite Volume Evolution Galerkin (FVEG) schemes. The FVEG methods couple a finite volume formulation with evolution operators. The latter are constructed using the bicharacteristics of multidimensional hyperbolic systems. However, in the case of multilayer shallow water flows the required eigenstructure of the underlying equations is not readily available. Thus…
Comparison between adaptive and uniform discontinuous Galerkin simulations in dry 2D bubble experiments
2013
Accepted by the Journal of Computational Physics Adaptive mesh refinement generally aims to increase computational efficiency without compromising the accuracy of the numerical solution. However it is an open question in which regions the spatial resolution can actually be coarsened without affecting the accuracy of the result. This question is investigated for a specific example of dry atmospheric convection, namely the simulation of warm air bubbles. For this purpose a novel numerical model is developed that is tailored towards this specific application. The compressible Euler equations are solved with a Discontinuous Galerkin method. Time integration is done with an IMEXmethod and the dy…
A semi-Lagrangian AMR scheme for 2D transport problems in conservation form
2013
In this paper, we construct a semi-Lagrangian (SL) Adaptive-Mesh-Refinement (AMR) solver for 1D and 2D transport problems in conservation form. First, we describe the a-la-Harten AMR framework: the adaptation process selects a hierarchical set of grids with different resolutions depending on the features of the integrand function, using as criteria the point value prediction via interpolation from coarser meshes, and the appearance of large gradients. We integrate in time by reconstructing at the feet of the characteristics through the Point-Value Weighted Essentially Non-Oscillatory (PV-WENO) interpolator. We propose, then, an extension to the 2D setting by making the time integration dime…