rqs_inform_type structure#
#include <galahad_rqs.h> struct rqs_inform_type { // fields ipc_ status; ipc_ alloc_status; ipc_ factorizations; int64_t max_entries_factors; ipc_ len_history; rpc_ obj; rpc_ obj_regularized; rpc_ x_norm; rpc_ multiplier; rpc_ pole; bool dense_factorization; bool hard_case; char bad_alloc[81]; struct rqs_time_type time; struct rqs_history_type history[100]; struct sls_inform_type sls_inform; struct ir_inform_type ir_inform; };
detailed documentation#
inform derived type as a C struct
components#
ipc_ status
reported return status:
0
the solution has been found
-1
an array allocation has failed
-2
an array deallocation has failed
-3
n and/or sigma is not positive and/or p <= 2
-9
the analysis phase of the factorization of \(H + \lambda M\) failed
-10
the factorization of \(H + \lambda M\) failed
-15
\(M\) does not appear to be strictly diagonally dominant
-16
ill-conditioning has prevented furthr progress
ipc_ alloc_status
STAT value after allocate failure.
ipc_ factorizations
the number of factorizations performed
int64_t max_entries_factors
the maximum number of entries in the factors
ipc_ len_history
the number of \((\|x\|_M,\lambda)\) pairs in the history
rpc_ obj
the value of the quadratic function
rpc_ obj_regularized
the value of the regularized quadratic function
rpc_ x_norm
the \(M\) -norm of \(x\), \(\|x\|_M\)
rpc_ multiplier
the Lagrange multiplier corresponding to the regularization
rpc_ pole
a lower bound max \((0,-\lambda_1)\), where \(\lambda_1\) is the left-most eigenvalue of \((H,M)\)
bool dense_factorization
was a dense factorization used?
bool hard_case
has the hard case occurred?
char bad_alloc[81]
name of array which provoked an allocate failure
struct rqs_time_type time
time information
struct rqs_history_type history[100]
history information
struct sls_inform_type sls_inform
cholesky information (see sls_c documentation)
struct ir_inform_type ir_inform
iterative_refinement information (see ir_c documentation)