12,010 research outputs found

    An Approach to Improve the Smoothing Process Based on Non-uniform Redistribution

    Get PDF
    PACLIC 19 / Taipei, taiwan / December 1-3, 200

    A discontinuous Galerkin moving mesh method for Hamilton-Jacobi equations

    Get PDF
    In this paper we consider the numerical solution of first-order Hamilton-Jacobi equations using the combination of a discontinuous Galerkin finite element method and an adaptive rr-refinement (mesh movement) strategy. Particular attention is given to the choice of an appropriate adaptivity criterion when the solution becomes discontinuous. Numerical examples in one and two dimensions are presented to demonstrate the effectiveness of the adaptive procedure

    A moving mesh method with variable relaxation time

    Full text link
    We propose a moving mesh adaptive approach for solving time-dependent partial differential equations. The motion of spatial grid points is governed by a moving mesh PDE (MMPDE) in which a mesh relaxation time \tau is employed as a regularization parameter. Previously reported results on MMPDEs have invariably employed a constant value of the parameter \tau. We extend this standard approach by incorporating a variable relaxation time that is calculated adaptively alongside the solution in order to regularize the mesh appropriately throughout a computation. We focus on singular problems involving self-similar blow-up to demonstrate the advantages of using a variable relaxation ime over a fixed one in terms of accuracy, stability and efficiency.Comment: 21 page

    Estimating Local Function Complexity via Mixture of Gaussian Processes

    Full text link
    Real world data often exhibit inhomogeneity, e.g., the noise level, the sampling distribution or the complexity of the target function may change over the input space. In this paper, we try to isolate local function complexity in a practical, robust way. This is achieved by first estimating the locally optimal kernel bandwidth as a functional relationship. Specifically, we propose Spatially Adaptive Bandwidth Estimation in Regression (SABER), which employs the mixture of experts consisting of multinomial kernel logistic regression as a gate and Gaussian process regression models as experts. Using the locally optimal kernel bandwidths, we deduce an estimate to the local function complexity by drawing parallels to the theory of locally linear smoothing. We demonstrate the usefulness of local function complexity for model interpretation and active learning in quantum chemistry experiments and fluid dynamics simulations.Comment: 19 pages, 16 figure
    • ā€¦
    corecore