Package no.uib.cipr.matrix.sparse

Examples of no.uib.cipr.matrix.sparse.DefaultIterationMonitor


            for (int i = n[rank]; i < n[rank + 1]; ++i)
                b_dist.set(i, getVectorEntry(i));

            IterativeSolver solver = createSolver(b_dist);

            IterationMonitor monitor = new DefaultIterationMonitor(1000, 1e-50,
                    1e-12, 1e+5);
            monitor.setNormType(norm);
            solver.setIterationMonitor(monitor);

            try {
                solver.solve(A, b_dist, x_dist);
            } catch (IterativeSolverNotConvergedException e) {
View Full Code Here


                solver = new no.uib.cipr.matrix.sparse.CG(solutionVector);
            } else if (solverType == BiCG) {
                solver = new no.uib.cipr.matrix.sparse.BiCG(solutionVector);
            }

            DefaultIterationMonitor monitor = new DefaultIterationMonitor();
            monitor.setMaxIterations(1000000);

            solver.setIterationMonitor( monitor );

            // A, b, x
            solver.solve(leftSideMatrix, coefficientVector, solutionVector);
View Full Code Here

TOP

Related Classes of no.uib.cipr.matrix.sparse.DefaultIterationMonitor

Copyright © 2018 www.massapicom. All rights reserved.
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.