Examples of DiagonalMatrix

edu.ucla.sspace.matrix.DiagonalMatrix
A special-case {@code Matrix} implementation for diagonal matrices. Thisclass provides a memory efficient representation and additional bounds checking to ensure non-diagonal elements cannot be set. @author Keith Stevens
mikera.matrixx.impl.DiagonalMatrix
Specialised diagonal matrix class, with dense double[] array storage for the leading diagonal only. Not fully mutable - only the diagonal values can be changed @author Mike
org.apache.commons.math3.linear.DiagonalMatrix
Implementation of a diagonal matrix. @since 3.1.1
org.apache.mahout.math.DiagonalMatrix

Examples of org.apache.commons.math3.linear.DiagonalMatrix

     *         {@code problem} is not modified.
     */
    public static LeastSquaresProblem weightDiagonal(final LeastSquaresProblem problem,
                                                     final RealVector weights) {
        // TODO more efficient implementation
        return weightMatrix(problem, new DiagonalMatrix(weights.toArray()));
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

     * @return the square-root of the weight matrix.
     */
    private static RealMatrix squareRoot(final RealMatrix m) {
        if (m instanceof DiagonalMatrix) {
            final int dim = m.getRowDimension();
            final RealMatrix sqrtM = new DiagonalMatrix(dim);
            for (int i = 0; i < dim; i++) {
                sqrtM.setEntry(i, i, FastMath.sqrt(m.getEntry(i, i)));
            }
            return sqrtM;
        } else {
            final EigenDecomposition dec = new EigenDecomposition(m);
            return dec.getSquareRoot();

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

        return new LeastSquaresBuilder().
                maxEvaluations(Integer.MAX_VALUE).
                maxIterations(maxIter).
                start(startPoint).
                target(target).
                weight(new DiagonalMatrix(weights)).
                model(model.getModelFunction(), model.getModelFunctionJacobian()).
                build();


    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

     * @return the square-root of the weight matrix.
     */
    private RealMatrix squareRoot(RealMatrix m) {
        if (m instanceof DiagonalMatrix) {
            final int dim = m.getRowDimension();
            final RealMatrix sqrtM = new DiagonalMatrix(dim);
            for (int i = 0; i < dim; i++) {
               sqrtM.setEntry(i, i, FastMath.sqrt(m.getEntry(i, i)));
            }
            return sqrtM;
        } else {
            final EigenDecomposition dec = new EigenDecomposition(m);
            return dec.getSquareRoot();

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

        LeastSquaresProblem problem = new LeastSquaresBuilder()
                .maxEvaluations(400 * (function.getN() + 1))
                .maxIterations(2000)
                .model(function.getModelFunction(), function.getModelFunctionJacobian())
                .target(function.getTarget())
                .weight(new DiagonalMatrix(function.getWeight()))
                .start(function.getStartPoint())
                .build();


        try {
            final Optimum optimum = optimizer.optimize(problem);

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix


    LeastSquaresBuilder builder(StraightLineProblem problem){
        return new LeastSquaresBuilder()
                .model(problem.getModelFunction(), problem.getModelFunctionJacobian())
                .target(problem.target())
                .weight(new DiagonalMatrix(problem.weight()))
                //unused start point to avoid NPE
                .start(new double[2]);
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

        final double[] weights = new double[c.getN()];
        Arrays.fill(weights, 1.0);
        return base()
                .model(c.getModelFunction(), c.getModelFunctionJacobian())
                .target(new double[c.getN()])
                .weight(new DiagonalMatrix(weights));
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

        final double[] weights = new double[dataset.getNumObservations()];
        Arrays.fill(weights, 1.0);
        return base()
                .model(problem.getModelFunction(), problem.getModelFunctionJacobian())
                .target(dataset.getData()[1])
                .weight(new DiagonalMatrix(weights))
                .start(dataset.getStartingPoint(0));
    }

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix


    @Test
    public void testGetIterations() {
        LeastSquaresProblem lsp = base()
                .target(new double[]{1})
                .weight(new DiagonalMatrix(new double[]{1}))
                .start(new double[]{3})
                .model(new MultivariateJacobianFunction() {
                    public Pair<RealVector, RealMatrix> value(final RealVector point) {
                        return new Pair<RealVector, RealMatrix>(
                                new ArrayRealVector(

View Full Code Here

Examples of org.apache.commons.math3.linear.DiagonalMatrix

            Assert.assertEquals(0, optimum.getRMS(), TOl);
            assertEquals(TOl, optimum.getPoint(), -1, 1);


            //TODO move to builder test
            optimizer.optimize(
                    problem.getBuilder().weight(new DiagonalMatrix(new double[]{1})).build());


            fail(optimizer);
        } catch (DimensionMismatchException e) {
            //expected
        }

View Full Code Here

0 1 2 3 4 5

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.