Computing sparse Hessians with automatic differentiation
ACM Transactions on Mathematical Software (TOMS)
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
Discrete Applied Mathematics
A framework for scalable greedy coloring on distributed-memory parallel computers
Journal of Parallel and Distributed Computing
Improving the Performance of Graph Coloring Algorithms through Backtracking
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
On the recursive largest first algorithm for graph colouring
International Journal of Computer Mathematics
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
INFORMS Journal on Computing
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Solving graph coloring problems using learning automata
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
SIAM Journal on Scientific Computing
New multithreaded ordering and coloring algorithms for multicore architectures
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Approximating Hessians in unconstrained optimization arising from discretized problems
Computational Optimization and Applications
A parallel distance-2 graph coloring algorithm for distributed memory computers
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Planarization and acyclic colorings of subcubic claw-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
SIAM Journal on Optimization
A polyhedral study of the acyclic coloring problem
Discrete Applied Mathematics
Graph models and their efficient implementation for sparse Jacobian matrix determination
Discrete Applied Mathematics
Computing the sparsity pattern of Hessians using automatic differentiation
ACM Transactions on Mathematical Software (TOMS)
ColPack: Software for graph coloring and related problems in scientific computing
ACM Transactions on Mathematical Software (TOMS)
Toward GPU accelerated topology optimization on unstructured meshes
Structural and Multidisciplinary Optimization
Scientific Programming - A New Overview of the Trilinos Project --Part 1
Hi-index | 0.01 |
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems occur in this context, depending on whether the matrix is a Jacobian or a Hessian, and on the specifics of the computational techniques employed. We consider eight variant vertex coloring problems here. This article begins with a gentle introduction to the problem of computing a sparse Jacobian, followed by an overview of the historical development of the research area. Then we present a unifying framework for the graph models of the variant matrix estimation problems. The framework is based upon the viewpoint that a partition of a matrix into structurally orthogonal groups of columns corresponds to distance-2 coloring an appropriate graph representation. The unified framework helps integrate earlier work and leads to fresh insights; enables the design of more efficient algorithms for many problems; leads to new algorithms for others; and eases the task of building graph models for new problems. We report computational results on two of the coloring problems to support our claims. Most of the methods for these problems treat a column or a row of a matrix as an atomic entity, and partition the columns or rows (or both). A brief review of methods that do not fit these criteria is provided. We also discuss results in discrete mathematics and theoretical computer science that intersect with the topics considered here.