aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src
Commit message (Collapse)AuthorAge
...
| * | mergeGravatar Gael Guennebaud2015-03-28
| |\ \
| | * | bug #983: Pass Vector3 by const reference and not by valueGravatar Christoph Hertzberg2015-03-28
| | | |
| * | | Pass Vector3 type by referenceGravatar Gael Guennebaud2015-03-27
| |/ /
| * | mergeGravatar Gael Guennebaud2015-03-27
| |\ \
| * | | Slight numerical stability improvement in 2x2 svdGravatar Gael Guennebaud2015-03-27
| | | |
| * | | Fix hypot(0,0).Gravatar Gael Guennebaud2015-03-27
| | | |
* | | | Pulled latest update from the eigen main codebaseGravatar Benoit Steiner2015-03-24
|\ \ \ \ | | |/ / | |/| |
| * | | Fixed the CUDA packet primitivesGravatar Benoit Steiner2015-03-24
| | | |
| | * | Make MatrixBase::is* methods aware of nested_eval.Gravatar Gael Guennebaud2015-03-24
| | | |
| | * | D&C SVD: directly falls back to JacobiSVD for very small problems (by-pass ↵Gravatar Gael Guennebaud2015-03-24
| |/ / | | | | | | | | | upper-bidiagonalization)
| * | Avoid SVD: consider denormalized small numbers as zero when computing the ↵Gravatar Gael Guennebaud2015-03-23
| | | | | | | | | | | | rank of the matrix
| * | Update approx. minimum ordering method to push and keep structural empty ↵Gravatar Gael Guennebaud2015-03-20
| | | | | | | | | | | | diagonal elements to the bottom-right part of the matrix
| * | Fix MSVC compilation: aligned type must be passed by referenceGravatar Gael Guennebaud2015-03-19
| | |
| * | Fix comparison warningGravatar Gael Guennebaud2015-03-19
| | |
| * | Improve random number generation for integer and add unit testGravatar Gael Guennebaud2015-03-19
| | |
| * | use unsigned short instead of uint16_t which doesn't exist in c++98Gravatar Benoit Jacob2015-03-17
| | |
| * | Similar to cset 3589a9c115a892ea3ca5dac74d71a1526764cb38Gravatar Benoit Jacob2015-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
| * | fix bug in maxsize calculation, which would cause products of size > 2048 to ↵Gravatar Benoit Jacob2015-03-16
| | | | | | | | | | | | address the lookup table out of bounds
| * | Update Nexus 5 lookup table from combining now 2 runs of the benchmark, ↵Gravatar Benoit Jacob2015-03-16
| | | | | | | | | | | | using the analyze-blocking-sizes partition tool. Gives better worst-case performance.
| * | fix compilation with GCC 4.8Gravatar Benoit Jacob2015-03-16
| | |
| * | Fix bug in case where EIGEN_TEST_SPECIFIC_BLOCKING_SIZE is defined but falseGravatar Benoit Jacob2015-03-15
| | |
| * | Provide a empirical lookup table for blocking sizes measured on a Nexus 5. ↵Gravatar Benoit Jacob2015-03-15
| | | | | | | | | | | | Only for float, only for Android on ARM 32bit for now.
| * | actual_panel_rows computation should always be resilient to parameters not ↵Gravatar Benoit Jacob2015-03-15
| | | | | | | | | | | | consistent with the known L1 cache size, see comment
| * | Fix a unused-var warningGravatar Benoit Jacob2015-03-15
| | |
| * | Refactor computeProductBlockingSizes to make room for the possibility of ↵Gravatar Benoit Jacob2015-03-15
| | | | | | | | | | | | using lookup tables
| * | organize a little our default cache sizes, and use a saner default L1 ↵Gravatar Benoit Jacob2015-03-13
| | | | | | | | | | | | outside of x86 (10% faster on Nexus 5)
| * | bug #973, improve AVX support by enabling vectorization of Vector4i-like ↵Gravatar Gael Guennebaud2015-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 ↵Gravatar Gael Guennebaud2015-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 ↵Gravatar Gael Guennebaud2015-03-13
| | | | | | | | | | | | end-user decompositions.
| * | SparseMatrix::insert: switch to a fully uncompressed mode if sequential ↵Gravatar Gael Guennebaud2015-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 ↵Gravatar Gael Guennebaud2015-03-13
| | | | | | | | | | | | throw bad_alloc if that's not possible.
| * | Add missing coeff/coeffRef members to Block<sparse>, and extend unit tests.Gravatar Gael Guennebaud2015-03-13
| | |
| | * Fix bug in pdiv<Packet1cd> which swaps 32-bit halves of a pair ofGravatar Doug Kwan2015-03-11
| |/ | | | | | | doubles instead of swapping the doubles.
| * Fix compilation of iterative solvers with dense matricesGravatar Gael Guennebaud2015-03-09
| |
| * Add typedefs for return types of SparseMatrixBase::selfadjointViewGravatar Gael Guennebaud2015-03-09
| |
| * Add unit tests for CG and sparse-LLT for long int as storage-indexGravatar Gael Guennebaud2015-03-09
| |
| * bug #963: make IncompleteLUT compatible with non-default storage index types.Gravatar Gael Guennebaud2015-03-09
| |
| * Avoid undeflow when blocking size are tuned manually.Gravatar Gael Guennebaud2015-03-06
| |
| * bug #969: workaround abiguous calls to Ref using enable_if.Gravatar Gael Guennebaud2015-03-06
| |
| * bug #978: early return for vanishing productsGravatar Gael Guennebaud2015-03-06
| |
| * Improve blocking heuristic: if the lhs fit within L1, then block on the rhs ↵Gravatar Gael Guennebaud2015-03-06
| | | | | | | | in L1 (allows to keep packed rhs in L1)
| * Improve product kernel: replace the previous dynamic loop swaping strategy ↵Gravatar Gael Guennebaud2015-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 LeastSquaresConjugateGradientGravatar Gael Guennebaud2015-03-05
| |
| * Product optimization: implement a dynamic loop-swapping startegy to improve ↵Gravatar Gael Guennebaud2015-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 ↵Gravatar Gael Guennebaud2015-03-04
| | | | | | | | instead of acos.
* | Fixed the optimized AVX implementation of the fast rsqrt functionGravatar Benoit Steiner2015-03-02
| |
* | Added an optimized version of rsqrt for SSE and AVX that is used when ↵Gravatar Benoit Steiner2015-03-02
| | | | | | | | EIGEN_FAST_MATH is defined.
* | Improved the default implementation of prsqrtGravatar Benoit Steiner2015-02-28
| |
* | Pulled latest updates from trunkGravatar Benoit Steiner2015-02-27
|\ \
* | | Added support for 32bit index on a per tensor/tensor expression. This ↵Gravatar Benoit Steiner2015-02-27
| | | | | | | | | | | | enables us to use 32bit indices to evaluate expressions on GPU faster while keeping the ability to use 64 bit indices to manipulate large tensors on CPU in the same binary.
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-04 07:09:03 +0000