Searched refs:triangular (Results 1 – 15 of 15) sorted by relevance
| /external/eigen/test/eigen2/ |
| D | eigen2_triangular.cpp | 12 template<typename MatrixType> void triangular(const MatrixType& m) in triangular() function
140 CALL_SUBTEST_1( triangular(Matrix<float, 1, 1>()) ); in test_eigen2_triangular()
141 CALL_SUBTEST_2( triangular(Matrix<float, 2, 2>()) ); in test_eigen2_triangular()
142 CALL_SUBTEST_3( triangular(Matrix3d()) ); in test_eigen2_triangular()
143 CALL_SUBTEST_4( triangular(MatrixXcf(4, 4)) ); in test_eigen2_triangular()
144 CALL_SUBTEST_5( triangular(Matrix<std::complex<float>,8, 8>()) ); in test_eigen2_triangular()
145 CALL_SUBTEST_6( triangular(MatrixXd(17,17)) ); in test_eigen2_triangular()
146 CALL_SUBTEST_7( triangular(Matrix<float,Dynamic,Dynamic,RowMajor>(5, 5)) ); in test_eigen2_triangular()
|
| /external/eigen/bench/btl/data/ |
| D | action_settings.txt | 8 trmm ; "{/*1.5 triangular matrix matrix product}" ; "matrix size" ; 4:3000
9 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:3000
10 trisolve_matrix ; "{/*1.5 triangular solver - matrix (M = inv(L) M)}" ; "size" ; 4:3000
|
| /external/eigen/doc/ |
| D | QuickReference.dox | 16 …code</td><td>Matrix and Array classes, basic linear algebra (including triangular and selfadjoint …
577 …View gives a view on a triangular part of a dense matrix and allows to perform optimized operation…
585 Reference to a triangular with optional \n
593 Writing to a specific triangular part:\n (only the referenced triangular part is evaluated)
598 Conversion to a dense matrix setting the opposite triangular part to zero:
622 Just as for triangular matrix, you can reference any triangular part of a square matrix to see it a…
623 matrix and perform special and optimized operations. Again the opposite triangular part is never re…
690 <tr><td>View on a triangular part of a matrix (read/write)</td>
697 <tr><td>View a triangular part as a symmetric/self-adjoint matrix (read/write)</td>
700 …intView<Upper>() = mat2 + mat2.adjoint(); // evaluated and write to the upper triangular part only
|
| D | TutorialSparse.dox | 11 …lasses, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></t…
312 …riangularView() function can be used to address a triangular part of the matrix, and perform trian…
325 - copy of triangular parts:
327 …(); // makes a full selfadjoint matrix from the upper triangular part
328 …= sm1.selfadjointView<Upper>(); // copies the upper triangular part to the lower triangular p…
333 …By(P); // compute P S P' from the upper triangular part of A, and m…
334 …ointView<Lower>().twistedBy(P); // compute P S P' from the lower triangular part of A, and t…
|
| D | HiPerformance.dox | 14 all kind of matrix products and triangular solvers.
124 Of course all these remarks hold for all other kind of products involving triangular or selfadjoint…
|
| D | TemplateKeyword.dox | 34 function which copies all entries in the upper triangular part of a matrix into another matrix, whi…
35 the lower triangular part unchanged. A straightforward implementation would be as follows:
|
| D | A05_PortingFrom2To3.dox | 107 In Eigen 2 you had to play with the part, extract, and marked functions to deal with triangular and…
214 triangular part to work on (default is lower part)</td></tr>
226 triangular part to work on</td></tr>
|
| D | SparseLinearSystems.dox | 78 For \c SPD solvers, a second optional template argument allows to specify which triangular part hav…
86 In the above example, only the upper triangular part of the input matrix A is considered for solvin…
|
| D | SparseQuickReference.dox | 221 <td> Several combination between triangular views and blocks views are possible
|
| /external/eigen/Eigen/ |
| D | OrderingMethods | 54 * // Call the ordering on the pattern of the lower triangular matrix A
|
| /external/eigen/unsupported/Eigen/ |
| D | MatrixFunctions | 399 quasi-triangular form with the real Schur decomposition. The square
400 root of the quasi-triangular matrix can then be computed directly. The
422 triangular matrix. The theoretical cost is the same. Details are in:
|
| /external/eigen/test/ |
| D | CMakeLists.txt | 164 ei_add_test(triangular)
|
| /external/eigen/Eigen/src/SparseCore/ |
| D | TriangularSolver.h | 317 this->template triangular<Flags&(Upper|Lower)>().solveInPlace(other);
|
| /external/bison/tests/ |
| D | torture.at | 43 # triangular grammar.
|
| /external/ceres-solver/docs/source/ |
| D | solving.rst | 454 an upper triangular matrix [TrefethenBau]_. Then it can be shown that
470 :math:`R` is an upper triangular matrix, then the solution to
479 factorization of :math:`H` is the same upper triangular matrix
|