Abstract
A restoration procedure based on a priori knowledge of sparsity patterns of the compressed Jacobian matrix rows is proposed. We show that if the rows of the compressed Jacobian matrix contain certain sparsity patterns the unknown entries can essentially be restored with cost at most proportional to substitution while the number of matrix-vector products to be calculated still remains optimal. We also show that the conditioning of the reduced linear system can be improved by employing a combination of direct and indirect methods of computation. Numerical test results are presented to demonstrate the effectiveness of our proposal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Hossain, S., Steihaug, T. (2006). Computing Sparse Jacobian Matrices Optimally. In: Bücker, M., Corliss, G., Naumann, U., Hovland, P., Norris, B. (eds) Automatic Differentiation: Applications, Theory, and Implementations. Lecture Notes in Computational Science and Engineering, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28438-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-28438-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28403-1
Online ISBN: 978-3-540-28438-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)