KmlIssGcrGet?I?
获得迭代求解相关参数。
接口定义
C Interface:
int KmlIssGcrGetSII(KmlSolverTask **handle, enum KML_SOLVER_PARAM param, int *data, int nd);
int KmlIssGcrGetDII(KmlSolverTask **handle, enum KML_SOLVER_PARAM param, int *data, int nd);
int KmlIssGcrGetSIS(KmlSolverTask **handle, enum KML_SOLVER_PARAM param, float *data, int nd);
int KmlIssGcrGetDID(KmlSolverTask **handle, enum KML_SOLVER_PARAM param, double *data, int nd);
参数
参数名 |
类型 |
描述 |
输入/输出 |
---|---|---|---|
handle |
KmlSolverTask ** |
求解器句柄,传入之前步骤的变量。 |
输入/输出 |
param |
enum KML_SOLVER_PARAM |
|
输入 |
data |
|
|
输入 |
nd |
int |
data数组元素个数。 |
输入 |
返回值
返回值 |
类型 |
描述 |
---|---|---|
KMLSS_NO_ERROR |
int |
正常执行。 |
KMLSS_DATA_SIZE |
int |
参数nd不等于1。 |
KMLSS_NULL_ARGUMENT |
int |
{handle, data}中存在空参数。 |
KMLSS_BAD_SELECTOR |
int |
param为无效参数。 |
依赖
#include "kml_iss.h"
示例
C Interface:
KmlSolverTask *handle; int ierr; int n = 8; double a[26] = {1.0, 1.0, 2.0, 9.0, 2.0, 1.0, -3.0, 2.0, 3.0, 2.0, 1.0, 1.0, 9.0, -5.0, 2.0, 6.0, 1.0, -3.0, 1.0, 4.0, 1.0, -5.0, 7.0, 2.0,1.0, 2.0}; int ja[26] = {0, 3, 4, 1, 2, 3, 5, 1, 2, 7, 0, 1, 3, 6, 0, 4, 5, 1, 4, 5, 7, 3, 6, 2, 5, 7}; int ia[9] = {0, 3, 7, 10, 14, 17, 21, 23, 26}; ierr = KmlIssGcrInitDI(&handle, n, a, ja, ia); ierr = KmlIssGcrAnalyzeDI(&handle); ierr = KmlIssGcrFactorizeDI(&handle); int nd = 1; int idata[] = {0}; double ddata[] = {0}; double eps = 1e-4; ierr = KmlIssGcrSetDID(&handle, KMLSS_THRESHOLD, &eps, nd); int max_iters = 2000; ierr = KmlIssGcrSetDII(&handle, KMLSS_MAX_ITERATION_COUNT, &max_iters, nd); int ldx = n; int ldb = n; int nb = 1; double b[8] = {4.0, 9.0, 7.0, 6.0, 9.0, 3.0, 2.0, 5.0}; double x[8]; ierr = KmlIssGcrSolveDI(&handle, nb, x, ldx, b, ldb); ierr = KmlIssGcrGetDII(&handle, KMLSS_ITERATION_COUNT, idata, nd); if (ierr != 0) { printf("\nERROR in KmlIssGcrGetDII: %d", ierr); return 1; } ierr = KmlIssGcrGetDID(&handle, KMLSS_TOLERANCE, ddata, nd); if (ierr != 0) { printf("\nERROR in KmlIssGcrGetDID: %d", ierr); return 1; } printf("[Solve info] Res= \t%.12g\t, iteration = \t%d\t\n", sqrt(ddata[0]), idata[0]);
运行结果
[Solve info] Res= 5.43730434757e-17 , iteration = 8
父主题: GCR