Analysis of the binary complexity of asymptotically fast algorithms for linear system solving

DOI10.1145/43876.43880zbMath0658.65027OpenAlexW2120601577MaRDI QIDQ3806671

Erich L. Kaltofen, Brent Gregory

Publication date: 1988

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/43876.43880

zbMATH Keywords

linear systemsGaussian eliminationasymptotically fast algorithmsmatrix triangularization algorithmbinary complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Computation of distances for regular and context-free probabilistic languages

This page was built for publication: Analysis of the binary complexity of asymptotically fast algorithms for linear system solving