Lines Matching full:matrix
71 * at right of the matrix and the combination is multiplicative.
73 * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix.
116 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
117 typedef Matrix<RealScalar,Dynamic,Dynamic> DenseRealMatrix;
118 typedef Matrix<Scalar,Dynamic,1> DenseVector;
119 typedef Matrix<RealScalar,Dynamic,1> DenseRealVector;
120 typedef Matrix<std::complex<RealScalar>, Dynamic, 1> ComplexVector;
126 /** Initialize the solver with matrix \a A for further \c Ax=b solving.
131 * \warning this class stores a reference to the matrix A as well as some
134 * matrix A, or modify a copy of A.
152 && "DGMRES::solve(): invalid number of rows of the right hand side matrix b");
229 mutable DenseMatrix m_H; // Hessenberg matrix
230 mutable DenseMatrix m_Hes; // Initial hessenberg matrix wihout Givens rotations applied
233 mutable DenseMatrix m_MU; // matrix operator applied to m_U (for next cycles)
290 * \param mat The coefficient matrix
343 // Update Hessenberg matrix with Givens rotations
369 //FIXME Check first if the matrix is singular ... zero diagonal
436 // First, find the Schur form of the Hessenberg matrix H
444 Matrix<Index,Dynamic,1>perm(it);
472 // Form the Schur vectors of the initial matrix using the Krylov basis
512 //FIXME CHeck if the factorization was correctly done (nonsingular matrix)
