Filtrer vos résultats
- 6
- 3
- 6
- 2
- 1
- 2
- 9
- 3
- 3
- 1
- 2
- 8
- 1
- 9
- 9
- 9
- 8
- 5
- 1
- 1
9 résultats
|
|
triés par
|
|
An improved recursive graph bipartitioning algorithm for well balanced domain decomposition[Research Report] RR-8582, INRIA. 2014, pp.29
Rapport
hal-01056749v1
|
||
Towards a recursive graph bipartitioning algorithm for well balanced domain decompositionSIAM Conference on Computational Science and Engineering (SIAM CSE 2015), Mar 2015, Salt Lake City, United States
Communication dans un congrès
hal-01100985v1
|
|||
|
Nested dissection with balanced haloSixth SIAM Workshop on Combinatorial Scientific Computing, Jul 2014, Lyon, France
Communication dans un congrès
hal-00987099v1
|
||
Towards a recursive graph bipartitioning algorithm for well balanced domain decompositionMini-Symposium on "Combinatorial Issues in Sparse Matrix Computation" at ICIAM'15 conference, Aug 2015, Beijing, China
Communication dans un congrès
hal-01100990v1
|
|||
|
Optimisations des solveurs linéaires creux hybrides basés sur une approche par complément de Schur et décomposition de domaineAutre [cs.OH]. Université de Bordeaux, 2015. Français. ⟨NNT : 2015BORD0186⟩
Thèse
tel-01228520v1
|
||
|
Memory Optimization to Build a Schur Complement in an Hybrid Solver[Research Report] RR-7971, INRIA. 2012, pp.11
Rapport
hal-00700053v2
|
||
|
An improved recursive graph bipartitioning algorithm for well balanced domain decompositionIEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. pp.1-10, ⟨10.1109/HiPC.2014.7116878⟩
Communication dans un congrès
hal-01100962v1
|
||
Memory Optimization to Build a Schur ComplementSIAM Conference on Applied Linear Algebra (SIAM LA 2012), Jun 2012, Valence, Spain
Communication dans un congrès
hal-00769029v1
|
|||
|
Towards Domain Decomposition with Balanced HaloWorkshop Celebrating 40 Years of Nested Dissection, Jul 2013, Waterloo, Canada
Communication dans un congrès
hal-00924977v1
|