Home
last modified time | relevance | path

Searched refs:nnzu (Results 1 – 12 of 12) sorted by relevance

/dports/math/elpa/elpa-2019.05.002/src/elpa1/
H A Delpa1_merge_systems_real_template.F90630 nnzu = 0
636 nnzu = nnzu+1
648 ndef = max(nnzu,nnzl)
695 nnzu = 0
700 nnzu = nnzu+1
701 d1u(nnzu) = d1(i)
702 zu (nnzu) = z (i)
743 tmp(1:nnzu) = d1u(1:nnzu)-dbase(j)
746 &(obj,tmp,nnzu,ddiff(j))
747 ev(1:nnzu,i) = zu(1:nnzu) / tmp(1:nnzu) * ev_scale(j)
[all …]
/dports/math/lis/lis-2.0.30/src/matrix/
H A Dlis_matrix_csr.c844 nnzu++; in lis_matrix_split_csr()
908 nnzu = 0; in lis_matrix_split_csr()
925 nnzu++; in lis_matrix_split_csr()
1033 nnzu++; in lis_matrix_split_create_csr()
1091 nnzu = 0; in lis_matrix_split_create_csr()
1106 nnzu++; in lis_matrix_split_create_csr()
1229 nnzu = 0; in lis_matrix_split_update_csr()
1242 nnzu++; in lis_matrix_split_update_csr()
1392 nnzu++; in lis_matrix_split2_csr()
1446 nnzu = 0; in lis_matrix_split2_csr()
[all …]
H A Dlis_matrix_coo.c536 LIS_INT nnzl,nnzu; in lis_matrix_split_coo() local
546 nnzu = 0; in lis_matrix_split_coo()
563 nnzu++; in lis_matrix_split_coo()
591 nnzu = 0; in lis_matrix_split_coo()
603 urow[nnzu] = A->row[i]; in lis_matrix_split_coo()
604 ucol[nnzu] = A->col[i]; in lis_matrix_split_coo()
606 nnzu++; in lis_matrix_split_coo()
617 A->U->nnz = nnzu; in lis_matrix_split_coo()
634 LIS_INT nnz,nnzl,nnzu; in lis_matrix_merge_coo() local
643 nnzu = A->U->nnz; in lis_matrix_merge_coo()
[all …]
H A Dlis_matrix_csc.c496 LIS_INT nnzl,nnzu; in lis_matrix_split_csc() local
510 nnzu = 0; in lis_matrix_split_csc()
560 nnzu = uiw[np]; in lis_matrix_split_csc()
572 nnzu++; in lis_matrix_split_csc()
588 err = lis_matrix_malloc_csr(np,nnzu,&uptr,&uindex,&uvalue); in lis_matrix_split_csc()
636 nnzu = 0; in lis_matrix_split_csc()
651 uindex[nnzu] = A->index[j]; in lis_matrix_split_csc()
652 uvalue[nnzu] = A->value[j]; in lis_matrix_split_csc()
653 nnzu++; in lis_matrix_split_csc()
661 uptr[i+1] = nnzu; in lis_matrix_split_csc()
[all …]
H A Dlis_matrix_vbr.c1124 LIS_INT nnzl,nnzu,bnnzl,bnnzu; in lis_matrix_split_vbr() local
1141 nnzu = 0; in lis_matrix_split_vbr()
1220 nnzu = uiw2[nr]; in lis_matrix_split_vbr()
1234 nnzu++; in lis_matrix_split_vbr()
1251 err = lis_matrix_malloc_vbr(n,nnzu,nr,nc,bnnzu,&urow,&ucol,&uptr,&ubptr,&ubindex,&uvalue); in lis_matrix_split_vbr()
1337 nnzu = 0; in lis_matrix_split_vbr()
1362 memcpy(&uvalue[nnzu],&A->value[A->ptr[j]],bs*sizeof(LIS_SCALAR));; in lis_matrix_split_vbr()
1363 nnzu += bs; in lis_matrix_split_vbr()
1365 uptr[bnnzu] = nnzu; in lis_matrix_split_vbr()
1390 A->U->nnz = nnzu; in lis_matrix_split_vbr()
H A Dlis_matrix_bsc.c1077 LIS_INT nnzl,nnzu; in lis_matrix_split_bsc() local
1096 nnzu = 0; in lis_matrix_split_bsc()
1151 nnzu = uiw[nc]; in lis_matrix_split_bsc()
1163 nnzu++; in lis_matrix_split_bsc()
1179 err = lis_matrix_malloc_bsc(np,bnr,bnc,nnzu,&uptr,&uindex,&uvalue); in lis_matrix_split_bsc()
1227 nnzu = 0; in lis_matrix_split_bsc()
1242 uindex[nnzu] = A->bindex[j]; in lis_matrix_split_bsc()
1243 memcpy(&uvalue[bs*nnzu],&A->value[bs*j],bs*sizeof(LIS_SCALAR)); in lis_matrix_split_bsc()
1244 nnzu++; in lis_matrix_split_bsc()
1252 uptr[i+1] = nnzu; in lis_matrix_split_bsc()
[all …]
H A Dlis_matrix_bsr.c1134 LIS_INT nnzl,nnzu; in lis_matrix_split_bsr() local
1153 nnzu = 0; in lis_matrix_split_bsr()
1208 nnzu = uiw[nr]; in lis_matrix_split_bsr()
1220 nnzu++; in lis_matrix_split_bsr()
1236 err = lis_matrix_malloc_bsr(n,bnr,bnc,nnzu,&uptr,&uindex,&uvalue); in lis_matrix_split_bsr()
1284 nnzu = 0; in lis_matrix_split_bsr()
1299 uindex[nnzu] = A->bindex[j]; in lis_matrix_split_bsr()
1300 memcpy(&uvalue[bs*nnzu],&A->value[bs*j],bs*sizeof(LIS_SCALAR)); in lis_matrix_split_bsr()
1301 nnzu++; in lis_matrix_split_bsr()
1309 uptr[i+1] = nnzu; in lis_matrix_split_bsr()
[all …]
/dports/math/lis/lis-2.0.30/src/precon/
H A Dlis_precon_is.c155 LIS_INT nnzl,nnzu,kl,ku; in lis_precon_create_is_csr() local
200 nnzu = 0; in lis_precon_create_is_csr()
217 nnzu++; in lis_precon_create_is_csr()
242 nnzu++; in lis_precon_create_is_csr()
251 nnzu++; in lis_precon_create_is_csr()
261 nnzu++; in lis_precon_create_is_csr()
266 uptr[i+1] = nnzu; in lis_precon_create_is_csr()
281 nnzu = uptr[n]; in lis_precon_create_is_csr()
285 uindex = (LIS_INT *)lis_malloc(nnzu*sizeof(LIS_INT),"lis_precon_create_is_csr::uindex"); in lis_precon_create_is_csr()
286 uvalue = (LIS_SCALAR *)lis_malloc(nnzu*sizeof(LIS_SCALAR),"lis_precon_create_is_csr::uvalue"); in lis_precon_create_is_csr()
/dports/science/openmx/openmx3.8/source/
H A Delpa1.f902215 nnzu = 0
2221 nnzu = nnzu+1
2233 ndef = max(nnzu,nnzl)
2272 nnzu = 0
2277 nnzu = nnzu+1
2278 d1u(nnzu) = d1(i)
2279 zu (nnzu) = z (i)
2320 tmp(1:nnzu) = d1u(1:nnzu)-dbase(j)
2321 call v_add_s(tmp,nnzu,ddiff(j))
2322 ev(1:nnzu,i) = zu(1:nnzu) / (tmp(1:nnzu)+1.0e-26) * ev_scale(j)
[all …]
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A DHashMatrix.cpp902 size_t nnzu =0,nnzd=0; in SortLU() local
904 if( i[k]<j[k]) ++nnzu; // 1 2 in U => i <= j in SortLU()
906 size_t nnzl=nnz-nnzu-nnzd; in SortLU()
907 cout << "SortLU " << U << ":s " << nnzl << " "<< nnzd << " " << nnzu << endl; in SortLU()
921 cout << " SortLU "<< kU << " " << nnzu+nnzd << " " << k << endl; in SortLU()
929 assert(kU == nnzu+nnzd); in SortLU()
961 size_t nnzu=SortLU(1); in CSC_U() local
962 Buildp(this->m,j,type_CSC+addstateLU(1),nnzu); in CSC_U()
967 return nnzu; in CSC_U()
/dports/math/lis/lis-2.0.30/include/
H A Dlis_matrix.h130 …extern LIS_INT lis_matrix_setDLU_csr(LIS_INT nnzl, LIS_INT nnzu, LIS_SCALAR *diag, LIS_INT *lptr, …
152 …extern LIS_INT lis_matrix_setDLU_csc(LIS_INT nnzl, LIS_INT nnzu, LIS_SCALAR *diag, LIS_INT *lptr, …
/dports/chinese/rime-array/rime-array-d10f2f8b2aec7c7e736ace01e8a399e5ae5e7c3a/
H A Darray30_phrases.dict.yaml98112 應有 nnzu'