Related papers: Fictitious domain method with boundary value corre…
A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function…
In this paper, we propose a $C^{0}$ interior penalty method for $m$th-Laplace equation on bounded Lipschitz polyhedral domain in $\mathbb{R}^{d}$, where $m$ and $d$ can be any positive integers. The standard $H^{1}$-conforming piecewise…
Deep neural network approaches show promise in solving partial differential equations. However, unlike traditional numerical methods, they face challenges in enforcing essential boundary conditions. The widely adopted penalty-type methods,…
We consider the steady Navier-Stokes system with mixed boundary conditions, in subdomains of a holdall domain. We study, via the penalization method, its approximation properties. Error estimates, obtained using the extension operator,…
In this paper, we consider the problem of piecewise affine abstraction of nonlinear systems, i.e., the overapproximation of its nonlinear dynamics by a pair of piecewise affine functions that "includes" the dynamical characteristics of the…
We present an arbitrary order discontinuous Galerkin finite element method for solving the biharmonic interface problem on the unfitted mesh. The approximation space is constructed by a patch reconstruction process with at most one degree…
We present a one-dimensional high-order moving-mesh finite element method for moving boundary problems where the boundary velocity depends implicitly on the solution in the interior of the domain. The method employs a conservative arbitrary…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More specifically, the objective function is of the form $f + h$…
In this paper, we consider the finite element approximation for a parabolic problem on a smooth domain $\Omega \subset \mathbb{R}^N$ with the inhomogeneous Neumann boundary condition. We emphasize that the domain can be non-convex in…
We construct and analyse a $hp$-FE/BE coupling on non-matching meshes, based on Nitsche's method. Both the mesh size and the polynomial degree are changed to improve accuracy. Nitsche's method leads to a positive definite formulation, thus,…
We investigate $C^1$ finite element methods for one dimensional elliptic distributed optimal control problems with pointwise constraints on the derivative of the state formulated as fourth order variational inequalities for the state…
In this paper, we formulate, analyse and implement the discrete formulation of the Brinkman problem with mixed boundary conditions, including slip boundary condition, using the Nitsche's technique for virtual element methods. The divergence…
The solution of partial differential equations (PDEs) on complex domains often presents a significant computational challenge by requiring the generation of fitted meshes. The Diffuse Domain Method (DDM) is an alternative which reformulates…
A high-order finite element method is proposed to solve the nonlinear convection-diffusion equation on a time-varying domain whose boundary is implicitly driven by the solution of the equation. The method is semi-implicit in the sense that…
We show how the Stefan type free boundary problem with random diffusion in one space dimension can be approximated by the corresponding free boundary problem with nonlocal diffusion. The approximation problem is a slightly modified version…
We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of \citet{sorensen1982newton}. The…
We propose a quasi-Newton-type method for nonconvex optimization with Lipschitz continuous gradients and Hessians. The algorithm finds an $\varepsilon$-stationary point within $\tilde{\mathrm{O}}(d^{1/4} \varepsilon^{-13/8})$ gradient…
In this work we present TRFD, a derivative-free trust-region method based on finite differences for minimizing composite functions of the form $f(x)=h(F(x))$, where $F$ is a black-box function assumed to have a Lipschitz continuous…
In density-based topology optimization, design variables associated to the boundaries of the design domain require unique treatment to negate boundary effects arising from the filtering technique. An effective approach to deal with…