| Commit message (Collapse) | Author | Age |
... | |
| |
| |
| |
| | |
*remove unused var warning
|
| |
| |
| |
| |
| |
| | |
division instead of RCPPS-followed-by-Newton-Raphson. The rationale for that is
that elsewhere in Eigen we dont allow ourselves this approximation (which throws
2 bits of mantissa), so there's no reason we should allow it here.
|
| |
| |
| |
| | |
of a namespace instead of Prefix_Name.
|
| |
| |
| |
| |
| |
| | |
disabled.
All unimplemented assignment operators have been removed.
|
| | |
|
| | |
|
| | |
|
| |
| |
| |
| | |
Silenced (amongst others) many conversion related warnings.
|
| | |
|
| | |
|
| |
| |
| |
| |
| |
| |
| | |
* inverse tests: use createRandomMatrixOfRank, use more strict precision
* tests: createRandomMatrixOfRank: support 1x1 matrices
* determinant: nest the xpr
* Minor: add comment
|
| |
| |
| |
| |
| |
| |
| |
| | |
* remove non-existant reference to CwiseAll
* define \householder_module (used in HouseholderSequence.h)
* update I01_TopicLazyEvaluation.dox - Product is now called GeneralProduct
* remove reference to list of examples which was deleted ages ago
* rename PartialLU_solve.cpp snippet to PartialPivLU_solve.cpp
|
| | |
|
| | |
|
| |\ |
|
| |/ |
|
| | |
|
| |
| |
| |
| |
| |
| |
| | |
* be aware of number of actual householder vectors
(optimization in non-full-rank case, no behavior change)
* fix applyThisOnTheRight, it was using k instead of actual_k
* QR: rename matrixQ() to householderQ() where applicable
|
| | |
|
| |\ |
|
| | |
| | |
| | |
| | | |
compatibility.
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | | |
* with random matrices multiplied by 1e+8 (i.e. fixed wrong absolute fuzzy compare)
* with 10,000 repetitions (i.e. the fuzzy compare is really clever)
and when it occasionnally fails, less than once in 10,000 repeats, it is only on the exact rank computation.
|
| | |
| | |
| | |
| | | |
thousands of repetitions and correctly tests matrices of all sizes. Several surprises along the way: for example, a major cause of trouble was the optimized "table of column squared norms" where the accumulation of imprecision was a serious issue; another surprise is that tests like "x!=0" before dividing by x really benefit from being replaced by fuzzy tests, as i hit real cases where i got wrong results in 1/epsilon.
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| | | |
|
| |/ |
|
| | |
|
| |
| |
| |
| | |
+ rudimentary test
|
| | |
|
| | |
|
| |
| |
| |
| |
| | |
* change block selection threshold from 1e-2 to 1e-1
* add rigorous precision test
|
| |
| |
| |
| | |
Sorry for this messy commit but I have to commit it...
|
| |
| |
| |
| |
| |
| | |
because thanks to the previous commit this is not needed anymore
* add a more general ForceAlignedAccess expression which can be used for any expression.
It is already used by StableNorm.h.
|
| |
| |
| |
| |
| |
| | |
Add an internal pseudo expression allowing to optimize operators like +=, *= using
the copyCoeff stuff.
This allows to easily enforce aligned load for the destination matrix everywhere.
|
| |
| |
| |
| | |
* expand unit tests to make sure to catch them: they nearly escaped the existing tests as these memory violations were highly dependent on the numbers of rows and cols.
|
| | |
|
| |
| |
| |
| | |
* remove buggy (superfluous?) specialization in the meta-unroller
|
| | |
|
| |
| |
| |
| |
| | |
* bump version to 2.91.0
* add FindEigen3.cmake
|
| | |
|
| | |
|
| |
| |
| |
| |
| | |
* old bug: in CwiseBinaryOp: only set the LinearAccessBit if both sides have the same storage order.
* new bug: in Assign.h, only consider linear traversal if both sides have the same storage order.
|