Analysis of dissection algorithms for vector computers

DOI10.1016/0898-1221(78)90010-XzbMATH Open0388.65012OpenAlexW1975464145MaRDI QIDQ1250682FDOQ1250682

Authors: K. Appert 

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

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Nested Dissection of a Regular Finite Element Mesh
• Complexity Bounds for Regular Finite Difference and Finite Element Grids
• 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
• Title not available (Why is that?)

This page was built for publication: Analysis of dissection algorithms for vector computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250682)