Related papers: Optimal local approximation spaces for parabolic p…
We study a parabolic system with $p(t,x)$-structure under Dirichlet boundary conditions. In particular, we deduce the optimal convergence rate for the error of the gradient of a finite element based space-time approximation. The error is…
In this paper, we develop a numerical scheme for the space-time fractional parabolic equation, i.e., an equation involving a fractional time derivative and a fractional spatial operator. Both the initial value problem and the…
In this paper, we study a generalized finite element method for solving second-order elliptic partial differential equations with rough coefficients. The method uses local approximation spaces computed by solving eigenvalue problems on…
We give a simplified and direct proof of the Kato square root estimate for parabolic operators with elliptic part in divergence form and coefficients possibly depending on space and time in a merely measurable way. The argument relies on…
We present and analyze a new space-time parallel multigrid method for parabolic equations. The method is based on arbitrarily high order discontinuous Galerkin discretizations in time, and a finite element discretization in space. The key…
This work is concerned with the development of a space-time adaptive numerical method, based on a rigorous a posteriori error bound, for a semilinear convection-diffusion problem which may exhibit blow-up in finite time. More specifically,…
We investigate the properties of the simultaneous projection method as applied to countably infinitely many closed and linear subspaces of a real Hilbert space. We establish the optimal error bound for linear convergence of this method,…
In this paper we establish compactness results of multiscale and very weak multiscale type for sequences bounded in $L^{2}(0,T;H_{0}^{1}(\Omega ))$, fulfilling a certain condition. We apply the results in the homogenization of the parabolic…
In this paper we find the optimal error bound (smallest possible estimate, independent of the starting point) for the linear convergence rate of the simultaneous projection method applied to closed linear subspaces in a real Hilbert space.…
We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain $\{0,1\}^n$ over arbitrary fields and more generally Abelian groups. Such functions form error-correcting codes of…
This paper is devoted to the error analysis of a time-spectral algorithm for fractional diffusion problems of order $\alpha$ ($0 < \alpha < 1$). The solution regularity in the Sobolev space is revisited, and new regularity results in the…
We consider the a posteriori error analysis of fully discrete approximations of parabolic problems based on conforming $hp$-finite element methods in space and an arbitrary order discontinuous Galerkin method in time. Using an equilibrated…
We study the parabolic $p$-Laplacian system in a bounded domain. We deduce optimal convergence rates for the space-time discretization based on an implicit Euler scheme in time. Our estimates are expressed in terms of Nikolskii spaces and…
In the first part of this paper, inspired by the geometric method of Jean-Pierre Marec, we consider the two-impulse Hohmann transfer problem between two coplanar circular orbits as a constrained nonlinear programming problem. By using the…
We study the discretization of a linear evolution partial differential equation when its Green function is known. We provide error estimates both for the spatial approximation and for the time stepping approximation. We show that, in fact,…
We develop a quantitative theory of stochastic homogenization for linear, uniformly parabolic equations with coefficients depending on space and time. Inspired by recent works in the elliptic setting, our analysis is focused on certain…
We derive a fully computable aposteriori error estimator for a Galerkin finite element solution of the wave equation with explicit leapfrog time-stepping. Our discrete formulation accommodates both time evolving meshes and leapfrog based…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We consider several local versions of the doubling condition and Poincar\'e inequalities on metric spaces. Our first result is that in proper connected spaces, the weakest local assumptions self-improve to semilocal ones, i.e. holding…