Modified Newton's algorithm for computing the group inverses of singular Toeplitz matrices

Jian Feng Cai*, Kwok Po NG, Yi Min Wei

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

Newton's iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton's iteration can be done efficiently. We show that the convergence of the modified Newton iteration is still very fast. Numerical results are presented to demonstrate the fast convergence of the proposed method.

Original languageEnglish
Pages (from-to)647-656
Number of pages10
JournalJournal of Computational Mathematics
Volume24
Issue number5
Publication statusPublished - Sep 2006

Scopus Subject Areas

  • Computational Mathematics

User-Defined Keywords

  • Displacement rank
  • Group inverse
  • Newton's iteration
  • Toeplitz matrix

Fingerprint

Dive into the research topics of 'Modified Newton's algorithm for computing the group inverses of singular Toeplitz matrices'. Together they form a unique fingerprint.

Cite this