Commit message (Collapse) | Author | Age | ||
---|---|---|---|---|
... | ||||
* | Fix regression: .conjugate() was popped out but not re-introduced. | 2019-02-18 | ||
| | ||||
* | Set cost of conjugate to 0 (in practice it boils down to a no-op). | 2019-02-18 | ||
| | | | | | This is also important to make sure that A.conjugate() * B.conjugate() does not evaluate its arguments into temporaries (e.g., if A and B are fixed and small, or * fall back to lazyProduct) | |||
* | GEMM: catch all scalar-multiple variants when falling-back to a coeff-based ↵ | 2019-02-18 | ||
| | | | | | | | product. Before only s*A*B was caught which was both inconsistent with GEMM, sub-optimal, and could even lead to compilation-errors (https://stackoverflow.com/questions/54738495). | |||
* | Enable unit tests of PartialPivLU on fixed size matrices, and increase ↵ | 2019-02-11 | ||
| | | | | tested matrix size (blocking was not tested!) | |||
* | bug #1669: fix PartialPivLU/inverse with zero-sized matrices. | 2019-01-29 | ||
| | ||||
* | bug #1574: implement "sparse_matrix =,+=,-= diagonal_matrix" with smart ↵ | 2019-01-28 | ||
| | | | | insertion strategies of missing diagonal coeffs. | |||
* | bug #1672: fix unit test compilation with MSVC by adding overloads of ↵ | 2019-01-28 | ||
| | | | | test_is* for long long (and factorize copy/paste code through a macro) | |||
* | Avoid `I` as an identifier, since it may clash with the C-header complex.h | 2019-01-25 | ||
| | ||||
* | More thoroughly check variadic template ctor of fixed-size vectors | 2019-01-24 | ||
| | ||||
* | PR 572: Add initializer list constructors to Matrix and Array (include unit ↵ | 2019-01-21 | ||
| | | | | | | | | tests and doc) - {1,2,3,4,5,...} for fixed-size vectors only - {{1,2,3},{4,5,6}} for the general cases - {{1,2,3,4,5,....}} is allowed for both row and column-vector | |||
* | Add more extensive tests of Array ctors, including {} variants | 2019-01-22 | ||
| | ||||
* | Fix compilation of unit tests with gcc and c++17 | 2019-01-18 | ||
| | ||||
* | After fixing bug #1557, boostmultiprec_7 failed with NumericalIssue instead ↵ | 2019-01-17 | ||
| | | | | of NoConvergence (all that matters here is no Success) | |||
* | Make nestByValue works again (broken since 3.3) and add unit tests. | 2019-01-17 | ||
| | ||||
* | Extend reshaped unit tests and remove useless const_cast | 2019-01-17 | ||
| | ||||
* | Cleanup useless const_cast and add missing broadcast assignment tests | 2019-01-17 | ||
| | ||||
* | Boosttest only available for Boost version >= 1.53.0 | 2019-01-17 | ||
| | ||||
* | PR 567: makes all dense solvers inherit SoverBase (LU,Cholesky,QR,SVD). | 2019-01-17 | ||
| | | | | | | | | | | | | | This changeset also includes: * add HouseholderSequence::conjugateIf * define int as the StorageIndex type for all dense solvers * dedicated unit tests, including assertion checking * _check_solve_assertion(): this method can be implemented in derived solver classes to implement custom checks * CompleteOrthogonalDecompositions: add applyZOnTheLeftInPlace, fix scalar type in applyZAdjointOnTheLeftInPlace(), add missing assertions * Cholesky: add missing assertions * FullPivHouseholderQR: Corrected Scalar type in _solve_impl() * BDCSVD: Unambiguous return type for ternary operator * SVDBase: Corrected Scalar type in _solve_impl() | |||
* | Add conjugateIf<bool> members to DesneBase, TriangularView, SelfadjointView, ↵ | 2019-01-17 | ||
| | | | | and make PartialPivLU use it. | |||
* | Remove Eigen2ToEigen3 migration page (obsolete since 3.3) | 2019-01-16 | ||
| | ||||
* | bug #1617: add unit tests for empty triangular solve. | 2019-01-16 | ||
| | ||||
* | bug #1646: disable aliasing detection for empty and 1x1 expression | 2019-01-16 | ||
| | ||||
* | Make Transform::rotation() an alias to Transform::linear() in the case of an ↵ | 2019-01-15 | ||
| | | | | Isometry | |||
* | Enable visitor on empty matrices (the visitor is left unchanged), and ↵ | 2019-01-15 | ||
| | | | | protect min/maxCoeff(Index*,Index*) on empty matrices by an assertion (+ doc & unit tests) | |||
* | bug #1592: makes partial min/max reductions trigger an assertion on inputs ↵ | 2019-01-15 | ||
| | | | | with a zero reduction length (+doc and tests) | |||
* | Fix detection of vector-at-time: use Rows/Cols instead of MaxRow/MaxCols. | 2019-01-15 | ||
| | | | | This fix VectorXd(n).middleCol(0,0).outerSize() which was equal to 1. | |||
* | fix always true warning with gcc 4.7 | 2019-01-15 | ||
| | ||||
* | cleanup | 2019-01-15 | ||
| | ||||
* | Merged eigen/eigen into default | 2019-01-14 | ||
|\ | ||||
| * | AVX512 (r)sqrt(double) was mistakenly disabled with clang and others | 2019-01-14 | ||
| | | ||||
| * | Initialize isometric transforms like affine transforms. | 2019-01-11 | ||
| | | | | | | | | | | | | The isometric transform, like the affine transform, has an implicit last row of [0, 0, 0, 1]. This was not being properly initialized, as verified by a new test function. | |||
| * | Fix StorageIndex FIXME in dense LU solvers | 2019-01-13 | ||
| | | ||||
* | | Add support for inverse hyperbolic functions. | 2019-01-11 | ||
|/ | | | | Fix cost of division. | |||
* | Rename pones -> ptrue. Use _CMP_TRUE_UQ where appropriate. | 2019-01-09 | ||
|\ | ||||
* | | Collapsed revision | 2019-01-09 | ||
| | | | | | | | | | | | | | | | | | | * Collapsed revision * Add packet up "pones". Write pnot(a) as pxor(pones(a), a). * Collapsed revision * Simplify a bit. * Undo useless diffs. * Fix typo. | |||
| * | Add packet up "pones". Write pnot(a) as pxor(pones(a), a). | 2019-01-09 | ||
|/ | ||||
* | Merged eigen/eigen into default | 2019-01-09 | ||
|\ | ||||
| * | bug #1652: implements a much more accurate version of vectorized sin/cos. ↵ | 2019-01-09 | ||
| | | | | | | | | | | | | | | This new version achieve same speed for SSE/AVX, and is slightly faster with FMA. Guarantees are as follows: - no FMA: 1ULP up to 3pi, 2ULP up to sin(25966) and cos(18838), fallback to std::sin/cos for larger inputs - FMA: 1ULP up to sin(117435.992) and cos(71476.0625), fallback to std::sin/cos for larger inputs | |||
* | | Add support for pcmp_eq and pnot, including for complex types. | 2019-01-07 | ||
|/ | ||||
* | Fix unit test | 2018-12-27 | ||
| | ||||
* | Implement a faster fix for sin/cos of large entries that also correctly ↵ | 2018-12-23 | ||
| | | | | handle INF input. | |||
* | Make sure that psin/pcos return number in [-1,1] for large inputs (though ↵ | 2018-12-23 | ||
| | | | | sin/cos on large entries is quite useless because it's inaccurate) | |||
* | Fix plog(+INF): it returned ~87 instead of +INF | 2018-12-23 | ||
| | ||||
* | Add regression test for bug #1174 | 2018-12-12 | ||
| | ||||
* | bug #1557: fix RealSchur and EigenSolver for matrices with only zeros on the ↵ | 2018-12-12 | ||
| | | | | diagonal. | |||
* | Simplify handling of tests that must fail to compile. | 2018-12-12 | ||
| | | | | Each test is now a normal ctest target, and build properties (compiler+flags) are preserved (instead of starting a new build-dir from scratch). | |||
* | bug #1641: fix testing of pandnot and fix pandnot for complex on SSE/AVX/AVX512 | 2018-12-08 | ||
| | ||||
* | Fix noise in sparse_basic_3 (numerical cancellation) | 2018-12-08 | ||
| | ||||
* | Fix noise in lu unit test | 2018-12-08 | ||
| | ||||
* | fix test regarding AVX512 vectorization of complexes. | 2018-12-06 | ||
| |