Home
last modified time | relevance | path

Searched refs:size2 (Results 1 – 3 of 3) sorted by relevance

/petsc/src/mat/tutorials/
H A Dex2.c17 PetscInt size = 8, size1 = 6, size2 = 2, i, j; in main() local
70 PetscCall(MatSetSizes(A12, size1, size2, size1, size2)); in main()
78 PetscCall(MatSetSizes(A21, size2, size1, size2, size1)); in main()
86 PetscCall(MatSetSizes(A22, size2, size2, size2, size2)); in main()
94 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, size2, x + size1, &X2)); in main()
96 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, size2, z + size1, &Z2)); in main()
/petsc/src/ksp/ksp/impls/lsqr/
H A Dlsqr.c70 PetscInt i, size1, size2; in KSPSolve_LSQR() local
235 PetscCall(MatGetSize(Amat, &size1, &size2)); in KSPSolve_LSQR()
236 if (size1 > size2) tmp = size1 - size2; in KSPSolve_LSQR()
/petsc/src/mat/impls/aij/mpi/
H A Dmpimatmatmult.c966 static void Merge3SortedArrays(PetscInt size1, PetscInt *in1, PetscInt size2, PetscInt *in2, PetscI… in Merge3SortedArrays() argument
971 while (i < size1 && j < size2 && k < size3) { in Merge3SortedArrays()
994 while (i < size1 && j < size2) { in Merge3SortedArrays()
1016 while (k < size3 && j < size2) { in Merge3SortedArrays()
1029 while (j < size2) out[l++] = in2[j++]; in Merge3SortedArrays()