221 research outputs found

    A mixed β„“1\ell_1 regularization approach for sparse simultaneous approximation of parameterized PDEs

    Full text link
    We present and analyze a novel sparse polynomial technique for the simultaneous approximation of parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our approach treats the numerical solution as a jointly sparse reconstruction problem through the reformulation of the standard basis pursuit denoising, where the set of jointly sparse vectors is infinite. To achieve global reconstruction of sparse solutions to parameterized elliptic PDEs over both physical and parametric domains, we combine the standard measurement scheme developed for compressed sensing in the context of bounded orthonormal systems with a novel mixed-norm based β„“1\ell_1 regularization method that exploits both energy and sparsity. In addition, we are able to prove that, with minimal sample complexity, error estimates comparable to the best ss-term and quasi-optimal approximations are achievable, while requiring only a priori bounds on polynomial truncation error with respect to the energy norm. Finally, we perform extensive numerical experiments on several high-dimensional parameterized elliptic PDE models to demonstrate the superior recovery properties of the proposed approach.Comment: 23 pages, 4 figure

    A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures

    Full text link
    The goal of this paper is to describe the oscillatory microstructure that can emerge from minimizing sequences for nonconvex energies. We consider integral functionals that are defined on real valued (scalar) functions u(x)u(x) which are nonconvex in the gradient βˆ‡u\nabla u and possibly also in uu. To characterize the microstructures for these nonconvex energies, we minimize the associated relaxed energy using two novel approaches: i) a semi-analytical method based on control systems theory, ii) and a numerical scheme that combines convex splitting together with a modified version of the split Bregman algorithm. These solutions are then used to gain information about minimizing sequences of the original problem and the spatial distribution of microstructure.Comment: 34 pages, 10 figure
    • …
    corecore