| Commit message (Collapse) | Author | Age |
... | |
|
|
|
|
|
|
| |
decomposition classes. One particular advantage of this is that decomposing matrices with max sizes known at compile time will not allocate.
NOTE: The ComplexEigenSolver class currently _does_ allocate (line 135 of Eigenvalues/ComplexEigenSolver.h), but the reason appears to be in the implementation of matrix-matrix products, and not in the decomposition itself.
The nomalloc unit test has been extended to verify that decompositions do not allocate when max sizes are specified. There are currently two workarounds to prevent the test from failing (see comments in test/nomalloc.cpp), both of which are related to matrix products that allocate on the stack.
|
|
|
|
|
|
| |
ReturnByValue col-vector
* remove a few useless resize() in evalTo() implementations
|
|
|
|
| |
Removed a useless Nested temporary.
|
| |
|
|\ |
|
| |
| |
| |
| |
| |
| |
| |
| | |
* use them (big simplification in Assign.h)
* axe (Inner|Outer)StrideAtCompileTime that were just introduced
* ei_int_if_dynamic now asserts that the size is the expected one: adapt to that in Block.h
* add rowStride() / colStride() in DenseBase
* implement innerStride() / outerStride() everywhere needed
|
| | |
|
| |
| |
| |
| |
| | |
=> they show that some improvements have still to be done
for permutations, tr*tr, trapezoidal matrices
|
| |
| |
| |
| |
| |
| | |
not even with huge numbers of repetitions.
Finally the createRandomMatrixOfRank() function is renamed to createRandomPIMatrixOfRank, where PI stands for 'partial isometry', that is, a matrix whose singular values are 0 or 1.
|
| |
| |
| |
| |
| |
| |
| |
| |
| | |
fuzzy compare
(fixes lu test failures when testing solve())
* LU test: set appropriate threshold and limit the number of times that a specially tricky test
is run. (fixes lu test failures when testing rank()).
* Tests: rename createRandomMatrixOfRank to createRandomProjectionOfRank
|
| | |
|
|/
|
|
| |
Renamed ReturnByValue::ReturnMatrixType ReturnByValue::ReturnType (again, Array != Matrix).
|
| |
|
|
|
|
| |
* make NumTraits inherits std::numeric_limits
|
|
|
|
|
|
| |
related to nested products.
Fixed a few typos and a few warnings.
|
| |
|
| |
|
| |
|
| |
|
|
|
|
| |
and remove the respective bit flags
|
|\ |
|
| |
| |
| |
| |
| |
| | |
start ---> head
end ---> tail
Much frustration with sed syntax. Need to learn perl some day.
|
| | |
|
|\| |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
| |
| |
| | |
*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.
|
| |
| |
| |
| |
| |
| | |
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
|
| |\ |
|
| | | |
|
| | | |
|
| |/ |
|
| |
| |
| |
| |
| | |
* change block selection threshold from 1e-2 to 1e-1
* add rigorous precision test
|
| |
| |
| |
| |
| |
| | |
* add a new Eigen2Support module including Cwise, Flagged, and some other deprecated stuff
* add a few cwiseXxx functions
* adapt a few modules to use cwiseXxx instead of the .cwise() prefix
|
| | |
|
| |
| |
| |
| | |
LU: make use of that
|
| | |
|
|/
|
|
| |
PermutationMatrix: add resize()
|
|
|
|
| |
and fix various compilation issues
|
| |
|
| |
|
| |
|
|
|
|
| |
put them in a new internal 'misc' directory
|
| |
|