Reordering Strategy for Blocking Optimization in Sparse Linear Solvers

Autor: Jean Roman, Grégoire Pichon, Mathieu Faverge, Pierre Ramet

Publikováno v: SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩
SIAM Journal on Matrix Analysis and Applications, Society for Industrial and Applied Mathematics, 2017, SIAM Journal on Matrix Analysis and Applications, 38 (1), pp.226-248. ⟨10.1137/16M1062454⟩

International audience; Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time-consuming and key kernel for those applications and for more advanced solvers such as hybrid direct-i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9647fbe7dd528abb106e5d44c768c7f4
https://inria.hal.science/hal-01485507v2/document

Reordering strategy for blocking optimization in sparse linear solvers

Autor: Pichon, Grégoire, Faverge, Mathieu, Ramet, Pierre, Roman, Jean

Publikováno v: [Research Report] RR-8860, Inria Bordeaux Sud-Ouest; LaBRI-Laboratoire Bordelais de Recherche en Informatique; Bordeaux INP; Université de Bordeaux. 2016, pp.26

Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time consuming and key kernel for those applications and for more advanced solvers such as hybrid direct-iterative solvers. For th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::d6c73ba4dba34b1f1866070ecfca47fa
https://hal.inria.fr/hal-01276746

Параллельный алгоритм многоуровневого метода вложенных сечений для вычислительных систем с общей памятью

Рассматривается задача переупорядочения строк и столбцов симметричной положительно определенной разреженной матрицы с целью уменьше�

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5d93df27aa93d74fc14440abbf8300ec

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

PT-Scotch: A tool for efficient parallel graph ordering

Autor: François Pellegrini, Cédric Chevalier

Publikováno v: Parallel Computing
Parallel Computing, Elsevier, 2008, 34 (6-8), pp.318-331. ⟨10.1016/j.parco.2007.12.001⟩
4th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'06)
4th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'06), Sep 2006, Rennes, France
Parallel Computing, 2008, 34 (6-8), pp.318-331. ⟨10.1016/j.parco.2007.12.001⟩

International audience; The parallel ordering of large graphs is a difficult problem, because on the one hand minimum degree algorithms do not parallelize well, and on the other hand the obtainment of high quality orderings with the nested dissection

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cc5ca81f9fc2c9237f91435295a353b
https://hal.archives-ouvertes.fr/hal-00402893/file/article_full.pdf