skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • NSF Public Access
  • Search Results
  • Numerical Approximation of the Solution of an Obstacle Problem Modelling the Displacement of Elliptic Membrane Shells via the Penalty Method
Title: Numerical Approximation of the Solution of an Obstacle Problem Modelling the Displacement of Elliptic Membrane Shells via the Penalty Method
In this paper we establish the convergence of a numerical scheme based, on the Finite Element Method, for a time-independent problem modelling the deformation of a linearly elastic elliptic membrane shell subjected to remaining confined in a half space. Instead of approximating the original variational inequalities governing this obstacle problem, we approximate the penalized version of the problem under consideration. A suitable coupling between the penalty parameter and the mesh size will then lead us to establish the convergence of the solution of the discrete penalized problem to the solution of the original variational inequalities. We also establish the convergence of the Brezis-Sibony scheme for the problem under consideration. Thanks to this iterative method, we can approximate the solution of the discrete penalized problem without having to resort to nonlinear optimization tools. Finally, we present numerical simulations validating our new theoretical results.  more » « less
Award ID(s):
2051032
PAR ID:
10502288
Author(s) / Creator(s):
;
Publisher / Repository:
Springer
Date Published:
Journal Name:
Applied Mathematics & Optimization
Volume:
89
Issue:
2
ISSN:
0095-4616
Subject(s) / Keyword(s):
Obstacle problems Variational Inequalities Elasticity theory Finite Difference Quotients Penalty Method Finite Element Method
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Journal of optimization theory and applications)
    We investigate the convergence properties of a projected neural network for solving inverse variational inequalities. Under standard assumptions, we establish the exponential stability of the proposed neural network. A discrete version of the proposed neural network is considered, leading to a new projection method for solving inverse variational inequalities, for which we obtain the linear convergence. We illustrate the effectiveness of the proposed neural network and its explicit discretization by considering applications in the road pricing problem arising in transportation science. The results obtained in this paper provide a positive answer to a recent open question and improve several recent results in the literature. 
    more » « less
  2. ; ; (, IMA Journal of Numerical Analysis)
    Abstract In this paper, a higher order time-discretization scheme is proposed, where the iterates approximate the solution of the stochastic semilinear wave equation driven by multiplicative noise with general drift and diffusion. We employ variational method for its error analysis and prove an improved convergence order of $$\frac 32$$ for the approximates of the solution. The core of the analysis is Hölder continuity in time and moment bounds for the solutions of the continuous and the discrete problem. Computational experiments are also presented. 
    more » « less
  3. ; (, ESAIM: Mathematical Modelling and Numerical Analysis)
    We propose and analyze a two-scale finite element method for the Isaacs equation. The fine scale is given by the mesh size h whereas the coarse scale ε is dictated by an integro-differential approximation of the partial differential equation. We show that the method satisfies the discrete maximum principle provided that the mesh is weakly acute. This, in conjunction with weak operator consistency of the finite element method, allows us to establish convergence of the numerical solution to the viscosity solution as ε , h → 0, and ε  ≳ ( h |log h |) 1/2 . In addition, using a discrete Alexandrov Bakelman Pucci estimate we deduce rates of convergence, under suitable smoothness assumptions on the exact solution. 
    more » « less
  4. ; (, Mathematics of Computation)
    This paper is concerned with the numerical solution of the flow problem in a fractured porous medium where the fracture is treated as a lower dimensional object embedded in the rock matrix. We consider a space-time mixed variational formulation of such a reduced fracture model with mixed finite element approximations in space and discontinuous Galerkin discretization in time. Different spatial and temporal grids are used in the subdomains and in the fracture to adapt to the heterogeneity of the problem. Analysis of the numerical scheme, including well-posedness of the discrete problem, stability and a priori error estimates, is presented. Using substructuring techniques, the coupled subdomain and fracture system is reduced to a space-time interface problem which is solved iteratively by GMRES. Each GMRES iteration involves solution of time-dependent problems in the subdomains using the method of lines with local spatial and temporal discretizations. The convergence of GMRES is proved by using the field-of-values analysis and the properties of the discrete space-time interface operator. Numerical experiments are carried out to illustrate the performance of the proposed iterative algorithm and the accuracy of the numerical solution. 
    more » « less
  5. ; ; ; (, Foundations of Computational Mathematics)
    null (Ed.)
    Abstract Combining the classical theory of optimal transport with modern operator splitting techniques, we develop a new numerical method for nonlinear, nonlocal partial differential equations, arising in models of porous media, materials science, and biological swarming. Our method proceeds as follows: first, we discretize in time, either via the classical JKO scheme or via a novel Crank–Nicolson-type method we introduce. Next, we use the Benamou–Brenier dynamical characterization of the Wasserstein distance to reduce computing the solution of the discrete time equations to solving fully discrete minimization problems, with strictly convex objective functions and linear constraints. Third, we compute the minimizers by applying a recently introduced, provably convergent primal dual splitting scheme for three operators (Yan in J Sci Comput 1–20, 2018). By leveraging the PDEs’ underlying variational structure, our method overcomes stability issues present in previous numerical work built on explicit time discretizations, which suffer due to the equations’ strong nonlinearities and degeneracies. Our method is also naturally positivity and mass preserving and, in the case of the JKO scheme, energy decreasing. We prove that minimizers of the fully discrete problem converge to minimizers of the spatially continuous, discrete time problem as the spatial discretization is refined. We conclude with simulations of nonlinear PDEs and Wasserstein geodesics in one and two dimensions that illustrate the key properties of our approach, including higher-order convergence our novel Crank–Nicolson-type method, when compared to the classical JKO method. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email