| Commit message (Collapse) | Author | Age |
|
|
|
| |
speed for small matrices (hypot is very slow).
|
| |
|
| |
|
|
|
|
| |
chack with random tricky matrices
|
| |
|
| |
|
| |
|
|
|
|
| |
variables in the unit tests and also fix a few other warnings.
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
| |
header,
so let's declare them after and do the respective fixes ;)
|
| |
|
|
|
|
|
|
| |
mallocs after preallocation, with unit test.
* added EIGEN_RUNTIME_NO_MALLOC and new set_is_malloc_allowed() function to implement that test
|
| |
|
| |
|
|
|
|
| |
that involves a division by zero, even if the numeric type has floating point
|
| |
|
|
|
|
|
|
| |
* fix preallocating constructors, allocate U and V of the right size for computation options
* complete documentation and internal comments
* improve unit test, test inf/nan values
|
|
|
|
| |
extended precision
|
| |
|
| |
|
| |
|
|
|
|
| |
By default nothing is computed. You have to ask explicitly for thin/full U/V if you want them.
|
|
|
|
|
|
| |
There is now an integer QRPreconditioner template parameter, defaulting to full-piv QR.
Since we have to special-case each QR dec anyway, a template template parameter didn't add much value here.
There is an option NoQRPreconditioner if you know your matrices are already square (auto-detected for fixed-size matrices).
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
preallocates member data structures.
- Updated unit tests to check above constructor.
- In the compute() method of decompositions: Made temporary matrices/vectors class members to avoid heap allocations during compute() (when dynamic matrices are used, of course).
These changes can speed up decomposition computation time when a solver instance is used to solve multiple same-sized problems. An added benefit is that the compute() method can now be invoked in contexts were heap allocations are forbidden, such as in real-time control loops.
CAVEAT: Not all of the decompositions in the Eigenvalues module have a heap-allocation-free compute() method. A future patch may address this issue, but some required API changes need to be incorporated first.
|
|
|
|
|
| |
Fixed multiple overloads for operator=.
Removed debug output.
|
|
|
|
| |
I still have JacobiSVD errors when cols>rows
|
|
|
|
|
|
|
|
|
|
| |
* renaming, e.g. LU ---> FullPivLU
* split tests framework: more robust, e.g. dont generate empty tests if a number is skipped
* make all remaining tests use that splitting, as needed.
* Fix 4x4 inversion (see stable branch)
* Transform::inverse() and geo_transform test : adapt to new inverse() API, it was also trying to instantiate inverse() for 3x4 matrices.
* CMakeLists: more robust regexp to parse the version number
* misc fixes in unit tests
|
|
|
|
|
|
| |
Triadiagonalization and HessenbergDecomposition)
* rework a bit AnyMatrixBase, and mobe it to a separate file
|
|
|
|
|
|
|
| |
- R-SVD preconditioning now done with meta selectors to avoid compiling useless code
- SVD options now honored, with options to hint "at least as many rows as cols" etc...
- fix compilation in bad cases (rectangular and fixed-size)
- the check for termination is now done on the fly, no more goto (should have done that earlier!)
|
|
|
|
| |
any rectangular matrix size by reducing to the smaller of the two dimensions (which is also an optimization)
|
|
- support complex numbers
- big rewrite of the 2x2 kernel, much more robust
* Jacobi:
- fix weirdness in initial design, e.g. applyJacobiOnTheRight actually did the inverse transformation
- fully support complex numbers
- fix logic to decide whether to vectorize
- remove several clumsy methods
fix for complex numbers
|