scientific article; zbMATH DE number 1114254

zbMATH Open0894.90146MaRDI QIDQ4375950FDOQ4375950

Anastasia A. Bartzi, M. P. Bekakos

Publication date: 7 September 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

profilebandwidthlevel structuresparse symmetric matricessystolic implementationbandwidth and profile reduction

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Conditioning of matrices (15A12) Canonical forms, reductions, classification (15A21)

Cites Work

• Complexity Results for Bandwidth Minimization
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• The bandwidth problem for graphs and matrices—a survey
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Bandwidth reduction in sparse matrices 👍 👎
• Algorithms for reducing the bandwidth and profile of a sparse matrix 👍 👎
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix 👍 👎
• Title not available (Why is that?) 👍 👎
• Sparse matrix computations on the hypercube and related networks 👍 👎
• Title not available (Why is that?) 👍 👎
• On systolic array methods for band matrix factorizations 👍 👎
• Short notes: Improved Matrix Product Computation using Double-Pipeline Systolic Arrays 👍 👎
• Sparse Matrix Computations on Parallel Processor Arrays 👍 👎

This page was built for publication:

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