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


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


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

View Full Code Here

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


        double[] weights = new double[circle.getN()];
        Arrays.fill(weights, 2);


        optimum = optimizer.optimize(
                builder(circle).weight(new DiagonalMatrix(weights)).start(start).build());


        cov = optimum.getCovariances(1e-14).getData();
        Assert.assertEquals(0.0016, cov[0][0], 0.001);
        Assert.assertEquals(3.2e-7, cov[0][1], 1e-9);
        Assert.assertEquals(cov[0][1], cov[1][0], 1e-14);

View Full Code Here

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

        Arrays.fill(weights, 2);
        for (int i = 0; i < points.length; ++i) {
            circle.addPoint(points[i][0], points[i][1]);
        }


        Optimum optimum = optimizer.optimize(builder(circle).weight(new DiagonalMatrix(weights)).start(start).build());


        Vector2D center = new Vector2D(optimum.getPoint().getEntry(0), optimum.getPoint().getEntry(1));
        Assert.assertTrue(optimum.getEvaluations() < 25);
        Assert.assertEquals(0.043, optimum.getRMS(), 1e-3);
        Assert.assertEquals(0.292235, circle.getRadius(center), 1e-6);

View Full Code Here

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

            circle.addPoint(points[i][0], points[i][1]);
        }
        final double[] start = {0, 0};


        Optimum optimum = optimizer.optimize(
                builder(circle).weight(new DiagonalMatrix(weights)).start(start).build());


        assertEquals(1e-6, optimum.getPoint(), -0.1517383071957963, 0.2074999736353867);
        Assert.assertEquals(0.04268731682389561, optimum.getRMS(), 1e-8);
    }

View Full Code Here

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

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

View Full Code Here

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

        Arrays.fill(weights, 1d);


        return new LeastSquaresBuilder()
                .model(problem.getModelFunction(), problem.getModelFunctionJacobian())
                .target(observed)
                .weight(new DiagonalMatrix(weights))
                .start(start);
    }

View Full Code Here

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

    @Test
    public void testComputeValueAndJacobian() {
        //setup
        final RealVector point = new ArrayRealVector(new double[]{1, 2});
        Evaluation evaluation = new LeastSquaresBuilder()
                .weight(new DiagonalMatrix(new double[]{16, 4}))
                .model(new MultivariateJacobianFunction() {
                    public Pair<RealVector, RealMatrix> value(RealVector actualPoint) {
                        //verify correct values passed in
                        Assert.assertArrayEquals(
                                point.toArray(), actualPoint.toArray(), Precision.EPSILON);

View Full Code Here

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


    public LeastSquaresBuilder builder(CircleProblem problem){
        return base()
                .model(problem.getModelFunction(), problem.getModelFunctionJacobian())
                .target(problem.target())
                .weight(new DiagonalMatrix(problem.weight()));
    }

View Full Code Here

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

        }


        final Optimum optimum = optimizer.optimize(
                builder(problem)
                        .target(dataPoints[1])
                        .weight(new DiagonalMatrix(weights))
                        .start(start)
                        .maxIterations(20)
                        .build()
        );

View Full Code Here

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

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


    }

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.