Abstract
We report on new results in logarithmic simulated annealing applied to the optimal Jacobian accumulation problem. This is a continuation of work that was presented at the SAGA’01 conference in Berlin, Germany [16]. We discuss the optimal edge elimination problem in linearized computational graphs [15] in the context of linear algebra. We introduce row and column pivoting on the extended Jacobian as analogs to front and back edge elimination in linearized computational graphs. Neighborhood relations for simulated annealing are defined on a metagraph that is derived from the computational graph. All prerequisites for logarithmic simulated annealing are fulfilled for dyadic pivoting, which is equivalent to vertex elimination in linearized computational graphs [7]. For row and column pivoting we cannot yet give a proof that the corresponding elimination sequences are polynomial in size. In practice, however, the likelihood for an exponential elimination sequence to occur is negligible. Numerical results are presented for algorithms based on both homogeneous and inhomogeneous Markov chains for all pivoting techniques. The superiority of row and column pivoting over dyadic pivoting can be observed when applying these techniques to Roe’s numerical flux [17].
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A., Sethi, R., Ullman, J.: Compilers. Principles, Techniques, and Tools. Addison- Wesley, Reading (1986)
Albrecht, A., Gottschling, P., Naumann, U.: Markowitz-type heuristics for computing Jacobian matrices efficiently. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2658, pp. 575–584. Springer, Heidelberg (2003) (to appear)
Berz, M., Bischof, C., Corliss, G., Griewank, A. (eds.): Computational Differentiation: Techniques, Applications, and Tools. Proceedings Series. SIAM, Philadelphia (1996)
Corliss, G., Faure, C., Griewank, A., Hascoet, L., Naumann, U. (eds.): Automatic Differentiation of Algorithms – From Simulation to Optimization. Springer, New York (2002)
Corliss, G., Griewank, A. (eds.): Automatic Differentiation: Theory, Implementation, and Application. Proceedings Series. SIAM, Philadelphia (1991)
Griewank, A.: Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, vol. 19. SIAM, Philadelphia (2000)
Griewank, A., Reese, S.: On the calculation of Jacobian matrices by the Markovitz rule. In: [5], pp. 126–135 (1991)
Hajek, B.: Cooling schedules for optimal annealing. Mathem. of Operations Research 13, 311–329 (1988)
Herley, K.: A note on the NP-completeness of optimum Jacobian accumulation by vertex elimination. Presentation at: Theory Institute on Combinatorial Challenges in Computational Differentiation (1993)
Van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. Reidel, Dordrechtz (1988)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1092 (1953)
Naumann, U.: An enhanced Markowitz rule for accumulating Jacobians efficiently. In: Mikula, K. (ed.) ALGORITHMY 2000 Conference on Scientific Computing, pp. 320–329. Slovak University of Technology, Bratislava (2000)
Naumann, U.: Cheaper Jacobians by Simulated Annealing. SIAM J. Opt. 13(3), 660–674 (2002)
Naumann, U.: Elimination techniques for cheap Jacobians. In: [4], pp. 247–253 (2002)
Naumann, U.: Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. Mathematical Programming (2003) (to appear)
Naumann, U., Gottschling, P.: Prospects for Simulated Annealing in Automatic Differentiation. In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, p. 131. Springer, Heidelberg (2001)
Roe, P.L.: Approximate Riemann solvers, parameter vectors, and difference schemes. Journnal of Computational Physics 43, 357–372 (1981)
Tadjouddine, M., Forth, S., Pryce, J., Reid, J.: Performance issues for vertex elimination methods in computing Jacobians using Automatic Differentiation. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2330, pp. 1077–1086. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naumann, U., Gottschling, P. (2003). Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation. In: Albrecht, A., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2003. Lecture Notes in Computer Science, vol 2827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39816-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39816-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20103-8
Online ISBN: 978-3-540-39816-5
eBook Packages: Springer Book Archive