Related papers: Matrix versions of some classical inequalities
Refinements of some recent reverse inequalities for the celebrated Cauchy-Bunyakovsky-Schwarz inequality in 2-inner product spaces are given. Using this framework, applications for determinantal integral inequalities are also provided.
The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…
The matrix version of the entropy-power inequality for real or complex coefficients and variables is proved using a transportation argument that easily settles the equality case. An application to blind source extraction is given.
We examine versions of the classical inequalities of Paley and Zygmund for functions of several variables. A sharp multiplier inclusion theorem and variants on the real line are obtained.
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
In a brief review, we discuss interrelations between arbitrary solutions of the loop equations that describe Hermitean one-matrix model and particular (multi-cut) solutions that describe concrete matrix integrals. These latter ones enjoy a…
Stretching is a new sparse matrix method that makes matrices sparser by making them larger. Stretching has implications for computational complexity theory and applications in scientific and parallel computing. It changes matrix sparsity…
The numerical solution of linear discrete ill-posed problems typically requires regularization, i.e., replacement of the available ill-conditioned problem by a nearby better conditioned one. The most popular regularization methods for…
We study the Hardy identities and inequalities on Cartan-Hadamard manifolds using the notion of a Bessel pair. These Hardy identities offer significantly more information on the existence/nonexistence of the extremal functions of the Hardy…
The aim of this paper is to prove an improved version of the bounded differences inequality for matrix valued functions, by developing the methods of Mackey et al.: "Matrix Concentration Inequalities via the Method of Exchangeable Pairs".…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
In this thesis, we study problems at the interface of analysis and discrete mathematics. We discuss analogues of well known Hardy-type inequalities and Rearrangement inequalities on the lattice graphs $\mathbb{Z}^d$, with a particular focus…
We establish primitive recursive versions of some known facts about computable ordered fields of reals and computable reals, and then apply them to proving primitive recursiveness of some natural problems in linear algebra and analysis. In…
Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establishes lower bounds on the worst-case number of…
Reverses of Schwarz, triangle and Bessel inequalities in inner product spaces that improve some earlier results are pointed out. They are applied to obtain new Gruss type inequalities in inner product spaces. Some natural applications for…
In this paper we prove that there is a continuum set of increments with some minimal structure for the Hardy - Littlewood integral. The result implies a number of new properties of the Hardy - Littlewood integral.
Kontsevitch's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In a subsequent work Okounkov rederived these results from the edge behavior of a Gaussian matrix integral.…
In this paper we demonstrate that a well known linear inequality method developed for rational Chebyshev approximation is equivalent to the application of the bisection method used in quasiconvex optimisation. Although this correspondence…
We establish a class of Oppenheim--Schur-type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend to a causal convolutional setting the classical Schur and Oppenheim inequalities…
In this paper we use some basic facts from the theory of (matrix) Lie groups and algebras to show that many of the classical matrix splittings used to construct stationary iterative methods and preconditioniers for Krylov subspace methods…