/dports/math/scilab/scilab-6.1.1/scilab/modules/m2sci/tests/unit_tests/mfiles/ |
H A D | EIG.m | 1 % Test file for function eig() 5 res1 = eig([]); 7 res2 = eig(m2sciUnknownType([])); 11 res4 = eig([1]); 23 res10 = eig([i]); 35 [res16,res17] = eig([]); 41 [res22,res23] = eig([1]); 53 [res34,res35] = eig([i]); 65 res46 = eig([],[]); 71 res49 = eig([1],[1]); [all …]
|
/dports/science/libmsym/libmsym-0.2.3-paper/src/ |
H A D | character_table.c | 209 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCi() 213 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = 1; in getRepresentationsCi() 227 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCs() 231 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.i = 1; in getRepresentationsCs() 245 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCn() 271 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCnh() 319 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCnv() 355 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsSn() 398 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsDn() 435 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsDnh() [all …]
|
/dports/science/v_sim/v_sim-3.8.0/lib/plug-ins/msym/libmsym/src/ |
H A D | character_table.c | 209 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCi() 213 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = 1; in getRepresentationsCi() 227 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCs() 231 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.i = 1; in getRepresentationsCs() 245 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCn() 271 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCnh() 319 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsCnv() 355 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsSn() 398 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsDn() 435 rep[r].eig.p = rep[r].eig.l = rep[r].eig.v = rep[r].eig.h = rep[r].eig.i = 1; in getRepresentationsDnh() [all …]
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/property/ |
H A D | hnd_diag.F | 27 if (abs(eig(1)-eig(2)).gt.conv) then 28 if (abs(eig(2)-eig(3)).gt.conv) then 33 t = eig(2) 34 eig(2) = eig(3) 43 t = eig(1) 44 eig(1) = eig(2) 45 eig(2) = t 65 if( abs(eig(j)).gt. abs(eig(jj))) jj=j 69 xx=eig(jj) 70 eig(jj)=eig(i) [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/property/ |
H A D | hnd_diag.F | 27 if (abs(eig(1)-eig(2)).gt.conv) then 28 if (abs(eig(2)-eig(3)).gt.conv) then 33 t = eig(2) 34 eig(2) = eig(3) 43 t = eig(1) 44 eig(1) = eig(2) 45 eig(2) = t 65 if( abs(eig(j)).gt. abs(eig(jj))) jj=j 69 xx=eig(jj) 70 eig(jj)=eig(i) [all …]
|
/dports/science/wannier90/wannier90-3.1.0/src/postw90/ |
H A D | wan_ham.F90 | 62 D_h_a(n, m) = delHH_a_bar(n, m)/(eig(m) - eig(n)) 104 if (n == m .or. abs(eig(m) - eig(n)) < 1.0e-7_dp) cycle 105 D_h(n, m, i) = delHH_bar_i(n, m)/(eig(m) - eig(n)) 149 deltaE = eig(m) - eig(n) 199 JJm_list(n, m, ife) = cmplx_i*delHH(n, m)/(eig(m) - eig(n)) 200 JJp_list(m, n, ife) = cmplx_i*delHH(m, n)/(eig(n) - eig(m)) 206 if (eig(n) > fe .and. eig(m) < fe) then 207 JJp_list(n, m, ife) = cmplx_i*delHH(n, m)/(eig(m) - eig(n)) 208 JJm_list(m, n, ife) = cmplx_i*delHH(m, n)/(eig(n) - eig(m)) 327 diff = eig(i + 1) - eig(i) [all …]
|
/dports/science/siesta/siesta-4.1.5/Util/TS/TBtrans/ |
H A D | m_tbt_diag.F90 | 97 allocate(eig(no)) 103 call dspevd('V','U',no,S_UT,eig,v,no,eig,-1,liwork,-1,info) 138 eig = 0._dp 140 eig = dsqrt(eig) 240 if ( eig(i) > eig(j) ) then 243 eig(j) = eig(i) 310 allocate(eig(no)) 356 eig = 0._dp 358 eig = dsqrt(eig) 465 if ( eig(i) > eig(j) ) then [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/algo/tests/ |
H A D | test_real_eigensystem.cxx | 27 vnl_real_eigensystem eig(S); in test_6x6() local 28 vnl_diag_matrix<std::complex<double> > D(eig.D.rows()); in test_6x6() 29 for (unsigned i = 0; i < eig.D.rows(); ++i) in test_6x6() 32 D(i,i) = std::real(eig.D(i,i)); in test_6x6() 35 std::cout << "D = " << eig.D << std::endl in test_6x6() 36 << "V = " << eig.V << std::endl; in test_6x6() 38 …vnl_matrix<std::complex<double> > diff = vnl_complexify(S*eig.Vreal) - vnl_complexify(eig.Vreal)*D; in test_6x6() 55 vnl_real_eigensystem eig(X); in test_4x4() local 57 std::cout << "D = " << eig.D << std::endl in test_4x4() 58 << "V = " << eig.V << std::endl; in test_4x4() [all …]
|
/dports/misc/vxl/vxl-3.3.2/core/vnl/algo/tests/ |
H A D | test_real_eigensystem.cxx | 25 vnl_real_eigensystem eig(S); in test_6x6() local 26 vnl_diag_matrix<std::complex<double>> D(eig.D.rows()); in test_6x6() 27 for (unsigned i = 0; i < eig.D.rows(); ++i) in test_6x6() 29 TEST("All real", std::imag(eig.D(i, i)) < 1e-15, true); in test_6x6() 30 D(i, i) = std::real(eig.D(i, i)); in test_6x6() 33 std::cout << "D = " << eig.D << std::endl << "V = " << eig.V << std::endl; in test_6x6() 35 …vnl_matrix<std::complex<double>> diff = vnl_complexify(S * eig.Vreal) - vnl_complexify(eig.Vreal) … in test_6x6() 47 vnl_real_eigensystem eig(X); in test_4x4() local 49 std::cout << "D = " << eig.D << std::endl << "V = " << eig.V << std::endl; in test_4x4() 53 vnl_matrix<std::complex<double>> diff = XC * eig.V - eig.V * eig.D; in test_4x4()
|
/dports/math/eigen3/eigen-3.3.9/test/ |
H A D | eigensolver_generic.cpp | 76 eig.compute(a.adjoint() * a); in eigensolver() 91 EigenSolver<MatrixType> eig; in eigensolver_verify_assert() local 92 VERIFY_RAISES_ASSERT(eig.eigenvectors()); in eigensolver_verify_assert() 95 VERIFY_RAISES_ASSERT(eig.eigenvalues()); in eigensolver_verify_assert() 98 eig.compute(a, false); in eigensolver_verify_assert() 145 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 147 …VERIFY_IS_APPROX(a * eig.pseudoEigenvectors()*scale, eig.pseudoEigenvectors() * eig.pseudoEigenval… in test_eigensolver_generic() 148 …VERIFY_IS_APPROX(a * eig.eigenvectors()*scale, eig.eigenvectors() * eig.eigenvalues().asDiagonal()… in test_eigensolver_generic() 155 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 158 VERIFY_IS_APPROX((eig.pseudoEigenvectors() * eig.pseudoEigenvalueMatrix()).norm()+1., 1.); in test_eigensolver_generic() [all …]
|
H A D | eigensolver_generalized_real.cpp | 38 GeneralizedEigenSolver<MatrixType> eig(spdA, spdB); in generalized_eigensolver_real() local 40 VERIFY_IS_EQUAL(eig.eigenvalues().imag().cwiseAbs().maxCoeff(), 0); in generalized_eigensolver_real() 42 VectorType realEigenvalues = eig.eigenvalues().real(); in generalized_eigensolver_real() 47 … typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType D = eig.eigenvalues().asDiagonal(); in generalized_eigensolver_real() 48 typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType V = eig.eigenvectors(); in generalized_eigensolver_real() 54 GeneralizedEigenSolver<MatrixType> eig(rows); in generalized_eigensolver_real() local 57 eig.compute(a,b); in generalized_eigensolver_real() 61 …Matrix<ComplexScalar,Dynamic,Dynamic> tmp = (eig.betas()(k)*a).template cast<ComplexScalar>() - ei… in generalized_eigensolver_real() 67 … typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType D = eig.eigenvalues().asDiagonal(); in generalized_eigensolver_real() 68 typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType V = eig.eigenvectors(); in generalized_eigensolver_real()
|
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/test/ |
H A D | eigensolver_generic.cpp | 76 eig.compute(a.adjoint() * a); in eigensolver() 91 EigenSolver<MatrixType> eig; in eigensolver_verify_assert() local 92 VERIFY_RAISES_ASSERT(eig.eigenvectors()); in eigensolver_verify_assert() 95 VERIFY_RAISES_ASSERT(eig.eigenvalues()); in eigensolver_verify_assert() 98 eig.compute(a, false); in eigensolver_verify_assert() 145 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 147 …VERIFY_IS_APPROX(a * eig.pseudoEigenvectors()*scale, eig.pseudoEigenvectors() * eig.pseudoEigenval… in test_eigensolver_generic() 148 …VERIFY_IS_APPROX(a * eig.eigenvectors()*scale, eig.eigenvectors() * eig.eigenvalues().asDiagonal()… in test_eigensolver_generic() 155 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 158 VERIFY_IS_APPROX((eig.pseudoEigenvectors() * eig.pseudoEigenvalueMatrix()).norm()+1., 1.); in test_eigensolver_generic() [all …]
|
H A D | eigensolver_generalized_real.cpp | 38 GeneralizedEigenSolver<MatrixType> eig(spdA, spdB); in generalized_eigensolver_real() local 40 VERIFY_IS_EQUAL(eig.eigenvalues().imag().cwiseAbs().maxCoeff(), 0); in generalized_eigensolver_real() 42 VectorType realEigenvalues = eig.eigenvalues().real(); in generalized_eigensolver_real() 47 … typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType D = eig.eigenvalues().asDiagonal(); in generalized_eigensolver_real() 48 typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType V = eig.eigenvectors(); in generalized_eigensolver_real() 54 GeneralizedEigenSolver<MatrixType> eig(rows); in generalized_eigensolver_real() local 57 eig.compute(a,b); in generalized_eigensolver_real() 61 …Matrix<ComplexScalar,Dynamic,Dynamic> tmp = (eig.betas()(k)*a).template cast<ComplexScalar>() - ei… in generalized_eigensolver_real() 67 … typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType D = eig.eigenvalues().asDiagonal(); in generalized_eigensolver_real() 68 typename GeneralizedEigenSolver<MatrixType>::EigenvectorsType V = eig.eigenvectors(); in generalized_eigensolver_real()
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/test/ |
H A D | eigensolver_generic.cpp | 76 eig.compute(a.adjoint() * a); in eigensolver() 91 EigenSolver<MatrixType> eig; in eigensolver_verify_assert() local 92 VERIFY_RAISES_ASSERT(eig.eigenvectors()); in eigensolver_verify_assert() 95 VERIFY_RAISES_ASSERT(eig.eigenvalues()); in eigensolver_verify_assert() 98 eig.compute(a, false); in eigensolver_verify_assert() 145 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 147 …VERIFY_IS_APPROX(a * eig.pseudoEigenvectors()*scale, eig.pseudoEigenvectors() * eig.pseudoEigenval… in test_eigensolver_generic() 148 …VERIFY_IS_APPROX(a * eig.eigenvectors()*scale, eig.eigenvectors() * eig.eigenvalues().asDiagonal()… in test_eigensolver_generic() 155 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 158 VERIFY_IS_APPROX((eig.pseudoEigenvectors() * eig.pseudoEigenvalueMatrix()).norm()+1., 1.); in test_eigensolver_generic() [all …]
|
/dports/misc/opennn/opennn-5.0.5/eigen/test/ |
H A D | eigensolver_generic.cpp | 76 eig.compute(a.adjoint() * a); in eigensolver() 91 EigenSolver<MatrixType> eig; in eigensolver_verify_assert() local 92 VERIFY_RAISES_ASSERT(eig.eigenvectors()); in eigensolver_verify_assert() 95 VERIFY_RAISES_ASSERT(eig.eigenvalues()); in eigensolver_verify_assert() 98 eig.compute(a, false); in eigensolver_verify_assert() 145 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 147 …VERIFY_IS_APPROX(a * eig.pseudoEigenvectors()*scale, eig.pseudoEigenvectors() * eig.pseudoEigenval… in test_eigensolver_generic() 148 …VERIFY_IS_APPROX(a * eig.eigenvectors()*scale, eig.eigenvectors() * eig.eigenvalues().asDiagonal()… in test_eigensolver_generic() 155 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 158 VERIFY_IS_APPROX((eig.pseudoEigenvectors() * eig.pseudoEigenvalueMatrix()).norm()+1., 1.); in test_eigensolver_generic() [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/test/ |
H A D | eigensolver_generic.cpp | 76 eig.compute(a.adjoint() * a); in eigensolver() 91 EigenSolver<MatrixType> eig; in eigensolver_verify_assert() local 92 VERIFY_RAISES_ASSERT(eig.eigenvectors()); in eigensolver_verify_assert() 95 VERIFY_RAISES_ASSERT(eig.eigenvalues()); in eigensolver_verify_assert() 98 eig.compute(a, false); in eigensolver_verify_assert() 145 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 147 …VERIFY_IS_APPROX(a * eig.pseudoEigenvectors()*scale, eig.pseudoEigenvectors() * eig.pseudoEigenval… in test_eigensolver_generic() 148 …VERIFY_IS_APPROX(a * eig.eigenvectors()*scale, eig.eigenvectors() * eig.eigenvalues().asDiagonal()… in test_eigensolver_generic() 155 Eigen::EigenSolver<MatrixXd> eig(a); in test_eigensolver_generic() local 158 VERIFY_IS_APPROX((eig.pseudoEigenvectors() * eig.pseudoEigenvalueMatrix()).norm()+1., 1.); in test_eigensolver_generic() [all …]
|
/dports/math/eclib/eclib-20210318/libsrc/ |
H A D | xsplit_data.cc | 142 long ff_data::eig() { in eig() function in ff_data 172 ff_data* ff_data::child( long eig ) { in child() argument 173 return children_[ map(eig) ]; in child() 275 child.setEigenvalue( eig ); in addChild() 276 children_[map(eig)] = &child; in addChild() 284 void ff_data::eraseChild( long eig ) { in eraseChild() argument 285 eraseChild( map(eig) ); in eraseChild() 318 void ff_data::setEigenvalue( long eig ) { in setEigenvalue() argument 319 eigenvalue_ = eig; in setEigenvalue() 346 completedChildren_[map(eig)] = flag; in childStatus() [all …]
|
/dports/multimedia/librespot/librespot-0.1.3/cargo-crates/nalgebra-0.18.1/tests/linalg/ |
H A D | eigen.rs | 19 let eig = m.clone().symmetric_eigen(); localVariable 20 let recomp = eig.recompose(); 31 let recomp = eig.recompose(); 38 let eig = m.symmetric_eigen(); localVariable 39 let recomp = eig.recompose(); 46 let eig = m.symmetric_eigen(); localVariable 47 let recomp = eig.recompose(); 54 let eig = m.symmetric_eigen(); localVariable 55 let recomp = eig.recompose(); 102 let eig = m.clone().symmetric_eigen(); in symmetric_eigen_singular_24x24() localVariable [all …]
|
/dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/nalgebra/tests/linalg/ |
H A D | eigen.rs | 21 let eig = m.clone().symmetric_eigen(); localVariable 22 let recomp = eig.recompose(); 34 let recomp = eig.recompose(); 42 let eig = m.symmetric_eigen(); localVariable 43 let recomp = eig.recompose(); 51 let eig = m.symmetric_eigen(); localVariable 52 let recomp = eig.recompose(); 60 let eig = m.symmetric_eigen(); localVariable 61 let recomp = eig.recompose(); 109 let eig = m.clone().symmetric_eigen(); in symmetric_eigen_singular_24x24() localVariable [all …]
|
/dports/audio/spotifyd/spotifyd-0.3.0/cargo-crates/nalgebra-0.18.1/tests/linalg/ |
H A D | eigen.rs | 19 let eig = m.clone().symmetric_eigen(); 20 let recomp = eig.recompose(); 31 let recomp = eig.recompose(); 38 let eig = m.symmetric_eigen(); 39 let recomp = eig.recompose(); 46 let eig = m.symmetric_eigen(); 47 let recomp = eig.recompose(); 54 let eig = m.symmetric_eigen(); 55 let recomp = eig.recompose(); 102 let eig = m.clone().symmetric_eigen(); [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_trlib/ |
H A D | trlib_eigen_inverse.c | 92 TRLIB_DNRM2(invnorm, &n, eig, &inc) invnorm = 1.0/invnorm; in trlib_eigen_inverse() 93 TRLIB_DSCAL(&n, &invnorm, eig, &inc) // normalize eig in trlib_eigen_inverse() 101 TRLIB_DPTTRS(&n, &inc, diag_fac, offdiag_fac, eig, &n, &info_fac) in trlib_eigen_inverse() 105 TRLIB_DNRM2(invnorm, &n, eig, &inc) invnorm = 1.0/invnorm; in trlib_eigen_inverse() 106 TRLIB_DSCAL(&n, &invnorm, eig, &inc) in trlib_eigen_inverse() 121 for(kk = 0; kk < n; ++kk ) { eig[kk] = ((trlib_flt_t)rand()/(trlib_flt_t)RAND_MAX); } in trlib_eigen_inverse() 123 TRLIB_DNRM2(invnorm, &n, eig, &inc) invnorm = 1.0/invnorm; in trlib_eigen_inverse() 124 TRLIB_DSCAL(&n, &invnorm, eig, &inc) // normalize eig in trlib_eigen_inverse() 132 TRLIB_DPTTRS(&n, &inc, diag_fac, offdiag_fac, eig, &n, &info_fac) in trlib_eigen_inverse() 136 TRLIB_DNRM2(invnorm, &n, eig, &inc) invnorm = 1.0/invnorm; in trlib_eigen_inverse() [all …]
|
/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/ |
H A D | coriolissolve.f | 35 & temp(nev,*),deig,eig,eignew local 77 eig=dsqrt(d(i))*(1.d0,0.d0)* 82 eig=(dsqrt(d(i-1))+ 90 a(k,l)=eig*cc(k,l)*(0.d0,1.d0) 93 a(k,k)=a(k,k)-eig*eig+d(k) 94 b(k,k)=b(k,k)+2.d0*eig 134 eignew=eig+deig 158 a(k,l)=eig*cc(k,l)*(0.d0,1.d0) 161 a(k,k)=a(k,k)-eig*eig+d(k) 162 b(k,k)=b(k,k)+2.d0*eig [all …]
|
/dports/math/octave-forge-linear-algebra/linear-algebra-2.2.3/inst/@kronprod/not_done/ |
H A D | eig.m | 17 ## @deftypefn {Function File} {@var{lambda} =} eig (@var{KP}) 20 ## @seealso{eig, @kronprod/svd} 23 function [V, lambda] = eig (KP, A) function 25 ## eigenvectors compared to 'eig (full (KP))' 33 error ("eig: first input argument must be of class 'kronprod'"); 37 error ("eig: first input must be a square matrix"); 45 lambda_A = eig (KP.A); 46 lambda_B = eig (KP.B); 56 [V_A, lambda_A] = eig (KP.A); 57 [V_B, lambda_B] = eig (KP.B); [all …]
|
/dports/math/algae/algae-4.3.6/test/ |
H A D | eig_test.A | 39 e=eig(a;{left}); 48 e=eig(a;{left}); 61 e=eig(a;{left}); 70 e=eig(a;{left}); 85 e=eig(a;{left}); 99 e=eig(a;{left}); 100 ee=eig(a';{left}); 119 e = eig( a; b ); 145 e = eig (a; b); 156 e = eig (a; b); [all …]
|
/dports/graphics/opencv/opencv-4.5.3/modules/imgproc/src/ |
H A D | featureselect.cpp | 80 UMat eig, maxEigenValue; in ocl_goodFeaturesToTrack() local 96 CV_Assert(eig.type() == CV_32FC1); in ocl_goodFeaturesToTrack() 120 k.args(eigarg, eig.cols, (int)eig.total(), dbarg, maskarg); in ocl_goodFeaturesToTrack() 122 k.args(eigarg, eig.cols, (int)eig.total(), dbarg); in ocl_goodFeaturesToTrack() 152 k.args(eigarg, cornersarg, eig.rows - 2, eig.cols - 2, thresholdarg, in ocl_goodFeaturesToTrack() 158 cornersarg, eig.rows - 2, eig.cols - 2, in ocl_goodFeaturesToTrack() 162 size_t globalsize[2] = { (size_t)eig.cols - 2, (size_t)eig.rows - 2 }; in ocl_goodFeaturesToTrack() 396 Mat image = _image.getMat(), eig, tmp; in goodFeaturesToTrack() 416 threshold( eig, eig, maxVal*qualityLevel, 0, THRESH_TOZERO ); in goodFeaturesToTrack() 417 dilate( eig, tmp, Mat()); in goodFeaturesToTrack() [all …]
|