A comparison of two effective methods for reordering columns within supernodes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915104182763520 |
|---|---|
| author | Karsavuran, M. Ozan Ng, Esmond G. Peyton, Barry W. |
| author_facet | Karsavuran, M. Ozan Ng, Esmond G. Peyton, Barry W. |
| contents | In some recent papers, researchers have found two very good methods for reordering columns within supernodes in sparse Cholesky factors; these reorderings can be very useful for certain factorization methods. The first of these reordering methods is based on modeling the underlying problem as a traveling salesman problem (TSP), and the second of these methods is based on partition refinement (PR). In this paper, we devise a fair way to compare the two methods. While the two methods are virtually the same in the quality of the reorderings that they produce, PR should be the method of choice because PR reorderings can be computed using far less time and storage than TSP reorderings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_08395 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A comparison of two effective methods for reordering columns within supernodes Karsavuran, M. Ozan Ng, Esmond G. Peyton, Barry W. Mathematical Software In some recent papers, researchers have found two very good methods for reordering columns within supernodes in sparse Cholesky factors; these reorderings can be very useful for certain factorization methods. The first of these reordering methods is based on modeling the underlying problem as a traveling salesman problem (TSP), and the second of these methods is based on partition refinement (PR). In this paper, we devise a fair way to compare the two methods. While the two methods are virtually the same in the quality of the reorderings that they produce, PR should be the method of choice because PR reorderings can be computed using far less time and storage than TSP reorderings. |
| title | A comparison of two effective methods for reordering columns within supernodes |
| topic | Mathematical Software |
| url | https://arxiv.org/abs/2501.08395 |