On iterative techniques for computing flow in large two-dimensional discrete fracture networks
type: Item
instance of: scholarly article
title: On iterative techniques for computing flow in large two-dimensional discrete fracture networks
zbMATH Open document ID: 1448.76160
author: Rishi Parashar
author: Donald M. Reeves
published in: Journal of Computational and Applied Mathematics
publication date: 2012-09-06T00:00:00Z
Mathematics Subject Classification ID: 76S05
Mathematics Subject Classification ID: 86A05
Mathematics Subject Classification ID: 74L10
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 6078383
zbMATH Keywords: discrete fracture networks
zbMATH Keywords: sparse matrices
zbMATH Keywords: DFN methodology
zbMATH Keywords: Krylov subspace iterative methods
describes a project that uses: UMFPACK
MaRDI profile type: Publication
full work available at URL: j.cam.2012.02.038
OpenAlex ID: W1964803719
cites work: Q4884572
cites work: Efficient Simulation of the von Mises Distribution
cites work: Algorithm 832
cites work: Pursuing scalability for hypre 's conceptual interfaces
cites work: Parallel iterative methods for sparse linear systems
cites work: Approximate inverse preconditionings for sparse linear systems
cites work: Parallel Preconditioning with Sparse Approximate Inverses
cites work: Preconditioning techniques for large linear systems: A survey
cites work: Q3653570
cites work: Q4348514
cites work: Recent computational developments in Krylov subspace methods for linear systems
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: Q4841246
cites work: How Fast are Nonsymmetric Matrix Iterations?
DOI: 10.1016/J.CAM.2012.02.038
description: scientific article; zbMATH DE number 6078383