Componentwise condition numbers of random sparse matrices

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review

2 Scopus Citations
Scopus Metrics
View graph of relations

Author(s)

  • Dennis Cheung
  • Felipe Cucker

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)721-731
Journal / PublicationSIAM Journal on Matrix Analysis and Applications
Volume31
Issue number2
Publication statusPublished - 2009

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-72449192637&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(4fef9a0e-7a67-46ae-8b4a-724efc5af557).html

Abstract

We prove an 0(log n) bound for the expected value of the logarithm of the componentwise (and, a fortiori, the mixed) condition number of a random sparse n X n matrix. As a consequence, small bounds on the average loss of accuracy for t riangular linear systems follow. © 2009 Society for Industrial and Applied Mathematics.

Research Area(s)

  • Average loss of precision, Sparse matrices, Triangular systems

Fingerprint

Publication fingerprints text

100
Condition number Mathematics
80
Mixed number Mathematics
51
Sparse matrix Mathematics
49
Random matrices Mathematics
49
Expected value Mathematics
47
Logarithm Mathematics
36
Linear systems Mathematics
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
Componentwise condition numbers of random sparse matrices. / Cheung, Dennis; Cucker, Felipe.
In: SIAM Journal on Matrix Analysis and Applications, Vol. 31, No. 2, 2009, p. 721-731.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review