OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:matrixT
(Results
1 - 25
of
28
) sorted by null
1
2
/external/eigen/doc/snippets/
ComplexSchur_compute.cpp
4
cout << "The matrix T in the decomposition of A is:" << endl << schur.
matrixT
() << endl;
6
cout << "The matrix T in the decomposition of A^(-1) is:" << endl << schur.
matrixT
() << endl;
RealSchur_compute.cpp
4
cout << "The matrix T in the decomposition of A is:" << endl << schur.
matrixT
() << endl;
6
cout << "The matrix T in the decomposition of A^(-1) is:" << endl << schur.
matrixT
() << endl;
Tridiagonalization_compute.cpp
6
cout << tri.
matrixT
() << endl;
9
cout << tri.
matrixT
() << endl;
ComplexSchur_matrixT.cpp
4
cout << "The triangular matrix T is:" << endl << schurOfA.
matrixT
() << endl;
RealSchur_RealSchur_MatrixType.cpp
6
cout << "The quasi-triangular matrix T is:" << endl << schur.
matrixT
() << endl << endl;
9
MatrixXd T = schur.
matrixT
();
Tridiagonalization_packedMatrix.cpp
8
<< endl << triOfA.
matrixT
() << endl;
RealQZ_compute.cpp
8
cout << "S:\n" << qz.matrixS() << "\n" << "T:\n" << qz.
matrixT
() << "\n";
14
<< ", |B-QTZ|: " << (B-qz.matrixQ()*qz.
matrixT
()*qz.matrixZ()).norm()
Tridiagonalization_Tridiagonalization_MatrixType.cpp
7
MatrixXd T = triOfA.
matrixT
();
Tridiagonalization_diagonal.cpp
6
MatrixXd T = triOfA.
matrixT
();
/external/eigen/test/
schur_complex.cpp
25
ComplexMatrixType T = schurOfA.
matrixT
();
36
VERIFY_RAISES_ASSERT(csUninitialized.
matrixT
());
47
VERIFY_IS_EQUAL(cs1.
matrixT
(), cs2.
matrixT
());
54
VERIFY_IS_EQUAL(cs3.
matrixT
(), cs1.
matrixT
());
64
VERIFY_IS_EQUAL(cs3.
matrixT
(), Atriangular.template cast<ComplexScalar>());
70
VERIFY_IS_EQUAL(cs1.
matrixT
(), csOnlyT.
matrixT
());
schur_real.cpp
48
MatrixType T = schurOfA.
matrixT
();
55
VERIFY_RAISES_ASSERT(rsUninitialized.
matrixT
());
66
VERIFY_IS_EQUAL(rs1.
matrixT
(), rs2.
matrixT
());
73
VERIFY_IS_EQUAL(rs3.
matrixT
(), rs1.
matrixT
());
85
VERIFY_IS_APPROX(rs3.
matrixT
(), Atriangular); // approx because of scaling...
91
VERIFY_IS_EQUAL(rs1.
matrixT
(), rsOnlyT.
matrixT
());
real_qz.cpp
56
if (abs(qz.
matrixT
()(i,j))!=Scalar(0.0))
58
std::cerr << "Error: T(" << i << "," << j << ") = " << qz.
matrixT
()(i,j) << std::endl;
74
VERIFY_IS_APPROX(qz.matrixQ()*qz.
matrixT
()*qz.matrixZ(), B);
eigensolver_selfadjoint.cpp
149
VERIFY_IS_APPROX(tridiag.diagonal(), tridiag.
matrixT
().diagonal());
150
VERIFY_IS_APPROX(tridiag.subDiagonal(), tridiag.
matrixT
().template diagonal<-1>());
151
Matrix<RealScalar,Dynamic,Dynamic> T = tridiag.
matrixT
();
158
VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.
matrixT
().eval() * MatrixType(tridiag.matrixQ()).adjoint());
159
VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), tridiag.matrixQ() * tridiag.
matrixT
() * tridiag.matrixQ().adjoint());
165
eiSymmTridiag.computeFromTridiagonal(tridiag.
matrixT
().diagonal(), tridiag.
matrixT
().diagonal(-1), ComputeEigenvectors);
167
VERIFY_IS_APPROX(tridiag.
matrixT
(), eiSymmTridiag.eigenvectors().real() * eiSymmTridiag.eigenvalues().asDiagonal() * eiSymmTridiag.eigenvectors().real().transpose());
qr_colpivoting.cpp
46
cod.
matrixT
().topLeftCorner(rank, rank).template triangularView<Upper>();
/external/eigen/Eigen/src/Eigenvalues/
ComplexEigenSolver.h
274
m_eivalues = m_schur.
matrixT
().diagonal();
276
doComputeEigenvectors(m_schur.
matrixT
().norm());
302
m_matX.coeffRef(i,k) = -m_schur.
matrixT
().coeff(i,k);
304
m_matX.coeffRef(i,k) -= (m_schur.
matrixT
().row(i).segment(i+1,k-i-1) * m_matX.col(k).segment(i+1,k-i-1)).value();
305
ComplexScalar z = m_schur.
matrixT
().coeff(i,i) - m_schur.
matrixT
().coeff(k,k);
ComplexSchur.h
44
* decomposition is computed, you can use the matrixU() and
matrixT
()
110
* \sa
matrixT
() and matrixU() for examples.
157
* \code schur.
matrixT
().triangularView<Upper>() \endcode
162
const ComplexMatrixType&
matrixT
() const
GeneralizedEigenSolver.h
316
const MatrixType &mT = m_realQZ.
matrixT
();
Tridiagonalization.h
55
* matrixQ() and
matrixT
() functions to retrieve the matrices Q and T in the
238
*
matrixT
(), class HouseholderSequence
265
MatrixTReturnType
matrixT
() const
282
* \sa
matrixT
(), subDiagonal()
294
* \sa diagonal() for an example,
matrixT
()
522
* \brief Expression type for return value of Tridiagonalization::
matrixT
()
EigenSolver.h
395
m_matT = m_realSchur.
matrixT
();
RealSchur.h
43
*
matrixT
() functions to retrieve the matrices U and T in the decomposition.
144
const MatrixType&
matrixT
() const
/external/eigen/unsupported/test/
matrix_functions.h
49
MatrixType T = schur.
matrixT
();
matrix_power.cpp
116
T = schur.
matrixT
();
/external/eigen/Eigen/src/QR/
CompleteOrthogonalDecomposition.h
175
* \code
matrixT
().template triangularView<Upper>() \endcode
181
const MatrixType&
matrixT
() const { return m_cpqr.matrixQR(); }
510
dst.topRows(rank) =
matrixT
()
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixSquareRoot.h
266
const MatrixType& T = schurOfA.
matrixT
();
291
const MatrixType& T = schurOfA.
matrixT
();
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DGMRES.h
391
return schurofH.
matrixT
().diagonal();
398
const DenseMatrix& T = schurofH.
matrixT
();
Completed in 1015 milliseconds
1
2