1972
DOI: 10.1007/bf02479751
|View full text |Cite
|
Sign up to set email alerts
|

Numerical algorithms for the Moore-Penrose inverse of a matrix: Direct methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0
2

Year Published

1972
1972
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 52 publications
(24 citation statements)
references
References 14 publications
0
16
0
2
Order By: Relevance
“…Hüls (2008). For the computation of the Moore-Penrose inverse, we refer to Shinozaki et al (1972). The dichotomy projector is the N-th block component of the solution u J .…”
Section: Numerical Detection Of Sacker-sell Spectral Intervals Via DImentioning
confidence: 99%
“…Hüls (2008). For the computation of the Moore-Penrose inverse, we refer to Shinozaki et al (1972). The dichotomy projector is the N-th block component of the solution u J .…”
Section: Numerical Detection Of Sacker-sell Spectral Intervals Via DImentioning
confidence: 99%
“…There are many methods to compute the Moore-Penrose inverse of a matrix. Shinozaki et al(1972aShinozaki et al( , 1972b surveyed the methods for computing the Moore-Penrose inverse into two subjects: direct methods and iterative methods. In order to find the Moore-Penrose inverse of an arbitrary matrix, these methods are very useful.…”
Section: Introductionmentioning
confidence: 99%
“…For the calculation of the pseudoinverse there exists a numerically more efficient approach using Singular Value Decomposition (SVD), see [147]. is fulfilled [132].…”
Section: A2 Gridded Data Interpolationmentioning
confidence: 99%