lstr_inform_type structure#
#include <galahad_lstr.h> struct lstr_inform_type { // fields ipc_ status; ipc_ alloc_status; char bad_alloc[81]; ipc_ iter; ipc_ iter_pass2; ipc_ biters; ipc_ biter_min; ipc_ biter_max; rpc_ multiplier; rpc_ x_norm; rpc_ r_norm; rpc_ Atr_norm; rpc_ biter_mean; };
detailed documentation#
inform derived type as a C struct
components#
ipc_ status
return status. See lstr_solve_problem for details
ipc_ alloc_status
the status of the last attempted allocation/deallocation
char bad_alloc[81]
the name of the array for which an allocation/deallocation error occurred
ipc_ iter
the total number of iterations required
ipc_ iter_pass2
the total number of pass-2 iterations required if the solution lies on the trust-region boundary
ipc_ biters
the total number of inner iterations performed
ipc_ biter_min
the smallest number of inner iterations performed during an outer iteration
ipc_ biter_max
the largestt number of inner iterations performed during an outer iteration
rpc_ multiplier
the Lagrange multiplier, \(\lambda\), corresponding to the trust-region constraint
rpc_ x_norm
the Euclidean norm of \(x\)
rpc_ r_norm
the Euclidean norm of \(Ax-b\)
rpc_ Atr_norm
the Euclidean norm of \(A^T (Ax-b) + \lambda x\)
rpc_ biter_mean
the average number of inner iterations performed during an outer
iteration