Related papers: Doubling the convergence rate by pre- and post-pro…
An expandable local and parallel two-grid finite element scheme based on superposition principle for elliptic problems is proposed and analyzed in this paper by taking example of Poisson equation. Compared with the usual local and parallel…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
One way of improving the behavior of finite element schemes for classical, time-dependent Maxwell's equations, is to render them from their hyperbolic character to elliptic form. This paper is devoted to the study of the stabilized linear…
The ultimate goal of any numerical scheme for partial differential equations (PDEs) is to compute an approximation of user-prescribed accuracy at quasi-minimal computational time. To this end, algorithmically, the standard adaptive finite…
A nonlinear Helmholtz equation (NLH) with high wave number and Sommerfeld radiation condition is approximated by the perfectly matched layer (PML) technique and then discretized by the linear finite element method (FEM).…
In this work we present an extension of the Virtual Element Method with curved edges for the numerical approximation of the second order wave equation in a bidimensional setting. Curved elements are used to describe the domain boundary, as…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
In this paper we propose and study a new complexity model for approximation algorithms. The main motivation are practical problems over large data sets that need to be solved many times for different scenarios, e.g., many multicast trees…
We present a simple deterministic single-pass $(2+\epsilon)$-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves upon the currently best known approximation ratio of $(4+\epsilon)$. Our…
The construction of finite element approximations in $\mathbf{H}(\mbox{div}, {\Omega})$ usually requires the Piola transformation to map vector polynomials from a master element to vector fields in the elements of a partition of the region…
This paper is concerned with fully discrete finite element methods for approximating variational solutions of nonlinear stochastic elastic wave equations with multiplicative noise. A detailed analysis of the properties of the weak solution…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
Error estimates are proved for finite element approximations to the solution of second-order hyperbolic partial differential equations with coefficients varying in both space and time. Optimal rates of convergence in the energy norm are…
We propose two basic assumptions, under which the rate of convergence of the augmented Lagrange method for a class of composite optimization problems is estimated. We analyze the rate of local convergence of the augmented Lagrangian method…
In this paper, based on the combination of finite element mesh and neural network, a novel type of neural network element space and corresponding machine learning method are designed for solving partial differential equations. The…
Convergence failure and slow convergence rates are among the biggest challenges with solving the system of non-linear equations numerically. Although mitigated, such issues still linger when using strictly small time steps and…
The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present $\textbf{Qu-FEM}$, a fault-tolerant era quantum algorithm for the finite element method. In contrast to…
Quasi-convex optimization acts a pivotal part in many fields including economics and finance; the subgradient method is an effective iterative algorithm for solving large-scale quasi-convex optimization problems. In this paper, we…
The a posteriori error analysis of the classical Argyris finite element methods dates back to 1996, while the optimal convergence rates of associated adaptive finite element schemes are established only very recently in 2021. It took a long…
Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their…