Pages that link to "Item:Q3761561"
From MaRDI portal
The following pages link to On the storage requirement in the out-of-core multifrontal method for sparse factorization (Q3761561):
Displayed 9 items.
- A review of frontal methods for solving linear systems (Q1294625) (← links)
- The impact of high-performance computing in the solution of linear systems: Trends and problems (Q1591200) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
- Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations (Q2815696) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Logarithmic barriers for sparse matrix cones (Q5299902) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Minimizing I/Os in Out-of-Core Task Tree Scheduling (Q6169958) (← links)