Related papers: Goal-oriented error analysis of iterative Galerkin…
In this work, we consider space-time goal-oriented a posteriori error estimation for parabolic problems. Temporal and spatial discretizations are based on Galerkin finite elements of continuous and discontinuous type. The main objectives…
In this note we consider the continuous Galerkin time stepping method of arbitrary order as a possible discretization scheme of nonlinear initial value problems. In addition, we develop and generalize a well known existing result for the…
Critical points of energy functionals, which are of broad interest, for instance, in physics and chemistry, in solid and quantum mechanics, in material science, or in general diffusion-reaction models arise as solutions to the associated…
Iterative optimization algorithms depend on access to information about the objective function. In a differentiable programming framework, this information, such as gradients, can be automatically derived from the computational graph. We…
In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…
We propose and analyze an iterative high-order hybridized discontinuous Galerkin (iHDG) discretization for linear partial differential equations. We improve our previous work (SIAM J. Sci. Comput. Vol. 39, No. 5, pp. S782--S808) in several…
In this article we develop function-based a posteriori error estimators for the solution of linear second order elliptic problems considering hierarchical spline spaces for the Galerkin discretization. We prove a global upper bound for the…
In this paper we investigate a priori error estimates for the space-time Galerkin finite element discretization of an optimal control problem governed by a simplified linear gradient enhanced damage model. The model equations are of a…
We consider the discretization of a class of nonlinear parabolic equations by discontinuous Galerkin time-stepping methods and establish a priori as well as conditional a posteriori error estimates. Our approach is motivated by the error…
While many methods exist to discretize nonlinear time-dependent partial differential equations (PDEs), the rigorous estimation and adaptive control of their discretization errors remains challenging. In this paper, we present a methodology…
In this paper we investigate a priori error estimates for the space-time Galerkin finite element discretization of a simplified semilinear gradient enhanced damage model. The model equations are of a special structure as the state equation…
In this work, we propose a novel layerwise adaptive construction method for neural network architectures. Our approach is based on a goal--oriented dual-weighted residual technique for the optimal control of neural differential equations.…
We propose a goal-oriented mesh-adaptive algorithm for a finite element method stabilized via residual minimization on dual discontinuous-Galerkin norms. By solving a saddle-point problem, this residual minimization delivers a stable…
A classical approach for solving discrete time nonlinear control on a finite horizon consists in repeatedly minimizing linear quadratic approximations of the original problem around current candidate solutions. While widely popular in many…
In this paper we discuss the local discontinuous Galerkin methods coupled with two specific explicit-implicit-null time discretizations for solving one-dimensional nonlinear diffusion problems $U_t=(a(U)U_x)_x$. The basic idea is to add and…
A $p$-adaptive discontinuous Galerkin time-domain method is developed to obtain high-order solutions to electromagnetic scattering problems. A novel feature of the proposed method is the use of divergence error to drive the $p$-adaptive…
A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic…
We devise and analyze a class of interior penalty discontinuous Galerkin methods for nonlinear and nonsmooth variational problems. Discrete duality relations are derived that lead to optimal error estimates in the case of total-variation…
We suggest an adaptive version of a partial linearization method for composite optimization problems. The goal function is the sum of a smooth function and a non necessary smooth convex separable function, whereas the feasible set is the…
This article presents a new primal-dual weak Galerkin method for second order elliptic equations in non-divergence form. The new method is devised as a constrained $L^p$-optimization problem with constraints that mimic the second order…