%Ci-dessous le fichier sage.bib à mettre à jour régulièrement. %Ce pad est destiné à vivre toute l'année en cours. Nous en créerons un chaque année pour que vous puissiez le mettre à jour, ainsi cela facilitera (pour tout le monde) la bibliographie du rapport d'activités. %Vous trouverez vos noms ci-dessous. Une fois que vous avez mis à jour vos références bibliographiques (articles, conférences, proceedings, ...) de l'année 2011 à la date t, merci d'écrire cette date à côté de votre nom, ainsi nous saurons qui relancer si besoin! :) % Pensez-y après une conférence ou lorsqu'un de vos articles est publié (en + du gâteau!) % Le pad ne peut pas être considéré comme un espace de sauvegarde pereine (dixit Charles, ingénieur SED). Il faut donc exporter régulièrement. Il n'y a pas meilleur sauvegarde que les sauvegardes distribuées, donc exportez après vos modifications ! %Vous pouvez aler voir la biblio correspondante ici : http://www.irisa.fr/sage/publications/bibtexbrowser.php?frameset&bib=sage2011.bib % Le script de reccupération du fichier et d'envoi vers le serveur est visible dans le pad "tips", pour les curieux. Le rafraichissement se fait toutes les minutes. % Pour exporter, utilisez le menu import/export, puis Plain Text. Attention,l'export se fait en utf8 ! (\usepackage[utf8]{inputenc}). Ou copier/coller dans votre editeur préféré, pour eviter le problème de la gestion des accents. %Pour raweb, il faut mettre des champs particuliers : % http://intranet.inria.fr/disc/publier/raweb2011instructions#CategoriesPublications % Je les ai ajoutés, mais je n'ai pas complété le champ x-pays = {} : % http://intranet.inria.fr/disc/publier/raweb2011instructions#moduleBibliography % Attention, il ne faut mettre que les pays autre que la france (ce qui compte c'est le pays du labo, pas la nationalité du co-publiant) % Format attendu (il faut retirer les % en début de ligne) : % @CONFERENCE{uniqKey, % author = {Nom, P.}, % title = {Mon super article}, % booktitle = {Titre du livre, du reccueil de proceeding, ou de la conf}, % year = {2011}, % address = {Ville de la conf, Pays de la conf}, % month = {Mois}, % note = {invité/contributed/workshop...}, % x-international-audience = {yes/no}, % x-invited-conference = {yes/no}, % x-proceedings = {no}, %} % uniqKey : Jocelyne prend comme clé le nom (4 lettres) l'année (2 chiffres) et une lettre. Pour lui simplifier la vie, vous pouvez faire pareil. Attention, la clé doit être unique % Nom : Commence par une majuscule, suivit d'une virgule puis Initialle en majuscule suivit d'un point. Par exemple Erhel, J. % Par convention interne, les conf avec proceedings sont notées avec la classe INPROCEEDING, celle sans avec la classe CONFERENCE % 28/10, après midi : j'ai intégré la nouvelle version du bib 2011 de Jocelyne, en faisant un "merge" à la main. Merci de verifier vos publis, histoire de ne pas laisser passer de typo suite à un mauvais copier coller. %Baptiste : 28/10 %Bernard : 08/11, 26/11 et 29/11 %Desire : 03/11 %Edouard : 04/11 %Geraldine : 22/11 %Jocelyne : 07/11 %Nadir : 03/11 %Mestapha : 28/10 %Sinda :27/10 %Souhila : 27/10 pas encore. % Julia: 09/11 % J'ai utilisé le .bib fourni par HAL; il manque un no pour le RR de Désiré % ATTENTION: il faut aussi mettre toutes les publications sous Hal @TECHREPORT{sind11a, author = {Ben Abda, A. and Johansson, B.T. and Khalfallah, S.}, title = {Leak identification in saturated unsteady flow via a {C}auchy problem for the heat equation and iterative regularization.}, year = {2011}, type = {preprint}, note = {In revision, submitted to Journal of Scientific Computing}, journal = {Journal of Scientific Computing}, x-editorial-board = {yes}, x-international-audience = {yes} } @TECHREPORT{char11a, author = {Charrier, J.}, title = {{Numerical analysis of the advection-diffusion of a solute in random media}}, institution = {INRIA}, year = {2011}, type = {Research Report}, number = {RR-7585}, month = Mar, pages = {30}, url = {http://hal.inria.fr/inria-00581244/en}, x-id-hal = {inria-00581244} } @PHDTHESIS{char11b, author = {Charrier, J.}, title = {{Analyse numérique d'équations aux dérivées partielles à coefficients aléatoires, applications à l'hydrogéologie}}, school = {{\'E}cole normale supérieure de Cachan - ENS Cachan}, year = {2011}, month = Jul, url = {http://hal.inria.fr/tel-00625092/en}, x-id-hal = {tel-00625092} } @CONFERENCE{char11d, author = {Charrier, J.}, title = {Numerical analysis of a multilevel {M}onte {C}arlo method for elliptic {PDE}s with random coefficients}, booktitle = {European Numerical Mathematics and Advanced Applications (ENUMATH 2011)}, year = {2011}, month = Sept, note = {invited in a mini-symposium}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {no} } @CONFERENCE{char11e, author = {Charrier, J.}, title = {Weak and strong error estimates for elliptic {PDE} with random coefficients}, booktitle = {Applied Mathematics and Statistics (AMSTAT Seminars), Warwick Mathematics Institute}, year = {2011}, month = Nov, note = {invited talk}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {no} } @ARTICLE{charr11f, author = {Charrier, J.}, title = {Strong and weak error estimates for elliptic partial diffrential equations with random coefficients}, journal = {SIAM Journal on numerical analysis}, year = {2011}, note = {to appear}, x-editorial-board = {yes}, x-international-audience = {yes} } @TECHREPORT{char11c, author = {Charrier, J. and Scheichl, R. and Teckentrup, A.}, title = {Finite element error analysis of elliptic {PDE}s with random coefficients and its application to multilevel Monte Carlo methods}, institution = {University of Bath}, year = {2011}, type = {Preprint}, number = {2/11}, month = Mar, pages = {30}, url = {http://www.bath.ac.uk/math-sci/BICS} } @INBOOK{erhe11b, chapter = {Some Properties of {K}rylov Projection Methods for Large Linear Systems}, pages = {41-70}, title = {Computational Technology Reviews}, publisher = {Saxe-Coburg Publications}, year = {2011}, editor = {Ivanyi, P. and Topping, B.H.V.}, author = {Erhel, J.}, volume = {3}, x-editorial-board = {yes}, x-international-audience = {yes} } @CONFERENCE{erhe11c, author = {Erhel, J.}, title = {Some Properties of {K}rylov Projection Methods for Large Linear Systems}, booktitle = {PARENG'2011}, year = {2011}, address = {Ajaccio, France}, month = {May}, note = {invited plenary talk}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {no} } @CONFERENCE{erhe11e, author = {Erhel, J. and Kern, M.}, title = {MoMaS: 10 years of reactive transport}, booktitle = {Journées scientifiques du GNR MOMAS}, year = {2011}, address = {Marseille, France}, month = {November}, x-international-audience = {yes}, x-invited-conference = {no}, x-proceedings = {no} } @INPROCEEDINGS{erhe11a, author = {Erhel, J. and Lejay, A. and Pichot, G.}, title = {Comparison of some lagrangian schemes for the simulation of diffusion in discontinuous media}, booktitle = {Proceedings of the 4th International Conference on Approximation Methods and Numerical Modelling in Environment and Natural Resources (MAMERN'11)}, year = {2011}, editor = {B. Amaziane and D. Barrera and H. Mraoui and M.L. Rodriguez and D. Sbibih}, pages = {319-322}, publisher = {EUG}, note = {invited in a mini-symposium}, abstract = {We study a diffusion process in a 1D discontinuous medium using a random walk approach. Our main contribution is to encompass two existing numerical methods in the unified framework of the Skew Brownian Motion. This theoretical approach allows to detail and justify the derived algorithms. Numerical simulations are performed on two test cases to show that the algorithms can deal with the discontinuity in the diffusion coefficient.}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {yes} } @ARTICLE{oumo11a, author = {Erhel, J. and Mghazli, Z. and Oumouni, M.}, title = {Calcul de l'espérance de la solution d'une {EDP} stochastique unidimensionnelle à l'aide d'une base réduite}, journal = {Comptes Rendus de l'Académie des Sciences de Paris (CRAS), série I}, year = {2011}, volume = {349}, pages = {861-865}, x-editorial-board = {yes}, x-international-audience = {yes} } abstract={ In this Note, we present an efficient method to approximate the expectation of the response of a one-dimensional elliptic problem with stochastic inputs. In conventional methods, the computational effort and cost of the approximation of the response can be dramatic. Our method presented here is based on the Karhunen–Loève (K-L) expansion of the inverse of the diffusion parameter, allowing us to build a base of random variables in reduced numbers, from which we construct a projected solution. We show that the expectation of this projected solution is a good approximation, we also give an a priori error estimate. A numerical example is presented to show the efficiency of this approach }. @CONFERENCE{oumo11b, author = {Erhel, J. and Mghazli, Z. and Oumouni, M.}, title = {Calcul de l'espérance de la solution d'une EDP stochastique unidimensionnelle à l'aide d'une base réduite}, booktitle = {TAM-TAM'11: 5ième colloque maghrébin de Mathématiques Appliquées.}, year = {2011}, address = {Sousse, Tunisie.}, month = {April}, x-international-audience = {yes}, x-invited-conference = {no}, x-proceedings = {no} } @CONFERENCE{phil11c, author = {Jézéquel, F. and Philippe, B.}, title = {Correction d'une décomposition spectrale approchée pour une matrice symétrique}, booktitle = {20ème Anniversaire du Laboratoire d'Etude et de Recherche en Mathématiques Appliquées}, year = {2011}, address = {Rabat}, month = {June}, note = {invited talk} } @CONFERENCE{phil11d, author = {Jézéquel, F. and Philippe, B.}, title = {Updating the Diagonalization of a Symmetric Matrix}, booktitle = {Festkolloquium Parallel Computing: Algorithms, Applications and architectures}, year = {2011}, address = {Salzburg}, month = {June}, abstract={Two methods are compared : Jacobi method and first order correction of the spectral projectors.} note = {invited talk} } @TECHREPORT{phil11b, author = {Kamgnia, E. and Philippe, B.}, title = {{Counting eigenvalues in domains of the complex field}}, institution = {INRIA}, year = {2011}, type = {Research Report}, number = {RR-7770}, month = Oct, pages = {21}, url = {http://hal.inria.fr/hal-00634065/en}, x-id-hal = {hal-00634065}, abstract={A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument of the logarithm of a function. A strategy is proposed for selecting a path length that insures that the same branch of the logarithm is followed during the integration. Numerical tests are reported for matrices obtained from conventional matrix test sets.}, x-pays = {CM} } @Book{ConfSameh12, editor = {Berry, M.W. and Gallivan, K.A. and Gallopoulos, E. and Grama, A. and Philippe, B. and Saad, Y. and Saied, F. }, title = {High-Performance Scientific Computing - Algorithms and Applications}, publisher = {Springer}, year = {to appear in 2012}, abstract={This comprehensive text/reference, inspired by the visionary work of Prof. Ahmed H. Sameh, represents the state of the art in parallel numerical algorithms, applications, architectures, and system software. Articles in this collection address solutions to various challenges arising from concurrency, scale, energy efficiency, and programmability. These solutions are discussed in the context of diverse applications, ranging from scientific simulations to large-scale data analysis and mining.} } @InBook{ConfSameh12b, author = {K. Gallivan and E. Gallopoulos and A. Grama and B. Philippe and E. Polizzi and Y. Saad and F. Saied and D. Sorensen}, chapter = {in High-Performance Scientific Computing - Algorithms and Applications, eds. M. Berry, K. Gallivan, E. Gallopoulos, A. Grama, B. Philippe, Y. Saad, and F. Saied}, title = {Parallel Numerical Computing from Illiac IV to Exascale: The Contributions of Ahmed H. Sameh}, publisher = {Springer}, year = {to appear in 2012}, abstract = {As exascale computing is looming on the horizon while multicore and GPU’s are routinely used, we survey the achievements of Ahmed H. Sameh, a pioneer in parallel matrix algorithms. Studying his contributions since the days of Illiac IV as well as the work that he directed and inspired in the building of the Cedar multiprocessor and his recent research, unfolds a useful historical perspective in the field of parallel scientific computing.} } @ARTICLE{muhi11a, author = {Muhieddine, M. and Canot, É. and March, R. and Delannay, R.}, title = {Coupling heat conduction and water-steam flow in a saturated porous medium}, journal = {International Journal for Numerical Methods in Engineering}, year = {2011}, volume = {85}, pages = {1390–1414}, number = {11}, doi = {10.1002/nme.3022}, publisher = {Wiley}, url-hal = {http://hal.inria.fr/inria-00540366/en}, x-editorial-board = {yes}, x-id-hal = {inria-00540366}, x-international-audience = {yes} } @ARTICLE{makh11a, author = {Nassif, N. and Makhoul-Karam, N. and Erhel, J.}, title = {A globally adaptive explicit numerical method for exploding systems of ordinary differential equations}, journal = {Applied Numerical Mathematics}, year = {2011}, note = {online}, doi = {10.1016/j.apnum.2011.09.009}, x-editorial-board = {yes}, x-international-audience = {yes}, x-pays = {LB} } @ARTICLE{nuen11c, author = {Nuentsa Wakam, D. and Atenekeng Kahou, G.-A.}, title = {Parallel {GMRES} with a multiplicative Schwarz preconditioner}, journal = {ARIMA}, volume = {14}, pages = {81-99}, year = {2011}, abstract = { This paper presents a robust hybrid solver for linear systems that combines a Krylov subspace method as accelerator with a Schwarz-based preconditioner. This preconditioner uses an explicit formulation associated to one iteration of the multiplicative Schwarz method. The Newton-basis GMRES, which aim at expressing a good data parallelism between subdomains is used as accelerator. In the first part of this paper, we present the pipeline parallelism that is obtained when the multiplicative Schwarz preconditioner is used to build the Krylov basis for the GMRES method. This is referred as the first level of parallelism. In the second part, we introduce a second level of parallelism inside the subdomains. For Schwarz-based preconditioners, the number of subdommains are keeped small to provide a robust solver. Therefore, the linear systems associated to subdomains are solved efficiently with this approach. Numerical experiments are performed on several problems to demonstrate the benefits of using these two levels of parallelism in the solver, mainly in terms of numerical robustness and global efficiency. }, x-editorial-board = {yes}, x-international-audience = {yes} } @TECHREPORT{nuen11e, author = {Nuentsa Wakam, D. and Erhel, J.}, title = {Parallelism and Robustness in {GMRES} with the Newton basis and the deflated restarting}, institution = {INRIA}, year = {2011}, type = {Research Report}, number = {RR-7787}, month = Nov, url = {http://hal.inria.fr/inria-00638247/en}, abstract = {The GMRES iterative method is widely used as Krylov subspace accelerator for solving sparse linear systems when the coefficient matrix is nonsymmetric and indefinite. The Newton basis implementation has been proposed on distributed memory computers as an alternative to the classical approach with the Arnoldi process. The aim of our work here is to introduce a modification based on deflation techniques. This approach builds an augmented subspace in an adaptive way to accelerate the convergence of the restarted formulation. In our numerical experiments, we show the benefits of using this implementation with hybrid direct/iterative methods to solve large linear systems. }, } @CONFERENCE{nuen11a, author = {Nuentsa Wakam, D. and Erhel, J. and Canot, É.}, title = {Deflated {GMRES} with Multiplicative Schwarz Preconditioner: A Challenge of Robustness and Parallelism}, booktitle = {The Twentieth International Conference on Domain Decomposition Methods}, year = {2011}, address = {La Jolla, California, USA}, month = {February}, note = {contributed talk}, abstract = { We consider the GMRES method preconditioned by one iteration of the classical multiplicative Schwarz method in which the matrix operator is algebraically decomposed in block-diagonal form. The general observation is that the number of iterations in GMRES tends to increase with the number of domains. To limit this effect, we introduce a deflation process in GMRES. This deflation is based either on a preconditioning technique or an augmented Krylov subspace approach. We show on real test cases that these approaches can reduce the overall number of iterations and prevent stagnation on large number of subdomains. }, x-international-audience = {yes}, x-invited-conference = {no}, x-proceedings = {no} } @INPROCEEDINGS{nuen11b, author = {Nuentsa Wakam, D. and Erhel, J. and Canot, É.}, title = {Robustness in hybrid algebraic solvers for large linear systems}, booktitle = {Proceedings of 23th International Conference on Parallel Computational Fluid Dynamics (Parallel CFD 2011)}, year = {2011}, pages = {5 pages}, organization = {Barcelona Supercomputing Center}, note = {invited in a mini-symposium}, url = {http://parcfd2011.bsc.es/accepted-paper-list-book-abstracts}, abstract = { Many scientific libraries are currently based on hybrid approaches for solving large linear systems. For nonsymmetric matrices, the GMRES approach provides a good framework as accelerator for Schwarz or Schur Complement based preconditioners. The restarted formulation of this method known as GMRES(m) gives less memory consumption compared to the full version. However, it is difficult to predict its convergence. In this situation, many industrial applications avoid the restarting. The drawback is the considerable memory required to store the growing size of the Krylov subspace basis. The main purpose of this work is to enhance the robustness of GMRES(m) using the deflated restarting. The main approach is based on an adaptive strategy which detect an insufficient rate of convergence and switch to the deflation process at the time of restart. Numerical experiments are performed on CFD test cases to show the benefits of this approach. }, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {yes} } @CONFERENCE{erhe11d, author = {Nuentsa Wakam, D. and Erhel, J. and Gropp, W.}, title = {About deflated Parallel {GMRES}}, booktitle = {fith workshop of the INRIA-Illinois Joint Laboratory on Petascale Computing}, year = {2011}, address = {Grenoble}, month = {June}, note = {invited talk}, owner = {erhel}, timestamp = {2011.07.01} } @TECHREPORT{nuen11d, author = {Nuentsa Wakam, D. and Erhel, J. and Gropp, W.}, title = {Parallel Adaptive Deflated {GMRES}}, year = {2011}, type = {preprint}, address = {San Diego, USA}, note = {in revision, submitted to proceedings of DD20}, booktitle = {Proceedings of DD20}, abstract = {Many scientific libraries are currently based on the GMRES method as a Krylov subspace iterative method for solving large linear systems. The restarted formulation known as GMRES($m$) has been extensively studied and several approaches have been proposed to reduce the negative effects due to the restarting procedure. A common effect in GMRES($m$) is a slow convergence rate or a stagnation in the iterative process. In this situation, it is less attractive as a general solver in industrial applications. In this work, we propose an adaptive deflation strategy which retains useful information at the time of restart to avoid stagnation in GMRES($m$) and improve its convergence rate. We give a parallel implementation in the PETSc package. The provided numerical results show that this approach can be effectively used in the hybrid direct/iterative methods to solve large-scale systems. }, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {yes} x-pays = {US} } @TECHREPORT{nuen11f, author = {Nuentsa Wakam, D. and {P}acull, F.}, title = {Memory efficient and robust hybrid algebraic solvers for large {CFD} linear systems}, year = {2011}, type = {preprint}, note = {submitted to computers and fluids}, booktitle = {Computer and Fluids, special issue of {ParCFD}2011}, journal = {Computer and Fluids, special issue of {ParCFD}2011}, abstract = {This paper deals with the solution of large and sparse linear systems arising from design optimization in Computational Fluid Dynamics. From the algebraic decomposition of the input matrix, a hybrid robust direct/iterative solver is often defined with a Krylov subspace method as accelerator, a domain decomposition method as preconditioner and a direct method as subdomain solver. The goal of this paper is to reduce the memory requirements and indirectly the computational cost at different steps of this scheme. To this end, we use a grid-point induced block approach for the data storage and the partitioning part, a Krylov subspace method based on the restarted GMRES accelerated by deflation, a preconditioner formulated with the restricted additive Schwarz method and an aerodynamic/turbulent fields split at the subdomain level. Numerical results are presented with industrial test cases to show the benefits of these choices. }, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {yes} } @ARTICLE{phil11a, author = {Philippe, B. and Reichel, L.}, title = {On the generation of {K}rylov subspace bases}, journal = {Applied Numerical Mathematics (APNUM)}, year = {2011}, volume = {in press; available online 7 January}, institution = {INRIA}, x-editorial-board = {yes}, x-international-audience = {yes}, x-pays = {US} } @CONFERENCE{pich11a, author = {Pichot, G. and Beaudoin, A. and Soualem, N. and Erhel, J. and de Dreuzy, J.-R.}, title = {Simulation of Transport in 2D Heterogeneous Porous Media via a Random Walk Particle Tracking method}, booktitle = {2011 SIAM Conference on Mathematical and Computational Issues in the Geosciences}, year = {2011}, note = {organization of a mini-symposium; invited}, abstract={ We study the transport of an inert species in a 2D heterogeneous porous medium via a Random Walk Particle Tracking (RWPT) method. The main objective is to derive the macroscopic properties of the transport by the means of Monte-Carlo simulations in large domains. Conditions to reach asymptotic macro-dispersion coefficients will be given. We will also present our on-going research about the RWPT method in presence of discontinuities within the domain. }, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {no} } @ARTICLE{pich11b, author = {G. Pichot and J. Erhel and J.R. de Dreuzy}, title = {A generalized mixed hybrid mortar method for solving flow in stochastic discrete fracture networks}, journal = {SIAM Journal on scientific computing}, year = {2011}, note = {to appear}, abstract={The simulation of flow in fractured media requires handling both a large number of fractures and a complex interconnecting network of these fractures. Networks considered in this paper are 3D domains made up of 2D fractures intersecting each other and randomly generated. Due to the stochastic generation of fractures, intersections can be highly intricate. The numerical method must generate a mesh and define a discrete problem for any Discrete Fracture Network (DFN). A first approach \cite{erhe09b} is to generate a conforming mesh and to apply a mixed hybrid finite element method. However the resulting linear system becomes very large when the network contains many fractures. Hence a second approach \cite{pich10a} is to generate a non conforming mesh, using an independent mesh generation for each fracture. Then a Mortar technique applied to the mixed hybrid finite element method deals with the non-matching grids. When intersections do not cross nor overlap, pairwise Mortar relations for each intersection are efficient \cite{pich10a}. But for most of random networks, discretized intersections involve more than two fractures. In this paper, we design a new method generalizing the previous one and applicable for stochastic networks. The main idea is to combine pairwise Mortar relations with additional relations for the overlapping part. This method still ensures the continuity of fluxes and heads and still yields a symmetric positive definite linear system. Numerical experiments show the efficiency of the method applied to complex stochastic fracture networks. We also study numerical convergence when reducing the mesh step. This method makes it easy to perform mesh optimization and appears as a very promising tool to simulate flow in multiscale fracture networks.}, x-editorial-board = {yes}, x-international-audience = {yes} } @INPROCEEDINGS{poir11b, author = {Poirriez, B. and Erhel, J.}, title = {Flow computations in 3D Discrete Fracture Networks using a Domain Decomposition Method}, booktitle = {Proceedings of the 4th International Conference on Approximation Methods and Numerical Modelling in Environment and Natural Resources (MAMERN'11)}, year = {2011}, editor = {B. Amaziane and D. Barrera and H. Mraoui and M.L. Rodriguez and D. Sbibih}, pages = {603-606}, publisher = {EUG}, note = {invited in a mini-symposium}, abstract = {This paper aims at solving efficiently the linear system arising from flow computations in {D}iscrete {F}racture {N}etworks (DFN). We define a partition of fractures into connected sets and apply a Schur domain decompo- sition method. Conjugate Gradient is preconditioned by Neumann-Neumann and deflation. Preliminary results with one network show the ability of our method to reduce both the number of iterations and the computational time.}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {yes} } @CONFERENCE{poir11a, author = {Poirriez, B. and Erhel, J. and Pichot, G.}, title = {Schur Complement Preconditioning for Flow Simulation in 3D Discrete Fracture Networks}, booktitle = {2011 SIAM Conference on Mathematical and Computational Issues in the Geosciences}, year = {2011}, note = {invited in a mini-symposium}, abstract = {The simulation of flow in discrete fractured media requires to solve very large linear systems. Those systems are sparse and with a specific shape due to the underlying physical problem. In order to take advantage of this specific structure, a preconditioned conjugate gradient method based on the Schur complement is used. Several preconditioning approaches are tested. We present simulations results in sequential as well as in parallel.}, x-international-audience = {yes}, x-invited-conference = {yes}, x-proceedings = {no} } @TECHREPORT{sabi11a, author = {S. Sabit and N. Soualem}, title = {Suite Logicielle GRT3D (Global Reactive Transport 3D)}, institution = {INRIA}, year = {2011}, type = {Rapport de contrat Andra}, } @CONFERENCE{tank11a, author = {Tankeo, M. and Richard, P. and Canot, É.}, title = {Simulation of granular flow in channel}, booktitle = {2nd Int. Conference on Material Modelling}, year = {2011}, address = {Paris, France}, month = {Sept}, note = {contributed talk}, url = {http://icmm2.eu}, x-international-audience = {yes}, x-invited-conference = {no}, x-proceedings = {no} }