{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:59Z","timestamp":1725497039625},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401957"},{"type":"electronic","value":"9783540448624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44862-4_61","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T10:39:06Z","timestamp":1196937546000},"page":"575-584","source":"Crossref","is-referenced-by-count":1,"title":["Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gottschling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Naumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"61_CR1","first-page":"126","volume-title":"Automatic Differentiation: Theory, Implementation, and Application","author":"A. Griewank","year":"1991","unstructured":"Griewank, A., Reese, S.: On the calculation of Jacobian matrices by the Markovitz rule. In: [5]. (1991) 126\u2013135"},{"key":"61_CR2","unstructured":"Naumann, U.: Optimal accumulation of Jacobian by eliminatin methods on the dual computational graph. Mathematical Programming (2002) to appear."},{"volume-title":"Computational Differentiation: Techniques, Applications, and Tools","year":"1996","key":"61_CR3","unstructured":"Berz, M., Bischof, C., Corliss, G., Griewank, A., eds.: Computational Differentiation: Techniques, Applications, and Tools, Philadelphia, SIAM (1996)"},{"volume-title":"Automatic Differentiation of Algorithms-from Simulation to Optimization","year":"2002","key":"61_CR4","unstructured":"Corliss, G., Faure, C., Griewank, A., Hascoet, L., Naumann, U., eds.: Automatic Differentiation of Algorithms-from Simulation to Optimization, New York, Springer (2002)"},{"volume-title":"Automatic Differentiation: Theory, Implementation, and Application","year":"1991","key":"61_CR5","unstructured":"Corliss, G., Griewanks, A., eds.: Automatic Differentiation: Theory, Implementation, and Application, Philadelphia, SIAM (1991)"},{"key":"61_CR6","volume-title":"Frontiers in Applied Mathematics","author":"A. Griewank","year":"2000","unstructured":"Griewank, A.: Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. Numbr 19 in Frontiers in Applied Mathematics. SIAM, Philadelphia (2000)"},{"key":"61_CR7","unstructured":"Naumann, U.: Efficient Calculation of Jacobian Matrices by Optimized Application of the Chain Rule to Computational Graphs. PhD thesis, Technical University Dresden (1999)"},{"key":"61_CR8","first-page":"82","volume-title":"Computational Differentiation: Techniques, Application, and Tools","author":"C. Bischof","year":"1996","unstructured":"Bischof, C., Haghighat, M.: Hierarchical approches to automatic differentiation. In: [3]. (1996) 82\u201394"},{"key":"61_CR9","unstructured":"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)"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/0601033","volume":"1","author":"J. Gilbert","year":"1980","unstructured":"Gilbert, J.: A note on the NP-comleteness of vertex elimination on directed graphs. J. Alg. Disc. Meth. 1 (1980) 292\u2013294","journal-title":"J. Alg. Disc. Meth."},{"key":"61_CR11","first-page":"176","volume":"34","author":"D. Rose","year":"1978","unstructured":"Rose, D., Tarjan, R.: Algorithmic aspects of vertex elimination on directed graphs. J. Appl. Math. 34 (1978) 176\u2013197","journal-title":"J. Appl. Math."},{"key":"61_CR12","first-page":"320","volume-title":"ALGORITHYMY\u20192000 Conference on Scientific Computing","author":"U. Naumann","year":"2000","unstructured":"Naumann, U.: An enhanced Markowitz rule for accumulating Jacobians efficiently. In Mikula, K., ed.: ALGORITHYMY\u20192000 Conference on Scientific Computing, Slovak University of Technology, Bratislava, Slovakia (2000) 320\u2013329"},{"key":"61_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the ICCS 2000 Conference","author":"M. Tadjouddine","year":"2002","unstructured":"Tadjouddine, M., Forth, S., Pryce, J., Reid, J.: Performance issues for vertex elimination methods in computing Jocobians using Authomatic Differentiation. In: Proceedings of the ICCS 2000 Conference. Volume 2330 of Springer LNCS. (2002)"},{"key":"61_CR14","unstructured":"Roe, P.: Approximating Riemann solvers, parameter vectors, and difference schemes. J. Comp. Physics (1981) 357\u2013372"},{"key":"61_CR15","doi-asserted-by":"crossref","unstructured":"Averik, B., Carter, R., Mor\u00e9, J.: The MINPACK-2 test problem collection (preliminary version). Technical Report 150, Mathematical and Computer Science Division, Argonne National Laboratory (1991)","DOI":"10.2172\/79972"},{"key":"61_CR16","unstructured":"Albrecht, A., Gottschling, P., Naumann, U.: Logarithmic simulated annealing for optimal derivative code. Technical Report 372, University of hertfordshire (2002)"},{"key":"61_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45322-9_9","volume-title":"SAGA 2002-Stochastic Algorithms, Foundations and Applications","author":"U. Naumann","year":"2001","unstructured":"Naumann, U., Gottschling, P.: Prospects for simulated annealing in automatic differentiation. In Steinh\u00f6fel, K., ed.: SAGA 2002-Stochastic Algorithms, Foundations and Applications. Volume 2264 of LNCS., Springer, Berlin (2001) 131\u2013144"},{"key":"61_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Proc. IFIP International Conference on Theoretical Computer Science","author":"A. Albrecht","year":"2000","unstructured":"Albrecht, A., Wong, C.: On logarithmic simulated annealing. In van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P., eds. Proc. IFIP International Conference on Theoretical Computer Science. LNCS, Springer (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44862-4_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T12:36:48Z","timestamp":1557059808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44862-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401957","9783540448624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44862-4_61","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}