A Generalized Matrix Inverse that is Consistent with Respect to Diagonal Transformations

• URL: http://arxiv.org/abs/2604.00049v1
• Date: Mon, 30 Mar 2026 15:06:02 GMT
• Title: A Generalized Matrix Inverse that is Consistent with Respect to Diagonal Transformations
• Abstract summary: A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations.<n>It preserves units associated with variables under state space transformations.<n>The new inverse complements the Drazin inverse and the Moore-Penrose inverse to complete a trilogy of generalized matrix inverses.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general solution to a longstanding open problem relevant to a wide variety of applications in robotics, tracking, and control systems. The new inverse complements the Drazin inverse (which is consistent with respect to similarity transformations) and the Moore-Penrose inverse (which is consistent with respect to unitary/orthonormal transformations) to complete a trilogy of generalized matrix inverses that exhausts the standard family of analytically-important linear system transformations. Results are generalized to obtain unit-consistent and unit-invariant matrix decompositions and examples of their use are described.

Related papers

• Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes [2.538209532048867]
  We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes.<n>The resulting formula supplies an explicit MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes.
  arXiv  Detail & Related papers  (2026-05-14T19:58:50Z)
• Sign Embedding Quantum Algorithms for Matrix Equations and Matrix Functions [4.591453488105558]
  We develop a framework of operator-output quantum algorithms for matrix equations and matrix functions.<n>For ordinary Sylvester equations, we offer an explicit block-encoding of the target matrix solution.<n>These algorithms propagate the same overlap-based normalization bookkeeping to ordinary and generalized equations.
  arXiv  Detail & Related papers  (2026-04-28T07:50:42Z)
• Deep Delta Learning [91.75868893250662]
  We introduce Deep Delta Learning (DDL), a novel architecture that generalizes the standard residual connection.<n>We provide a spectral analysis of this operator, demonstrating that the gate $(mathbfX)$ enables dynamic between identity mapping, projection, and geometric reflection.<n>This unification empowers the network to explicitly control the spectrum of its layer-wise transition operator, enabling the modeling of complex, non-monotonic dynamics.
  arXiv  Detail & Related papers  (2026-01-01T18:11:38Z)
• Generalized Linear Mode Connectivity for Transformers [87.32299363530996]
  A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths.<n>Prior work has predominantly focused on neuron re-ordering through permutations, but such approaches are limited in scope.<n>We introduce a unified framework that captures four symmetry classes: permutations, semi-permutations, transformations, and general invertible maps.<n>This generalization enables, for the first time, the discovery of low- and zero-barrier linear paths between independently trained Vision Transformers and GPT-2 models.
  arXiv  Detail & Related papers  (2025-06-28T01:46:36Z)
• Directional Non-Commutative Monoidal Structures with Interchange Law via Commutative Generators [0.0]
  We introduce a class of algebraic structures that generalize one-dimensional monoidal systems into higher dimensions.<n>We show that the framework that unifies several well-known linear transforms in signal processing and data analysis.
  arXiv  Detail & Related papers  (2025-05-30T12:40:01Z)
• Transforming optimization problems into a QUBO form: A tutorial [45.31975029877049]
  Practically relevant problems of quadratic optimization often contain multidimensional arrays of variables interconnected by linear constraints. The paper identifies and considers three main transformations of the original problem statement. Convenient formulas for calculations are presented and proven, simplifying the implementation of these transformations.
  arXiv  Detail & Related papers  (2024-10-28T14:38:09Z)
• Source Condition Double Robust Inference on Functionals of Inverse Problems [71.42652863687117]
  We consider estimation of parameters defined as linear functionals of solutions to linear inverse problems. We provide the first source condition double robust inference method.
  arXiv  Detail & Related papers  (2023-07-25T19:54:46Z)
• Unitarization of Pseudo-Unitary Quantum Circuits in the S-matrix Framework [0.0]
  We show a family of pseudo-unitary and inter-pseudo-unitary circuits with full diagrammatic representation in three dimensions. The outcomes of our study expand the methodological toolbox needed to build a family of pseudo-unitary and inter-pseudo-unitary circuits.
  arXiv  Detail & Related papers  (2023-02-09T14:55:20Z)
• Similarity Equivariant Linear Transformation of Joint Orientation-Scale Space Representations [11.57423546614283]
  Group convolution generalizes the concept to linear operations. Group convolution that is equivariant to similarity transformation is the most general shape preserving linear operator. We present an initial demonstration of its utility by using it to compute a shape equivariant distribution of closed contours traced by particles undergoing Brownian motion in velocity.
  arXiv  Detail & Related papers  (2022-03-13T23:53:51Z)
• The Convolution Exponential and Generalized Sylvester Flows [82.18442368078804]
  This paper introduces a new method to build linear flows, by taking the exponential of a linear transformation. An important insight is that the exponential can be computed implicitly, which allows the use of convolutional layers. We show that the convolution exponential outperforms other linear transformations in generative flows on CIFAR10.
  arXiv  Detail & Related papers  (2020-06-02T19:43:36Z)
• Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous Data [52.78581260260455]
  We propose a general method to construct a convolutional layer that is equivariant to transformations from any specified Lie group. We apply the same model architecture to images, ball-and-stick molecular data, and Hamiltonian dynamical systems.
  arXiv  Detail & Related papers  (2020-02-25T17:40:38Z)

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.