2,483 research outputs found

    Analysis of the implicit upwind finite volume scheme with rough coefficients

    Full text link
    We study the implicit upwind finite volume scheme for numerically approximating the linear continuity equation in the low regularity DiPerna-Lions setting. That is, we are concerned with advecting velocity fields that are spatially Sobolev regular and data that are merely integrable. We prove that on unstructured regular meshes the rate of convergence of approximate solutions generated by the upwind scheme towards the unique distributional solution of the continuous model is at least 1/2. The numerical error is estimated in terms of logarithmic Kantorovich-Rubinstein distances and provides thus a bound on the rate of weak convergence.Comment: 27 pages. To appear in Numerische Mathemati

    Convergence rates of finite difference schemes for the linear advection and wave equation with rough coefficient

    Full text link
    We prove convergence rates of explicit finite difference schemes for the linear advection and wave equation in one space dimension with H\"older continuous coefficient. The obtained convergence rates explicitly depend on the H\"older regularity of the coefficient and the modulus of continuity of the initial data. We compare the theoretically established rates with the experimental rates of a couple of numerical examples

    Numerical schemes for the optimal input flow of a supply-chain

    Full text link
    An innovative numerical technique is presented to adjust the inflow to a supply chain in order to achieve a desired outflow, reducing the costs of inventory, or the goods timing in warehouses. The supply chain is modelled by a conservation law for the density of processed parts coupled to an ODE for the queue buffer occupancy. The control problem is stated as the minimization of a cost functional J measuring the queue size and the quadratic difference between the outflow and the expected one. The main novelty is the extensive use of generalized tangent vectors to a piecewise constant control, which represent time shifts of discontinuity points. Such method allows convergence results and error estimates for an Upwind- Euler steepest descent algorithm, which is also tested by numerical simulations

    Diffusion limited mixing rates in passive scalar advection

    Full text link
    We are concerned with flow enhanced mixing of passive scalars in the presence of diffusion. Under the assumption that the velocity gradient is suitably integrable, we provide upper bounds on the exponential rates of mixing and of enhanced dissipation. Our results suggest that there is a crossover from advection dominated to diffusion dominated mixing, and we observe a slow down in the exponential decay rates by (some power of) a logarithm of the diffusivity.Comment: Generalized resul

    A Meshfree Generalized Finite Difference Method for Surface PDEs

    Full text link
    In this paper, we propose a novel meshfree Generalized Finite Difference Method (GFDM) approach to discretize PDEs defined on manifolds. Derivative approximations for the same are done directly on the tangent space, in a manner that mimics the procedure followed in volume-based meshfree GFDMs. As a result, the proposed method not only does not require a mesh, it also does not require an explicit reconstruction of the manifold. In contrast to existing methods, it avoids the complexities of dealing with a manifold metric, while also avoiding the need to solve a PDE in the embedding space. A major advantage of this method is that all developments in usual volume-based numerical methods can be directly ported over to surfaces using this framework. We propose discretizations of the surface gradient operator, the surface Laplacian and surface Diffusion operators. Possibilities to deal with anisotropic and discontinous surface properties (with large jumps) are also introduced, and a few practical applications are presented

    Multigrid approaches to the Euler equations

    Get PDF

    Piecewise Constant Policy Approximations to Hamilton-Jacobi-Bellman Equations

    Full text link
    An advantageous feature of piecewise constant policy timestepping for Hamilton-Jacobi-Bellman (HJB) equations is that different linear approximation schemes, and indeed different meshes, can be used for the resulting linear equations for different control parameters. Standard convergence analysis suggests that monotone (i.e., linear) interpolation must be used to transfer data between meshes. Using the equivalence to a switching system and an adaptation of the usual arguments based on consistency, stability and monotonicity, we show that if limited, potentially higher order interpolation is used for the mesh transfer, convergence is guaranteed. We provide numerical tests for the mean-variance optimal investment problem and the uncertain volatility option pricing model, and compare the results to published test cases

    Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario

    Full text link
    A variety of methods is available to quantify uncertainties arising with\-in the modeling of flow and transport in carbon dioxide storage, but there is a lack of thorough comparisons. Usually, raw data from such storage sites can hardly be described by theoretical statistical distributions since only very limited data is available. Hence, exact information on distribution shapes for all uncertain parameters is very rare in realistic applications. We discuss and compare four different methods tested for data-driven uncertainty quantification based on a benchmark scenario of carbon dioxide storage. In the benchmark, for which we provide data and code, carbon dioxide is injected into a saline aquifer modeled by the nonlinear capillarity-free fractional flow formulation for two incompressible fluid phases, namely carbon dioxide and brine. To cover different aspects of uncertainty quantification, we incorporate various sources of uncertainty such as uncertainty of boundary conditions, of conceptual model definitions and of material properties. We consider recent versions of the following non-intrusive and intrusive uncertainty quantification methods: arbitary polynomial chaos, spatially adaptive sparse grids, kernel-based greedy interpolation and hybrid stochastic Galerkin. The performance of each approach is demonstrated assessing expectation value and standard deviation of the carbon dioxide saturation against a reference statistic based on Monte Carlo sampling. We compare the convergence of all methods reporting on accuracy with respect to the number of model runs and resolution. Finally we offer suggestions about the methods' advantages and disadvantages that can guide the modeler for uncertainty quantification in carbon dioxide storage and beyond
    corecore