Abstract. In this paper, the problem of estimating Jacobian and Hessian matrices arising in the finite difference approximation of partial differential equations is considered. Using the notion of computational molecule or stencil, schemes are developed that require the minimum number of differences to estimate these matrices. A procedure applicable to more complicated structures is also given.1. Introduction. In the past few years, there has been a growing interest in studying efficient ways to obtain good estimates of sparse Jacobian or Hessian matrices. Two basic approaches have been followed. In the first approach, it is assumed that one has an estimate of the Jacobian (Hessian) which one wishes to revise given "arbitrary" changes in the variables and the corresponding changes in the functions (gradients). This has led to the development of several sparse quasi-Newton methods (see [11], [14], [12], for example). In the second approach, it is assumed that one can specify the changes in the variables. One then forms an estimate of the Jacobian (Hessian) matrix from the observed changes in the functions (gradients). When the dimension of the matrix is large and the evaluation of each function (gradient) vector is expensive, it is necessary to take the sparsity structure of the matrix into account, in order to make this approach efficient.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.