An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
DOI10.1007/S40314-017-0490-5zbMATH Open1416.65083OpenAlexW2743862328MaRDI QIDQ1993591FDOQ1993591
Authors: 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
Recommendations
- A robust incomplete Choleski-conjugate gradient algorithm
- The effect of ordering on preconditioned conjugate gradients
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- Orderings for Conjugate Gradient Preconditionings
- Ordering techniques for the preconditioned conjugate gradient method on parallel computers
- Improving the efficiency of incomplete Choleski preconditionings
- Orderings for Parallel Conjugate Gradient Preconditioners
- On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
- Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
- On optimization of algorithms of the conjugate gradient method
heuristicssparse matricescombinatorial optimizationmetaheuristicsorderinggraph algorithmconjugate gradient methodgraph labelingincomplete Cholesky factorizationbandwidth reductionprofile reductionrenumberingreordering algorithmssparse symmetric positive-definite linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Cites Work
- The University of Florida sparse matrix collection
- SparseX: a library for high-performance sparse matrix-vector multiplication on multicore platforms
- Preconditioning techniques for large linear systems: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Incidence matrices, interval graphs and seriation in archeology
- Title not available (Why is that?)
- Mapping the genome
- The NP-completeness of the bandwidth minimization problem
- Finite element procedures
- Title not available (Why is that?)
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- Variable neighbourhood search for bandwidth reduction
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- A robust incomplete factorization preconditioner for positive definite matrices
- A robust incomplete Choleski-conjugate gradient algorithm
- On the performance of a simple parallel implementation of the ILU-PCG for the Poisson equation on irregular domains
- Conjugate gradient type methods and preconditioning
- Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers
- Two improved algorithms for envelope and wavefront reduction
- A FORTRAN program for profile and wavefront reduction
- Solution of linear equations with skyline-stored symmetric matrix
- Profile minimization problem for matrices and graphs
- A new mode renumbering algorithm for bandwidth reduction
- An Implementation of a Pseudoperipheral Node Finder
- Title not available (Why is that?)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- The use of profile reduction algorithms with a frontal code
- Implementing Hager's exchange methods for matrix profile reduction
- Design and implementation of a parallel unstructured Euler solver using software primitives
Cited In (4)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
- A structural diagnosis of some IC orderings
- A hypergraph partitioning model for profile minimization
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming
Uses Software
This page was built for publication: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993591)
