Abstract
The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node re-ordering of graphs with rather complex configuration. Further considerations on the proposed method and numerical error of the skyline method are also given.
| Original language | English |
|---|---|
| Pages (from-to) | 107-113 |
| Number of pages | 7 |
| Journal | Engineering Computations |
| Volume | 2 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Feb 1 1985 |
ASJC Scopus subject areas
- Software
- Engineering(all)
- Computer Science Applications
- Computational Theory and Mathematics