Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme
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 wit...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-08-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/8/731 |
| _version_ | 1819261459381616640 |
|---|---|
| author | Haifa Bin Jebreen |
| author_facet | Haifa Bin Jebreen |
| author_sort | Haifa Bin Jebreen |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-23T19:42:08Z |
| format | Article |
| id | doaj.art-7a9f5e3070c941b0870f22a826687739 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-12-23T19:42:08Z |
| publishDate | 2019-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-7a9f5e3070c941b0870f22a8266877392022-12-21T17:33:39ZengMDPI AGMathematics2227-73902019-08-017873110.3390/math7080731math7080731Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration SchemeHaifa Bin Jebreen0Mathematics Department, College of Science, King Saud University, Riyadh 11451, Saudi ArabiaThe 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.https://www.mdpi.com/2227-7390/7/8/731iteration schemeMoore–Penroserectangular matricesrate of convergenceefficiency index |
| spellingShingle | Haifa Bin Jebreen Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme Mathematics iteration scheme Moore–Penrose rectangular matrices rate of convergence efficiency index |
| title | Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme |
| title_full | Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme |
| title_fullStr | Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme |
| title_full_unstemmed | Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme |
| title_short | Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme |
| title_sort | calculating the weighted moore penrose inverse by a high order iteration scheme |
| topic | iteration scheme Moore–Penrose rectangular matrices rate of convergence efficiency index |
| url | https://www.mdpi.com/2227-7390/7/8/731 |
| work_keys_str_mv | AT haifabinjebreen calculatingtheweightedmoorepenroseinversebyahighorderiterationscheme |