Java DiagonalMatrix类代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› Java›Java编程经验

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了Java中org.apache.commons.math3.linear.DiagonalMatrix类的典型用法代码示例。如果您正苦于以下问题：Java DiagonalMatrix类的具体用法？Java DiagonalMatrix怎么用？Java DiagonalMatrix使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

DiagonalMatrix类属于org.apache.commons.math3.linear包，在下文中一共展示了DiagonalMatrix类的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: getProblem

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
protected LeastSquaresProblem getProblem(Collection<WeightedObservedPoint> points) {
    final int len = points.size();
    final double[] target  = new double[len];
    final double[] weights = new double[len];
    final double[] initialGuess = { 1.0, 1.0 };

    int i = 0;
    for(WeightedObservedPoint point : points) {
        target[i]  = point.getY();
        weights[i] = point.getWeight();
        i += 1;
    }

    AbstractCurveFitter.TheoreticalValuesFunction model = new AbstractCurveFitter.TheoreticalValuesFunction(func, points);

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

开发者ID:Auraya，项目名称:armorvox-client，代码行数:25，代码来源:VxmlClientGetVoiceprint.java

示例2: testInconsistentSizes1

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testInconsistentSizes1() {
    try {
        LinearProblem problem
                = new LinearProblem(new double[][]{{1, 0},
                {0, 1}},
                new double[]{-1, 1});

        //TODO why is this part here? hasn't it been tested already?
        Optimum optimum = optimizer.optimize(problem.getBuilder().build());

        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
    }
}

开发者ID:Quanticol，项目名称:CARMA，代码行数:24，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例3: testInconsistentSizes2

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testInconsistentSizes2() {
    try {
        LinearProblem problem
                = new LinearProblem(new double[][]{{1, 0}, {0, 1}},
                new double[]{-1, 1});

        Optimum optimum = optimizer.optimize(problem.getBuilder().build());

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

        //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) {
        //expected
    }
}

开发者ID:Quanticol，项目名称:CARMA，代码行数:26，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例4: testCircleFittingBadInit

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testCircleFittingBadInit() {
    CircleVectorial circle = new CircleVectorial();
    double[][] points = circlePoints;
    double[] weights = new double[points.length];
    final double[] start = {-12, -12};
    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);
    Assert.assertEquals(-0.151738, center.getX(), 1e-6);
    Assert.assertEquals(0.2075001, center.getY(), 1e-6);
}

开发者ID:Quanticol，项目名称:CARMA，代码行数:21，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例5: testCircleFittingGoodInit

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testCircleFittingGoodInit() {
    CircleVectorial circle = new CircleVectorial();
    double[][] points = circlePoints;
    double[] weights = new double[points.length];
    Arrays.fill(weights, 2);
    for (int i = 0; i < points.length; ++i) {
        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);
}

开发者ID:Quanticol，项目名称:CARMA，代码行数:18，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例6: assertSVDValues

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
private void assertSVDValues(final File outputFileV, final File outputFileS, final File outputFileU) {
    try {
        final ReadCountCollection rcc = ReadCountCollectionUtils.parse(CONTROL_PCOV_FULL_FILE);
        final SVD svd = SVDFactory.createSVD(rcc.counts());
        final RealMatrix sDiag = new DiagonalMatrix(svd.getSingularValues());
        assertOutputFileValues(outputFileU, svd.getU());
        assertOutputFileValues(outputFileS, sDiag);
        assertOutputFileValues(outputFileV, svd.getV());
        assertUnitaryMatrix(svd.getV());
        assertUnitaryMatrix(svd.getU());
        Assert.assertTrue(MatrixUtils.isSymmetric(sDiag, 1e-32));

    } catch (final IOException ioe) {
        Assert.fail("Could not open test file: " + CONTROL_PCOV_FULL_FILE, ioe);
    }
}

开发者ID:broadinstitute，项目名称:gatk-protected，代码行数:17，代码来源:DecomposeSingularValuesIntegrationTest.java

示例7: testComputeCost

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testComputeCost() throws IOException {
    final StatisticalReferenceDataset dataset
        = StatisticalReferenceDatasetFactory.createKirby2();
    final double[] a = dataset.getParameters();
    final double[] y = dataset.getData()[1];
    final double[] w = new double[y.length];
    Arrays.fill(w, 1d);

    StatisticalReferenceDataset.LeastSquaresProblem problem
        = dataset.getLeastSquaresProblem();

    final LevenbergMarquardtOptimizer optim = LevenbergMarquardtOptimizer.create()
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(y)
        .withWeight(new DiagonalMatrix(w))
        .withStartPoint(a);

    final double expected = dataset.getResidualSumOfSquares();
    final double cost = optim.computeCost(optim.computeResiduals(optim.getModel().value(optim.getStart())));
    final double actual = cost * cost;
    Assert.assertEquals(dataset.getName(), expected, actual, 1e-11 * expected);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:25，代码来源:AbstractLeastSquaresOptimizerTest.java

示例8: testComputeRMS

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testComputeRMS() throws IOException {
    final StatisticalReferenceDataset dataset
        = StatisticalReferenceDatasetFactory.createKirby2();
    final double[] a = dataset.getParameters();
    final double[] y = dataset.getData()[1];
    final double[] w = new double[y.length];
    Arrays.fill(w, 1d);

    StatisticalReferenceDataset.LeastSquaresProblem problem
        = dataset.getLeastSquaresProblem();

    final LevenbergMarquardtOptimizer optim = LevenbergMarquardtOptimizer.create()
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(y)
        .withWeight(new DiagonalMatrix(w))
        .withStartPoint(a);

    final double expected = FastMath.sqrt(dataset.getResidualSumOfSquares() /
                                          dataset.getNumObservations());
    final double actual = optim.computeRMS(optim.getStart());
    Assert.assertEquals(dataset.getName(), expected, actual, 1e-11 * expected);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:25，代码来源:AbstractLeastSquaresOptimizerTest.java

示例9: testTrivial

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testTrivial() {
    LinearProblem problem
        = new LinearProblem(new double[][] { { 2 } },
                            new double[] { 3 });
    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1 }))
        .withStartPoint(new double[] { 0 });

    PointVectorValuePair optimum = optimizer.optimize();

    Assert.assertEquals(0, optimizer.computeRMS(optimum.getPoint()), 1e-10);
    Assert.assertEquals(1.5, optimum.getPoint()[0], 1e-10);
    Assert.assertEquals(3.0, optimum.getValue()[0], 1e-10);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:21，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例10: testQRColumnsPermutation

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testQRColumnsPermutation() {
    LinearProblem problem
        = new LinearProblem(new double[][] { { 1, -1 }, { 0, 2 }, { 1, -2 } },
                            new double[] { 4, 6, 1 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 0, 0 });

    PointVectorValuePair optimum = optimizer.optimize();

    Assert.assertEquals(0, optimizer.computeRMS(optimum.getPoint()), 1e-10);
    Assert.assertEquals(7, optimum.getPoint()[0], 1e-10);
    Assert.assertEquals(3, optimum.getPoint()[1], 1e-10);
    Assert.assertEquals(4, optimum.getValue()[0], 1e-10);
    Assert.assertEquals(6, optimum.getValue()[1], 1e-10);
    Assert.assertEquals(1, optimum.getValue()[2], 1e-10);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:25，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例11: testNoDependency

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testNoDependency() {
    LinearProblem problem = new LinearProblem(new double[][] {
            { 2, 0, 0, 0, 0, 0 },
            { 0, 2, 0, 0, 0, 0 },
            { 0, 0, 2, 0, 0, 0 },
            { 0, 0, 0, 2, 0, 0 },
            { 0, 0, 0, 0, 2, 0 },
            { 0, 0, 0, 0, 0, 2 }
    }, new double[] { 0, 1.1, 2.2, 3.3, 4.4, 5.5 });
    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1, 1, 1, 1 }))
        .withStartPoint(new double[] { 0, 0, 0, 0, 0, 0 });

    double[] optimum = optimizer.optimize().getPoint();
    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
    for (int i = 0; i < problem.target.length; ++i) {
        Assert.assertEquals(0.55 * i, optimum[i], 1e-10);
    }
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:26，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例12: testOneSet

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testOneSet() {
    LinearProblem problem = new LinearProblem(new double[][] {
            {  1,  0, 0 },
            { -1,  1, 0 },
            {  0, -1, 1 }
    }, new double[] { 1, 1, 1});

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 0, 0, 0 });

    double[] optimum = optimizer.optimize().getPoint();
    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
    Assert.assertEquals(1, optimum[0], 1e-10);
    Assert.assertEquals(2, optimum[1], 1e-10);
    Assert.assertEquals(3, optimum[2], 1e-10);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:24，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例13: testNonInvertible

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test(expected=ConvergenceException.class)
public void testNonInvertible() throws Exception {
    LinearProblem problem = new LinearProblem(new double[][] {
            {  1, 2, -3 },
            {  2, 1,  3 },
            { -3, 0, -9 }
    }, new double[] { 1, 1, 1 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 0, 0, 0 });

    optimizer.optimize();
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:20，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例14: testMoreEstimatedParametersSimple

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testMoreEstimatedParametersSimple() {
    LinearProblem problem = new LinearProblem(new double[][] {
            { 3, 2,  0, 0 },
            { 0, 1, -1, 1 },
            { 2, 0,  1, 0 }
    }, new double[] { 7, 3, 5 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 7, 6, 5, 4 });

    double[] optimum = optimizer.optimize().getPoint();
    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:21，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例15: testRedundantEquations

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testRedundantEquations() {
    LinearProblem problem = new LinearProblem(new double[][] {
            { 1,  1 },
            { 1, -1 },
            { 1,  3 }
    }, new double[] { 3, 1, 5 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 1, 1 });

    double[] optimum = optimizer.optimize().getPoint();

    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
    Assert.assertEquals(2, optimum[0], 1e-10);
    Assert.assertEquals(1, optimum[1], 1e-10);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:24，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例16: testInconsistentEquations

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testInconsistentEquations() {
    LinearProblem problem = new LinearProblem(new double[][] {
            { 1,  1 },
            { 1, -1 },
            { 1,  3 }
    }, new double[] { 3, 1, 4 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1 }))
        .withStartPoint(new double[] { 1, 1 });

    double[] optimum = optimizer.optimize().getPoint();

    Assert.assertTrue(optimizer.computeRMS(optimum) > 0.1);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:22，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例17: testInconsistentSizes1

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test(expected=DimensionMismatchException.class)
public void testInconsistentSizes1() {
    LinearProblem problem
        = new LinearProblem(new double[][] { { 1, 0 },
                                             { 0, 1 } },
                            new double[] { -1, 1 });
    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1 }))
        .withStartPoint(new double[] { 0, 0 });

    double[] optimum = optimizer.optimize().getPoint();

    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
    Assert.assertEquals(-1, optimum[0], 1e-10);
    Assert.assertEquals(1, optimum[1], 1e-10);

    optimizer.withWeight(new DiagonalMatrix(new double[] { 1 })).optimize();
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:24，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例18: testInconsistentSizes2

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test(expected=DimensionMismatchException.class)
public void testInconsistentSizes2() {
    LinearProblem problem
        = new LinearProblem(new double[][] { { 1, 0 }, { 0, 1 } },
                            new double[] { -1, 1 });

    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(problem.getModelFunction(),
                              problem.getModelFunctionJacobian())
        .withTarget(problem.getTarget())
        .withWeight(new DiagonalMatrix(new double[] { 1, 1 }))
        .withStartPoint(new double[] { 0, 0 });

    double[] optimum = optimizer.optimize().getPoint();

    Assert.assertEquals(0, optimizer.computeRMS(optimum), 1e-10);
    Assert.assertEquals(-1, optimum[0], 1e-10);
    Assert.assertEquals(1, optimum[1], 1e-10);

    optimizer
        .withTarget(new double[] { 1 })
        .withWeight(new DiagonalMatrix(new double[] { 1 }))
        .optimize();
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:27，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例19: testCircleFittingGoodInit

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test
public void testCircleFittingGoodInit() {
    CircleVectorial circle = new CircleVectorial();
    double[][] points = circlePoints;
    double[] target = new double[points.length];
    Arrays.fill(target, 0);
    double[] weights = new double[points.length];
    Arrays.fill(weights, 2);
    for (int i = 0; i < points.length; ++i) {
        circle.addPoint(points[i][0], points[i][1]);
    }
    T optimizer = createOptimizer()
        .withMaxEvaluations(100)
        .withMaxIterations(getMaxIterations())
        .withModelAndJacobian(circle.getModelFunction(),
                              circle.getModelFunctionJacobian())
        .withTarget(target)
        .withWeight(new DiagonalMatrix(weights))
        .withStartPoint(new double[] { 0, 0 });

    double[] optimum = optimizer.optimize().getPoint();

    Assert.assertEquals(-0.1517383071957963, optimum[0], 1e-6);
    Assert.assertEquals(0.2074999736353867,  optimum[1], 1e-6);
    Assert.assertEquals(0.04268731682389561, optimizer.computeRMS(optimum), 1e-8);
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:27，代码来源:AbstractLeastSquaresOptimizerAbstractTest.java

示例20: testMaxEvaluations

import org.apache.commons.math3.linear.DiagonalMatrix; //导入依赖的package包/类
@Test(expected=TooManyEvaluationsException.class)
public void testMaxEvaluations() throws Exception {
    CircleVectorial circle = new CircleVectorial();
    circle.addPoint( 30.0,  68.0);
    circle.addPoint( 50.0,  -6.0);
    circle.addPoint(110.0, -20.0);
    circle.addPoint( 35.0,  15.0);
    circle.addPoint( 45.0,  97.0);

    GaussNewtonOptimizer optimizer = createOptimizer()
        .withConvergenceChecker(new SimpleVectorValueChecker(1e-30, 1e-30))
        .withMaxIterations(Integer.MAX_VALUE)
        .withMaxEvaluations(100)
        .withModelAndJacobian(circle.getModelFunction(),
                              circle.getModelFunctionJacobian())
        .withTarget(new double[] { 0, 0, 0, 0, 0 })
        .withWeight(new DiagonalMatrix(new double[] { 1, 1, 1, 1, 1 }))
        .withStartPoint(new double[] { 98.680, 47.345 });

    optimizer.optimize();
}

开发者ID:SpoonLabs，项目名称:astor，代码行数:22，代码来源:GaussNewtonOptimizerTest.java

注：本文中的org.apache.commons.math3.linear.DiagonalMatrix类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

Java Connection类代码示例发布时间：2022-05-21

Java Param类代码示例发布时间：2022-05-21

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：19135|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9973|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8317|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8686|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8627|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9643|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8611|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7991|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8642|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7527|2022-11-06

客服电话

电子邮件

Java DiagonalMatrix类代码示例

示例1: getProblem

示例2: testInconsistentSizes1

示例3: testInconsistentSizes2

示例4: testCircleFittingBadInit

示例5: testCircleFittingGoodInit

示例6: assertSVDValues

示例7: testComputeCost

示例8: testComputeRMS

示例9: testTrivial

示例10: testQRColumnsPermutation

示例11: testNoDependency

示例12: testOneSet

示例13: testNonInvertible

示例14: testMoreEstimatedParametersSimple

示例15: testRedundantEquations

示例16: testInconsistentEquations

示例17: testInconsistentSizes1

示例18: testInconsistentSizes2

示例19: testCircleFittingGoodInit

示例20: testMaxEvaluations

请发表评论

全部评论

上一篇：

下一篇：

徘的拼音和组词，带徘字的词语大全

chasinginfinity/ml-from-scratch: Machine

mkyong/spring3-mvc-maven-annotation-hell

床的笔顺,关于床的笔画,体会床的部首

zendesk/android-floating-action-button:

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053