1,385 research outputs found

    Adaptive FE-BE coupling for strongly nonlinear transmission problems with friction II

    Full text link
    This article discusses the well-posedness and error analysis of the coupling of finite and boundary elements for transmission or contact problems in nonlinear elasticity. It concerns W^{1,p}-monotone Hencky materials with an unbounded stress-strain relation, as they arise in the modelling of ice sheets, non-Newtonian fluids or porous media. For 1<p<2 the bilinear form of the boundary element method fails to be continuous in natural function spaces associated to the nonlinear operator. We propose a functional analytic framework for the numerical analysis and obtain a priori and a posteriori error estimates for Galerkin approximations to the resulting boundary/domain variational inequality. The a posteriori estimate complements recent estimates obtained for mixed finite element formulations of friction problems in linear elasticity.Comment: 20 pages, corrected typos and improved expositio

    A New General Iterative Method for Solution of a New General System of Variational Inclusions for Nonexpansive Semigroups in Banach Spaces

    Get PDF
    We introduce a new general system of variational inclusions in Banach spaces and propose a new iterative scheme for finding common element of the set of solutions of the variational inclusion with set-valued maximal monotone mapping and Lipschitzian relaxed cocoercive mapping and the set of fixed point of nonexpansive semigroups in a uniformly convex and 2-uniformly smooth Banach space. Furthermore, strong convergence theorems are established under some certain control conditions. As applications, finding a common solution for a system of variational inequality problems and minimization problems is given

    Universal Scalable Robust Solvers from Computational Information Games and fast eigenspace adapted Multiresolution Analysis

    Get PDF
    We show how the discovery of robust scalable numerical solvers for arbitrary bounded linear operators can be automated as a Game Theory problem by reformulating the process of computing with partial information and limited resources as that of playing underlying hierarchies of adversarial information games. When the solution space is a Banach space BB endowed with a quadratic norm βˆ₯β‹…βˆ₯\|\cdot\|, the optimal measure (mixed strategy) for such games (e.g. the adversarial recovery of u∈Bu\in B, given partial measurements [Ο•i,u][\phi_i, u] with Ο•i∈Bβˆ—\phi_i\in B^*, using relative error in βˆ₯β‹…βˆ₯\|\cdot\|-norm as a loss) is a centered Gaussian field ΞΎ\xi solely determined by the norm βˆ₯β‹…βˆ₯\|\cdot\|, whose conditioning (on measurements) produces optimal bets. When measurements are hierarchical, the process of conditioning this Gaussian field produces a hierarchy of elementary bets (gamblets). These gamblets generalize the notion of Wavelets and Wannier functions in the sense that they are adapted to the norm βˆ₯β‹…βˆ₯\|\cdot\| and induce a multi-resolution decomposition of BB that is adapted to the eigensubspaces of the operator defining the norm βˆ₯β‹…βˆ₯\|\cdot\|. When the operator is localized, we show that the resulting gamblets are localized both in space and frequency and introduce the Fast Gamblet Transform (FGT) with rigorous accuracy and (near-linear) complexity estimates. As the FFT can be used to solve and diagonalize arbitrary PDEs with constant coefficients, the FGT can be used to decompose a wide range of continuous linear operators (including arbitrary continuous linear bijections from H0sH^s_0 to Hβˆ’sH^{-s} or to L2L^2) into a sequence of independent linear systems with uniformly bounded condition numbers and leads to O(Npolylog⁑N)\mathcal{O}(N \operatorname{polylog} N) solvers and eigenspace adapted Multiresolution Analysis (resulting in near linear complexity approximation of all eigensubspaces).Comment: 142 pages. 14 Figures. Presented at AFOSR (Aug 2016), DARPA (Sep 2016), IPAM (Apr 3, 2017), Hausdorff (April 13, 2017) and ICERM (June 5, 2017
    • …
    corecore