A divide-and-conquer approach for the computation of the Moore-Penrose inverses

Xuzhou Chen and Jun Ji

Applied Mathematics and Computation, 2020, vol. 379, issue C

Abstract: In this paper, we present a divide-and-conquer method for computing the Moore-Penrose inverse of a bidiagonal matrix. Working together with the effective parallel algorithms for the reduction of a general matrix to the bidiagonal matrix, the proposed method provides a new parallel approach for the computation of the Moore-Penrose inverse of a general matrix. This new approach was implemented in the CUDA environment and a significant speedup was observed on randomly generated matrices.

Keywords: Moore-Penrose inverse; Divide-and-conquer; Parallel algorithm (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320302344
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:379:y:2020:i:c:s0096300320302344

DOI: 10.1016/j.amc.2020.125265

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().