Home | History | Annotate | Download | only in IterativeLinearSolvers

Lines Matching refs:Matrix

49 // We have an explicit matrix at hand, compatible with Ref<>
72 const ActualMatrixType& matrix() const
98 // MatrixType is not compatible with Ref<> -> matrix-free wrapper
121 const ActualMatrixType& matrix() const
171 /** Initialize the solver with matrix \a A for further \c Ax=b solving.
176 * \warning this class stores a reference to the matrix A as well as some
179 * matrix A, or modify a copy of A.
186 compute(matrix());
191 /** Initializes the iterative solver for the sparsity pattern of the matrix \a A for further solving \c Ax=b problems.
194 * we might, for instance, implement column reordering for faster matrix vector products.
200 m_preconditioner.analyzePattern(matrix());
207 /** Initializes the iterative solver with the numerical values of the matrix \a A for further solving \c Ax=b problems.
211 * \warning this class stores a reference to the matrix A as well as some
214 * matrix A, or modify a copy of A.
221 m_preconditioner.factorize(matrix());
227 /** Initializes the iterative solver with the matrix \a A for further solving \c Ax=b problems.
230 * we might, for instance, implement column reordering for faster matrix vector products.
232 * \warning this class stores a reference to the matrix A as well as some
235 * matrix A, or modify a copy of A.
241 m_preconditioner.compute(matrix());
250 Index rows() const { return matrix().rows(); }
253 Index cols() const { return matrix().cols(); }
279 * twice the number of columns of the matrix.
283 return (m_maxIterations<0) ? 2*matrix().cols() : m_maxIterations;
287 * Default is twice the number of columns of the matrix.
321 eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b");
342 Eigen::Matrix<DestScalar,Dynamic,1> tb(size);
343 Eigen::Matrix<DestScalar,Dynamic,1> tx(cols());
369 const ActualMatrixType& matrix() const
371 return m_matrixWrapper.matrix();