相关论文: On Generalizing Trace Minimization Principles, II
We deal with the minimization of the ${\mathcal H}_\infty$-norm of the transfer function of a parameter-dependent descriptor system over the set of admissible parameter values. Subspace frameworks are proposed for such minimization problems…
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$…
We characterize the infimum of a matrix norm of a square matrix A induced by an absolute norm, over the fields of real and complex numbers. Usually this infimum is greater than the spectral radius of A. If A is sign equivalent to a…
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
Recent works on over-parameterized neural networks have shown that the stochasticity in optimizers has the implicit regularization effect of minimizing the sharpness of the loss function (in particular, the trace of its Hessian) over the…
This paper presents an efficient method for obtaining the least squares Hermitian solutions of the reduced biquaternion matrix equation $(AXB, CXD) = (E, F )$. The method leverages the real representation of reduced biquaternion matrices.…
Hua's fundamental theorem of geometry of hermitian matrices characterizes all bijective maps on the space of all hermitian matrices, which preserve adjacency in both directions. In this and subsequent paper we characterize maps on the set…
The Horn inequalities characterise the possible spectra of triples of $n$-by-$n$ Hermitian matrices $A+B=C$. We study integral inequalities that arise as limits of Horn inequalities as $n \to \infty$. These inequalities are parametrised by…
We study integral operators on the space of square-integrable functions from a compact set, $X$, to a separable Hilbert space, $H$. The kernel of such an operator takes values in the ideal of Hilbert-Schmidt operators on $H$. We establish…
We derive transformation rules for test ideals and $F$-singularities under an arbitrary finite surjective morphism $\pi : Y \to X$ of normal varieties in prime characteristic $p > 0$. The main technique is to relate homomorphisms $F_{*}…
We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…
This work concerns the global minimization of a prescribed eigenvalue or a weighted sum of prescribed eigenvalues of a Hermitian matrix-valued function depending on its parameters analytically in a box. We describe how the analytical…
We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…
We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…
We use an extension of the diagrammatic rules in random matrix theory to evaluate spectral properties of finite and infinite products of large complex matrices and large hermitian matrices. The infinite product case allows us to define a…
We consider homomorphisms of hermitian holomorphic Hilbert bundles. Assuming the homomorphism decreases curvature, we prove that its pointwise norm is plurisubharmonic.
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.…
We show that a doubly minimal system $X$ has the property that for every minimal system $Y$ the orbit closure of any pair $(y,x) \in Y \times X$ is either $Y \times X$ or it has the form $\Gamma_\pi = \{(\pi(x),x) : x \in X\}$ for some…
Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on…
It is known that if a 2-universal hash function $H$ is applied to elements of a {\em block source} $(X_1,...,X_T)$, where each item $X_i$ has enough min-entropy conditioned on the previous items, then the output distribution…