Lines Matching refs:decomposition

35 Here, ColPivHouseholderQR is a QR decomposition with column pivoting. It's a good compromise for th…
117 choice is then the LLT or LDLT decomposition. Here's an example, also demonstrating that using a ge…
173 allows Eigen to avoid performing a LU decomposition, and instead use formulas that are more efficie…
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 objec…
208 decomposition object.
213     on an already-computed decomposition, reinitializing it.
225 Finally, you can tell the decomposition constructor to preallocate storage for decomposing matrices…
228 passing the size to the decomposition constructor, as in this example:
256 on the decomposition but is typically the diagonal size times machine epsilon. While this is the be…
258 on your decomposition object before calling rank() or any other method that needs to use such a thr…
259 The decomposition itself, i.e. the compute() method, is independent of the threshold. You don't nee…
260 decomposition after you've changed the threshold.