sbls_inform_type structure#
struct sbls_inform_type{T} status::Int32 alloc_status::Int32 bad_alloc::NTuple{81,Cchar} sort_status::Int32 factorization_integer::Int64 factorization_real::Int64 preconditioner::Int32 factorization::Int32 d_plus::Int32 rank::Int32 rank_def::Bool perturbed::Bool iter_pcg::Int32 norm_residual::T alternative::Bool time::sbls_time_type{T} sls_inform::sls_inform_type{T} uls_inform::uls_inform_type{T}
detailed documentation#
inform derived type as a Julia structure
components#
Int32 status
return status. See SBLS_form_and_factorize for details
Int32 alloc_status
the status of the last attempted allocation/deallocation
NTuple{81,Cchar} bad_alloc
the name of the array for which an allocation/deallocation error occurred
Int32 sort_status
the return status from the sorting routines
Int64 factorization_integer
the total integer workspace required for the factorization
Int64 factorization_real
the total real workspace required for the factorization
Int32 preconditioner
the preconditioner used
Int32 factorization
the factorization used
Int32 d_plus
how many of the diagonals in the factorization are positive
Int32 rank
the computed rank of \(A\)
Bool rank_def
is the matrix A rank defficient?
Bool perturbed
has the used preconditioner been perturbed to guarantee correct inertia?
Int32 iter_pcg
the total number of projected CG iterations required
T norm_residual
the norm of the residual
Bool alternative
has an “alternative” \(y\) : \(K y = 0\) and \(y^T c > 0\) been found when trying to solve \(K y = c\) for generic \(K\)?
struct sbls_time_type time
timings (see above)
struct sls_inform_type sls_inform
inform parameters from the GALAHAD package SLS used
struct uls_inform_type uls_inform
inform parameters from the GALAHAD package ULS used