493 research outputs found

    Numerical hyperinterpolation over nonstandard planar regions

    Get PDF
    We discuss an algorithm (implemented in Matlab) that computes numerically total-degree bivariate orthogonal polynomials (OPs) given an algebraic cubature formula with positive weights, and constructs the orthogonal projection (hyperinterpolation) of a function sampled at the cubature nodes. The method is applicable to nonstandard regions where OPs are not known analytically, for example convex and concave polygons, or circular sections such as sectors, lenses and lunes

    Constructing Cubature Formulas of Degree 5 with Few Points

    Get PDF
    This paper will devote to construct a family of fifth degree cubature formulae for nn-cube with symmetric measure and nn-dimensional spherically symmetrical region. The formula for nn-cube contains at most n2+5n+3n^2+5n+3 points and for nn-dimensional spherically symmetrical region contains only n2+3n+3n^2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1n^2+3n+1 and n2+n+1n^2+n+1 if n=7n=7 respectively, the later of which is minimal.Comment: 13 page

    Signal reconstruction from the magnitude of subspace components

    Full text link
    We consider signal reconstruction from the norms of subspace components generalizing standard phase retrieval problems. In the deterministic setting, a closed reconstruction formula is derived when the subspaces satisfy certain cubature conditions, that require at least a quadratic number of subspaces. Moreover, we address reconstruction under the erasure of a subset of the norms; using the concepts of pp-fusion frames and list decoding, we propose an algorithm that outputs a finite list of candidate signals, one of which is the correct one. In the random setting, we show that a set of subspaces chosen at random and of cardinality scaling linearly in the ambient dimension allows for exact reconstruction with high probability by solving the feasibility problem of a semidefinite program

    Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

    Full text link
    Padua points is a family of points on the square [−1,1]2[-1,1]^2 given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. The interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The LpL^p convergence of the interpolation polynomials is also studied.Comment: 11 page
    • …
    corecore