Searched refs:p_nnz (Results 1 – 4 of 4) sorted by relevance
/dports/math/combblas/CombBLAS_beta_16_2/BipartiteMatchings/ |
H A D | BPMaximumMatching.h | 76 IT p_nnz = accumulate(recvcnt,recvcnt+procsPerRow, static_cast<IT>(0)); in PermMat() local 79 IT * p_rows = new IT[p_nnz]; in PermMat() 80 IT * p_cols = new IT[p_nnz]; in PermMat() 97 std::tuple<IT,IT,bool> * p_tuples = new std::tuple<IT,IT,bool>[p_nnz]; in PermMat() 98 for(IT i=0; i< p_nnz; ++i) in PermMat() 113 …PSeq->Create( p_nnz, local_nrow, local_ncol, p_tuples); // deletion of tuples[] is handled by SpM… in PermMat()
|
/dports/science/PETSc/petsc-3.14.1/src/mat/impls/aij/seq/bas/ |
H A D | spbas_cholesky.h | 282 PetscInt p_nnz; in spbas_incomplete_cholesky() local 320 p_nnz = pattern.row_nnz[i]; in spbas_incomplete_cholesky() 322 for (j=0; j<p_nnz; j++) { in spbas_incomplete_cholesky() 329 p_nnz = pattern.row_nnz[i]; in spbas_incomplete_cholesky() 388 for (j=1; j<p_nnz; j++) { in spbas_incomplete_cholesky()
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/overloading/macros/ |
H A D | %p_nnz.sci | 7 function n = %p_nnz(p)
|
/dports/math/combblas/CombBLAS_beta_16_2/include/CombBLAS/ |
H A D | SpParMat.cpp | 1964 IT p_nnz = std::accumulate(recvcnt,recvcnt+rowneighs, static_cast<IT>(0)); in SubsRef_SR() local 1967 IT * p_rows = new IT[p_nnz]; in SubsRef_SR() 1968 IT * p_cols = new IT[p_nnz]; in SubsRef_SR() 1985 std::tuple<IT,IT,bool> * p_tuples = new std::tuple<IT,IT,bool>[p_nnz]; in SubsRef_SR() 1986 for(IT i=0; i< p_nnz; ++i) in SubsRef_SR() 1993 …PSeq->Create( p_nnz, rrowlen, trlocalrows, p_tuples); // deletion of tuples[] is handled by SpMat… in SubsRef_SR()
|