Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:triangular (Results 51 - 75 of 146) sorted by null

1 23 4 5 6

/external/eigen/blas/
dspmv.f	26 * triangular part of the matrix A is supplied in the packed 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 49 * contain the upper triangular part of the symmetric matrix 54 * contain the lower triangular part of the symmetric matrix
sspmv.f	26 * triangular part of the matrix A is supplied in the packed 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 49 * contain the upper triangular part of the symmetric matrix 54 * contain the lower triangular part of the symmetric matrix
zhpmv.f	26 * triangular part of the matrix A is supplied in the packed 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 49 * contain the upper triangular part of the hermitian matrix 54 * contain the lower triangular part of the hermitian matrix
BandTriangularSolver.h	16 * Solve Ax=b with A a band triangular matrix
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixSquareRoot.h	16 * \brief Class for computing matrix square roots of upper quasi-triangular matrices. 20 * This class computes the square root of the upper quasi-triangular 33 * \param[in] A upper quasi-triangular matrix whose square root 96 // pre: T is quasi-upper-triangular and sqrtT is a zero matrix of the same size 115 // pre: T is quasi-upper-triangular and diagonal blocks of sqrtT are square root of diagonal blocks of T. 253 * \brief Class for computing matrix square roots of upper triangular matrices. 257 * This class computes the square root of the upper triangular matrix 258 * stored in the upper triangular part (including the diagonal) of 277 * Only the upper triangular part (including the diagonal) of 297 // Compute square root of T and store it in upper triangular part of resul     [all...]
/external/eigen/Eigen/src/Cholesky/
LLT.h	26 * \param UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper. 27 * The other triangular part won't be read. 30 * matrix A such that A = LL^* = U^*U, where L is lower triangular. 47 * Note that during the decomposition, only the upper triangular part of A is considered. Therefore, 96 /** \returns a view of the upper triangular matrix U */ 103 /** \returns a view of the lower triangular matrix L */
/external/eigen/Eigen/src/Core/util/
Constants.h	161 /** View matrix as a lower triangular matrix. */ 163 /** View matrix as an upper triangular matrix. */ 169 /** View matrix as a lower triangular matrix with ones on the diagonal. */ 171 /** View matrix as an upper triangular matrix with ones on the diagonal. */ 173 /** View matrix as a lower triangular matrix with zeros on the diagonal. */ 175 /** View matrix as an upper triangular matrix with zeros on the diagonal. */
/external/eigen/Eigen/src/Eigenvalues/
ComplexSchur.h	36 * complex matrix, and T is a complex upper triangular matrix. The 142 /** \brief Returns the triangular matrix in the Schur decomposition. 153 * only the upper triangular part, use: 174 * to triangular form by performing QR iterations with a single 328 // Reduce the Hessenberg matrix m_matT to triangular form by QR iteration. 335 // Rows iu+1,...,end are already brought in triangular form.
RealSchur.h	31 * T is a real quasi-triangular matrix. An orthogonal matrix is a matrix whose 32 * inverse is equal to its transpose, \f$ U^{-1} = U^T \f$. A quasi-triangular 33 * matrix is a block-triangular matrix whose diagonal consists of 1-by-1 131 /** \brief Returns the quasi-triangular matrix in the Schur decomposition. 155 * matrix is then reduced to triangular form by performing Francis QR 221 // Rows iu+1,...,end are already brought in triangular form. 276 // FIXME to be efficient the following would requires a triangular reduxion code
/external/eigen/doc/
C09_TutorialSparse.dox	28 <tr><td>\link Sparse_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><td>SparseMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></tr> 307 For \c SPD solvers, a second optional template argument allows to specify which triangular part have to be used, e.g.: 315 In the above example, only the upper triangular part of the input matrix A is considered for solving. The opposite triangle might either be empty or contain arbitrary values. 413 \subsection TutorialSparse_TriangularSelfadjoint Triangular and selfadjoint views 415 Just as with dense matrices, the triangularView() function can be used to address a triangular part of the matrix, and perform triangular solves with a dense right hand side: 428 - copy of triangular parts: 430 sm2 = sm1.selfadjointView<Upper>(); // makes a full selfadjoint matrix from the upper triangular part 431 sm2.selfadjointView<Lower>() = sm1.selfadjointView<Upper>(); // copies the upper triangular part to the lower triangular par     [all...]
I02_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 matrices.
A05_PortingFrom2To3.dox	120 \section PartAndExtract Triangular and self-adjoint matrices 122 In Eigen 2 you had to play with the part, extract, and marked functions to deal with triangular and selfadjoint matrices. In Eigen 3, all these functions have been removed in favor of the concept of \em views: 172 \section TriangularSolveInPlace Triangular in-place solving 229 triangular part to work on (default is lower part)</td></tr> 241 triangular part to work on</td></tr>
SparseQuickReference.dox	189 \section sparseselfadjointview Sparse triangular and selfadjoint Views 191 sm2 = sm1.triangularview<Lower>(); // Get the lower triangular part of the matrix. 192 dv2 = sm1.triangularView<Upper>().solve(dv1); // Solve the linear system with the uppper triangular part.
/external/ceres-solver/internal/ceres/
schur_complement_solver.cc	284 // one corresponding to upper triangular matrices. 286 // Create a upper triangular symmetric matrix. 297 // triangular matrices. 299 // Create a upper triangular symmetric matrix.
implicit_schur_complement_test.cc	101 // lhs_ref is an upper triangular matrix. Construct a full version 103 // lower triangular part of the matrix and adding it to lhs_ref.
dense_qr_solver.h	61 // Where Q is an orthonormal matrix and R is an upper triangular
incomplete_lq_factorization.h	51 // Where L is a lower triangular matrix, and Q is a near orthonormal
lapack.h	45 // column major and only the lower triangular part of the matrix is
/external/eigen/test/
schur_complex.cpp	19 // Test basic functionality: T is triangular and A = U T U*
schur_real.cpp	42 // Test basic functionality: T is quasi-triangular and A = U T U*
/external/eigen/unsupported/Eigen/src/Skyline/
SkylineProduct.h	143 //Use matrix lower triangular part 163 //Use matrix upper triangular part 207 //Use matrix upper triangular part 228 //Use matrix lower triangular part
/external/eigen/Eigen/src/LU/
FullPivLU.h	24 * is decomposed as A = PLUQ where L is unit-lower-triangular, U is upper-triangular, and P and Q 97 /** \returns the LU decomposition matrix: the upper-triangular part is U, the 98 * unit-lower-triangular part is L (at least for square matrices; in the non-square 570 * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end. 586 // the main diagonal. We need that to be able to apply our triangular solvers. 601 // ok, we have our trapezoid matrix, we can apply the triangular solver.
PartialPivLU.h	25 * is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P 94 /** \returns the LU decomposition matrix: the upper-triangular part is U, the 95 * unit-lower-triangular part is L (at least for square matrices; in the non-square
/external/eigen/Eigen/src/Core/
SolveTriangular.h	192 /** \returns the product of the inverse of \c *this with \a other, \a *this being triangular. 198 * The matrix \c *this must be triangular and invertible (i.e., all the coefficients of the 200 * is an upper (resp. lower) triangular matrix.
/external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h	348 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower 395 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower 440 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower 487 * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower

Completed in 265 milliseconds

1 23 4 5 6