An Improvement of the Gibbs-Poole-Stockmeyer Algorithm
A pseudo-peripheral node was found by the Gibbs-Poole-Stockmeyer algorithm as the staring node for reducing bandwidth of a sparse matrix. This influences algorithm's performance because it is shown in this paper that eccentric distance of a pseudo-peripheral node may much less than diameter of...
Main Author: | GU Feng |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2010-09-01
|
Series: | Journal of Algorithms & Computational Technology |
Online Access: | https://doi.org/10.1260/1748-3018.4.3.325 |
Similar Items
-
Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method
by: Jorge Sastre, et al.
Published: (2021-07-01) -
Herded Gibbs and discretized herded Gibbs sampling
by: Eskelinen, Mareija
Published: (2013) -
Herded Gibbs and discretized herded Gibbs sampling
by: Eskelinen, Mareija
Published: (2013) -
Improved Thermal Area Law and Quasilinear Time Algorithm for Quantum Gibbs States
by: Tomotaka Kuwahara, et al.
Published: (2021-03-01) -
The Gibbs Paradox
by: Simon Saunders
Published: (2018-07-01)