Two generalizations of ideal matrices and their applications

• URL: http://arxiv.org/abs/2309.11240v1
• Date: Wed, 20 Sep 2023 12:07:53 GMT
• Title: Two generalizations of ideal matrices and their applications
• Authors: Mingpei Zhang, Heng Guo, Wenlin Huang,
• Abstract summary: The concepts of generalized ideal matrices and double ideal matrices are proposed, and their ranks and maxima.linearly independent groups are verified. The initial motivation to study double cyclic matrices is to study the quasi cyclic codes of the fractional index.
• Score: 1.1758578066868612
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, two kinds of generalizations of ideal matrices, generalized ideal matrices and double ideal matrices. are obtained and studied, The concepts of generalized ideal matrices and double ideal matrices are proposed, and their ranks and maxima.linearly independent groups are verified.The initial motivation to study double cyclic matrices is to study the quasi cyclic codes of the fractional index. In this paper, the generalized form of the quasi cyclic codes, i.e. the {\phi}-quasi cyclic codes. and the construction of the generated matrix are given by the double ideal matrix.

Related papers

• 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.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Matrix decompositions in Quantum Optics: Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and Williamson [0.0]
  We present four important matrix decompositions commonly used in quantum optics. The first two of these decompositions are specialized versions of the singular-value decomposition. The third factors any symplectic matrix in a unique way in terms of matrices that belong to different subgroups of the symplectic group.
  arXiv  Detail & Related papers  (2024-03-07T15:43:17Z)
• Generalized unistochastic matrices [0.4604003661048266]
  We measure a class of bistochastic matrices generalizing unistochastic matrices. We show that the generalized unistochastic matrices is the whole Birkhoff polytope.
  arXiv  Detail & Related papers  (2023-10-05T10:21:54Z)
• 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)
• 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)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• What Is the Generalized Representation of Dirac Equation in Two Dimensions? [0.0]
  In this work, the general form of $2times2$ Dirac matrices for 2+1 dimension is found. Our motivation for this study was lack of the general representation of these matrices despite the fact that more than nine decades have been passed since the discovery of this well known equation.
  arXiv  Detail & Related papers  (2021-04-01T10:44:11Z)
• Generalized Visual Information Analysis via Tensorial Algebra [7.028302194243312]
  Higher order data is modeled using matrices whose entries are numerical arrays of a fixed size. Matrices with elements in the ring of t-scalars are referred to as t-matrices. With the t-matrix model, it is possible to generalize many well-known matrix algorithms.
  arXiv  Detail & Related papers  (2020-01-31T08:47:35Z)
• 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.