What question did this study set out to answer?

The paper aims to explore efficient methods for calculating the pseudo-inverse of an m × n matrix and how they extend existing techniques for n × n matrices.

synapse

⌘+K

synapse

⌘+K

March 1, 1970Open Access

The least squares problem and pseudo-inverses

Key Points

The paper aims to explore efficient methods for calculating the pseudo-inverse of an m × n matrix and how they extend existing techniques for n × n matrices.
Developed uniform methods for computing pseudo-inverses of m × n matrices.
Compared and analyzed classical matrix inversion methods for applicability to pseudo-inverses.
Demonstrated that proposed methods enhance computational efficiency.
Showed that these methods are natural extensions of existing techniques for n × n matrices.

Abstract

This paper presents a number of the most efficient mothods for computing the pseudo-inverse of an m × n matrix, developing them from a uniform standpoint. It shows that these are the natural extentions of the more common methods for inverting an n × n matrix.

Read Full Paperexternally

Mark Helpful

Bookmark

Relay

View Full Paper