Related papers: Error Bounds for the Krylov Subspace Methods for C…
We study the error introduced by entropy regularization in infinite-horizon discrete discounted Markov decision processes. We show that this error decreases exponentially in the inverse regularization strength, both in a weighted…
Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…
We propose local space-time approximation spaces for parabolic problems that are optimal in the sense of Kolmogorov and may be employed in multiscale and domain decomposition methods. The diffusion coefficient can be arbitrarily rough in…
With the goal of solving optimisation problems on non-Riemannian manifolds, such as geometrical surfaces with sharp edges, we develop and prove the convergence of a forward-backward method in Alexandrov spaces with curvature bounded both…
Interior eigenvalue problems for large-scale sparse Hermitian matrices are fundamental in computational science. We propose an adaptive polynomial filtering strategy based on Chebyshev expansion of a step function, integrated into a…
We generalize and analyse the method for computing lower bounds of the principal eigenvalue proposed in our previous paper (I. Sebestova, T. Vejchodsky, SIAM J. Numer. Anal. 2014). This method is suitable for symmetric elliptic eigenvalue…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…
This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…
In nonlinear deterministic parameter estimation, the maximum likelihood estimator (MLE) is unable to attain the Cramer-Rao lower bound at low and medium signal-to-noise ratios (SNR) due the threshold and ambiguity phenomena. In order to…
This article studies a priori error analysis for linear parabolic interface problems with measure data in time in a bounded convex polygonal domain in $\mathbb{R}^2$. We have used the standard continuous fitted finite element discretization…
We derive error bounds for CUR matrix approximation using determinant-based methods that relate local projection errors to global approximation quality. For general matrices, we establish determinant identities for bordered Gramian matrices…
Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…
Low-rank pseudoinverses are widely used to approximate matrix inverses in scalable machine learning, optimization, and scientific computing. However, real-world matrices are often observed with noise, arising from sampling, sketching, and…
In this paper we explore the maximum precision attainable in the location of a point source imaged by a pixel array detector in the presence of a background, as a function of the detector properties. For this we use a well-known result from…
The rejection threshold used for e-values and e-processes is by default set to $1/\alpha$ for a guaranteed type-I error control at $\alpha$, based on Markov's and Ville's inequalities. This threshold can be wasteful in practical…
We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Here, given access to a matrix $A$ through matrix-vector products, an accuracy parameter $\epsilon$, and a target rank $k$, the…
Recently, Krylov, Barles, and Jakobsen developed the theory for estimating errors of monotone approximation schemes for the Bellman equation (a convex Isaacs equation). In this paper we consider an extension of this theory to a class of…
The paper presents two variants of a Krylov-Simplex iterative method that combines Krylov and simplex iterations to minimize the residual $r = b-Ax$. The first method minimizes $\|r\|_\infty$, i.e. maximum of the absolute residuals. The…
For many applications, it is convenient to have good upper bounds for the norm of the inverse of a given matrix. In this paper, we obtain such bounds when A is a Nekrasov matrix, by means of a scaling matrix transforming A into a strictly…
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by ``non-commutative convex combinations'' A of permutation matrices of the…