A Jacobi-based parallel algorithm for matrix inverse computations

  • Tian Zhou
  • , Shuai Fang
  • , Xi Yang
  • , Zheng Li
  • , Qin Guo
  • , Bin Jiang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper we propose a faster variation of one-sided Jacobi algorithm. We bring the idea of Fast-Givens rotation and utilize it in Jacobi algorithm to generate a so-called Fast-onesided Jacobi algorithm, which can be utilized to calculate matrix inverse in parallel environment in a faster speed without losing any precision. Then, we give a simpler and faster variation of the new algorithm. We use Taylor expansion to approximate the parameter to avoid calculation of square roots. Numerical results are presented to validate the theoretical analysis.

Original languageEnglish
Title of host publication2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012 - Huangshan, China
Duration: 25 Oct 201227 Oct 2012

Publication series

Name2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012

Conference

Conference2012 International Conference on Wireless Communications and Signal Processing, WCSP 2012
Country/TerritoryChina
CityHuangshan
Period25/10/1227/10/12

Keywords

  • DSP
  • Jacobi
  • SVD
  • Taylor
  • inverse
  • parallel

Fingerprint

Dive into the research topics of 'A Jacobi-based parallel algorithm for matrix inverse computations'. Together they form a unique fingerprint.

Cite this