BACK TO INDEX

Publications of A. Casadei
Thesis
  1. A. Casadei. Optimizations of hybrid sparse linear solvers relying on Schur complement and domain decomposition approaches. PhD thesis, LaBRI, Universit� Bordeaux, Talence, France, October 2015. Keyword(s): Sparse. [Abstract] [bibtex-entry]


Conference articles
  1. A. Casadei and P. Ramet. Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition. In Mini-Symposium on Combinatorial Issues in Sparse Matrix Computation at ICIAM'15 conference, Pekin, China, August 2015. Keyword(s): Sparse. [Abstract] [bibtex-entry]


  2. A. Casadei, P. Ramet, and J. Roman. Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition. In Mini-Symposium on Partitioning for Complex Objectives at SIAM CSE'15 conference, Salt Lake City, USA, March 2015. Keyword(s): Sparse. [bibtex-entry]


  3. A. Casadei, P. Ramet, and J. Roman. An improved recursive graph bipartitioning algorithm for well balanced domain decomposition. In 21st IEEE International Conference on High Performance Computing (HiPC), Goa, India, pages 1-10, December 2014. Keyword(s): Sparse. [Abstract] [bibtex-entry]


  4. A. Casadei, P. Ramet, and J. Roman. Nested Dissection with Balanced Halo. In SIAM Workshop on Combinatorial Scientific Computing, Lyon, France, July 2014. Keyword(s): Sparse. [bibtex-entry]


  5. A. Casadei, L. Giraud, P. Ramet, and J. Roman. Towards Domain Decomposition with Balanced Halo. In Workshop Celebrating 40 Years of Nested Dissection, Waterloo, Canada, July 2013. Keyword(s): Sparse. [bibtex-entry]


  6. A. Casadei and P. Ramet. Memory Optimization to Build a Schur Complement. In SIAM Conference on Applied Linear Algebra, Valence, Spain, June 2012. Keyword(s): Sparse. [bibtex-entry]


Internal reports
  1. A. Casadei, P. Ramet, and J. Roman. An improved recursive graph bipartitioning algorithm for well balanced domain decomposition. Research Report RR-8582, August 2014. Keyword(s): Sparse. [bibtex-entry]


  2. A. Casadei and P. Ramet. Memory Optimization to Build a Schur Complement in an Hybrid Solver. Research Report RR-7971, INRIA, 2012. Keyword(s): Sparse. [bibtex-entry]



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.




Last modified: Thu Sep 14 15:35:14 2017
Author: ramet.


This document was translated from BibTEX by bibtex2html