Pages that link to "Item:Q4195885"
From MaRDI portal
The following pages link to An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems (Q4195885):
Displaying 14 items.
- A fast algorithm for sparse matrix computations related to inversion (Q401614) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- Task scheduling for parallel sparse Cholesky factorization (Q915427) (← links)
- Row-ordering schemes for sparse Givens transformations. II. Implicit graph model (Q1078976) (← links)
- Solution of algebraic equations generated by the p-version of the finite element method (Q1092605) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← 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)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint (Q1921328) (← links)
- A multilevel approach for trace system in HDG discretizations (Q2122738) (← links)
