METIS

METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes developed in our lab.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 391 articles )

Showing results 1 to 20 of 391.
Sorted by year (citations)

1 2 3 ... 18 19 20 next

  1. Wang, Zhong-Nan; Tyacke, James; Tucker, Paul; Boehning, Peer: Parallel computation of aeroacoustics of industrially relevant complex-geometry aeroengine jets (2019)
  2. Agreste, Santa; Ricciardello, Angela: An overlapping domain decomposition method for large-scale problems (2018)
  3. Antonietti, Paola F.; Houston, Paul; Pennesi, Giorgio: Fast numerical integration on polytopic meshes with applications to discontinuous Galerkin finite element methods (2018)
  4. Badia, Santiago; Verdugo, Francesc: Robust and scalable domain decomposition solvers for unfitted finite element methods (2018)
  5. Badri, M. A.; Jolivet, P.; Rousseau, B.; Favennec, Y.: High performance computation of radiative transfer equation using the finite element method (2018)
  6. Barrenechea, Gabriel R.; Bosy, Michał; Dolean, Victorita: Numerical assessment of two-level domain decomposition preconditioners for incompressible Stokes and elasticity equations (2018)
  7. Burstedde, Carsten; Fonseca, Jose A.; Kollet, Stefan: Enhancing speed and scalability of the ParFlow simulation code (2018)
  8. Gurgul, Piotr; Jopek, Konrad; Pingali, Keshav; Paszyńska, Anna: Applications of a hyper-graph grammar system in adaptive finite-element computations (2018)
  9. Hager, William W.; Hungerford, James T.; Safro, Ilya: A multilevel bilinear programming algorithm for the vertex separator problem (2018)
  10. Jackson, Adrian; Campobasso, M. Sergio; Drofelnik, Jernej: Load balance and parallel I/O: optimising COSA for large simulations (2018)
  11. Oh, Duk-Soon; Widlund, Olof B.; Zampini, Stefano; Dohrmann, Clark R.: BDDC algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields (2018)
  12. Papoutsakis, Andreas; Sazhin, Sergei S.; Begg, Steven; Danaila, Ionut; Luddens, Francky: An efficient adaptive mesh refinement (AMR) algorithm for the discontinuous Galerkin method: applications for the computation of compressible two-phase flows (2018)
  13. Sawant, Saurabh S.; Tumuklu, Ozgur; Jambunathan, Revathi; Levin, Deborah A.: Application of adaptively refined unstructured grids in DSMC to shock wave simulations (2018)
  14. Scott, Jennifer; Tůma, Miroslav: A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (2018)
  15. Torun, F. Sukru; Manguoglu, Murat; Aykanat, Cevdet: A novel partitioning method for accelerating the block Cimmino algorithm (2018)
  16. Yang, Wangdong; Li, Kenli; Li, Keqin: A parallel computing method using blocked format with optimal partitioning for SpMV on GPU (2018)
  17. Amestoy, Patrick; Buttari, Alfredo; L’Excellent, Jean-Yves; Mary, Theo: On the complexity of the block low-rank multifrontal factorization (2017)
  18. Bank, Randolph E.; Deotte, Chris: The influence of partitioning on domain decomposition convergence rates (2017)
  19. Bosma, Sebastian; Hajibeygi, Hadi; Tene, Matei; Tchelepi, Hamdi A.: Multiscale finite volume method for discrete fracture modeling on unstructured grids (MS-DFM) (2017)
  20. Botti, L.; Colombo, A.; Bassi, F.: $h$-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems (2017)

1 2 3 ... 18 19 20 next


Further publications can be found at: http://glaros.dtc.umn.edu/gkhome/publications