Lines Matching refs:Nk
558 PetscInt depth, pdepth, Nk, pNk; in PetscLagNodeIndicesPushForward() local
632 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(formDegree), &Nk)); in PetscLagNodeIndicesPushForward()
634 PetscCall(DMGetWorkArray(dm, pNk * Nk, MPIU_REAL, &Jstar)); in PetscLagNodeIndicesPushForward()
637 for (i = 0; i < Nk; i++) { in PetscLagNodeIndicesPushForward()
639 for (j = 0; j < pNk; j++) val += nodeVec[n * pNk + j] * Jstar[j * Nk + i]; in PetscLagNodeIndicesPushForward()
640 pfNodeVec[n * Nk + i] = val; in PetscLagNodeIndicesPushForward()
643 PetscCall(DMRestoreWorkArray(dm, pNk * Nk, MPIU_REAL, &Jstar)); in PetscLagNodeIndicesPushForward()
655 PetscInt Nk, NkT, NkF; in PetscLagNodeIndicesTensor() local
666 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(formDegree), &Nk)); in PetscLagNodeIndicesTensor()
673 ni->nodeVecDim = Nk; in PetscLagNodeIndicesTensor()
688 PetscCall(PetscMalloc1(nNodes * Nk, &ni->nodeVec)); in PetscLagNodeIndicesTensor()
695 …PetscCall(PetscMalloc6(MkT, &workT, MkT, &workT2, MkF, &workF, MkF, &workF2, Nk, &work, Nk, &work2… in PetscLagNodeIndicesTensor()
696 PetscCall(PetscMalloc1(Nk * MkT, &wedgeMat)); in PetscLagNodeIndicesTensor()
727 for (d = 0; d < Nk; d++) { in PetscLagNodeIndicesTensor()
734 for (d = 0; d < Nk; d++) work2[d] = work[d]; in PetscLagNodeIndicesTensor()
738 for (d = 0; d < Nk; d++) ni->nodeVec[l * Nk + d] = sign * work[d]; in PetscLagNodeIndicesTensor()
1045 PetscInt dim, NkTrace, NkFiber, Nk; in MatTensorAltV() local
1076 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(k), &Nk)); in MatTensorAltV()
1080 … for (i = 0; i < mTrace; i++, l++) nnz[l] = (nnzTrace[i] / NkTrace) * (nnzFiber[j] / NkFiber) * Nk; in MatTensorAltV()
1081 n = (nTrace / NkTrace) * (nFiber / NkFiber) * Nk; in MatTensorAltV()
1098 PetscCall(PetscMalloc5(dT, &workT, dF, &workF, Nk, &work, Nk, &workstar, Nk, &workS)); in MatTensorAltV()
1100 PetscCall(PetscMalloc1(Nk * dT, &wedgeMat)); in MatTensorAltV()
1144 for (il = 0; il < Nk; il++) { in MatTensorAltV()
1152 for (l = 0; l < Nk; l++) workS[l] = workstar[l]; in MatTensorAltV()
1159 for (l = 0; l < Nk; l++) workS[l] = work[l]; in MatTensorAltV()
1165 …for (l = 0; l < Nk; l++) PetscCall(MatSetValue(prod, i, col * Nk + l, vals[l], INSERT_VALUES)); /*… in MatTensorAltV()
1232 PetscInt m, n, mA, nA, mB, nB, Nk, i, j, l; in MatricesMerge() local
1239 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(k), &Nk)); in MatricesMerge()
1241 …PetscCheck(nA % Nk == 0, PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "matA column space not a multiple of … in MatricesMerge()
1243 …PetscCheck(nB % Nk == 0, PETSC_COMM_SELF, PETSC_ERR_ARG_SIZ, "matB column space not a multiple of … in MatricesMerge()
1245 n = numMerged * Nk; in MatricesMerge()
1250 …PetscCheck(nnz[i] % Nk == 0, PETSC_COMM_SELF, PETSC_ERR_PLIB, "nonzeros in matA are not in k-form … in MatricesMerge()
1255 …PetscCheck(nnz[i + mA] % Nk == 0, PETSC_COMM_SELF, PETSC_ERR_PLIB, "nonzeros in matB are not in k-… in MatricesMerge()
1269 for (j = 0; j < nCols / Nk; j++) { in MatricesMerge()
1270 PetscInt newCol = aToMerged[cols[j * Nk] / Nk]; in MatricesMerge()
1271 for (l = 0; l < Nk; l++) work[j * Nk + l] = newCol * Nk + l; in MatricesMerge()
1283 for (j = 0; j < nCols / Nk; j++) { in MatricesMerge()
1284 PetscInt newCol = bToMerged[cols[j * Nk] / Nk]; in MatricesMerge()
1285 for (l = 0; l < Nk; l++) work[j * Nk + l] = newCol * Nk + l; in MatricesMerge()
1346 …NodeMat(Petsc1DNodeFamily nodeFamily, PetscInt dim, PetscInt sum, PetscInt Nk, PetscInt numNodeSki… in PetscDualSpaceLagrangeCreateSimplexNodeMat() argument
1362 ni->nodeVecDim = Nk; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1363 ni->nNodes = nNodes * Nk; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1365 PetscCall(PetscMalloc1(nNodes * Nk * (dim + 1), &ni->nodeIdx)); in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1366 PetscCall(PetscMalloc1(nNodes * Nk * Nk, &ni->nodeVec)); in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1368 for (j = 0; j < Nk; j++) in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1369 for (k = 0; k < Nk; k++) ni->nodeVec[(i * Nk + j) * Nk + k] = (j == k) ? 1. : 0.; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1383 for (c = 0; c < Nk; c++) { in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1384 for (j = 0; j < dim + 1; j++) ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1401 for (c = 0; c < Nk; c++) { in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1406 ni->nodeIdx[(k * Nk + c) * (dim + 1) + j] = tup[j] + 1; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1414 PetscCall(MatCreateSeqAIJ(PETSC_COMM_SELF, nNodes * Nk, nNodes * Nk, Nk, NULL, &intMat)); in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1417 for (j = 0; j < nNodes * Nk; j++) { in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1418 PetscInt rem = j % Nk; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1420 PetscInt anext = aprev + Nk; in PetscDualSpaceLagrangeCreateSimplexNodeMat()
1440 PetscInt formDegree, Nk; in PetscDualSpaceLagrangeCreateAllNodeIdx() local
1451 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(formDegree), &Nk)); in PetscDualSpaceLagrangeCreateAllNodeIdx()
1456 ni->nodeVecDim = Nk; in PetscDualSpaceLagrangeCreateAllNodeIdx()
1460 PetscCall(PetscMalloc1(Nk * nDofs, &ni->nodeVec)); in PetscDualSpaceLagrangeCreateAllNodeIdx()
1465 PetscCall(PetscArraycpy(ni->nodeVec, lag->intNodeIndices->nodeVec, spintdim * Nk)); in PetscDualSpaceLagrangeCreateAllNodeIdx()
1476 …ces, plag->intNodeIndices, 0, formDegree, &ni->nodeIdx[off * nodeIdxDim], &ni->nodeVec[off * Nk])); in PetscDualSpaceLagrangeCreateAllNodeIdx()
1490 PetscInt pStart, pEnd, p, k, Nk, dim, Nc; in PetscDualSpaceCreateAllDataFromInteriorData() local
1510 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(k), &Nk)); in PetscDualSpaceCreateAllDataFromInteriorData()
1541 PetscCall(MatCreateSeqAIJ(PETSC_COMM_SELF, nDofs, nNodes * Nc, maxNzforms * Nk, NULL, &allMat)); in PetscDualSpaceCreateAllDataFromInteriorData()
1544 … &v0, dim, &pv0, dim * dim, &J, dim * dim, &Jinv, Nk * Nk, &L, maxNzforms * Nk, &work, maxNzforms … in PetscDualSpaceCreateAllDataFromInteriorData()
1616 for (d = 0; d < Nk; d++) iwork[l * Nk + d] = (blockcol + countNodesIn) * Nk + d; in PetscDualSpaceCreateAllDataFromInteriorData()
1617 for (d = 0; d < Nk; d++) work[l * Nk + d] = 0.; in PetscDualSpaceCreateAllDataFromInteriorData()
1618 for (d = 0; d < Nk; d++) { in PetscDualSpaceCreateAllDataFromInteriorData()
1621 work[l * Nk + d] += vals[l * pNk + e] * L[e * Nk + d]; in PetscDualSpaceCreateAllDataFromInteriorData()
1625 PetscCall(MatSetValues(allMat, 1, &row, (ncols / pNk) * Nk, iwork, work, INSERT_VALUES)); in PetscDualSpaceCreateAllDataFromInteriorData()
1895 PetscInt Nk; in BiunitSimplexSymmetricFormTransformation() local
1900 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(k), &Nk)); in BiunitSimplexSymmetricFormTransformation()
1901 …PetscCall(PetscCalloc4(dim * dim, &biToEq, dim * dim, &eqToBi, Nk * Nk, &biToEqStar, Nk * Nk, &eqT… in BiunitSimplexSymmetricFormTransformation()
1932 for (PetscInt i = 0; i < Nk; i++) { in BiunitSimplexSymmetricFormTransformation()
1933 for (PetscInt j = 0; j < Nk; j++) { in BiunitSimplexSymmetricFormTransformation()
1935 for (PetscInt k = 0; k < Nk; k++) val += biToEqStar[i * Nk + k] * eqToBiStar[k * Nk + j]; in BiunitSimplexSymmetricFormTransformation()
1936 T[i * Nk + j] = val; in BiunitSimplexSymmetricFormTransformation()
1990 PetscInt formDegree, Nk, Ncopies; in PetscDualSpaceSetUp_Lagrange() local
2010 PetscCall(PetscDTBinomialInt(dim, PetscAbsInt(formDegree), &Nk)); in PetscDualSpaceSetUp_Lagrange()
2011 if (sp->Nc <= 0 && lag->numCopies > 0) sp->Nc = Nk * lag->numCopies; in PetscDualSpaceSetUp_Lagrange()
2013 …PetscCheck(Nc % Nk == 0, comm, PETSC_ERR_ARG_INCOMP, "Number of components is not a multiple of fo… in PetscDualSpaceSetUp_Lagrange()
2014 if (lag->numCopies <= 0) lag->numCopies = Nc / Nk; in PetscDualSpaceSetUp_Lagrange()
2016 …PetscCheck(Nc / Nk == Ncopies, comm, PETSC_ERR_ARG_INCOMP, "Number of copies * (dim choose k) != N… in PetscDualSpaceSetUp_Lagrange()
2067 PetscCall(PetscDualSpaceSetNumComponents(scalarsp, Nk)); in PetscDualSpaceSetUp_Lagrange()
2213 …PetscCall(PetscDualSpaceLagrangeCreateSimplexNodeMat(nodeFamily, dim, sum, Nk, numNodeSkip, &sp->i… in PetscDualSpaceSetUp_Lagrange()
2227 …PetscCall(PetscDualSpaceLagrangeCreateSimplexNodeMat(nodeFamily, dim, sum, Nk, numNodeSkip, &sp->i… in PetscDualSpaceSetUp_Lagrange()
2269 PetscCall(PetscMalloc2(Nk * Nk, &T, nCols, &work)); in PetscDualSpaceSetUp_Lagrange()
2277 …PetscCheck(nrCols % Nk == 0, PETSC_COMM_SELF, PETSC_ERR_PLIB, "nonzeros in intMat matrix are not i… in PetscDualSpaceSetUp_Lagrange()
2278 for (PetscInt b = 0; b < nrCols; b += Nk) { in PetscDualSpaceSetUp_Lagrange()
2281 for (PetscInt j = 0; j < Nk; j++) { in PetscDualSpaceSetUp_Lagrange()
2283 for (PetscInt i = 0; i < Nk; i++) w[j] += v[i] * T[i * Nk + j]; in PetscDualSpaceSetUp_Lagrange()
2301 PetscReal *w = &newNodeVec[n * Nk]; in PetscDualSpaceSetUp_Lagrange()
2302 const PetscReal *v = &oldNodeVec[n * Nk]; in PetscDualSpaceSetUp_Lagrange()
2304 for (PetscInt j = 0; j < Nk; j++) { in PetscDualSpaceSetUp_Lagrange()
2306 for (PetscInt i = 0; i < Nk; i++) w[j] += v[i] * T[i * Nk + j]; in PetscDualSpaceSetUp_Lagrange()