Lines Matching full:gmres
39 * GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems.
47 * Implementations of the GMRES method.
51 * Implementation of the GMRES Method using Householder Transformations.
56 bool gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond,
205 class GMRES;
210 struct traits<GMRES<_MatrixType,_Preconditioner> >
219 * \brief A GMRES solver for sparse square problems
237 * GMRES<SparseMatrix<double> > solver(A);
264 class GMRES : public IterativeSolverBase<GMRES<_MatrixType,_Preconditioner> >
266 typedef IterativeSolverBase<GMRES> Base;
286 GMRES() : Base(), m_restart(30) {}
298 GMRES(const MatrixType& A) : Base(A), m_restart(30) {}
300 ~GMRES() {}
317 inline const internal::solve_retval_with_guess<GMRES, Rhs, Guess>
320 eigen_assert(m_isInitialized && "GMRES is not initialized.");
322 && "GMRES::solve(): invalid number of rows of the right hand side matrix b");
324 <GMRES, Rhs, Guess>(*this, b.derived(), x0);
338 if(!internal::gmres(*mp_matrix, b.col(j), xj, Base::m_preconditioner, m_iterations, m_restart, m_error))
363 struct solve_retval<GMRES<_MatrixType, _Preconditioner>, Rhs>
364 : solve_retval_base<GMRES<_MatrixType, _Preconditioner>, Rhs>
366 typedef GMRES<_MatrixType, _Preconditioner> Dec;
