Minimizing the bandwidth of sparse symmetric matrices

DOI10.1007/BF02252900zbMATH Open0263.65049MaRDI QIDQ2561468FDOQ2561468

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)

Cites Work

• Title not available (Why is that?)

Cited In (11)

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

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)