Pages that link to "Item:Q1103322"
From MaRDI portal
The following pages link to The analysis of a nested dissection algorithm (Q1103322):
Displayed 8 items.
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- A parallel graph partitioning algorithm for a message-passing multiprocessor (Q1111029) (← links)
- Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. (Algorithmic study and complexity bounds for a nested dissection solver) (Q1114300) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- Efficient approximate solution of sparse linear systems (Q1125019) (← links)
- Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées (Q3789083) (← links)