An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
DOI10.1007/s40314-017-0490-5zbMath1416.65083OpenAlexW2743862328MaRDI QIDQ1993591
Sanderson L. Gonzaga de Oliveira, J. A. B. Bernardes, Guilherme O. Chagas
Publication date: 5 November 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-017-0490-5
orderingheuristicscombinatorial optimizationmetaheuristicsgraph algorithmconjugate gradient methodsparse matricesgraph labelingbandwidth reductionincomplete Cholesky factorizationprofile reductionrenumberingreordering algorithmssparse symmetric positive-definite linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- On the performance of a simple parallel implementation of the ILU-PCG for the Poisson equation on irregular domains
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- Conjugate gradient type methods and preconditioning
- The NP-completeness of the bandwidth minimization problem
- Profile minimization problem for matrices and graphs
- Two improved algorithms for envelope and wavefront reduction
- Preconditioning techniques for large linear systems: A survey
- Variable neighbourhood search for bandwidth reduction
- Incidence matrices, interval graphs and seriation in archeology
- The university of Florida sparse matrix collection
- Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
- A robust incomplete Choleski-conjugate gradient algorithm
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A new mode renumbering algorithm for bandwidth reduction
- An Implementation of a Pseudoperipheral Node Finder
- Solution of linear equations with skyline-stored symmetric matrix
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Design and implementation of a parallel unstructured Euler solver using software primitives
- SparseX
- The use of profile reduction algorithms with a frontal code
- A FORTRAN program for profile and wavefront reduction
- Mapping the genome
- A robust incomplete factorization preconditioner for positive definite matrices
- Implementing Hager's exchange methods for matrix profile reduction
- Methods of conjugate gradients for solving linear systems
This page was built for publication: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
