skip to main content
article
Free access

Sparsity structure and Gaussian elimination

Published: 01 April 1988 Publication History

Abstract

In this paper we collate and discuss some results on the sparsity structure of a matrix. If a matrix is irreducible, Gaussian elimination yields an LU factorization in which L has at least one entry beneath the diagonal in every column except the last and U has at least one entry to the right of the diagonal in every row except the last. If this factorization is used to solve the equation Ax=b, the intermediate vector has an entry in its last component and the solution x is full. Furthermore, the inverse of A is full.Where the matrix is reducible, these results are applicable to the diagonal blocks of its block triangular form.

References

[1]
Duff, I. S. and Reid, J. K. (1978). "An implementation of Tarjan's algorithm for the block triangularization of a matrix". ACM Trans. Math. Soft. 4, pp. 137--147.
[2]
Tarjan, R. E. (1972). "Depth-first search and linear graph algorithms". SIAM J. Comput. 1, pp. 146--160.
[3]
Willoughby, R. A. (1975). "A characterization of matrix irreducibility". International Series of Numerical Mathematics 29. Birkhauser Verlag, pp. 131--143.
[4]
Schneider, H. (1977). "The concepts of irreducibility and full indecomposability of a matrix". Linear Algebra and its Applications 18, pp. 139--162

Cited By

View all
  • (2024)GPU-based parallel programming for FEM analysis in the optimization of steel framesJournal of Asian Architecture and Building Engineering10.1080/13467581.2024.2345310(1-22)Online publication date: 9-May-2024
  • (2024)Generative Modeling of Sparse Approximate Inverse PreconditionersComputational Science – ICCS 202410.1007/978-3-031-63759-9_40(378-392)Online publication date: 2-Jul-2024
  • (2023)Scalable Approximate NonSymmetric Autoencoder for Collaborative FilteringProceedings of the 17th ACM Conference on Recommender Systems10.1145/3604915.3608827(763-770)Online publication date: 14-Sep-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGNUM Newsletter
ACM SIGNUM Newsletter  Volume 23, Issue 2
April 1988
59 pages
ISSN:0163-5778
DOI:10.1145/47917
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1988
Published in SIGNUM Volume 23, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)43
  • Downloads (Last 6 weeks)5
Reflects downloads up to 22 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2024)GPU-based parallel programming for FEM analysis in the optimization of steel framesJournal of Asian Architecture and Building Engineering10.1080/13467581.2024.2345310(1-22)Online publication date: 9-May-2024
  • (2024)Generative Modeling of Sparse Approximate Inverse PreconditionersComputational Science – ICCS 202410.1007/978-3-031-63759-9_40(378-392)Online publication date: 2-Jul-2024
  • (2023)Scalable Approximate NonSymmetric Autoencoder for Collaborative FilteringProceedings of the 17th ACM Conference on Recommender Systems10.1145/3604915.3608827(763-770)Online publication date: 14-Sep-2023
  • (2023)Stability, Ill-Conditioning, and Symmetric Indefinite FactorizationsAlgorithms for Sparse Linear Systems10.1007/978-3-031-25820-6_7(113-134)Online publication date: 11-Jan-2023
  • (2016)A survey of direct methods for sparse linear systemsActa Numerica10.1017/S096249291600007625(383-566)Online publication date: 23-May-2016
  • (2015)$$\mathcal H$$H-FAINVComputing and Visualization in Science10.1007/s00791-015-0254-y17:3(135-150)Online publication date: 1-Jun-2015
  • (2013)Simultaneous analysis of large INTEGRAL/SPI11Based on observations with INTEGRAL, an ESA project with instruments and science data center funded by ESA member states (especially the PI countries: Denmark, France, Germany, Italy, Spain, and Switzerland), Czech Republic and Poland with participation of Russia and the USA. datasets: Optimizing the computation of the solution and its variance using sparse matrix algorithmsAstronomy and Computing10.1016/j.ascom.2013.03.0021(59-69)Online publication date: Feb-2013
  • (2013)Fast methods for computing selected elements of the green's function in massively parallel nanoelectronic device simulationsProceedings of the 19th international conference on Parallel Processing10.1007/978-3-642-40047-6_54(533-544)Online publication date: 26-Aug-2013
  • (2012)Combinatorial Problems in Solving Linear SystemsCombinatorial Scientific Computing10.1201/b11644-3(21-68)Online publication date: 29-Mar-2012
  • (2012)On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core EnvironmentSIAM Journal on Scientific Computing10.1137/10079941134:4(A1975-A1999)Online publication date: Jan-2012
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media