Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
finite elementgroundwater contamination simulationincomplete LU factorizationminimum discarded fill orderingnumerical resultsordering techniquespreconditioned conjugate gradient methodsunstructured grids
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Flows in porous media; filtration; seepage (76S05)
- The effect of ordering on preconditioned conjugate gradients
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
- Orderings for Parallel Conjugate Gradient Preconditioners
- Orderings for Conjugate Gradient Preconditionings
- Towards a cost-effective ILU preconditioner with high level fill
- A comparison of projective and direct solvers for finite elements in elastostatics
- Towards a cost-effective ILU preconditioner with high level fill
- Penalty methods for American options with stochastic volatility
- Nonlinear iteration methods for high speed laminar compressible Navier-Stokes equations
- Two improved algorithms for envelope and wavefront reduction
- Iterative solution of linear systems in the 20th century
- A comparison of GMRES and CGSTAB accelerations for incompressible Navier- Stokes problems
- A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices
- Efficient and reliable iterative methods for linear systems
- Preconditioning techniques for large linear systems: A survey
- Weighted graph based ordering techniques for preconditioned conjugate gradient methods
- Robust linear and nonlinear strategies for solution of the transonic Euler equations
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
- Graph coarsening: from scientific computing to machine learning
- Potential-based reduced Newton algorithm for nonlinear multiphase flow in porous media
- scientific article; zbMATH DE number 440689 (Why is no real title available?)
- scientific article; zbMATH DE number 3976202 (Why is no real title available?)
- Preconditioned conjugate gradient methods for the incompressible Navier-Stokes equations
- On the impact of triangle shapes for boundary layer problems using high-order finite element discretization
- Preconditioning methods for very ill-conditioned three-dimensional linear elasticity problems
- scientific article; zbMATH DE number 665522 (Why is no real title available?)
- ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES
- Performance of adaptive dual-dropping ILUT preconditioners in semiconductor dopant diffusion simulation
- A finite element approach to the pricing of discrete lookbacks with stochastic volatility
- Unstructured meshing for two asset barrier options
- A hypergraph partitioning model for profile minimization
- The use of conjugate gradients methods with a segregated finite volume procedure for solving transient, incompressible Navier–Stokes equations
- Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
- Matrix reordering using multilevel graph coarsening for ILU preconditioning
- Iterative subregion correction preconditioners with adaptive tolerance for problems with geometrically localized stiffness
- BDDC preconditioning for high-order Galerkin least-squares methods using inexact solvers
This page was built for publication: Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016804)
