File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Modified Newton's algorithm for computing the group inverses of singular Toeplitz matrices
Title | Modified Newton's algorithm for computing the group inverses of singular Toeplitz matrices |
---|---|
Authors | |
Keywords | Displacement rank Group inverse Newton's iteration Toeplitz matrix |
Issue Date | 2006 |
Citation | Journal of Computational Mathematics, 2006, v. 24, n. 5, p. 647-656 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/276797 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.488 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cai, Jian Feng | - |
dc.contributor.author | Ng, Michael K. | - |
dc.contributor.author | Wei, Yi Min | - |
dc.date.accessioned | 2019-09-18T08:34:41Z | - |
dc.date.available | 2019-09-18T08:34:41Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Journal of Computational Mathematics, 2006, v. 24, n. 5, p. 647-656 | - |
dc.identifier.issn | 0254-9409 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276797 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Computational Mathematics | - |
dc.subject | Displacement rank | - |
dc.subject | Group inverse | - |
dc.subject | Newton's iteration | - |
dc.subject | Toeplitz matrix | - |
dc.title | Modified Newton's algorithm for computing the group inverses of singular Toeplitz matrices | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-33750409008 | - |
dc.identifier.volume | 24 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 647 | - |
dc.identifier.epage | 656 | - |
dc.identifier.issnl | 0254-9409 | - |