Minimizing the bandwidth of sparse symmetric matrices

DOI10.1007/BF02252900MaRDI QIDQ2561468zbMATH OpenFDO

Authors Yanyan Li

Publication date 1973

Published in Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35)

Cited in

(11)

• Bandwidth constraints on problems complete for polynomial time
• Processor-efficient sparse matrix-vector multiplication
• A survey of direct methods for sparse linear systems
• The NP-completeness of the bandwidth minimization problem
• Approximation algorithms for the bandwidth minimization problem for a large class of trees
• Graph layout problems
• Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
• Bandwidth Minimization: An approximation algorithm for caterpillars
• Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction
• Note on minimizing the bandwidth of sparse, symmetric matrices
• Computational methods of linear algebra

This page was built for publication: Minimizing the bandwidth of sparse symmetric matrices

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