f11jb
is the AD Library version of the primal routine
f11jbf.
Based (in the C++ interface) on overload resolution,
f11jb can be used for primal, tangent and adjoint
evaluation. It supports tangents and adjoints of first order.
Note: this function can be used with AD tools other than dco/c++. For details, please contact
NAG.
f11jb
is the AD Library version of the primal routine
f11jbf.
f11jbf solves a system of linear equations involving the incomplete Cholesky preconditioning matrix generated by
f11jaf.
For further information see
Section 3 in the documentation for
f11jbf.
A brief summary of the AD specific arguments is given below. For the remainder, links are provided to the corresponding argument from the primal routine.
A tooltip popup for all arguments can be found by hovering over the argument name in
Section 2 and in this section.
f11jb preserves all error codes from
f11jbf and in addition can return:
An unexpected AD error has been triggered by this routine. Please
contact
NAG.
See
Error Handling in the NAG AD Library Introduction for further information.
The routine was called using a strategy that has not yet been implemented.
See
AD Strategies in the NAG AD Library Introduction for further information.
A C++ exception was thrown.
The error message will show the details of the C++ exception text.
Dynamic memory allocation failed for AD.
See
Error Handling in the NAG AD Library Introduction for further information.
Not applicable.
None.
The following examples are variants of the example for
f11jbf,
modified to demonstrate calling the NAG AD Library.
This example reads in a symmetric positive definite sparse matrix
and a vector
. It then calls
f11ja, with
and
, to compute the
complete Cholesky decomposition of
:
Then it calls
f11jb to solve the system
It then repeats the exercise for the same matrix permuted with the bandwidth-reducing Reverse Cuthill–McKee permutation, calculated with
f11ye.