29,544 research outputs found

    Optimal polynomial meshes and Caratheodory-Tchakaloff submeshes on the sphere

    Get PDF
    Using the notion of Dubiner distance, we give an elementary proof of the fact that good covering point configurations on the 2-sphere are optimal polynomial meshes. From these we extract Caratheodory-Tchakaloff (CATCH) submeshes for compressed Least Squares fitting

    Polynomial Meshes: Computation and Approximation

    Get PDF
    We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d polynomial least squares and interpolation on compact sets with various geometries. Possible applications range from data fitting to high-order methods for PDEs

    Stochastic collocation on unstructured multivariate meshes

    Full text link
    Collocation has become a standard tool for approximation of parameterized systems in the uncertainty quantification (UQ) community. Techniques for least-squares regularization, compressive sampling recovery, and interpolatory reconstruction are becoming standard tools used in a variety of applications. Selection of a collocation mesh is frequently a challenge, but methods that construct geometrically "unstructured" collocation meshes have shown great potential due to attractive theoretical properties and direct, simple generation and implementation. We investigate properties of these meshes, presenting stability and accuracy results that can be used as guides for generating stochastic collocation grids in multiple dimensions.Comment: 29 pages, 6 figure

    Effects of Mesh Irregularities on Accuracy of Finite-Volume Discretization Schemes

    Get PDF
    The effects of mesh irregularities on accuracy of unstructured node-centered finite-volume discretizations are considered. The focus is on an edge-based approach that uses unweighted least-squares gradient reconstruction with a quadratic fit. For inviscid fluxes, the discretization is nominally third order accurate on general triangular meshes. For viscous fluxes, the scheme is an average-least-squares formulation that is nominally second order accurate and contrasted with a common Green-Gauss discretization scheme. Gradient errors, truncation errors, and discretization errors are separately studied according to a previously introduced comprehensive methodology. The methodology considers three classes of grids: isotropic grids in a rectangular geometry, anisotropic grids typical of adapted grids, and anisotropic grids over a curved surface typical of advancing layer grids. The meshes within the classes range from regular to extremely irregular including meshes with random perturbation of nodes. Recommendations are made concerning the discretization schemes that are expected to be least sensitive to mesh irregularities in applications to turbulent flows in complex geometries

    First order least squares method with weakly imposed boundary condition for convection dominated diffusion problems

    Full text link
    We present and analyze a first order least squares method for convection dominated diffusion problems, which provides robust L2 a priori error estimate for the scalar variable even if the given data f in L2 space. The novel theoretical approach is to rewrite the method in the framework of discontinuous Petrov - Galerkin (DPG) method, and then show numerical stability by using a key equation discovered by J. Gopalakrishnan and W. Qiu [Math. Comp. 83(2014), pp. 537-552]. This new approach gives an alternative way to do numerical analysis for least squares methods for a large class of differential equations. We also show that the condition number of the global matrix is independent of the diffusion coefficient. A key feature of the method is that there is no stabilization parameter chosen empirically. In addition, Dirichlet boundary condition is weakly imposed. Numerical experiments verify our theoretical results and, in particular, show our way of weakly imposing Dirichlet boundary condition is essential to the design of least squares methods - numerical solutions on subdomains away from interior layers or boundary layers have remarkable accuracy even on coarse meshes, which are unstructured quasi-uniform
    • …
    corecore