Graph coloring in the estimation of sparse derivative matrices: Instances and applications

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 280-288

  Hossain, Shahadat ^a   Steihaug, Trond ^b  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Exact coloring; Mathematical derivatives; Sparsity

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; MOLECULAR BIOLOGY; PROBLEM SOLVING;

COMPUTATIONAL COST; EXACT COLORING; GRAPH COLORING; MATHEMATICAL DERIVATIVES; SPARSITY;

GRAPH THEORY;

EID: 37049032323     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.018     Document Type: Article

References (24)

1. Brélaz D. New methods to color the vertices of a graph. Comm. ACM 22 4 (1979) 251-256
2. Coleman T.F., and Cai J.-Y. The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Algebraic Discrete Methods 7 2 (1986) 221-235
3. Coleman T.F., and Moré J.J. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20 1 (1983) 187-209
4. Coleman T.F., and Moré J.J. Estimation of sparse Hessian matrices and graph coloring problems. Math. Programming 28 (1984) 243-270
5. Coleman T.F., and Verma A. The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput. 19 4 (1998) 1210-1233
6. Culberson J., and Gent I. Frozen development in graph coloring. Theoret. Comput. Sci. 265 1-2 (2001) 227-264
7. Curtis A.R., Powell M.J.D., and Reid J.K. On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl. 13 (1974) 117-119
8. J. Dongarra, A. Lumsdaine, R. Pozo, K. Remington, A sparse matrix library in C ++ for high performance architectures, in: Proceedings of the Second Object Oriented Numerics Conference, 1994, pp. 214-218.
9. I.S. Duff, R.G. Grimes, J.G. Lewis, Users' guide for the Harwell-Boeing sparse matrix collection (Release I), Technical Report tr/pa/92/86, CERFACS, 1992.
10. A.H. Gebremedhin, F. Manne, A. Pothen, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev. 47(4) 2005 629-705.
11. A.V. Gelder, Another look at graph coloring via propositional satisfiability, 2002, Computational Symposium on Graph Coloring and Generalizations, COLOR02, 7-8 September 2002, Ithaca, NY.
12. Golub G.H., and Van Loan C.F. Matrix Computations. third ed. (1996), Johns Hopkins University Press, Baltimore, MD
13. A. Griewank, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Appl. Math. SIAM, Philadelphia, Penn., 2000.
14. Griewank A., and Mitev C. Detecting Jacobian sparsity patterns by Bayesian probing. Math. Prog. 93 1 (2002) 1-25
15. Griewank A., and Toint Ph.L. On the unconstrained optimization of partially separable functions. In: Powell M.J.D. (Ed). Nonlinear Optimization 1981 (1982), Academic Press, New York 301-312
16. Hossain A.S., and Steihaug T. Computing a sparse Jacobian matrix by rows and columns. Optimization Methods and Software 10 (1998) 33-48
17. S. Hossain, T. Steihaug, Reducing the number of AD passes for computing a sparse Jacobian matrix, in: G. Corliss, C. Faure, A. Griewank, L. Hascoët, U. Naumann, (Eds.), Automatic Differentiation: From Simulation to Optimization, Computer and Information Science, Springer, New York, 2001, (chapter 31), pp. 263-270.
18. S. Hossain, T. Steihaug, Graph coloring in the estimation of mathematical derivatives. pp. 9-16, 2002. Computational Symposium on Graph Coloring and Generalizations, COLOR02, 7-8 September 2002, Ithaca, NY.
19. S. Hossain, T. Steihaug, Optimal direct determination of sparse Jacobian matrices, Technical Report 254, Department of Informatics, University of Bergen, Norway, October 2003. (Revised version to appear in Optimization Methods and Software).
20. Hossain S., and Zhang Z. CsegGraph: column segment graph generator, University of Lethbridge, 4401 University Drive (2003), Alberta, Canada
21. McCormick S.T. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Programming 26 (1983) 153-171
22. Moré J.J., and Wu J. Optimal sizing for a class of nonlinearly elastic materials. SIAM J. Optim. 7 3 (1997) 814-836
23. Newsam G.N., and Ramsdell J.D. Estimation of sparse Jacobian matrices. SIAM J. Algebraic Discrete Methods 4 3 (1983) 404-417
24. Rall L.B., and Reps T.W. Algorithmic differencing. In: Facius A., and Kulisch U. (Eds). Perspectives on Enclosure Methods (2001), Springer, Vienna