English
Related papers

Related papers: Best approximants relative to a C$^*$-subalgebra, …

200 papers

Matrix rank and inertia optimization problems are a class of discontinuous optimization problems in which the decision variables are matrices running over certain matrix sets, while the ranks and inertias of the variable matrices are taken…

Optimization and Control · Mathematics 2013-01-15 Yongge Tian

In a previous joint paper with Wu and Yakimov, we gave an explicit description of the lowest discriminant ideal in Cayley-Hamilton Hopf algebras $(H,C,\mathrm{tr})$ with basic identity fiber, i.e. all irreducible representations over the…

Representation Theory · Mathematics 2025-07-09 Zhongkai Mi

In a paper from 1973 R.D. Hill studied linear matrix maps $\mathcal{L}:\mathbb{C}^{q \times q}\to\mathbb{C}^{n \times n}$ which map Hermitian matrices to Hermitian matrices, or equivalently, preserve adjoints, i.e.,…

Functional Analysis · Mathematics 2021-03-29 Sanne ter Horst , Alma Naude

In this document, some elements of the theory and algorithmics corresponding to the existence and computability of approximate joint eigenpairs for finite collections of matrices with applications to model order reduction, are presented.…

Numerical Analysis · Mathematics 2022-10-21 Terry A. Loring , Fredy Vides

In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…

Numerical Analysis · Mathematics 2021-04-02 Peter Benner , Xin Liang , Suzana Miodragović , Ninoslav Truhar

The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density…

Machine Learning · Statistics 2016-04-19 Vladimir Koltchinskii , Dong Xia

This article discusses a way for uniquely setting up the valuations for the minimal generators of the maximal ideal of a one dimensional complete reduced and irreducible local algebra over an algebraically closed field, when treated as a…

Commutative Algebra · Mathematics 2025-09-23 Reinhold Hübl , Craig Huneke , Sarasij Maitra , Vivek Mukundan

Let $\a$ be a real-valued random variable of mean zero and variance 1. Let $M_n(\a)$ denote the $n \times n$ random matrix whose entries are iid copies of $\a$ and $\sigma_n(M_n(\a))$ denote the least singular value of $M_n(\a)$.…

Probability · Mathematics 2009-03-04 Terence Tao , Van Vu

For a matrix $T \in M_m(\mathbb{C})$, let $|T| : = \sqrt{T^*T}$. For $A \in M_m(\mathbb{C})$, we show that the matrix sequence $\big\{ |A^n|^{\frac{1}{n}} \big\}_{n \in \mathbb{N}}$ converges in norm to a positive-semidefinite matrix $H$…

Functional Analysis · Mathematics 2023-11-13 Soumyashant Nayak

The one-dimensional real line of coordinates is replaced, for simplification or approximation purposes, by an N-plet of the so called Gauss-Hermite grid points. These grid points are interpreted as the eigenvalues of a tridiagonal matrix…

Quantum Physics · Physics 2011-09-02 Miloslav Znojil

The objective of the matrix selection problem is to select a submatrix $A_{S}\in \mathbb{R}^{n\times k}$ from $A\in \mathbb{R}^{n\times m}$ such that its minimum singular value is maximized. In this paper, we employ the interlacing…

Functional Analysis · Mathematics 2025-08-15 Zhiqiang Xu

Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…

Numerical Analysis · Mathematics 2024-12-02 Cecilia Chen , John Urschel

This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control…

Numerical Analysis · Mathematics 2024-06-21 Nicat Aliyev , Emre Mengi

We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $\mu$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in…

Data Structures and Algorithms · Computer Science 2025-10-07 Beatrice Bertolotti , Matteo Russo , Chris Schwiegelshohn , Sudarshan Shyam

We aim to characterize the category of injective *-homomorphisms between commutative C*-subalgebras of a given C*-algebra A. We reduce this problem to finding a weakly terminal commutative subalgebra of A, and solve the latter for various…

Operator Algebras · Mathematics 2016-12-02 Chris Heunen

Let $A\in\mathbb C^{n\times n}$ and let $\mathcal X\subset \mathbb C^n$ be an $A$-invariant subspace with $\dim \mathcal X=d\geq 1$, corresponding to exterior eigenvalues of $A$. Given an initial subspace $\mathcal V\subset \mathbb C^n$…

Numerical Analysis · Mathematics 2024-12-17 Francisco Arrieta Zuccalli , Pedro Massey , Demetrio Stojanoff

We search for the best fit in Frobenius norm of $A \in {\mathbb C}^{m \times n}$ by a matrix product $B C^*$, where $B \in {\mathbb C}^{m \times r}$ and $C \in {\mathbb C}^{n \times r}$, $r \le m$ so $B = \{b_{ij}\}$, ($i=1, \dots, m$,~…

Spectral Theory · Mathematics 2017-06-06 Ilgis Ibragimov , Elena Ibragimova

We propose a boundary regularity condition for the $M_n(\mathbb{C})$-valued subordination functions in free probability to prove the local limit theorem and delocalization of eigenvectors for polynomials in two random matrices. We prove…

Probability · Mathematics 2020-05-01 Ching-Wei Ho

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $\sigma_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment,…

Probability · Mathematics 2025-07-30 Yi Han

For coprime integers $N,a,b,c$, with $0<a<b<c<N$, we define the set $$ \{ (na \! \! \! \! \pmod{N}, nb \! \! \! \! \pmod{N}, nc \! \! \! \! \pmod{N}) : 0 \leq n < N\}. $$ We study which parameters $N,a,b,c$ generate point sets with long…

Number Theory · Mathematics 2020-08-27 Florian Pausinger
‹ Prev 1 8 9 10 Next ›