An Implementation of a Pseudoperipheral Node Finder

DOI10.1145/355841.355845MaRDI QIDQ3869467zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355841.355845

zbMATH Keywords

computer program for finding nodessparse symmetric matrices

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to linear algebra (15-04)

Cited in

(13)

• Algorithms for the reduction of matrix bandwidth and profile
• Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessor computers
• An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
• A linear time implementation of the reverse Cuthill-McKee algorithm
• A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
• scientific article; zbMATH DE number 1062852 (Why is no real title available?)
• EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
• Stencil reduction algorithms for the local discontinuous Galerkin method
• A survey of direct methods for sparse linear systems
• An algorithm for frontwidth reduction
• Caveats of three direct linear solvers for finite element analyses
• An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
• Finding pseudoperipheral nodes in graphs

This page was built for publication: An Implementation of a Pseudoperipheral Node Finder

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