Examples of GMRES

no.uib.cipr.matrix.sparse.GMRES
GMRES solver. GMRES solves the unsymmetric linear system Ax = b using the Generalized Minimum Residual method. The GMRES iteration is restarted after a given number of iterations. By default it is restarted after 30 iterations. @author Templates

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

            super(rank, norm);
        }


        @Override
        protected IterativeSolver createSolver(Vector x) {
            return new GMRES(x);
        }

View Full Code Here

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

            super(rank, norm);
        }


        @Override
        protected IterativeSolver createSolver(Vector x) {
            return new GMRES(x);
        }

View Full Code Here

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

        super(arg0);
    }


    @Override
    protected void createSolver() throws Exception {
        solver = new GMRES(x);
    }

View Full Code Here

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.