相关论文: A Posteriori Error Estimates for Solving Graph Lap…
Trimming consists of cutting away parts of a geometric domain, without reconstructing a global parametrization (meshing). It is a widely used operation in computer aided design, which generates meshes that are unfitted with the described…
Within this article, we develop a residual type a posteriori error estimator for a time discrete quasi-static phase-field fracture model. Particular emphasize is given to the robustness of the error estimator for the variational inequality…
This paper investigates the state estimation problem for a class of complex networks, in which the dynamics of each node is subject to Gaussian noise, system uncertainties and nonlinearities. Based on a regularized least-squares approach,…
We present a novel statistically-based discretization paradigm and derive a class of maximum a posteriori (MAP) estimators for solving ill-conditioned linear inverse problems. We are guided by the theory of sparse stochastic processes,…
In this article, a posteriori error analysis is developed for mixed finite element Galerkin approximations to a second order linear hyperbolic equation. Based on mixed elliptic reconstructions and an integration tool, which is a variation…
This paper considers a high-dimensional linear regression problem where there are complex correlation structures among predictors. We propose a graph-constrained regularization procedure, named Sparse Laplacian Shrinkage with the Graphical…
In this note, we extend the analysis for the residual-based a posteriori error estimators in the energy norm defined for the algebraic flux correction (AFC) schemes [Jha20.CAMWA] to the newly proposed algebraic stabilization schemes…
A posteriori error estimators are studied for discontinuous Galerkin methods for solving a frictional contact problem, which is a representative elliptic variational inequality of the second kind. The estimators are derived by relating the…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical…
In our work, we consider the classical density-based approach to the topology optimization. We propose to modify the discretized cost functional using a posteriori error estimator for the finite element method. It can be regarded as a new…
We study decentralized designing of the graph shift operators to implement linear transformations between graph signals. Since this operator captures the local structure of the graph, the proposed method of this paper gives rise to…
We present an equilibration-based a posteriori error estimator for N\'ed\'elec element discretizations of the magnetostatic problem. The estimator is obtained by adding a gradient correction to the estimator for N\'ed\'elec elements of…
In this paper, we derive a practical, general framework for creating adaptive iterative (linearization or splitting) algorithms to solve multi-physics problems. This means that, given an iterative method, we derive \textit{a posteriori}…
This work is concerned with the derivation of a robust a posteriori error estimator for a discontinuous Galerkin method discretisation of linear non-stationary convection-diffusion initial/boundary value problems and with the implementation…
The binary Mumford-Shah model is a widespread tool for image segmentation and can be considered as a basic model in shape optimization with a broad range of applications in computer vision, ranging from basic segmentation and labeling to…
The nonconforming triangular piecewise quadratic finite element space by Fortin and Soulie can be used for the displacement approximation and its combination with discontinuous piecewise linear pressure elements is known to constitute a…
In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…
We construct a space-time parallel method for solving parabolic partial differential equations by coupling the Parareal algorithm in time with overlapping domain decomposition in space. The goal is to obtain a discretization consisting of…
We consider second-order PDE problems set in unbounded domains and discretized by Lagrange finite elements on a finite mesh, thus introducing an artificial boundary in the discretization. Specifically, we consider the reaction diffusion…