---
title: KmlScaissCgAnalyze?I
description: "分析稀疏矩阵并确定不同进程之间的通信关系。"
url: https://www.hikunpeng.com/document/detail/zh/kunpengboostkithistory/240RC1/accel/kunpengaccel_kml_16_0501.html
sourcePath: /source/zh/kunpengboostkithistory/240RC1/accel/kunpengaccel_kml_16_0501.html
indexId: 6f55c27df53c1529841f7ed8b6023a5d7d93e72149333e8c4bca54ca3aecaa9376
---
# KmlScaissCgAnalyze?I

分析稀疏矩阵并确定不同进程之间的通信关系。

#### 接口定义

C Interface：

int KmlScaissCgAnalyzeSI(KmlScasolverTask **handle);

int KmlScaissCgAnalyzeDI(KmlScasolverTask **handle);


#### 参数

| 参数名 | 类型 | 描述 | 输入/输出 |
| --- | --- | --- | --- |
| handle | KmlScasolverTask \*\* | 求解器句柄，传入之前步骤的变量。 | 输入/输出 |


#### 返回值

| 返回值 | 类型 | 描述 |
| --- | --- | --- |
| KMLSS\_NO\_ERROR | int | 正常执行。 |
| KMLSS\_NULL\_ARGUMENT | int | handle为空参数。 |


#### 依赖

#include "kml_scaiss.h"


#### 示例

C Interface：

```
MPI_Init(NULL, NULL);
int size, rank;
MPI_Comm_size(MPI_COMM_WORLD, &size);//获取总进程数
MPI_Comm_rank(MPI_COMM_WORLD, &rank);//获取当前进程标识
int mat_size = 8;
int n = mat_size / size;
int n_beg = n * rank;
if (n * size != mat_size && rank == (size - 1)) {
n = mat_size - n * rank;
}
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 };
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 ia[9] = { 0, 3, 7, 10, 14, 17, 21, 23, 26 };
int a_beg = ia[n_beg];
for (int i = n_beg; i < (n_beg + n + 1); i++) {
ia[i] -= a_beg;
}
/* Internal KML_SCAISS structure */
KmlScasolverTask *handle;
/* KML_SCAISS control parameters */
int error;            /* Output error handle */
/* Create data structures */
const double *a_holder = &a[a_beg];
const int *ja_holder = &ja[a_beg];
const int *ia_holder = &ia[n_beg];
error = KmlScaissCgInitStripesDI(&handle, mat_size, 1, &n, &n_beg, &a_holder, &ja_holder, &ia_holder, MPI_COMM_WORLD);
double eps = 1e-4;
error = KmlScaissCgSetDID(&handle, KMLSS_THRESHOLD, &eps, 1);
if (error != 0) {
printf("\nERROR in KmlScaissCgSetDID with KMLSS_THRESHOLD: %d", error);
return 1;
}
int max_iters = 2000;
error = KmlScaissCgSetDII(&handle, KMLSS_MAX_ITERATION_COUNT, &max_iters, 1);
if (error != 0) {
printf("\nERROR in KmlScaissCgSetDII with KMLSS_MAX_ITERATION_COUNT: %d", error);
return 1;
}
int precond = KMLSS_BJACOBI;
error = KmlScaissCgSetDII(&handle, KMLSS_PRECONDITIONER_TYPE, &precond, 1);
if (error != 0) {
printf("\nERROR in KmlScaissCgSetDII with KMLSS_PRECONDITIONER_TYPE: %d", error);
return 1;
}
int num_blocks = 1;
error = KmlScaissCgPcSetDII(&handle, KMLSS_NUM_BLOCKS, &num_blocks, 1);
if (error != 0) {
printf("ERROR in KmlScaissCgPcSetDII: %d\n", error);
return 1;
}
int subprecond = KMLSS_ICC;
error = KmlScaissCgPcSetDII(&handle, KMLSS_BLOCK_METHOD, &subprecond, 1);
if (error != 0) {
printf("ERROR in KmlScaissCgPcSetDII: %d\n", error);
return 1;
}
error = KmlScaissCgAnalyzeDI(&handle);
if (error != 0) {
printf("ERROR in KmlScaissCgAnalyzeDI: %d\n", error);
return 1;
}
```