A network programming approach in solving Darcy's equations by mixed finite-element methods

zbMath1112.65023MaRDI QIDQ871165

Mario Arioli, Gianmarco Manzini

Publication date: 16 March 2007

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127440

zbMATH Keywords

iterative algorithmnetwork programmingnumerical examplespreconditioninggraph theorysparse matricesaugmented systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Flows in porous media; filtration; seepage (76S05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element methods applied to problems in fluid mechanics (76M10)

Related Items

Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ Iterative preconditioned methods in Krylov spaces: trends of the 21st century

This page was built for publication: A network programming approach in solving Darcy's equations by mixed finite-element methods