Analysis of dissection algorithms for vector computers

DOI10.1016/0898-1221(78)90010-XMaRDI QIDQ1250682zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3607419 (Why is no real title available?)
• Complexity Bounds for Regular Finite Difference and Finite Element Grids
• Incomplete Nested Dissection for Solving n by n Grid Problems
• Nested Dissection of a Regular Finite Element Mesh
• Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
• On Block Elimination for Sparse Linear Systems
• The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer

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)