Package org.jquantlib.math.matrixutilities

Examples of org.jquantlib.math.matrixutilities.Array.begin()


    public Array interpolationErrors(final Array not_used) {
      final Array results = new Array(vx.size());
      int ix = vx.begin();
      int iy = vy.begin();
      int iw = itsCoeffs.weights_.begin();
      int ir = results.begin();
      while (ix < vx.end()) {
        final double x = vx.get(ix);
        final double y = vy.get(iy);
        final double w = itsCoeffs.weights_.get(iw);
        results.set(ir, (op(x) - y) * Math.sqrt(w));
 
View Full Code Here


        }
        if (a.size() != aA.size()) {
            fail("'subAssign' failed");
        }

        final int begin = a.begin();
        final int end = a.end();
        for (int i=begin; i<end; i++) {
            if (a.get(i) != 5) {
                fail("'subAssign' failed");
            }
View Full Code Here

        }
        if (a1.size() != aA.size()) {
            fail("'mul' failed");
        }

        for (int i=a1.begin(); i<a1.end(); i++) {
            if (a1.get(i) != 1000) {
                fail("'mul' failed");
            }
        }
View Full Code Here

        }
        if (a2.size() != mB.cols()) {
            fail("'mul' failed");
        }

        for (int i=a2.begin(); i<a2.end(); i++) {
            final double elem = aB2.get(i);
            if (a2.get(i) != elem) {
                fail("'mul' failed");
            }
        }
View Full Code Here

        }
        if (a.size() != aA.size()) {
            fail("'mulAssign' failed");
        }

        final int begin = a.begin();
        final int end = a.end();
        for (int i=begin; i<end; i++) {
            if (a.get(i) != 1000) {
                fail("'mulAssign' failed");
            }
View Full Code Here

        }
        if (a.size() != aA.size()) {
            fail("'divAssign' failed");
        }

        final int begin = a.begin();
        final int end = a.end();
        for (int i=begin; i<end; i++) {
            if (!Closeness.isClose(a.get(i), 2.0)) {
                fail("'divAssign' failed");
            }
View Full Code Here

        for (int i = 0; i < 5; ++i) {
            for (int j = 4; j < 7; ++j) {
                final double tmp[] = new double[j-i +1];
                System.arraycopy(array, i, tmp, 0, j-i+1);
                final Array con = new Array(tmp, flags);
                final int offset = con.begin();

                final int pos = con.lowerBound(1);
                if (pos != 4 - i + offset) {
                    fail(MESSAGE);
                }
View Full Code Here

        for (int i = 0; i < 5; ++i) {
            for (int j = 4; j < 7; ++j) {
                final double tmp[] = new double[j-i +1];
                System.arraycopy(array, i, tmp, 0, j-i+1);
                final Array con = new Array(tmp, flags);
                final int offset = con.begin();

                final int pos = con.upperBound(0);
                if (pos != 4 - i + offset) {
                    fail(MESSAGE);
                }
View Full Code Here

        final Array a = clone.addAssign(aB);
        if (a != clone) {
            fail("addAssign must return <this>");
        }

        final int begin = a.begin();
        final int end = a.end();
        for (int i=begin; i<end; i++) {
            if (a.get(i) != 5) {
                fail("'addAssign' failed");
            }
View Full Code Here

    public Array interpolationErrors(final Array not_used) {
      final Array results = new Array(vx.size());
      int ix = vx.begin();
      int iy = vy.begin();
      int iw = itsCoeffs.weights_.begin();
      int ir = results.begin();
      while (ix < vx.end()) {
        final double x = vx.get(ix);
        final double y = vy.get(iy);
        final double w = itsCoeffs.weights_.get(iw);
        results.set(ir, (op(x) - y) * Math.sqrt(w));
 
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.