An interval extension of SMS method for computing weighted Moore–Penrose inverse

Roy, Falguni; Gupta, Dharmendra K.; Stanimirović, Predrag S.

doi:10.1007/s10092-018-0257-4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Definition1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2020

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, X ∈ C n×m is called the WMP inverse of A, and is shown by A † MN . Noting that, as long as M = I m×m and N = I n×n , then X is the Moore-Penrose (MP) inverse, or simply the pseudo-inverse of A, and we show it by A † [17]. Furthermore, when the matrix A is non-singular, then the pseudo-inverse will be simplified to the regular inverse.…”

Section: Definitionmentioning

confidence: 93%

Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme

Jebreen

2019

Mathematics

View full text Add to dashboard Cite

The goal of this research is to extend and investigate an improved approach for calculating the weighted Moore-Penrose (WMP) inverses of singular or rectangular matrices. The scheme is constructed based on a hyperpower method of order ten. It is shown that the improved scheme converges with this rate using only six matrix products per cycle. Several tests are conducted to reveal the applicability and efficiency of the discussed method, in contrast with its well-known competitors.

show abstract

Section: Definitionmentioning

confidence: 93%