Examples of Jama.Matrix.transpose()

Jama.Matrix.transpose()
Matrix transpose. @return A'

    
    
    System.out.println("cCarriersToCancelledDegrees gram schmidt");
    cCarriersToCancelledDegrees.print(15, 15);
    
    return cCarriersToCancelledDegrees.transpose();
  }
  
  private static double[] createWeightings(int[] cCarriers) 
  {
    double[] weightings = new double[cCarriers.length];

View Full Code Here

                }
                if( iii != jjj ) { randSigma[iii][jjj] = 0.0; } // Sigma is a symmetric, positive-definite matrix created by taking a lower diagonal matrix and multiplying it by its transpose
            }
        }
        Matrix tmp = new Matrix( randSigma );
        tmp = tmp.times(tmp.transpose());
        sigma.setMatrix(0, mu.length - 1, 0, mu.length - 1, tmp);
    }


    public double calculateDistanceFromMeanSquared( final VariantDatum datum ) {
        return MathUtils.distanceSquared( datum.annotations, mu );

View Full Code Here

         **/


        print("\nTesting linear algebra methods...\n");
        A = new Matrix(columnwise, 3);
        T = new Matrix(tvals);
        T = A.transpose();
        try {
            check(A.transpose(), T);
            try_success("transpose...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "transpose()...",

View Full Code Here

        print("\nTesting linear algebra methods...\n");
        A = new Matrix(columnwise, 3);
        T = new Matrix(tvals);
        T = A.transpose();
        try {
            check(A.transpose(), T);
            try_success("transpose...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "transpose()...",
                    "transpose unsuccessful");
        }

View Full Code Here

            try_success("transpose...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "transpose()...",
                    "transpose unsuccessful");
        }
        A.transpose();
        try {
            check(A.norm1(), columnsummax);
            try_success("norm1...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "norm1()...",

View Full Code Here

            errorCount = try_failure(errorCount, "det()...",
                    "incorrect determinant calculation");
        }
        SQ = new Matrix(square);
        try {
            check(A.times(A.transpose()), SQ);
            try_success("times(Matrix)...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "times(Matrix)...",
                    "incorrect Matrix-Matrix product calculation");
        }

View Full Code Here

        A = new Matrix(pvals);
        CholeskyDecomposition Chol = A.chol(); 
        Matrix L = Chol.getL();


        try {
            check(A, L.times(L.transpose()));
            try_success("CholeskyDecomposition...", "");
        } catch (java.lang.RuntimeException e) {
            errorCount = try_failure(errorCount, "CholeskyDecomposition...",
                    "incorrect Cholesky decomposition calculation");
        }

View Full Code Here

            int t = (int) M.trace();


            print(fixedWidthIntegertoString(t, 10));


            EigenvalueDecomposition E = new EigenvalueDecomposition(
                    M.plus(M.transpose()).times(0.5));
            double[] d = E.getRealEigenvalues();


            print(fixedWidthDoubletoString(d[n - 1], 14, 3));


            int r = M.rank();

View Full Code Here

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.