Christoph Hertzberg
|
09a5361d1b
|
bug #983: Pass Vector3 by const reference and not by value
|
2015-03-28 12:36:24 +01:00 |
|
Gael Guennebaud
|
79cb875249
|
merge
|
2015-03-27 10:56:04 +01:00 |
|
Gael Guennebaud
|
1b8cc9af43
|
Slight numerical stability improvement in 2x2 svd
|
2015-03-27 10:55:00 +01:00 |
|
Gael Guennebaud
|
3d59ae0203
|
Fix hypot(0,0).
|
2015-03-27 09:59:24 +01:00 |
|
Benoit Steiner
|
abdbe8562e
|
Fixed the CUDA packet primitives
|
2015-03-24 10:45:46 -07:00 |
|
Gael Guennebaud
|
29eaa2b0f1
|
Make MatrixBase::is* methods aware of nested_eval.
|
2015-03-24 13:42:42 +01:00 |
|
Gael Guennebaud
|
d27968eb7e
|
D&C SVD: directly falls back to JacobiSVD for very small problems (by-pass upper-bidiagonalization)
|
2015-03-24 13:38:07 +01:00 |
|
Gael Guennebaud
|
4472f3e578
|
Avoid SVD: consider denormalized small numbers as zero when computing the rank of the matrix
|
2015-03-23 09:40:21 +01:00 |
|
Gael Guennebaud
|
4e2b18d909
|
Update approx. minimum ordering method to push and keep structural empty diagonal elements to the bottom-right part of the matrix
|
2015-03-20 16:33:48 +01:00 |
|
Gael Guennebaud
|
d6b2f300db
|
Fix MSVC compilation: aligned type must be passed by reference
|
2015-03-19 17:28:32 +01:00 |
|
Gael Guennebaud
|
61c45d7cfd
|
Fix comparison warning
|
2015-03-19 17:13:22 +01:00 |
|
Gael Guennebaud
|
f329d0908a
|
Improve random number generation for integer and add unit test
|
2015-03-19 15:10:36 +01:00 |
|
Benoit Jacob
|
dc04f12967
|
use unsigned short instead of uint16_t which doesn't exist in c++98
|
2015-03-17 10:31:45 -04:00 |
|
Benoit Jacob
|
364cfd529d
|
Similar to cset 3589a9c115
, also in 2px4 kernel: actual_panel_rows computation should always be resilient to parameters not consistent with the known L1 cache size, see comment
|
2015-03-16 16:28:44 -04:00 |
|
Benoit Jacob
|
577056aa94
|
Include stdint.h. Not going for cstdint because it is a C++11 addition. Needed for uint16_t at least, in lookup-table code.
|
2015-03-16 16:21:50 -04:00 |
|
Benoit Jacob
|
eb6929cb19
|
fix bug in maxsize calculation, which would cause products of size > 2048 to address the lookup table out of bounds
|
2015-03-16 16:15:47 -04:00 |
|
Benoit Jacob
|
35c3a8bb84
|
Update Nexus 5 lookup table from combining now 2 runs of the benchmark, using the analyze-blocking-sizes partition tool. Gives better worst-case performance.
|
2015-03-16 11:05:51 -04:00 |
|
Benoit Jacob
|
e274607d7f
|
fix compilation with GCC 4.8
|
2015-03-16 10:48:27 -04:00 |
|
Benoit Jacob
|
151b8b95c6
|
Fix bug in case where EIGEN_TEST_SPECIFIC_BLOCKING_SIZE is defined but false
|
2015-03-15 19:10:51 -04:00 |
|
Benoit Jacob
|
02babb9c0f
|
Provide a empirical lookup table for blocking sizes measured on a Nexus 5. Only for float, only for Android on ARM 32bit for now.
|
2015-03-15 18:13:12 -04:00 |
|
Benoit Jacob
|
3589a9c115
|
actual_panel_rows computation should always be resilient to parameters not consistent with the known L1 cache size, see comment
|
2015-03-15 18:12:18 -04:00 |
|
Benoit Jacob
|
1dd3d89818
|
Fix a unused-var warning
|
2015-03-15 18:07:19 -04:00 |
|
Benoit Jacob
|
e56aabf205
|
Refactor computeProductBlockingSizes to make room for the possibility of using lookup tables
|
2015-03-15 18:05:12 -04:00 |
|
Benoit Jacob
|
488c15615a
|
organize a little our default cache sizes, and use a saner default L1 outside of x86 (10% faster on Nexus 5)
|
2015-03-13 14:51:26 -07:00 |
|
Gael Guennebaud
|
1330f8bbd1
|
bug #973, improve AVX support by enabling vectorization of Vector4i-like 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.
|
2015-03-13 21:15:50 +01:00 |
|
Gael Guennebaud
|
d99ab35f9e
|
Fix internal::random(x,y) for integer types. The previous implementation could return y+1. The new implementation uses rejection sampling to get an unbiased behabior.
|
2015-03-13 21:12:46 +01:00 |
|
Gael Guennebaud
|
8580eb6808
|
bug #949: add static assertion for incompatible scalar types in dense end-user decompositions.
|
2015-03-13 21:06:20 +01:00 |
|
Gael Guennebaud
|
a9df28c95b
|
SparseMatrix::insert: switch to a fully uncompressed mode if sequential insertion is not possible (otherwise an arbitrary large amount of memory was preallocated in some cases)
|
2015-03-13 21:00:21 +01:00 |
|
Gael Guennebaud
|
5ffe29cb9f
|
Bound pre-allocation to the maximal size representable by StorageIndex and throw bad_alloc if that's not possible.
|
2015-03-13 20:57:33 +01:00 |
|
Gael Guennebaud
|
2f6f8bf31c
|
Add missing coeff/coeffRef members to Block<sparse>, and extend unit tests.
|
2015-03-13 16:24:40 +01:00 |
|
Gael Guennebaud
|
fd78874888
|
Fix compilation of iterative solvers with dense matrices
|
2015-03-09 21:31:03 +01:00 |
|
Gael Guennebaud
|
d4317a85e8
|
Add typedefs for return types of SparseMatrixBase::selfadjointView
|
2015-03-09 21:29:46 +01:00 |
|
Gael Guennebaud
|
9e885fb766
|
Add unit tests for CG and sparse-LLT for long int as storage-index
|
2015-03-09 14:33:15 +01:00 |
|
Gael Guennebaud
|
224a1fe4c6
|
bug #963: make IncompleteLUT compatible with non-default storage index types.
|
2015-03-09 13:55:20 +01:00 |
|
Gael Guennebaud
|
0ee391863e
|
Avoid undeflow when blocking size are tuned manually.
|
2015-03-06 21:51:09 +01:00 |
|
Gael Guennebaud
|
14a5f135a3
|
bug #969: workaround abiguous calls to Ref using enable_if.
|
2015-03-06 17:51:31 +01:00 |
|
Gael Guennebaud
|
87681e508f
|
bug #978: early return for vanishing products
|
2015-03-06 16:11:22 +01:00 |
|
Gael Guennebaud
|
cd3bbffa73
|
Improve blocking heuristic: if the lhs fit within L1, then block on the rhs in L1 (allows to keep packed rhs in L1)
|
2015-03-06 14:31:39 +01:00 |
|
Gael Guennebaud
|
58740ce4c6
|
Improve product kernel: replace the previous dynamic loop swaping strategy 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.
|
2015-03-06 10:30:35 +01:00 |
|
Gael Guennebaud
|
4c8b95d5c5
|
Rename LSCG to LeastSquaresConjugateGradient
|
2015-03-05 10:16:32 +01:00 |
|
Gael Guennebaud
|
7550107028
|
Product optimization: implement a dynamic loop-swapping startegy to improve 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"
|
2015-03-05 10:03:46 +01:00 |
|
Gael Guennebaud
|
2dc968e453
|
bug #824: improve accuracy of Quaternion::angularDistance using atan2 instead of acos.
|
2015-03-04 17:03:13 +01:00 |
|
Jan Blechta
|
168ceb271e
|
Really use zero guess in ConjugateGradients::solve as documented
and expected for consistency with other methods.
|
2015-02-18 14:26:10 +01:00 |
|
Gael Guennebaud
|
8fdcaded5e
|
merge
|
2015-03-04 10:18:08 +01:00 |
|
Gael Guennebaud
|
c43154bbc5
|
Check for no-reallocation in SparseMatrix::insert (bug #974)
|
2015-03-04 10:16:46 +01:00 |
|
Gael Guennebaud
|
1ce0178363
|
Improve efficiency of SparseMatrix::insert/coeffRef for sequential outer-index insertion strategies (bug #974)
|
2015-03-04 09:39:26 +01:00 |
|
Gael Guennebaud
|
3dca4a1efc
|
Update manual wrt new LSCG solver.
|
2015-03-04 09:35:30 +01:00 |
|
Gael Guennebaud
|
05274219a7
|
Add a CG-based solver for rectangular least-square problems (bug #975).
|
2015-03-04 09:34:27 +01:00 |
|
Benoit Jacob
|
2aa09e6b4e
|
Fix asm comments in 1px1 kernel
|
2015-03-03 13:44:00 -05:00 |
|
Benoit Jacob
|
eae8e27b7d
|
Add a benchmark-default-sizes action to benchmark-blocking-sizes.cpp
|
2015-03-03 11:41:21 -05:00 |
|