Analysis of dissection algorithms for vector computers
From MaRDI portal
Publication:1250682
DOI10.1016/0898-1221(78)90010-XzbMath0388.65012OpenAlexW1975464145MaRDI QIDQ1250682
Publication date: 1978
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(78)90010-x
Cites Work
- The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
- Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
- Incomplete Nested Dissection for Solving n by n Grid Problems
- On Block Elimination for Sparse Linear Systems
- Nested Dissection of a Regular Finite Element Mesh
- Complexity Bounds for Regular Finite Difference and Finite Element Grids
- Unnamed Item
This page was built for publication: Analysis of dissection algorithms for vector computers