Related papers: Rayleigh-Ritz majorization error bounds with appli…

Ridge regression (RR) is a regularization technique that penalizes the L2-norm of the coefficients in linear regression. One of the challenges of using RR is the need to set a hyperparameter ($\alpha$) that controls the amount of…

In this paper, we present new a posteriori and a priori error bounds for the Krylov subspace methods for computing $e^{-\tau A}v$ for a given $\tau>0$ and $v \in C^n$, where $A$ is a large sparse non-Hermitian matrix. The {\em a priori}…

We describe a highly efficient numerical scheme for finding two-sided bounds for the eigenvalues of the fractional Laplace operator (-Delta)^{alpha/2} in the unit ball D in R^d, with a Dirichlet condition in the complement of D. The…

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…

This paper gives some results related to the research problem about infinite-dimensional affine variational inequalities raised by N.D. Yen and X. Yang [Affine variational inequalities on normed spaces, J. Optim. Theory Appl., 178 (2018),…

Recently, a non-classical eigenvalue solver, called RIM, was proposed to compute (all) eigenvalues in a region on the complex plane. Without solving any eigenvalue problem, it tests if a region contains eigenvalues using an approximate…

The Berezin--Li--Yau and the Kr\"oger inequalities show that Riesz means of order $\geq 1$ of the eigenvalues of the Laplacian on a domain $\Omega$ of finite measure are bounded in terms of their semiclassical limit expressions. We show…

We study the infinite-horizon average-reward reinforcement learning (RL) for continuous space Lipschitz MDPs in which an agent can play policies from a given set $\Phi$. The proposed algorithms efficiently explore the policy space by…

We establish the fundamental limits in the approximation of Lipschitz functions by deep ReLU neural networks with finite-precision weights. Specifically, three regimes, namely under-, over-, and proper quantization, in terms of minimax…

In this paper, we give explicit descriptions of versions of (Local-) Backtracking Gradient Descent and New Q-Newton's method to the Riemannian setting.Here are some easy to state consequences of results in this paper, where X is a general…

Regularization methods have been recently developed to construct stable approximate solutions to classical partial differential equations considered as final value problems. In this paper, we investigate the backward parabolic problem with…

Residual minimization is a widely used technique for solving Partial Differential Equations in variational form. It minimizes the dual norm of the residual, which naturally yields a saddle-point (min-max) problem over the so-called trial…

Let $M$ be an $n(>2)$-dimensional closed orientable submanifold in an $(n+p)$-dimensional space form $\mathbb{R}^{n+p}(c)$. We obtain an optimal upper bound for the second eigenvalue of a class of elliptic operators on $M$ defined by…

We derive novel guaranteed lower bounds for eigenvalues of the Euler-Bernoulli beam with variable bending stiffness. While the standard finite element Rayleigh-Ritz method automatically yields upper bounds, we obtain lower bounds by…

In this work, optimal rigidity results for eigenvalues on K\"ahler manifolds with positive Ricci lower bound are established. More precisely, for those K\"ahler manifolds whose first eigenvalue agrees with the Ricci lower bound, we show…

The quantization problem looks for best approximations of a probability measure on a given metric space by finitely many points, where the approximation error is measured with respect to the Wasserstein distance. On particular smooth…

We consider the minimization of a cost function $f$ on a manifold $M$ using Riemannian gradient descent and Riemannian trust regions (RTR). We focus on satisfying necessary optimality conditions within a tolerance $\varepsilon$.…

We develop a framework for proving rapid convergence of shifted QR algorithms which use Ritz values as shifts, in finite arithmetic. Our key contribution is a dichotomy result which addresses the known forward-instability issues surrounding…

We develop a general form of the Ritz method for trial functions that do not satisfy the essential boundary conditions. The idea is to treat the latter as variational constraints and remove them using the Lagrange multipliers. In…

For $1<p<\infty$, we prove the $L^p$-boundedness of the Riesz transform operators on metric measure spaces with Riemannian Ricci curvature bounded from below, without any restriction on their dimension. This large class of spaces include…