Pages that link to "Item:Q613122"

The following pages link to Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122):

Displaying 7 items.

• Optimal cache-oblivious mesh layouts (Q633762) (← links)
• Efficient boundary condition-enforced immersed boundary method for incompressible flows with moving boundaries (Q2131023) (← links)
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve (Q2905507) (← links)
• Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods (Q3066229) (← links)
• The I/O Complexity of Sparse Matrix Dense Matrix Multiplication (Q3557017) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)