Null space algorithm and spanning trees in solving Darcy's equation
From MaRDI portal
Recommendations
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- A network programming approach in solving Darcy's equations by mixed finite-element methods
- Dual variable methods for mixed-hybrid finite element approximation of the potential fluid flow problem in porous media
- An algorithm to compute a sparse basis of the null space
- The Null Space Problem II. Algorithms
Cited in
(6)- Splitting extrapolation algorithms for solving the boundary integral equations of anisotropic Darcy's equation on polygons by mechanical quadrature methods
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic
- Preconditioning linear least-squares problems by identifying a basis matrix
- A null space algorithm for mixed finite-element approximations of Darcy's equation
- A network programming approach in solving Darcy's equations by mixed finite-element methods
This page was built for publication: Null space algorithm and spanning trees in solving Darcy's equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431636)