Pages that link to "Item:Q3916021"
From MaRDI portal
The following pages link to Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product (Q3916021):
Displayed 4 items.
- Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices (Q1090071) (← links)
- The equivalence of decimation in time and decimation in frequency in FFT computations (Q1107953) (← links)
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575) (← links)
- On the accuracy of solving triangular systems in parallel. II (Q1184726) (← links)