English
Related papers

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

200 papers

Let $A$ be a $d\times d$ complex self-adjoint matrix, $\mathcal{X},\mathcal{Y}\subset \mathbb{C}^d$ be $k$-dimensional subspaces and let $X$ be a $d\times k$ complex matrix whose columns form an orthonormal basis of $\mathcal{X}$. We…

Functional Analysis · Mathematics 2021-04-15 Pedro Massey , Demetrio Stojanoff , Sebastian Zarate

The Rayleigh-Ritz method is widely used for eigenvalue approximation. Given a matrix $X$ with columns that form an orthonormal basis for a subspace $\X$, and a Hermitian matrix $A$, the eigenvalues of $X^HAX$ are called Ritz values of $A$…

Numerical Analysis · Mathematics 2008-05-16 M. E. Argentati , A. V. Knyazev , C. C. Paige , I. Panayotov

Many inequality relations between real vector quantities can be succinctly expressed as "weak (sub)majorization" relations. We explain these ideas and apply them in several areas: angles between subspaces, Ritz values, and graph Laplacian…

Numerical Analysis · Mathematics 2013-03-26 A. V. Knyazev , M. E. Argentati

The absolute change in the Rayleigh quotient (RQ) for a Hermitian matrix with respect to vectors is bounded in terms of the norms of the residual vectors and the angle between vectors in [\doi{10.1137/120884468}]. We substitute…

Numerical Analysis · Mathematics 2017-01-12 Andrew Knyazev , Peizhen Zhu

We consider bounds on the convergence of Ritz values from a sequence of Krylov subspaces to interior eigenvalues of Hermitean matrices. These bounds are useful in regions of low spectral density, for example near voids in the spectrum, as…

Numerical Analysis · Mathematics 2011-10-18 Chris Johnson , A. D. Kennedy

The Rayleigh-Ritz (RR) method finds the stationary values, called Ritz values, of the Rayleigh quotient on a given trial subspace as approximations to eigenvalues of a Hermitian operator $A$. If the trial subspace is $A$-invariant, the Ritz…

Numerical Analysis · Mathematics 2010-01-08 Andrew V. Knyazev , Merico E. Argentati

We extend bounds, proved by R.C. Thompson in 1966, on the sum of the $j$-th largest eigenvalues of the $(n-1) \times (n-1)$ principal matrices of an $n \times n$ Hermitian matrix. Our bounds are stronger than just summing up Thompson's…

Rings and Algebras · Mathematics 2026-01-26 Hristo Sendov , Mengxu Yuan

We derive sharp bounds for the accuracy of approximate eigenvectors (Ritz vectors) obtained by the Rayleigh-Ritz process for symmetric eigenvalue problems. Using information that is available or easy to estimate, our bounds improve the…

Numerical Analysis · Mathematics 2020-01-01 Yuji Nakatsukasa

Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…

Numerical Analysis · Mathematics 2025-10-07 Irina-Beatrice Haas , Yuji Nakatsukasa

Eigenvalue estimates that are optimal in some sense have self-evident appeal and leave estimators with a sense of virtue and economy. So, it is natural that ongoing searches for effective strategies for difficult tasks such as estimating…

Rings and Algebras · Mathematics 2007-05-23 Christopher Beattie

We present some extensions of Bernstein's concentration inequality for random matrices. This inequality has become a useful and powerful tool for many problems in statistics, signal processing and theoretical computer science. The main…

Probability · Mathematics 2017-04-18 Stanislav Minsker

A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is…

Information Theory · Computer Science 2015-10-20 Igal Sason , Sergio Verdu

In this paper we present a theoretical analysis in order to establish maximal and minimal vectors with respect to the majorization order of particular subsets of \Re ^n: Afterwards we apply these issues to the calcula- tion of bounds for a…

Combinatorics · Mathematics 2015-03-27 Monica Bianchi , Alessandra Cornaro , Anna Torriero

New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…

Information Theory · Computer Science 2015-04-14 Igal Sason

We formulate and prove $\textit{a priori}$ bounds for the renormalization of H\'enon-like maps (under certain regularity assumptions). This provides a certain uniform control on the small-scale geometry of the dynamics, and ensures…

Dynamical Systems · Mathematics 2024-11-22 Sylvain Crovisier , Mikhail Lyubich , Enrique Pujals , Jonguk Yang

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…

Probability · Mathematics 2014-04-29 Joel A. Tropp

We derive novel concentration inequalities for the operator norm of the sum of self-adjoint operators that do not explicitly depend on the underlying dimension of the operator, but rather an intrinsic notion of it. Our analysis leads to…

Statistics Theory · Mathematics 2026-02-17 Diego Martinez-Taboada , Aaditya Ramdas

This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…

Probability · Mathematics 2013-09-25 Sandrine Dallaporta

In this paper we study relative Riemann-Zariski spaces attached to a morphism of schemes and generalizing the classical Riemann-Zariski space of a field. We prove that similarly to the classical RZ spaces, the relative ones can be described…

Algebraic Geometry · Mathematics 2011-10-11 Michael Temkin

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

Combinatorics · Mathematics 2026-05-27 Shaowei Sun , Yaping Min , Kinkar Chandra Das
‹ Prev 1 2 3 10 Next ›