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