| /external/eigen/doc/snippets/ |
| HessenbergDecomposition_compute.cpp | 4 cout << "The matrix H in the decomposition of A is:" << endl << hd.matrixH() << endl;
5 hd.compute(2*A); // re-use hd to compute and store decomposition of 2A
6 cout << "The matrix H in the decomposition of 2A is:" << endl << hd.matrixH() << endl;
|
| 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;
|
| LeastSquaresQR.cpp | 3 cout << "The solution using the QR decomposition is:\n"
|
| Tridiagonalization_compute.cpp | 5 cout << "The matrix T in the tridiagonal decomposition of A is: " << endl;
8 cout << "The matrix T in the tridiagonal decomposition of 2A is: " << endl;
|
| LLT_example.cpp | 5 LLT<MatrixXd> lltOfA(A); // compute the Cholesky decomposition of A
6 MatrixXd L = lltOfA.matrixL(); // retrieve factor L in the decomposition
|
| Tutorial_solve_reuse_decomposition.cpp | 3 PartialPivLU<Matrix3f> luOfA(A); // compute LU decomposition of A
|
| /external/eigen/Eigen/src/Core/ |
| Solve.h | 15 template<typename Decomposition, typename RhsType, typename StorageKind> class SolveImpl;
22 * \tparam Decomposition the type of the matrix or decomposion object
32 template<typename Decomposition, typename RhsType,typename StorageKind> struct solve_traits;
34 template<typename Decomposition, typename RhsType>
35 struct solve_traits<Decomposition,RhsType,Dense>
38 Decomposition::ColsAtCompileTime,
41 Decomposition::MaxColsAtCompileTime,
45 template<typename Decomposition, typename RhsType>
46 struct traits<Solve<Decomposition, RhsType> >
47 : traits<typename solve_traits<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>::PlainObject
[all...] |
| ConditionEstimator.h | 36 * \returns an estimate of ||inv(matrix)||_1 given a decomposition of
55 template <typename Decomposition>
56 typename Decomposition::RealScalar rcond_invmatrix_L1_norm_estimate(const Decomposition& dec)
58 typedef typename Decomposition::MatrixType MatrixType;
59 typedef typename Decomposition::Scalar Scalar;
60 typedef typename Decomposition::RealScalar RealScalar;
146 * Computing a decomposition of a dense matrix takes O(n^3) operations, while
152 * its decomposition. Supports the following decompositions: FullPivLU,
157 template <typename Decomposition>
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| SolveWithGuess.h | 15 template<typename Decomposition, typename RhsType, typename GuessType> class SolveWithGuess;
22 * \tparam Decomposition the type of the matrix or decomposion object
32 template<typename Decomposition, typename RhsType, typename GuessType>
33 struct traits<SolveWithGuess<Decomposition, RhsType, GuessType> >
34 : traits<Solve<Decomposition,RhsType> >
40 template<typename Decomposition, typename RhsType, typename GuessType>
41 class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type
46 typedef typename internal::generic_xpr_base<SolveWithGuess<Decomposition,RhsType,GuessType>, MatrixXpr, typename internal::traits<RhsType>::StorageKind>::type Base;
49 SolveWithGuess(const Decomposition &dec, const RhsType &rhs, const GuessType &guess)
56 EIGEN_DEVICE_FUNC const Decomposition& dec() const { return m_dec;
[all...] |
| /external/eigen/bench/btl/data/ |
| action_settings.txt | 11 cholesky ; "{/*1.5 Cholesky decomposition}" ; "matrix size" ; 4:5000
12 complete_lu_decomp ; "{/*1.5 Complete LU decomposition}" ; "matrix size" ; 4:5000
13 partial_lu_decomp ; "{/*1.5 Partial LU decomposition}" ; "matrix size" ; 4:5000
15 hessenberg ; "{/*1.5 Hessenberg decomposition}" ; "matrix size" ; 4:5000
|
| /external/eigen/doc/ |
| LeastSquares.dox | 10 The three methods discussed on this page are the SVD decomposition, the QR decomposition and normal
11 equations. Of these, the SVD decomposition is generally the most accurate but the slowest, normal
12 equations is the fastest but least accurate, and the QR decomposition is in between.
17 \section LeastSquaresSVD Using the SVD decomposition
21 this class); you also need the singular vectors but the thin SVD decomposition suffices for
35 \section LeastSquaresQR Using the QR decomposition
37 The solve() method in QR decomposition classes also computes the least squares solution. There are
38 three QR decomposition classes: HouseholderQR (no pivoting, so fast but unstable),
|
| TutorialLinearAlgebra.dox | 35 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for this tutorial, as it
41 <th>Decomposition</th>
117 choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a general
173 allows Eigen to avoid performing a LU decomposition, and instead use formulas that are more efficient on such small matrices.
186 The most accurate method to do least squares solving is with a SVD decomposition. Eigen provides one
198 Another methods, potentially faster but less reliable, are to use a Cholesky decomposition of the
199 normal matrix or a QR decomposition. Our page on \link LeastSquares least squares solving \endlink
205 In the above examples, the decomposition was computed at the same time that the decomposition object was constructed.
208 decomposition object
[all...] |
| /external/eigen/doc/examples/ |
| TutorialLinAlgComputeTwice.cpp | 15 cout << "Computing LLT decomposition..." << endl;
20 cout << "Computing LLT decomposition..." << endl;
|
| TutorialInplaceLU.cpp | 17 cout << "Here is the input matrix A before decomposition:\n" << A << endl;
22 cout << "Here is the input matrix A after decomposition:\n" << A << endl;
53 cout << "Here is the input matrix A1 after decomposition:\n" << A1 << endl;
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 34 * \tparam _MatrixType the type of the matrix of which we are computing the Hessenberg decomposition
36 * This class performs an Hessenberg decomposition of a matrix \f$ A \f$. In
37 * the real case, the Hessenberg decomposition consists of an orthogonal
41 * subdiagonal, so it is almost upper triangular. The Hessenberg decomposition
45 * Call the function compute() to compute the Hessenberg decomposition of a
48 * Hessenberg decomposition at construction time. Once the decomposition is
50 * the matrices H and Q in the decomposition.
89 /** \brief Default constructor; the decomposition will be computed later.
91 * \param [in] size The size of the matrix whose Hessenberg decomposition will be computed
[all...] |
| /external/eigen/Eigen/ |
| SparseQR | 16 * \brief Provides QR decomposition for sparse matrices
18 * This module provides a simplicial version of the left-looking Sparse QR decomposition.
20 * decomposition. Built-in methods (COLAMD, AMD) or external methods (METIS) can be used to this end.
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| ArabicCharacterData.java | 41 return decomposition;
55 decomposition = Normalizer.compose(UCharacter.toString(character), true);
59 decomposition = Normalizer.decompose(UCharacter.toString(character), true);
63 decomposition = null;
70 private String decomposition; field in class:ArabicCharacterData.Record
|
| DecompTable.java | 29 DecompEntry(int composedChar, String decomposition)
31 int decompCount = UTF16.countCodePoint(decomposition);
38 for (int in = 0; in < decomposition.length(); in += UTF16.getCharCount(cp)) {
39 cp = UTF16.charAt(decomposition, in);
106 public void add(int composed, String decomposition)
108 DecompEntry entry = new DecompEntry(composed, decomposition);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| ComposedCharIter.java | 35 * composed characters in Unicode. If the decomposition for that character
38 * its decomposition sequence.
51 * is a canonical decomposition.
90 * @param options Optional decomposition features. None are supported, so this is ignored.
134 * Returns the Unicode decomposition of the current character.
135 * This method returns the decomposition of the precomposed character most
136 * recently returned by {@link #next}. The resulting decomposition is
141 public String decomposition() { method in class:ComposedCharIter
142 // the decomposition buffer contains the decomposition of
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| ComposedCharIter.java | 34 * composed characters in Unicode. If the decomposition for that character
37 * its decomposition sequence.
50 * is a canonical decomposition.
88 * @param options Optional decomposition features. None are supported, so this is ignored.
132 * Returns the Unicode decomposition of the current character.
133 * This method returns the decomposition of the precomposed character most
134 * recently returned by {@link #next}. The resulting decomposition is
139 public String decomposition() { method in class:ComposedCharIter
140 // the decomposition buffer contains the decomposition of
[all...] |
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/unicode/norm/ |
| forminfo.go | 18 // For v < 0x8000, the respective rune has a decomposition and v is an index
19 // into a byte array of UTF-8 decomposition sequences and additional info and
22 // The header contains the number of bytes in the decomposition (excluding this
43 ccc uint8 // leading canonical combining class (ccc if not decomposition)
44 tccc uint8 // trailing canonical combining class (ccc if not decomposition)
99 // We assume that the CCC of the first character in a decomposition
115 // 2: NFD_QC Yes (0) or No (1). No also means there is a decomposition.
145 // Decomposition returns the decomposition for the underlying rune
147 func (p Properties) Decomposition() []byte
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/norm/ |
| forminfo.go | 18 // For v < 0x8000, the respective rune has a decomposition and v is an index
19 // into a byte array of UTF-8 decomposition sequences and additional info and
22 // The header contains the number of bytes in the decomposition (excluding this
43 ccc uint8 // leading canonical combining class (ccc if not decomposition)
44 tccc uint8 // trailing canonical combining class (ccc if not decomposition)
99 // We assume that the CCC of the first character in a decomposition
115 // 2: NFD_QC Yes (0) or No (1). No also means there is a decomposition.
145 // Decomposition returns the decomposition for the underlying rune
147 func (p Properties) Decomposition() []byte
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| CholeskyDecomposition.java | 23 * Cholesky decomposition of a real symmetric positive-definite matrix.
46 * Returns the matrix L of the decomposition.
53 * Returns the transpose of the matrix L of the decomposition.
55 * @return the transpose of the matrix L of the decomposition
|
| QRDecomposition.java | 23 * QR-decomposition of a real matrix.
42 * Returns the matrix R of the decomposition.
49 * Returns the matrix Q of the decomposition.
56 * Returns the transpose of the matrix Q of the decomposition.
|
