Matrix Ordering through Spectral and Nilpotent Structures in Totally Ordered Complex Number Fields
- URL: http://arxiv.org/abs/2501.10603v1
- Date: Fri, 17 Jan 2025 23:34:17 GMT
- Title: Matrix Ordering through Spectral and Nilpotent Structures in Totally Ordered Complex Number Fields
- Authors: Shih-Yu Chang,
- Abstract summary: We develop a total ordering relation for complex numbers, enabling comparisons of the spectral components of general matrices with complex eigenvalues.
We establish a theoretical framework for majorization ordering with complex-valued functions.
We characterize Jordan blocks of matrix functions using a generalized dominance order for nilpotent components.
- Score: 2.2533084621250143
- License:
- Abstract: Matrix inequalities play a pivotal role in mathematics, generalizing scalar inequalities and providing insights into linear operator structures. However, the widely used L\"owner ordering, which relies on real-valued eigenvalues, is limited to Hermitian matrices, restricting its applicability to non-Hermitian systems increasingly relevant in fields like non-Hermitian physics. To overcome this, we develop a total ordering relation for complex numbers, enabling comparisons of the spectral components of general matrices with complex eigenvalues. Building on this, we introduce the Spectral and Nilpotent Ordering (SNO), a partial order for arbitrary matrices of the same dimensions. We further establish a theoretical framework for majorization ordering with complex-valued functions, which aids in refining SNO and analyzing spectral components. An additional result is the extension of the Schur--Ostrowski criterion to the complex domain. Moreover, we characterize Jordan blocks of matrix functions using a generalized dominance order for nilpotent components, facilitating systematic analysis of non-diagonalizable matrices. Finally, we derive monotonicity and convexity conditions for functions under the SNO framework, laying a new mathematical foundation for advancing matrix analysis.
Related papers
- Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.
It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.
The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
arXiv Detail & Related papers (2024-08-02T10:15:26Z) - Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.
This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
arXiv Detail & Related papers (2024-07-15T07:11:44Z) - Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition.
A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues.
We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
arXiv Detail & Related papers (2024-05-23T12:26:25Z) - Mutually-orthogonal unitary and orthogonal matrices [6.9607365816307]
We show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
As an application in quantum information theory, we show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
arXiv Detail & Related papers (2023-09-20T08:20:57Z) - The Inductive Bias of Flatness Regularization for Deep Matrix
Factorization [58.851514333119255]
This work takes the first step toward understanding the inductive bias of the minimum trace of the Hessian solutions in deep linear networks.
We show that for all depth greater than one, with the standard Isometry Property (RIP) on the measurements, minimizing the trace of Hessian is approximately equivalent to minimizing the Schatten 1-norm of the corresponding end-to-end matrix parameters.
arXiv Detail & Related papers (2023-06-22T23:14:57Z) - Cubic-Regularized Newton for Spectral Constrained Matrix Optimization
and its Application to Fairness [9.649070872824957]
Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems.
A new convergence analysis is provided for cubic-regularized Newton for matrix vector spaces.
arXiv Detail & Related papers (2022-09-02T18:11:05Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - Matrix Decomposition and Applications [8.034728173797953]
In 1954, Alston S. Householder published Principles of Numerical Analysis, one of the first modern treatments on matrix decomposition.
matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network.
arXiv Detail & Related papers (2022-01-01T08:13:48Z) - Identifiability in Exact Two-Layer Sparse Matrix Factorization [0.0]
Sparse matrix factorization is the problem of approximating a matrix Z by a product of L sparse factors X(L) X(L--1).
This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed.
arXiv Detail & Related papers (2021-10-04T07:56:37Z) - Can one hear a matrix? Recovering a real symmetric matrix from its
spectral data [0.0]
The spectrum of a real and symmetric $Ntimes N$ matrix determines the matrix up to unitary equivalence.
More spectral data is needed together with some sign indicators to remove the unitary ambiguities.
It is shown that one can optimize the ratio between redundancy and genericity by using the freedom of choice of the spectral information input.
arXiv Detail & Related papers (2021-06-03T13:14:44Z) - Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
We develop a relative error bound for nuclear norm regularized matrix completion.
We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
arXiv Detail & Related papers (2015-04-26T13:12:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.