Package jinngine.math

Examples of jinngine.math.Matrix3.column()


    public void testColumn01() {
        final Matrix3 m = new Matrix3(
                1., 2., 3.,
                4., 5., 6.,
                7., 8., 9.);
        final Vector3 c1 = m.column(0);
        assertEquals(1., c1.x);
        assertEquals(4., c1.y);
        assertEquals(7., c1.z);
        final Vector3 c2 = m.column(1);
        assertNotSame(c1, c2); // Vector is not recycled
View Full Code Here


                7., 8., 9.);
        final Vector3 c1 = m.column(0);
        assertEquals(1., c1.x);
        assertEquals(4., c1.y);
        assertEquals(7., c1.z);
        final Vector3 c2 = m.column(1);
        assertNotSame(c1, c2); // Vector is not recycled
        assertEquals(2., c2.x);
        assertEquals(5., c2.y);
        assertEquals(8., c2.z);
        final Vector3 c3 = m.column(2);
View Full Code Here

        final Vector3 c2 = m.column(1);
        assertNotSame(c1, c2); // Vector is not recycled
        assertEquals(2., c2.x);
        assertEquals(5., c2.y);
        assertEquals(8., c2.z);
        final Vector3 c3 = m.column(2);
        assertEquals(3., c3.x);
        assertEquals(6., c3.y);
        assertEquals(9., c3.z);
    }
View Full Code Here

        null,
        u.y, 0 );

    linear3.assign(
        bi,  bj,
        Bi.column(2), Bangi.column(2), Bj.column(2), Bangj.column(2),
        Ji.row(2), Jangi.row(2), Jj.row(2), Jangj.row(2),
        Double.NEGATIVE_INFINITY,
        Double.POSITIVE_INFINITY,
        null,
        u.z, 0 )
View Full Code Here

    Vector3 nerror = tn1.cross(tn2);
    u.assign( u.add(posError.multiply(Kcor)));
   
    linear1.assign(
        b1,  b2,
        Bi.column(0), Bangi.column(0), Bj.column(0), Bangj.column(0),
        Ji.row(0), Jangi.row(0), Jj.row(0), Jangj.row(0),
        Double.NEGATIVE_INFINITY,
        Double.POSITIVE_INFINITY,
        null,
        u.x, 0 );
View Full Code Here

        null,
        u.x, 0 );

    linear2.assign(
        b1,  b2,
        Bi.column(1), Bangi.column(1), Bj.column(1), Bangj.column(1),
        Ji.row(1), Jangi.row(1), Jj.row(1), Jangj.row(1),
        Double.NEGATIVE_INFINITY,
        Double.POSITIVE_INFINITY,
        null,
        u.y, 0 );
View Full Code Here

        null,
        u.y, 0 );

    linear3.assign(
        b1,  b2,
        Bi.column(2), Bangi.column(2), Bj.column(2), Bangj.column(2),
        Ji.row(2), Jangi.row(2), Jj.row(2), Jangj.row(2),
        Double.NEGATIVE_INFINITY,
        Double.POSITIVE_INFINITY,
        null,
        u.z, 0 )
View Full Code Here

   
   
    //go through matrices and create rows in the final A matrix to be solved
    c1.assign(
        b1, b2,
        Bi.column(0), Bangi.column(0), Bj.column(0), Bangj.column(0),
        Ji.row(0), Jangi.row(0), Jj.row(0), Jangj.row(0),
        -forcelimit,
        forcelimit,
        null,
        u.x, 0);
View Full Code Here

        forcelimit,
        null,
        u.x, 0);
    c2.assign(
        b1, b2,
        Bi.column(1), Bangi.column(1), Bj.column(1), Bangj.column(1),
        Ji.row(1), Jangi.row(1), Jj.row(1), Jangj.row(1),
        -forcelimit,
        forcelimit,
        null,
        u.y, 0);
View Full Code Here

        forcelimit,
        null,
        u.y, 0);
    c3.assign(
        b1, b2,
        Bi.column(2), Bangi.column(2), Bj.column(2), Bangj.column(2),
        Ji.row(2), Jangi.row(2), Jj.row(2), Jangj.row(2),
        -forcelimit,
        forcelimit,
        null,
        u.z, 0);
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.