Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:triangular (Results 26 - 50 of 146) sorted by null

12 3 4 5 6

/external/eigen/Eigen/src/Core/products/
TriangularMatrixVector_MKL.h	29 * Triangular matrix-vector product functionality based on ?TRMV. 41 * This file implements triangular matrix-vector multiplication using BLAS 73 // implements col-major: res += alpha * op(triangular) * vector 130 /* Non-square case - doesn't fit to MKL ?TRMV. Fall to default triangular product*/ \ 158 // implements row-major: res += alpha * op(triangular) * vector 215 /* Non-square case - doesn't fit to MKL ?TRMV. Fall to default triangular product*/ \
GeneralMatrixMatrixTriangular.h	19 * evaluating only one triangular part of the product. 28 /* Optimized matrix-matrix product evaluating only one triangular half */ 118 // Optimized packed Block * packed Block product kernel evaluating only one given triangular part 124 // while the triangular block overlapping the diagonal is evaluated into a 126 // triangular traversal. 159 // 2 - triangular accumulation
SelfadjointRank2Update.h	73 // If MatrixType is row major, then we use the routine for lower triangular in the upper triangular case and
TriangularSolverMatrix.h	36 /* Optimized triangular solver with multiple right hand side and the triangular matrix on the left 88 // A11 (the triangular part) and A21 the remaining rectangular part. 97 // Each panel can be split into a small triangular part T1k which is processed without optimization, 178 /* Optimized triangular solver with multiple left hand sides and the trinagular matrix on the right 230 // triangular packing (we only pack the panels off the diagonal, 252 // triangular solver kernel 279 // unblocked triangular solve
TriangularSolverMatrix_MKL.h	29 * Triangular matrix * matrix product functionality based on ?TRMM. 40 // implements LeftSide op(triangular)^-1 * general 95 // implements RightSide general * op(triangular)^-1
TriangularMatrixMatrix_MKL.h	29 * Triangular matrix * matrix product functionality based on ?TRMM. 77 // implements col-major += alpha * op(triangular) * op(general) 109 /* Non-square case - doesn't fit to MKL ?TRMM. Fall to default triangular product or call MKL ?GEMM*/ \ 191 // implements col-major += alpha * op(general) * op(triangular) 223 /* Non-square case - doesn't fit to MKL ?TRMM. Fall to default triangular product or call MKL ?GEMM*/ \
/external/eigen/Eigen/src/Householder/
BlockHouseholder.h	37 // FIXME add .noalias() once the triangular product can work inplace 59 // FIXME add .noalias() once the triangular product can work inplace
/external/eigen/blas/
ctbmv.f	18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals. 25 * lower triangular matrix as follows: 27 * UPLO = 'U' or 'u' A is an upper triangular matrix. 29 * UPLO = 'L' or 'l' A is a lower triangular matrix. 47 * triangular as follows: 49 * DIAG = 'U' or 'u' A is assumed to be unit triangular. 52 * triangular. 71 * by n part of the array A must contain the upper triangular 78 * triangular band matrix from conventional full matrix storage 89 * by n part of the array A must contain the lower triangular     [all...]
dtbmv.f	18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals. 25 * lower triangular matrix as follows: 27 * UPLO = 'U' or 'u' A is an upper triangular matrix. 29 * UPLO = 'L' or 'l' A is a lower triangular matrix. 47 * triangular as follows: 49 * DIAG = 'U' or 'u' A is assumed to be unit triangular. 52 * triangular. 71 * by n part of the array A must contain the upper triangular 78 * triangular band matrix from conventional full matrix storage 89 * by n part of the array A must contain the lower triangular     [all...]
stbmv.f	18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals. 25 * lower triangular matrix as follows: 27 * UPLO = 'U' or 'u' A is an upper triangular matrix. 29 * UPLO = 'L' or 'l' A is a lower triangular matrix. 47 * triangular as follows: 49 * DIAG = 'U' or 'u' A is assumed to be unit triangular. 52 * triangular. 71 * by n part of the array A must contain the upper triangular 78 * triangular band matrix from conventional full matrix storage 89 * by n part of the array A must contain the lower triangular     [all...]
ztbmv.f	18 * upper or lower triangular band matrix, with ( k + 1 ) diagonals. 25 * lower triangular matrix as follows: 27 * UPLO = 'U' or 'u' A is an upper triangular matrix. 29 * UPLO = 'L' or 'l' A is a lower triangular matrix. 47 * triangular as follows: 49 * DIAG = 'U' or 'u' A is assumed to be unit triangular. 52 * triangular. 71 * by n part of the array A must contain the upper triangular 78 * triangular band matrix from conventional full matrix storage 89 * by n part of the array A must contain the lower triangular     [all...]
chbmv.f	26 * triangular part of the band matrix A is being supplied as 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 53 * by n part of the array A must contain the upper triangular 60 * triangular part of a hermitian band matrix from conventional 71 * by n part of the array A must contain the lower triangular 78 * triangular part of a hermitian band matrix from conventional
chpr2.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 71 * contain the upper triangular part of the hermitian matrix 75 * AP is overwritten by the upper triangular part of the 78 * contain the lower triangular part of the hermitian matrix 82 * AP is overwritten by the lower triangular part of the
dsbmv.f	26 * triangular part of the band matrix A is being supplied as 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 53 * by n part of the array A must contain the upper triangular 60 * triangular part of a symmetric band matrix from conventional 71 * by n part of the array A must contain the lower triangular 78 * triangular part of a symmetric band matrix from conventional
ssbmv.f	26 * triangular part of the band matrix A is being supplied as 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 53 * by n part of the array A must contain the upper triangular 60 * triangular part of a symmetric band matrix from conventional 71 * by n part of the array A must contain the lower triangular 78 * triangular part of a symmetric band matrix from conventional
zhbmv.f	26 * triangular part of the band matrix A is being supplied as 29 * UPLO = 'U' or 'u' The upper triangular part of A is 32 * UPLO = 'L' or 'l' The lower triangular part of A is 53 * by n part of the array A must contain the upper triangular 60 * triangular part of a hermitian band matrix from conventional 71 * by n part of the array A must contain the lower triangular 78 * triangular part of a hermitian band matrix from conventional
zhpr2.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 71 * contain the upper triangular part of the hermitian matrix 75 * AP is overwritten by the upper triangular part of the 78 * contain the lower triangular part of the hermitian matrix 82 * AP is overwritten by the lower triangular part of the
chpmv.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
/external/ceres-solver/internal/ceres/
lapack.cc	34 // C interface to the LAPACK Cholesky factorization and triangular solve. 87 LOG(INFO) << "Triangular solve (dpotrs) failed: " << info;
compressed_col_sparse_matrix_utils.h	68 // Where R is an upper triangular compressed column sparse matrix. 89 // Where R is an upper triangular compressed column sparse matrix. 106 // Given a upper triangular matrix R in compressed column form, solve
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
qrsolv.h	27 // the following will only change the lower triangular part of s, including 73 /* solve the triangular system for z. if the system is */
/external/eigen/Eigen/src/Core/arch/Default/
Settings.h	34 /** Defines the maximal width of the blocks used in the triangular product and solver
/external/eigen/doc/
QuickReference.dox	26 <tr><td>\link Core_Module Core \endlink</td><td>\code#include <Eigen/Core>\endcode</td><td>Matrix and Array classes, basic linear algebra (including triangular and selfadjoint products), array manipulation</td></tr> 548 <a href="#" class="top">top</a>\section QuickRef_DiagTriSymm Diagonal, Triangular, and Self-adjoint matrices 585 \subsection QuickRef_TriangularView Triangular views 587 TriangularView gives a view on a triangular part of a dense matrix and allows to perform optimized operations on it. The opposite triangular part is never referenced and can be used to store other information. 595 Reference to a triangular with optional \n 603 Writing to a specific triangular part:\n (only the referenced triangular part is evaluated) 608 Conversion to a dense matrix setting the opposite triangular part to zero: 632 Just as for triangular matrix, you can reference any triangular part of a square matrix to see it as a selfadjoin     [all...]
/external/eigen/Eigen/src/Core/
SelfAdjointView.h	19 * \brief Expression of a selfadjoint matrix from a triangular part of a dense matrix 24 * This class is an expression of a sefladjoint matrix from a triangular part of a matrix 81 * \warning the coordinates must fit into the referenced triangular part 90 * \warning the coordinates must fit into the referenced triangular part 129 * a adjoint expression without any overhead. Only the meaningful triangular
/external/eigen/Eigen/src/Eigenvalues/
GeneralizedSelfAdjointEigenSolver.h	33 * Only the \b lower \b triangular \b part of the input matrix is referenced. 84 * Only the lower triangular part of the matrix is referenced. 86 * Only the lower triangular part of the matrix is referenced. 117 * Only the lower triangular part of the matrix is referenced. 119 * Only the lower triangular part of the matrix is referenced.

Completed in 428 milliseconds

12 3 4 5 6