English
Related papers

Related papers: Majorization bounds for Ritz values of self-adjoin…

200 papers

We study a.e. convergence on $L^p$, and Lorentz spaces $L^{p,q}$, $p>\tfrac{2d}{d-1}$, for variants of Riesz means at the critical index $d(\tfrac 12-\tfrac 1p)-\tfrac12$. We derive more general results for (quasi-)radial Fourier…

Classical Analysis and ODEs · Mathematics 2016-04-20 Sanghyuk Lee , Andreas Seeger

One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…

Statistics Theory · Mathematics 2024-04-26 Muhammad Usman Farooq , Tobias Fritz , Erkka Haapasalo , Marco Tomamichel

In this paper we obtain a Bernstein type inequality for the sum of self-adjoint centered and geometrically absolutely regular random matrices with bounded largest eigenvalue. This inequality can be viewed as an extension to the matrix…

Probability · Mathematics 2018-07-19 Marwa Banna , Florence Merlevède , Pierre Youssef

This paper directly builds upon previous work where we introduced new reduced basis a posteriori error bounds for parametrized saddle point problems based on Brezzi's theory. We here sharpen these estimates for the special case of a…

Numerical Analysis · Mathematics 2012-11-06 Anna-Lena Gerner , Karen Veroy

In this article, we establish a limiting distribution for eigenvalues of a class of auto-covariance matrices. The same distribution has been found in the literature for a regularized version of these auto-covariance matrices. The original…

Probability · Mathematics 2021-03-23 Jianfeng Yao , Wangjun Yuan

For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…

Numerical Analysis · Mathematics 2022-07-19 Xuefeng Liu , Tomáš Vejchodský

In the framework of the majorization technique, an improved condition is proposed for the semilocal convergence of the Newton method under the mild assumption that the derivative of the involved operator F(x) is continuous. Our starting…

Numerical Analysis · Mathematics 2015-03-13 Andrei Dubin

We present a new approach to convergence rate results for variational regularization. Avoiding Bregman distances and using image space approximation rates as source conditions we prove a nearly minimax theorem showing that the modulus of…

Numerical Analysis · Mathematics 2021-07-07 Philip Miller

M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…

Spectral Theory · Mathematics 2025-10-20 Lyonell Boulton

This article generalises the well-known Katznelson-Tzafriri theorem for a $C_0$-semigroup $T$ on a Banach space $X$, by removing the assumption that a certain measure in the original result be absolutely continuous. In an important special…

Functional Analysis · Mathematics 2015-01-21 David Seifert

We investigate the large values of the derivatives of the Riemann zeta function $\zeta(s)$ on the 1-line. We give a larger lower bound for $\max_{t\in[T,2T]}|\zeta^{(\ell)}(1+{\rm i} t)|$, which improves the previous result established by…

Number Theory · Mathematics 2022-03-31 Zikang Dong , Bin Wei

Over the past few years, a family of interesting new inequalities for the entropies of sums and differences of random variables has been developed by Ruzsa, Tao and others, motivated by analogous results in additive combinatorics. The…

Information Theory · Computer Science 2020-02-07 Mokshay Madiman , Ioannis Kontoyiannis

This paper addresses two different but related questions regarding an unbounded symmetric tridiagonal operator: its self-adjointness and the approximation of its spectrum by the eigenvalues of its finite truncations. The sufficient…

Functional Analysis · Mathematics 2014-07-17 Eugenia N. Petropoulou , L. Velázquez

Given an integral domain A we consider the set of all integral elements over A that can occur as an eigenvalue of a symmetric matrix over A. We give a sufficient criterion for being such an element. In the case where A is the ring of…

Number Theory · Mathematics 2016-08-12 Mario Kummer

In this paper we discuss general tridiagonal matrix models which are natural extensions of the ones given by Dumitriu and Edelman. We prove here the convergence of the distribution of the eigenvalues and compute the limiting distributions…

Probability · Mathematics 2008-02-18 Ionel Popescu

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is simpler. We give several corollaries relevant to minors of…

Combinatorics · Mathematics 2013-09-10 Richard P. Brent , Judy-anne H. Osborn

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

Statistics Theory · Mathematics 2013-12-24 Avanti Athreya , Vince Lyzinski , David J. Marchette , Carey E. Priebe , Daniel L. Sussman , Minh Tang

It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…

Information Theory · Computer Science 2014-06-23 Junil Choi , David J. Love

We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

Numerical Analysis · Mathematics 2016-05-31 Aaron Melman