Direct solution of larger coupled sparse/dense linear systems using low-rank compression on single-node multi-core machines in an industrial context

Autor: Emmanuel Agullo, Marek Felsoci, Guillaume Sylvand

Publikováno v: [Research Report] RR-9453, Inria Bordeaux Sud-Ouest. 2022, pp.25
IPDPS 2022-36th IEEE International Parallel and Distributed Processing Symposium
IPDPS 2022-36th IEEE International Parallel and Distributed Processing Symposium, May 2022, Lyon, France. pp.11, ⟨10.1109/IPDPS53621.2022.00012⟩

International audience; While hierarchically low-rank compression methods are now commonly available in both dense and sparse direct solvers, their usage for the direct solution of coupled sparse/dense linear systems has been little investigated. The

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad5f55a63f19db7f819224d8671dee4d
https://inria.hal.science/hal-03557692

A comparison of selected solvers for coupled FEM/BEM linear systems arising from discretization of aeroacoustic problems

Autor: Agullo, Emmanuel, Felšöci, Marek, Sylvand, Guillaume

Publikováno v: [Research Report] RR-9412, Inria Bordeaux Sud-Ouest. 2021, pp.52

When discretization of an aeroacoustic physical model is based on the application of both the Finite Elements Method (FEM) and the Boundary Elements Method (BEM), this leads to coupled FEM/BEM linear systems combining sparse and dense parts. In this

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6660323b91cb9d2d0612112529189a68
https://hal.inria.fr/hal-03263603

Algorithmic and software contributions to graph mining

Autor: de Lara, Nathan

Publikováno v: Data Structures and Algorithms [cs.DS]. Institut Polytechnique de Paris, 2020. English. ⟨NNT : 2020IPPAT029⟩

Since the introduction of Google's PageRank method for Web searches in the late 1990s, graph algorithms have been part of our daily lives. In the mid 2000s, the arrival of social networks has amplified this phenomenon, creating new use-cases for thes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9ecd41e978e1393904c411a69ae54185
https://tel.archives-ouvertes.fr/tel-03104061/file/98234_DE_LARA_2020_archivage.pdf

Partitionnement, couplage et permutation: Calcul scientifique combinatoire sur des matrices et des tenseurs

Autor: Uçar, Bora

Publikováno v: Computer Science [cs]. ENS de Lyon, 2019

This HDR investigates three classes of problems at the interplay of discrete algorithms, combinatorial optimization, and numerical methods. The three problem classes are that of partitioning, matching, and ordering.Partitioning problems arise in task

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d1cd92bcc001cf0304affc4a41830eb8
https://hal.inria.fr/tel-02377874/file/bu_hdr_hal.pdf

Combler l’écart entre H-Matrices et méthodes directes creuses pour la résolution de systèmes linéaires de grandes tailles

Autor: Falco, Aurélien

Publikováno v: Other [cs.OH]. Université de Bordeaux, 2019. English. ⟨NNT : 2019BORD0090⟩

Many physical phenomena may be studied through modeling and numerical simulations, commonplace in scientific applications. To be tractable on a computer, appropriated discretization techniques must be considered, which often lead to a set of linear e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::92ae9885281d249dd547904155e38d55
https://theses.hal.science/tel-02183902