/** * Checks that the matrix may be transposed */ protected void checkTranspose() { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); }
/** * Checks that the matrix may be transposed */ protected void checkTranspose() { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); }
/** * Checks that a matrix rank1 update is possible for the given matrix */ protected void checkRank1(Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != C.numRows()) throw new IndexOutOfBoundsException("A.numRows != C.numRows (" + numRows + " != " + C.numRows() + ")"); }
/** * Checks that a transposed rank1 update is leagal with the given argument */ protected void checkTransRank1(Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != C.numColumns()) throw new IndexOutOfBoundsException("A.numRows != C.numColumns (" + numRows + " != " + C.numColumns() + ")"); }
/** * Checks that a matrix rank1 update is possible for the given matrix */ protected void checkRank1(Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != C.numRows()) throw new IndexOutOfBoundsException("A.numRows != C.numRows (" + numRows + " != " + C.numRows() + ")"); }
/** * Checks that a transposed rank1 update is leagal with the given argument */ protected void checkTransRank1(Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != C.numColumns()) throw new IndexOutOfBoundsException("A.numRows != C.numColumns (" + numRows + " != " + C.numColumns() + ")"); }
/** * Checks that a matrix inversion is legal for the given arguments. This is * for the square case, not for least-squares problems */ protected void checkSolve(Vector b, Vector x) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != b.size()) throw new IndexOutOfBoundsException("numRows != b.size (" + numRows + " != " + b.size() + ")"); if (numColumns != x.size()) throw new IndexOutOfBoundsException("numColumns != x.size (" + numColumns + " != " + x.size() + ")"); }
/** * Checks that a vector rank2 update is legal with the given vectors */ protected void checkRank2(Vector x, Vector y) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (x.size() != numRows) throw new IndexOutOfBoundsException("x.size != A.numRows (" + x.size() + " != " + numRows + ")"); if (y.size() != numRows) throw new IndexOutOfBoundsException("y.size != A.numRows (" + y.size() + " != " + numRows + ")"); }
/** * Checks that a vector rank1 update is possible for the given vectors */ protected void checkRank1(Vector x, Vector y) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (x.size() != numRows) throw new IndexOutOfBoundsException("x.size != A.numRows (" + x.size() + " != " + numRows + ")"); if (y.size() != numColumns) throw new IndexOutOfBoundsException("y.size != A.numColumns (" + y.size() + " != " + numColumns + ")"); }
/** * Checks that a vector rank1 update is possible for the given vectors */ protected void checkRank1(Vector x, Vector y) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (x.size() != numRows) throw new IndexOutOfBoundsException("x.size != A.numRows (" + x.size() + " != " + numRows + ")"); if (y.size() != numColumns) throw new IndexOutOfBoundsException("y.size != A.numColumns (" + y.size() + " != " + numColumns + ")"); }
/** * Checks that a vector rank2 update is legal with the given vectors */ protected void checkRank2(Vector x, Vector y) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (x.size() != numRows) throw new IndexOutOfBoundsException("x.size != A.numRows (" + x.size() + " != " + numRows + ")"); if (y.size() != numRows) throw new IndexOutOfBoundsException("y.size != A.numRows (" + y.size() + " != " + numRows + ")"); }
/** * Checks that a matrix inversion is legal for the given arguments. This is * for the square case, not for least-squares problems */ protected void checkSolve(Vector b, Vector x) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != b.size()) throw new IndexOutOfBoundsException("numRows != b.size (" + numRows + " != " + b.size() + ")"); if (numColumns != x.size()) throw new IndexOutOfBoundsException("numColumns != x.size (" + numColumns + " != " + x.size() + ")"); }
/** * Checks that a matrix inversion is legal for the given arguments. This is * for the square case, not for least-squares problems */ protected void checkSolve(Matrix B, Matrix X) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (B.numRows() != numRows) throw new IndexOutOfBoundsException("B.numRows != A.numRows (" + B.numRows() + " != " + numRows + ")"); if (B.numColumns() != X.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != X.numColumns (" + B.numColumns() + " != " + X.numColumns() + ")"); if (X.numRows() != numColumns) throw new IndexOutOfBoundsException("X.numRows != A.numColumns (" + X.numRows() + " != " + numColumns + ")"); }
/** * Checks that a rank2 update is legal for the given arguments */ protected void checkRank2(Matrix B, Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (B.numRows() != C.numRows()) throw new IndexOutOfBoundsException("B.numRows != C.numRows (" + B.numRows() + " != " + C.numRows() + ")"); if (B.numColumns() != C.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != C.numColumns (" + B.numColumns() + " != " + C.numColumns() + ")"); }
/** * Checks that a rank2 update is legal for the given arguments */ protected void checkRank2(Matrix B, Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (B.numRows() != C.numRows()) throw new IndexOutOfBoundsException("B.numRows != C.numRows (" + B.numRows() + " != " + C.numRows() + ")"); if (B.numColumns() != C.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != C.numColumns (" + B.numColumns() + " != " + C.numColumns() + ")"); }
/** * Checks that a matrix inversion is legal for the given arguments. This is * for the square case, not for least-squares problems */ protected void checkSolve(Matrix B, Matrix X) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (B.numRows() != numRows) throw new IndexOutOfBoundsException("B.numRows != A.numRows (" + B.numRows() + " != " + numRows + ")"); if (B.numColumns() != X.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != X.numColumns (" + B.numColumns() + " != " + X.numColumns() + ")"); if (X.numRows() != numColumns) throw new IndexOutOfBoundsException("X.numRows != A.numColumns (" + X.numRows() + " != " + numColumns + ")"); }
/** * Checks that a transposed rank2 update is leagal with the given arguments */ protected void checkTransRank2(Matrix B, Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != B.numColumns()) throw new IndexOutOfBoundsException("A.numRows != B.numColumns (" + numRows + " != " + B.numColumns() + ")"); if (B.numRows() != C.numRows()) throw new IndexOutOfBoundsException("B.numRows != C.numRows (" + B.numRows() + " != " + C.numRows() + ")"); if (B.numColumns() != C.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != C.numColumns (" + B.numColumns() + " != " + C.numColumns() + ")"); }
/** * Checks that a transposed rank2 update is leagal with the given arguments */ protected void checkTransRank2(Matrix B, Matrix C) { if (!isSquare()) throw new IndexOutOfBoundsException("!A.isSquare"); if (numRows != B.numColumns()) throw new IndexOutOfBoundsException("A.numRows != B.numColumns (" + numRows + " != " + B.numColumns() + ")"); if (B.numRows() != C.numRows()) throw new IndexOutOfBoundsException("B.numRows != C.numRows (" + B.numRows() + " != " + C.numRows() + ")"); if (B.numColumns() != C.numColumns()) throw new IndexOutOfBoundsException( "B.numColumns != C.numColumns (" + B.numColumns() + " != " + C.numColumns() + ")"); }