Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics

DOI10.1016/j.camwa.2015.03.003zbMath1443.65045OpenAlexW2090118329MaRDI QIDQ2006121

Omid Kardani, Kristian Krabbenhoft, Andrei V. Lyamin

Publication date: 8 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2015.03.003

zbMATH Keywords

limit analysispreconditioned conjugate gradient methodcone programmingapproximate inverse preconditionerincomplete Cholesky factorizationgraphic processing unit

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10) Computational methods for problems pertaining to geophysics (86-08) Numerical algorithms for specific classes of architectures (65Y10) Preconditioners for iterative methods (65F08)

Related Items (3)

Second-order cone programming formulation for consolidation analysis of saturated porous media ⋮ Toward a GPU-aware comparison of explicit and implicit CFD simulations on structured meshes ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Cam clay plasticity using second-order cone programming
• A new preconditioning technique for solving large sparse linear systems
• Formulation and solution of some plasticity problems as conic programs
• A comparative study of sparse approximate inverse preconditioners
• Factorized sparse approximate inverses for preconditioning
• On implementing a primal-dual interior-point method for conic quadratic optimization
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Preconditioning techniques for large linear systems: A survey
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
• A Factored Approximate Inverse Preconditioner with Pivoting
• On the Implementation of a Primal-Dual Interior Point Method
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Upper bound limit analysis using finite elements and linear programming
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Matrix Preconditioning Techniques and Applications
• Three‐dimensional Mohr–Coulomb limit analysis using semidefinite programming

This page was built for publication: Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics