Home | History | Annotate | Download | only in IterativeSolvers

Lines Matching refs: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,
208 class GMRES;
213 struct traits<GMRES<_MatrixType,_Preconditioner> >
222 * \brief A GMRES solver for sparse square problems
240 * GMRES<SparseMatrix<double> > solver(A);
267 class GMRES : public IterativeSolverBase<GMRES<_MatrixType,_Preconditioner> >
269 typedef IterativeSolverBase<GMRES> Base;
289 GMRES() : Base(), m_restart(30) {}
301 GMRES(const MatrixType& A) : Base(A), m_restart(30) {}
303 ~GMRES() {}
320 inline const internal::solve_retval_with_guess<GMRES, Rhs, Guess>
323 eigen_assert(m_isInitialized && "GMRES is not initialized.");
325 && "GMRES::solve(): invalid number of rows of the right hand side matrix b");
327 <GMRES, Rhs, Guess>(*this, b.derived(), x0);
341 if(!internal::gmres(*mp_matrix, b.col(j), xj, Base::m_preconditioner, m_iterations, m_restart, m_error))
367 struct solve_retval<GMRES<_MatrixType, _Preconditioner>, Rhs>
368 : solve_retval_base<GMRES<_MatrixType, _Preconditioner>, Rhs>
370 typedef GMRES<_MatrixType, _Preconditioner> Dec;