Why Vector-jacobian Products Are Cheap but Preconditioning Is Generally Costly

نویسنده

  • Andreas Griewank
چکیده

All methods for solving linear or nonlinear systems of equations require the evaluation of residual vectors, most algorithms are based on Jacobian-vector products and many schemes involve vector-Jacobian products. Moreover, while only exact Newton methods form and factor the Jacobian explicitly, some information about the size of its elements or the structure of its spectrum appears to be indespensible for preconditioning purposes. In this paper we will examine what statements can be made about the relative costs of obtaining these various quantities for a linear or nonlinear mapping between Euclidean spaces. Our only assumption is that this vector function is evaluated by a computer program as a composition of arithmetic operations and univariate algebraic or transcendental functions, like the square root and the exponential. Complete Jacobians are in general an order of magnitude more expensive to obtain than the underlying residual. The complexity ratio between these two mathematical objects depends on the sparsity of the Jacobian. Analytical values for Jacobian-vector products are never much more expensive than residuals, which is clearly the case for their approximation by divided diierences. In fact, sometimes such directional derivatives are signiicantly cheaper, especially if evaluated as a bundle. These observations are relevant for Krylov or block-Krylov methods, irrespective of whether the problem is linear or not. Iterative equation solvers that consistency reduce some xed norm of the residual over successive steps tend to involve vector-Jacobian products. Because evaluating these row-vectors is generally assumed to be quite expensive or at least troublesome for the user considerable eeort has gone into the development of transpose-free variants that require only Jacobian-vector products. The good news part of this talk is that vector-Jacobian products can in principle be obtained at the same operations count as Jacobian-vector products. It is commonly understood that all iterative solvers can be painfully slow if the equations are poorly scaled. Most strategies to detect and remedy that calamity are based on guessing or collecting information about some entries of the Jacobian, speciically its diagonal. It has been shown that evaluating just the trace of the Jacobian is in general almost as expensive as evaluating the complete Jacobian. Obviously, this bad news suggests that preconditioning information cannot be obtained automatically, but must be gleaned from \physical" properties of the underlying system, possibly before its discretization or through a multi-level approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Full and partial Jacobian computation via graph coloring : algorithms and applications

Simulations and optimizations are carried out to investigate real-world problems in science and engineering. For instance, solving systems of linear equations with sparse Jacobian matrices is mandatory when using a Newton-type algorithm. The sparsity of Jacobian matrices is exploited and only a subset of the nonzero elements is determined to successfully reduce the usage of the restricting reso...

متن کامل

Towards Matrix-Free AD-Based Preconditioning of KKT Systems in PDE-Constrained Optimization

The presented approach aims at solving an equality constrained, finite-dimensional optimization problem, where the constraints arise from the discretization of some partial differential equation (PDE) on a given space grid. For this purpose, a stationary point of the Lagrangian is computed using Newton’s method, which requires the repeated solution of KKT systems. The proposed algorithm focuses...

متن کامل

Review and Comparison of In-field Calibration Methods of Accelerometer Based on Gravity Vector

Considering the wide applications of accelerometers to determine position and attitude and due to reducing of accuracy of this sensors because of some errors, this paper discusses the calibration of accelerometers. Also because the traditional calibration methods are very time consuming, costly and need precision laboratory equipment, in-field calibration methods are recommended which are simpl...

متن کامل

Jacobian-free Newton–Krylov methods: a survey of approaches and applications

Jacobian-free Newton–Krylov (JFNK) methods are synergistic combinations of Newton-type methods for superlinearly convergent solution of nonlinear equations and Krylov subspace methods for solving the Newton correction equations. The link between the two methods is the Jacobian-vector product, which may be probed approximately without forming and storing the elements of the true Jacobian, throug...

متن کامل

Randomized Heuristics for Exploiting Jacobian Scarcity

We describe a code transformation technique that, given code for a vector function F , produces code suitable for computing collections of Jacobian-vector products F (x)ẋ or Jacobiantranspose-vector products F (x) ȳ. Exploitation of scarcity a measure of the degrees of freedom in the Jacobian matrix means solving a combinatorial optimization problem that is believed to be hard. Our heuristics t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007