Gregory, Brent; Kaltofen, Erich Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. (English) Zbl 0658.65027 SIGSAM Bull. 22, No. 2, 41-49 (1988). This paper deals with the analysis of the binary complexity of asymptotically fast algorithms for linear systems. The main result is negative: it shows that asymptotically fast methods may significantly increase the size of intermediately computers fractions. For specific domains, this growth can be controlled. Reviewer: F.Chatelin Cited in 1 Document MSC: 65F05 Direct numerical methods for linear systems and matrix inversion 68Q25 Analysis of algorithms and problem complexity Keywords:Gaussian elimination; matrix triangularization algorithm; binary complexity; asymptotically fast algorithms; linear systems PDFBibTeX XMLCite \textit{B. Gregory} and \textit{E. Kaltofen}, SIGSAM Bull. 22, No. 2, 41--49 (1988; Zbl 0658.65027) Full Text: DOI