Related papers: Adaptive guaranteed lower eigenvalue bounds with o…
A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and…
A concrete formulation of the Lehmann-Maehly-Goerisch method for semi-definite self-adjoint operators with compact resolvent is considered. Precise rates of convergence are determined in terms of how well the trial spaces capture the…
We study unconstrained Online Linear Optimization with Lipschitz losses. Motivated by the pursuit of instance optimality, we propose a new algorithm that simultaneously achieves ($i$) the AdaGrad-style second order gradient adaptivity; and…
Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have…
The standard application of the Lehmann-Goerisch method for lower bounds on eigenvalues of symmetric elliptic second-order partial differential operators relies on determination of fluxes $\sigma_i$ that approximate co-gradients of exact…
Equilibrium computation on Riemannian manifolds provides a unifying framework for numerous problems in machine learning and data analytics. One of the simplest yet most fundamental methods is Riemannian gradient descent (RGD). While its…
The paper is concerned with space-time IgA approximations of parabolic initial-boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of IgA approximations and investigate their…
Let $m$ be a bounded function and $\alpha$ a nonnegative parameter. This article is concerned with the first eigenvalue $\lambda\_\alpha(m)$ of the drifted Laplacian type operator $\mathcal L\_m$ given by $\mathcal L\_m(u)=…
This article is devoted to computing the eigenvalue of the Laplace eigenvalue problem by the weak Galerkin (WG) finite element method with emphasis on obtaining lower bounds. The WG method is on the use of weak functions and their weak…
We introduce an adaptive finite element scheme for the efficient approximation of a (large) collection of eigenpairs of selfadjoint elliptic operators in which the adaptive refinement is driven by the solution of a single source problem --…
This study presents an aposteriori error analysis of adaptive finite element approximations of parabolic boundary control problems with bilateral box constraints that act on a Neumann boundary. The control problem is discretized using the…
This paper presents a new class of adaptive filters, namely Geometric-Algebra Adaptive Filters (GAAFs). They are generated by formulating the underlying minimization problem (a deterministic cost function) from the perspective of Geometric…
Adaptive meshing is a fundamental component of adaptive finite element methods. This includes refining and coarsening meshes locally. In this work, we are concerned with the red-green-blue refinement strategy in two dimensions and its…
A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…
We study the convergence of the shuffling gradient method, a popular algorithm employed to minimize the finite-sum function with regularization, in which functions are passed to apply (Proximal) Gradient Descent (GD) one by one whose order…
We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones. Thanks to this adaptation…
We consider the regression model with (known) random design. We investigate the minimax performances of an adaptive wavelet block thresholding estimator under the $\mathbb{L}^p$ risk with $p\ge 2$ over Besov balls. We prove that it is near…
We analyse the convergence of an approximate, fully inexact, ADMM algorithm under additive, deterministic and probabilistic error models. We consider the generalized ADMM scheme that is derived from generalized Lagrangian penalty with…
We prove that for compactly perturbed elliptic problems, where the corresponding bilinear form satisfies a Garding inequality, adaptive mesh-refinement is capable of overcoming the preasymptotic behavior and eventually leads to convergence…
This paper reviews the state of the art and discusses very recent mathematical developments in the field of adaptive boundary element methods. This includes an overview of available a posteriori error estimates as well as a state-of-the-art…