Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | bug #982: Make sure numext::maxi and numext::mini are called correctly, in ↵ | Christoph Hertzberg | 2015-03-30 |
| | | | | case Scalar expressions return expression templates. | ||
* | fix stupid warning with old GCC | Gael Guennebaud | 2015-03-28 |
| | |||
* | merge | Gael Guennebaud | 2015-03-28 |
|\ | |||
| * | bug #983: Pass Vector3 by const reference and not by value | Christoph Hertzberg | 2015-03-28 |
| | | |||
* | | Pass Vector3 type by reference | Gael Guennebaud | 2015-03-27 |
|/ | |||
* | merge | Gael Guennebaud | 2015-03-27 |
|\ | |||
* | | Slight numerical stability improvement in 2x2 svd | Gael Guennebaud | 2015-03-27 |
| | | |||
* | | Fix hypot(0,0). | Gael Guennebaud | 2015-03-27 |
| | | |||
| * | Fixed the CUDA packet primitives | Benoit Steiner | 2015-03-24 |
| | | |||
* | | Make MatrixBase::is* methods aware of nested_eval. | Gael Guennebaud | 2015-03-24 |
| | | |||
* | | D&C SVD: directly falls back to JacobiSVD for very small problems (by-pass ↵ | Gael Guennebaud | 2015-03-24 |
|/ | | | | upper-bidiagonalization) | ||
* | Avoid SVD: consider denormalized small numbers as zero when computing the ↵ | Gael Guennebaud | 2015-03-23 |
| | | | | rank of the matrix | ||
* | Update approx. minimum ordering method to push and keep structural empty ↵ | Gael Guennebaud | 2015-03-20 |
| | | | | diagonal elements to the bottom-right part of the matrix | ||
* | Fix MSVC compilation: aligned type must be passed by reference | Gael Guennebaud | 2015-03-19 |
| | |||
* | Fix comparison warning | Gael Guennebaud | 2015-03-19 |
| | |||
* | Improve random number generation for integer and add unit test | Gael Guennebaud | 2015-03-19 |
| | |||
* | use unsigned short instead of uint16_t which doesn't exist in c++98 | Benoit Jacob | 2015-03-17 |
| | |||
* | Similar to cset 3589a9c115a892ea3ca5dac74d71a1526764cb38 | Benoit Jacob | 2015-03-16 |
| | | | | , also in 2px4 kernel: actual_panel_rows computation should always be resilient to parameters not consistent with the known L1 cache size, see comment | ||
* | Include stdint.h. Not going for cstdint because it is a C++11 addition. ↵ | Benoit Jacob | 2015-03-16 |
| | | | | Needed for uint16_t at least, in lookup-table code. | ||
* | fix bug in maxsize calculation, which would cause products of size > 2048 to ↵ | Benoit Jacob | 2015-03-16 |
| | | | | address the lookup table out of bounds | ||
* | Update Nexus 5 lookup table from combining now 2 runs of the benchmark, ↵ | Benoit Jacob | 2015-03-16 |
| | | | | using the analyze-blocking-sizes partition tool. Gives better worst-case performance. | ||
* | fix compilation with GCC 4.8 | Benoit Jacob | 2015-03-16 |
| | |||
* | Fix bug in case where EIGEN_TEST_SPECIFIC_BLOCKING_SIZE is defined but false | Benoit Jacob | 2015-03-15 |
| | |||
* | Provide a empirical lookup table for blocking sizes measured on a Nexus 5. ↵ | Benoit Jacob | 2015-03-15 |
| | | | | Only for float, only for Android on ARM 32bit for now. | ||
* | actual_panel_rows computation should always be resilient to parameters not ↵ | Benoit Jacob | 2015-03-15 |
| | | | | consistent with the known L1 cache size, see comment | ||
* | Fix a unused-var warning | Benoit Jacob | 2015-03-15 |
| | |||
* | Refactor computeProductBlockingSizes to make room for the possibility of ↵ | Benoit Jacob | 2015-03-15 |
| | | | | using lookup tables | ||
* | organize a little our default cache sizes, and use a saner default L1 ↵ | Benoit Jacob | 2015-03-13 |
| | | | | outside of x86 (10% faster on Nexus 5) | ||
* | bug #973, improve AVX support by enabling vectorization of Vector4i-like ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | types, and enforcing alignement of Vector4f/Vector2d-like types to preserve compatibility with SSE and future Eigen versions that will vectorize them with AVX enabled. | ||
* | Fix internal::random(x,y) for integer types. The previous implementation ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | could return y+1. The new implementation uses rejection sampling to get an unbiased behabior. | ||
* | bug #949: add static assertion for incompatible scalar types in dense ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | end-user decompositions. | ||
* | SparseMatrix::insert: switch to a fully uncompressed mode if sequential ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | insertion is not possible (otherwise an arbitrary large amount of memory was preallocated in some cases) | ||
* | Bound pre-allocation to the maximal size representable by StorageIndex and ↵ | Gael Guennebaud | 2015-03-13 |
| | | | | throw bad_alloc if that's not possible. | ||
* | Add missing coeff/coeffRef members to Block<sparse>, and extend unit tests. | Gael Guennebaud | 2015-03-13 |
| | |||
* | Fix compilation of iterative solvers with dense matrices | Gael Guennebaud | 2015-03-09 |
| | |||
* | Add typedefs for return types of SparseMatrixBase::selfadjointView | Gael Guennebaud | 2015-03-09 |
| | |||
* | Add unit tests for CG and sparse-LLT for long int as storage-index | Gael Guennebaud | 2015-03-09 |
| | |||
* | bug #963: make IncompleteLUT compatible with non-default storage index types. | Gael Guennebaud | 2015-03-09 |
| | |||
* | Avoid undeflow when blocking size are tuned manually. | Gael Guennebaud | 2015-03-06 |
| | |||
* | bug #969: workaround abiguous calls to Ref using enable_if. | Gael Guennebaud | 2015-03-06 |
| | |||
* | bug #978: early return for vanishing products | Gael Guennebaud | 2015-03-06 |
| | |||
* | Improve blocking heuristic: if the lhs fit within L1, then block on the rhs ↵ | Gael Guennebaud | 2015-03-06 |
| | | | | in L1 (allows to keep packed rhs in L1) | ||
* | Improve product kernel: replace the previous dynamic loop swaping strategy ↵ | Gael Guennebaud | 2015-03-06 |
| | | | | | | by a more general one: It consists in increasing the actual number of rows of lhs's micro horizontal panel for small depth such that L1 cache is fully exploited. | ||
* | Rename LSCG to LeastSquaresConjugateGradient | Gael Guennebaud | 2015-03-05 |
| | |||
* | Product optimization: implement a dynamic loop-swapping startegy to improve ↵ | Gael Guennebaud | 2015-03-05 |
| | | | | memory accesses to the destination matrix in the case of K-rank-update like products, i.e., for products of the kind: "large x small" * "small x large" | ||
* | bug #824: improve accuracy of Quaternion::angularDistance using atan2 ↵ | Gael Guennebaud | 2015-03-04 |
| | | | | instead of acos. | ||
* | Really use zero guess in ConjugateGradients::solve as documented | Jan Blechta | 2015-02-18 |
| | | | | and expected for consistency with other methods. | ||
* | merge | Gael Guennebaud | 2015-03-04 |
|\ | |||
* | | Check for no-reallocation in SparseMatrix::insert (bug #974) | Gael Guennebaud | 2015-03-04 |
| | | |||
* | | Improve efficiency of SparseMatrix::insert/coeffRef for sequential ↵ | Gael Guennebaud | 2015-03-04 |
| | | | | | | | | outer-index insertion strategies (bug #974) |