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

Jeffrey Uhlmann

math.NAMar 30, 2026

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

Authors: Jeffrey Uhlmann

Organizations: University of Missouri-Columbia 201 EBW, Columbia, MO 65211

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.

Local Inverse Geometry Can Be Amortized
May 13, 2026Aaditya L. KachhadiyaNeural Surrogate Modeling Inference-Time Optimization
Independent Researcher Surat, India
Solving Minimal Problems Without Matrix Inversion Using FFT-Based Interpolation
May 7, 2026Haidong Wu, Snehal Bhayani, Janne HeikkiläMulti-View Geometry Camera Pose Estimation
Center for Machine Vision and Signal Analysis University of Oulu, Oulu, Finland
Robustly Invertible Nonlinear Dynamics and the BiLipREN: From Inversion-Based Control to Generative Trajectory Modelling
Jul 10, 2026Yurui Zhang, Ruigang Wang, Ian R. ManchesterInvertible Neural Networks Recurrent Neural Networks
Australian Centre for Robotics (ACFR), and the School of Aerospace, Mechanical and Mechatronic Engineering, The University of Sydney, Australia

May 13, 2026J/K move · Enter open · S save

Local Inverse Geometry Can Be Amortized

Aaditya L. Kachhadiya

Independent Researcher Surat, India

Neural Surrogate Modeling Inference-Time Optimization Amortized Inference Learning to Optimize PDE Inverse Problems

Open paper AskPDF arXiv

Nonlinear inverse problems often trade inexpensive but fragile first-order updates against curvature-aware methods such as Gauss-Newton and Levenberg-Marquardt, which obtain stronger directions by repeatedly solving Jacobian-based linearized systems. We propose a learned alternative: amortize local inverse geometry into a reusable reverse operator. Our framework learns a bidirectional surrogate, Deceptron, and deploys it through D-IPG (Deceptron Inverse-Preconditioned Gradient), an iterative solver that pulls residual-corrected measurement-space proposals back to latent space. The key mechanism is a Jacobian Composition Penalty (JCP), which trains the reverse Jacobian to act as a local left inverse of the forward Jacobian; its runtime counterpart, RJCP, measures the same inverse-consistency error along optimization trajectories. We prove that D-IPG is first-order equivalent to damped Gauss-Newton under local pseudoinverse consistency, with deviation controlled by composition error and conditioning. Across seven PDE inverse-problem benchmarks, D-IPG outperforms standard baselines, achieves 94.8% mean success across the six-problem reliability suite, and reaches comparable or better recovery quality at up to 77x lower inference-time solve cost on the main benchmarks.

Abstract

Explore similar work

Local Inverse Geometry Can Be Amortized

Solving Minimal Problems Without Matrix Inversion Using FFT-Based Interpolation

Robustly Invertible Nonlinear Dynamics and the BiLipREN: From Inversion-Based Control to Generative Trajectory Modelling