Home
last modified time | relevance | path

Searched +refs:finite +refs:sum (Results 226 – 250 of 3998) sorted by relevance

12345678910>>...160

/dports/science/lammps/lammps-stable_29Sep2021/examples/PACKAGES/atc/elastic/
H A Din.bar1d_ghost_flux1 # Computes elastic waves propagating in and out of a finite temperature region
83 compute avgStress internal reduce sum c_atomStress[1] c_atomStress[2] c_atomStress[3]
/dports/math/octave-forge-queueing/queueing/inst/
H A Dctmcbd.m28 ## continuous birth-death process over the finite state space
94 Q -= diag( sum(Q,2) );
/dports/math/octave-forge-ltfat/ltfat/inst/sigproc/
H A Drms.m9 % RMS(f) computes the RMS (Root Mean Square) value of a finite sampled
19 % rms(f) = 1/sqrt(N) ( sum |f(n)|^2 )^(1/2)
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Documentation/commands/
H A Dcompose-dofs.rst32 The finite grid of the target image is used to determine an appropriate domain
68 is 2 terms, i.e., the sum of left and right velocity fields. The second argument
/dports/math/gap/gap-4.11.0/pkg/RepnDecomp-1.1.0/lib/
H A Disomorphism.gi39 …oj, used_tensors, rho_dual, class1, class2, candidate_map, classes, tries, sum, v, v_0, im, orbit,…
78 # is just given by the sum over whole group of alpha(g)
82 # to sum in a way that doesn't require us to store any huge
90 # the natural choice is the sum of an orbit of some random vector
91 # v. We know that some choice of v gives an orbit sum that is
101 sum := v_0;
105 # terminate since G is finite.
204 # TODO: can I use a trick to sum over the generators instead of G?
214 # we just pick random invertible matrices and sum over the group
/dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/
H A Ddist_metrics.pyx171 "braycurtis" BrayCurtisDistance ``sum(|x - y|) / (sum(|x|) + sum(|y|))``
414 # d = sqrt(sum(x_i^2 - y_i^2))
447 # d = sqrt(sum((x_i - y_i2)^2 / v_i))
491 # d = sum(abs(x_i - y_i))
533 # d = sum(x_i^p - y_i^p) ^ (1/p)
540 Minkowski Distance requires p >= 1 and finite. For p = infinity,
549 raise ValueError("MinkowskiDistance requires finite p. "
580 # d = sum(w_i * (x_i^p - y_i^p)) ^ (1/p)
587 Weighted Minkowski Distance requires p >= 1 and finite.
601 raise ValueError("WMinkowskiDistance requires finite p. "
[all …]
/dports/math/spot/spot-2.10.2/tests/
H A DMakefile.am449 python/sum.py \
506 ltsmin/finite.test \
513 ltsmin/elevator2.1.pm ltsmin/finite.dve ltsmin/finite.pm ltsmin/finite.gal
/dports/math/py-spot/spot-2.10.2/tests/
H A DMakefile.am449 python/sum.py \
506 ltsmin/finite.test \
513 ltsmin/elevator2.1.pm ltsmin/finite.dve ltsmin/finite.pm ltsmin/finite.gal
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/math/
H A DConjGradient.h647 T sum = zeroVal<T>();
648 for (SizeType i = begin; i < end; ++i) { sum += a[i] * b[i]; }
650 reducetmp[n] = sum;
737 bool operator()(const SizeRange& range, bool finite) const
739 if (finite) {
744 return finite;
759 return finite;
1027 bool operator()(const SizeRange& range, bool finite) const
1029 if (finite) {
1037 return finite;
[all …]
/dports/math/gap/gap-4.11.0/lib/
H A Dffe.gi12 ## Note that we must distinguish finite fields and fields that consist of
15 ## of rational functions is of course a finite field but its elements are
18 ## Special methods for (elements of) general finite fields can be found in
30 ## global cache of finite fields `GF( <p>^<d> )', consisting of a pair of
57 ## As usual, difference and quotient are defined as sum and product,
405 # if the subfield is given by a finite field
469 Error( "<subfield> must be a prime or a finite field" );
483 # Construct the finite field object.
499 # Construct the finite field object.
504 # Return the finite field.
[all …]
H A Dringsc.gd76 ## for a finite ring <A>R</A> this function returns a list of all
102 ## for a finite ring <A>R</A> this function returns a list of all
180 ## These functions construct the direct sum of the rings given as
/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/macros/
H A Ddatafit.sci173 if ~GR then // finite difference
181 "f = sum(sum((g1''*Wg) .* g1'',""c"").*Wd'');"
186 " e = sum(sum((g1''*Wg) .* g1'',""c"").*Wd'');"
222 " f = sum(sum((g1''*Wg) .* g1'',""c"") .* Wd'');"
265 dmin = sqrt(fmin/ng/sum(Wd));
/dports/math/R-cran-VGAM/VGAM/R/
H A Dsummary.vglm.q49 "sum of squares) for computing the dispersion parameter")
304 is.finite(rdf)) {
346 signif.legend = sum(how.many[-1]) == 0) # Last one
358 signif.legend = sum(how.many[3]) == 0) # Last one
434 if (is.finite(rdf))
442 if (is.finite(rdf))
/dports/finance/R-cran-tseries/tseries/man/
H A Darma.Rd44 sum-of-squared errors. The gradient is computed, if it is needed, by
45 a finite-difference approximation. Default initialization is done by
55 \item{css}{the conditional sum-of-squared errors.}
/dports/math/gap/gap-4.11.0/pkg/qpa-version-1.30/lib/
H A Dpathalg.gi39 # path ring; which is the sum of all vertices:
1646 # then the center is generated by the identity and powers of the sum of all the
1658 # Constructing the linear span of the sum of the vertices, ie. the
1674 # define linear span of the sum of cycles in the quiver
1763 "for a finite dimension (quotient of) a path algebra",
1812 Print("Algebra is not finite dimensional!\n");
2461 # Finding the linear map \pi\colon A \to k being the sum of the dual
2610 "for a finite dimensional quiver algebra",
3010 ## is not sum over vertices e such that e<A>(1 - e) = (0). The function
3075 ## Given a quiver algebra A and a sum of vertices e, this function computes
[all …]
/dports/math/py-sympy/sympy-1.9/doc/src/modules/
H A Dstats.rst185 the above domain could be enhanced by a finite density
219 we know their sum to be greater than 12.
224 represent finite (such as dice) and continuous (such as normals) random
/dports/math/cmlib/cmlib-3.0_8/doc/odrpack/
H A DSummary242 computed at every iteration either by finite differences or by a
771 finite differences.
1227 - the derivatives will be computed by finite differences;
1269 be computed by finite differences and that
1629 INFO = 1 : sum-of-squares convergence
1631 INFO = 3 : sum-of-squares convergence and
2368 finite precision arithmetic) as an unscaled analysis, i.e., an
2511 detect sum-of-squares convergence.
2670 containing the step used for computing finite
2769 and the finite difference
[all …]
/dports/science/py-scipy/scipy-1.7.1/doc/source/tutorial/examples/
H A D5-118 leastsq -- Minimize the sum of squares of M equations in
91 check_grad -- Check the supplied derivative using finite difference
/dports/math/octave-forge-signal/signal-1.4.1/inst/
H A Dqp_kaiser.m21 ## Computes a finite impulse response (FIR) filter for use with a
92 h = h / sum(h);
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/geom3d/
H A DdrawLine3d.m66 {'nonempty','nonnan','real','finite','size',[nan,6]});
78 if sum(isnan(edge)) == 0
/dports/math/maxima/maxima-5.43.2/
H A DChangeLog-5.9.212 * Moved nset (finite set functions) into Maxima core
113 853830 (sum)
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-3/doc/
H A Dintro.dox6 <h3>The basic set up of finite element methods</h3>
8 This is the first example where we actually use finite elements to compute
23 If you've learned about the basics of the finite element method, you will
24 remember the steps we need to take to approximate the solution $u$ by a finite
57 finite element shape functions we will use. To define these shape functions,
63 - A finite element that describes the shape functions we want to use on the
78 from the shape functions defined by the finite element class on the
152 weighted sum over a set of points on each cell. That is, we first split the
200 very difficult concept, since they can in general only deal with a finite
236 element method, this program shows the basic structure of most finite
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/specfn/
H A Dsimplede.red81 for j:=0:(degreeofde-1) sum a(j) * dff(j);
118 for j:=0:(degreeofde-1) sum a(j)*df(ff,x,j);
185 for j:=0:(degreeofde-1) sum a(j) * dff(j);
222 for j:=0:(degreeofde-1) sum a(j)*df(ff,x,j);
253 % functions with finite representation
256 "fps with finite number of non-zero coefficients";
284 for j:=0:(degreeofde-1) sum ba(k+j)*a(j);
487 if rsolve!*!* = finite then s := s +
488 c*sum(ck*x^(m*k+i), k)
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/metrics/
H A D_dist_metrics.pyx114 "manhattan" ManhattanDistance - ``sum(|x - y|)``
146 "braycurtis" BrayCurtisDistance ``sum(|x - y|) / (sum(|x|) + sum(|y|))``
422 # d = sqrt(sum(x_i^2 - y_i^2))
455 # d = sqrt(sum((x_i - y_i2)^2 / v_i))
499 # d = sum(abs(x_i - y_i))
559 Minkowski Distance requires p >= 1 and finite. For p = infinity,
568 raise ValueError("MinkowskiDistance requires finite p. "
605 Weighted Minkowski Distance requires p >= 1 and finite.
619 raise ValueError("WMinkowskiDistance requires finite p. "
750 # D(x, y) = sum[ abs(x_i - y_i) / (abs(x_i) + abs(y_i)) ]
[all …]
/dports/math/R-cran-maxLik/maxLik/man/
H A DmaxSGA.Rd42 If \code{NULL}, finite-difference gradients are computed.
46 If \code{grad} is not supplied, it is computed by finite-difference
56 If missing, either finite-difference Hessian, based on
81 \code{FALSE} (do not calculate), \code{TRUE} (use analytic/finite-difference
90 computed by finite-difference method, the Hessian computation may be
287 loglik <- function(theta, index) sum(log(theta) - theta*t[index])
289 gradlik <- function(theta, index) sum(1/theta - t[index])

12345678910>>...160