Lines Matching refs:matA
28 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs);
324 * Performs a tridiagonal decomposition of the selfadjoint matrix \a matA in-place.
326 * \param[in,out] matA On input the selfadjoint matrix. Only the \b lower triangular part is referenced.
332 * and lower sub-diagonal of the matrix \a matA.
340 * \f$ v_i = [ 0, \ldots, 0, 1, matA(i+2,i), \ldots, matA(N-1,i) ]^T \f$.
347 void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs)
352 Index n = matA.rows();
353 eigen_assert(n==matA.cols());
361 matA.col(i).tail(remainingSize).makeHouseholderInPlace(h, beta);
364 // i.e., A = H A H' where H = I - h v v' and v = matA.col(i).tail(n-i-1)
365 matA.col(i).coeffRef(i+1) = 1;
367 hCoeffs.tail(n-i-1).noalias() = (matA.bottomRightCorner(remainingSize,remainingSize).template selfadjointView<Lower>()
368 * (conj(h) * matA.col(i).tail(remainingSize)));
370 hCoeffs.tail(n-i-1) += (conj(h)*RealScalar(-0.5)*(hCoeffs.tail(remainingSize).dot(matA.col(i).tail(remainingSize)))) * matA.col(i).tail(n-i-1);
372 matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView<Lower>()
373 .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), Scalar(-1));
375 matA.col(i).coeffRef(i+1) = beta;
