List of all speakers and titles at the conference “computational linear algebra in algebraic and related problems”

The bit complexity of matrix multiplicat

The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms

✍ V.Y. Pan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 869 KB

The numbers of bit operations (br) required for matrix multiplication (MM), matrix inversion (MI). the evaluation of the determinant of a matrix (Det). and the solution of a system of linear equations (SLE) are estimated from above and below. (For SLE the estimates are nearly sharp.) The bit-complex