NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Complexity of Sparse Matrix Algorithms

Studies computational complexity of sparse matrix operations, including linear system solving and eigenvalue computation with sparsity constraints.