List of mult() Examples

Examples of mult()

cern.colt.matrix.linalg.Algebra.mult()
Inner product of two vectors; Sum(x[i] * y[i]). Also known as dot product.
Equivalent to x.zDotProduct(y). @param x the first source vector. @param y the second source matrix. @return the inner product. @throws IllegalArgumentException if x.size() != y.size().
cern.jet.math.Functions.mult()
Constructs a function that returns a * b. a is a variable, b is fixed.
ch.akuhn.matrix.Matrix.mult()
Returns y = Ax.
civquest.map.resource.ResourceSet.mult()
Multiplies all amounts in this ResourceSet with the given factor, and returns the result in a separate ResourceSet. This set will not be altered. @param factor any factor @return a clone of this ResourceSet, with all amounts multiplied by factor
com.barchart.feed.base.values.api.PriceValue.mult()
com.barchart.util.values.api.PriceValue.mult()
com.jme.math.Matrix4f.mult()
com.jme.math.Quaternion.mult()
com.jme.math.Vector3f.mult()
com.jme.renderer.ColorRGBA.mult()
com.jme3.math.Matrix3f.mult()
mult multiplies this matrix by a given matrix. The result matrix is returned as a new object. If the given matrix is null, a null matrix is returned. @param mat the matrix to multiply this matrix by. @return the result matrix.
com.jme3.math.Matrix4f.mult()
com.jme3.math.Quaternion.mult()
mult multiplies this quaternion by a parameter quaternion. The result is returned as a new quaternion. It should be noted that quaternion multiplication is not commutative so q * p != p * q. @param q the quaternion to multiply this quaternion by. @return the new quaternion.
com.jme3.math.Vector2f.mult()
mult multiplies this vector by a scalar. The resultant vector is returned. @param scalar the value to multiply this vector by. @return the new vector.
com.jme3.math.Vector3f.mult()
mult multiplies this vector by a scalar. The resultant vector is returned. @param scalar the value to multiply this vector by. @return the new vector.
com.numb3r3.common.math.Matrix.mult()
Element-wise multiplication. @param other @return
eas.math.geometry.Vector2D.mult()
Multipliziert den Vektor mit einer Konstanten. @param constant Die Konstante.
edu.mit.csail.sdg.alloy4compiler.ast.Expr.mult()
If this is loneOf/oneOf/someOf/exactlyOf expression, return loneOf/oneOf/someOf/exactlyOf, otherwise returns setOf.
fmg.fmg8.umgebung2D.Vektor2D.mult()
Multipliziert den Vektor mit einer Konstanten. @param constant Die Konstante.
no.uib.cipr.matrix.TridiagMatrix.mult()
org.bouncycastle.pqc.math.ntru.polynomial.BigIntPolynomial.mult()
Multiplies the polynomial by another, taking the indices mod N. Does not change this polynomial but returns the result as a new polynomial.
Both polynomials must have the same number of coefficients. @param poly2 the polynomial to multiply by @return a new polynomial
org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial.mult()
org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.mult()
Multiplies the polynomial with another, taking the values mod modulus and the indices mod N
org.bouncycastle.pqc.math.ntru.polynomial.Polynomial.mult()
Multiplies the polynomial by an IntegerPolynomial, taking the indices mod N. @param poly2 a polynomial @return the product of the two polynomials
org.ejml.simple.SimpleMatrix.mult()
org.gephi.preview.util.Vector.mult()
org.jamesii.core.math.Matrix.mult()
Multiplies this matrix with another one and returns the result. @param m matrix this matrix shall be multiplied with @return product of this matrix times the given matrix m @exception MatrixException This method will throw a MatrixException if the two matrices are not compatible! I. e. matrix mult only works if the matrices are m x n and n x r.
org.jboss.ejb3.core.test.ejbthree1828.FirstStateless.mult()
org.osm2world.core.math.VectorXYZ.mult()
org.osm2world.core.math.VectorXZ.mult()
org.terasology.math.Vector3i.mult()
mult multiplies this vector by a scalar. The resultant vector is returned. @param scalar the value to multiply this vector by.
processing.core.PMatrix3D.mult()
processing.core.PVector.mult()

Examples of com.jme3.math.Vector2f.mult()

      Distance = Math.abs(Distance);
      Distance = (Epsilon > Distance ? Epsilon : Distance);


      // this point needs adjustment
      Vector2f Normal = m_Side[SideNumber].getNormal();
      Normal = Normal.mult(Distance);
      TestPoint.x += Normal.x;
      TestPoint.y += Normal.y;
      return (true);
    }
    return (false);

View Full Code Here

Examples of com.jme3.math.Vector3f.mult()

            inputManager.getCursorPosition(), 0.0f);
        Vector3f direction = cam.getWorldCoordinates(
            inputManager.getCursorPosition(), 0.3f);
        direction.subtractLocal(origin).normalizeLocal();
        
        Line li = new Line(origin.clone(), origin.add(direction.mult(30f)));
//        li.setLineWidth(3f);
        Geometry g = new Geometry(null, li);
      g.setMaterial(matWireframe);
      bboxes.attachChild(g);

View Full Code Here

Examples of com.numb3r3.common.math.Matrix.mult()

     * @param args
     */
    public static void main(String[] args) {
        Matrix m = InMemoryJBlasMatrix.randn(3);
        double[] scores1 = m.toArray();
        double[] scores2 = m.mult(-1.0).toArray();


        ArrayPrinting.printDoubleArray(scores1, null, "score 1");
        ArrayPrinting.printDoubleArray(scores2, null, "score 2");
        ArrayPrinting.printIntArray(ArrayUtil.argsort(scores2), null, "sorted array");

View Full Code Here

Examples of eas.math.geometry.Vector2D.mult()

        Vector2D mitte = new Vector2D(
                rob.getEnvironmentEA().getDynWaende()[17].centerPoint());
        Vector2D robPosVer = new Vector2D(rob.getPosition());
        Vector2D robPos = new Vector2D(rob.getPosition());
        Vector2D robBlick = new Vector2D(rob.getBlickrichtung());
        robBlick.mult(30);
        robPosVer.translate(robBlick);


        Vector2D richtPos = new Vector2D(robPos);
        // Richtung von Mitte zu Position des Roboters.
        richtPos.sub(mitte);

View Full Code Here

Examples of edu.mit.csail.sdg.alloy4compiler.ast.Expr.mult()

       final int n = x.count();
       final ExprVar v = x.get(i);
       final Expr bound = x.getBound(i);
       final SimTupleset e = cset(bound);
       final Iterator<SimTupleset> it;
       switch(bound.mult()) {
         case LONEOF: it = e.loneOf(); break;
         case ONEOF:  it = e.oneOf();  break;
         case SOMEOF: it = e.someOf(); break;
         default:     it = e.setOf();
       }

View Full Code Here

Examples of fmg.fmg8.umgebung2D.Vektor2D.mult()

       Vektor2D dreiP2 = (new Vektor2D(p2));
       Vektor2D sechsP1 = (new Vektor2D(p1));
       dreiP0.mult(3);
       dreiP1.mult(3);
       dreiP2.mult(3);
       sechsP1.mult(6);
       Vektor2D punkt2, punkt3;
       double tQuad, tKub;


       for (double t = 0; t <= 1; t += step) {
           tQuad = t * t;

View Full Code Here

Examples of no.uib.cipr.matrix.TridiagMatrix.mult()

        System.arraycopy(svd.getS(), 0, S.getDiagonal(), 0, svd.getS().length);
        DenseMatrix U = svd.getU();
        DenseMatrix Vt = svd.getVt();


        // Compute U*S*Vt
        Matrix s = U.mult(S.mult(Vt, new DenseMatrix(S.numRows(), Vt
                .numColumns())), new DenseMatrix(A.numRows(), A.numColumns()));


        // Check that A=U*S*Vt
        for (int i = 0; i < A.numRows(); ++i)
            for (int j = 0; j < A.numColumns(); ++j)

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.BigIntPolynomial.mult()

            r = BigIntEuclidean.calculate(rf.res, rg.res);
        }
        while (!r.gcd.equals(ONE));


        BigIntPolynomial A = (BigIntPolynomial)rf.rho.clone();
        A.mult(r.x.multiply(BigInteger.valueOf(q)));
        BigIntPolynomial B = (BigIntPolynomial)rg.rho.clone();
        B.mult(r.y.multiply(BigInteger.valueOf(-q)));


        BigIntPolynomial C;
        if (params.keyGenAlg == NTRUSigningKeyGenerationParameters.KEY_GEN_ALG_RESULTANT)

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.BigIntPolynomial.mult()

        while (!r.gcd.equals(ONE));


        BigIntPolynomial A = (BigIntPolynomial)rf.rho.clone();
        A.mult(r.x.multiply(BigInteger.valueOf(q)));
        BigIntPolynomial B = (BigIntPolynomial)rg.rho.clone();
        B.mult(r.y.multiply(BigInteger.valueOf(-q)));


        BigIntPolynomial C;
        if (params.keyGenAlg == NTRUSigningKeyGenerationParameters.KEY_GEN_ALG_RESULTANT)
        {
            int[] fRevCoeffs = new int[N];

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.BigIntPolynomial.mult()

            IntegerPolynomial t = f.mult(fRev);
            t.add(g.mult(gRev));
            Resultant rt = t.resultant();
            C = fRev.mult(B);   // fRev.mult(B) is actually faster than new SparseTernaryPolynomial(fRev).mult(B), possibly due to cache locality?
            C.add(gRev.mult(A));
            C = C.mult(rt.rho);
            C.div(rt.res);
        }
        else
        {   // KeyGenAlg.FLOAT
            // calculate ceil(log10(N))

View Full Code Here

0 1 2 3 4 5 6 7

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.