We consider the problem of accumulating the Jacobian matrix of a nonlinear vector function by using a minimal number of arithmetic operations. Two new Markowitz-type heuristics are proposed for vertex elimination in linearized computational graphs, and their superiority over existing approaches is shown by several tests. Similar ideas are applied to derive new heuristics for edge elimination techniques. The well known superiority of edge over vertex elimination can be observed only partially for the heuristics discussed in this paper. Nevertheless, significant improvements can be achieved by the new heuristics both in terms of the quality of the results and their robustness with respect to different tiebreaking criteria. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Albrecht, A., Gottschling, P., & Naumann, U. (2003). Markowitz-type heuristics for computing Jacobian matrices efficiently. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2658, 575–584. https://doi.org/10.1007/3-540-44862-4_61
Mendeley helps you to discover research relevant for your work.