Commit message (Collapse) | Author | Age | ||
---|---|---|---|---|
... | ||||
* | | Made sure the code compiles when EIGEN_HAS_C99_MATH isn't defined | 2016-02-03 | ||
| | | ||||
* | | Added a few comments | 2016-02-03 | ||
| | | ||||
* | | Properly disable nvcc warning messages in user code. | 2016-02-03 | ||
| | | ||||
* | | Revert the nvcc messages to their default severity instead of the forcing ↵ | 2016-02-03 | ||
| | | | | | | | | them to be warnings | |||
* | | Pulled latest updates from trunk | 2016-02-03 | ||
|\ \ | ||||
* | | | Silenced some unhelpful warnings generated by nvcc. | 2016-02-03 | ||
| | | | ||||
| * | | Merged in rmlarsen/eigen (pull request PR-161) | 2016-02-03 | ||
|/| | | | | | | | | | | | Change Eigen's ColPivHouseholderQR to use numerically stable norm downdate formula | |||
| * | | Fix bad line break. Don't repeat Kahan matrix test since it is deterministic. | 2016-02-03 | ||
| | | | ||||
| * | | Make the array of directly compute column norms a member to avoid allocation ↵ | 2016-02-03 | ||
| | | | | | | | | | | | | in computeInPlace. | |||
* | | | bug #1161: fix division by zero for huge scalar types | 2016-02-03 | ||
| | | | ||||
* | | | bug #1164: fix list and deque specializations such that our aligned ↵ | 2016-02-03 | ||
| | | | | | | | | | | | | allocator is automatically activatived only when the user did not specified an allocator (or specified the default std::allocator). | |||
* | | | Clarify error message when writing to a read-only sparse-sub-matrix. | 2016-02-03 | ||
| | | | ||||
| * | | merging. | 2016-02-01 | ||
| |\ \ | |/ / |/| | | ||||
* | | | bug #694: document that SparseQR::matrixR is not sorted. | 2016-02-01 | ||
| | | | ||||
* | | | bug #557: make InnerIterator of sparse storage types more versatile by ↵ | 2016-02-01 | ||
| | | | | | | | | | | | | adding default-ctor, copy-ctor/assignment | |||
* | | | Fix integer path for num_steps==1 | 2016-02-01 | ||
| | | | ||||
* | | | bug #698: fix linspaced for integer types. | 2016-02-01 | ||
| | | | ||||
* | | | Fix warning and replace min/max macros by calls to mini/maxi | 2016-02-01 | ||
| | | | ||||
* | | | Fixed compilation errors triggered by duplicate inline declaration | 2016-01-31 | ||
| | | | ||||
* | | | bug #667: declare several critical functions as FORECE_INLINE to make ICC ↵ | 2016-01-31 | ||
| | | | | | | | | | | | | | | | | | | | | | happier. <g.gael@free.fr> HG: branch 'default' HG: changed Eigen/src/Core/ArrayBase.h HG: changed Eigen/src/Core/AssignEvaluator.h HG: changed Eigen/src/Core/CoreEvaluators.h HG: changed Eigen/src/Core/CwiseUnaryOp.h HG: changed Eigen/src/Core/DenseBase.h HG: changed Eigen/src/Core/MatrixBase.h | |||
* | | | backout changeset d4a9e615699bd7f26864d57d2b28021b9f64b6ff | 2016-01-30 | ||
| | | | | | | | | | | | | : the extended SparseView is not needed anymore | |||
* | | | bug #632: implement general coefficient-wise "dense op sparse" operations ↵ | 2016-01-30 | ||
| | | | | | | | | | | | | | | | | | | through specialized evaluators instead of using SparseView. This permits to deal with arbitrary storage order, and to by-pass the more complex iterator of the sparse-sparse case. | |||
* | | | bug #946: generalize Cholmod::solve to handle any rhs expression | 2016-01-29 | ||
| | | | ||||
* | | | bug #632: add support for "dense +/- sparse" operations. The current ↵ | 2016-01-29 | ||
| | | | | | | | | | | | | implementation is based on SparseView to make the dense subexpression compatible with the sparse one. | |||
* | | | Extend SparseView to allow keeping explicit zeros. This is equivalent to ↵ | 2016-01-29 | ||
| | | | | | | | | | | | | sparseView(1,-1) but faster because the test is removed at compile-time. | |||
* | | | bug #696: enable zero-sized block at compile-time by relaxing the respective ↵ | 2016-01-29 | ||
| | | | | | | | | | | | | assertion | |||
* | | | merge | 2016-01-29 | ||
|\ \ \ | ||||
* | | | | Fixed compilation warning | 2016-01-28 | ||
| | | | | ||||
| * | | | Making ceil() functor generic w.r.t packet type | 2016-01-28 | ||
|/ / / | ||||
| * / | Change Eigen's ColPivHouseholderQR to use the numerically stable norm ↵ | 2016-01-28 | ||
|/ / | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | downdate formula from http://www.netlib.org/lapack/lawnspdf/lawn176.pdf, which has been used in LAPACK's xGEQPF and xGEQP3 since 2006. With the old formula, the code chooses the wrong pivots and fails to correctly determine rank on graded matrices. This change also adds additional checks for non-increasing diagonal in R11 to existing unit tests, and adds a new unit test with the Kahan matrix, which consistently fails for the original code. Benchmark timings on Intel(R) Xeon(R) CPU E5-1650 v3 @ 3.50GHz. Code compiled with AVX & FMA. I just ran on square matrices of 3 difference sizes. Benchmark Time(ns) CPU(ns) Iterations ------------------------------------------------------- Before: BM_EigencolPivQR/64 53677 53627 12890 BM_EigencolPivQR/512 15265408 15250784 46 BM_EigencolPivQR/4k 15403556228 15388788368 2 After (non-vectorized version): Benchmark Time(ns) CPU(ns) Iterations Degradation -------------------------------------------------------------------- BM_EigencolPivQR/64 63736 63669 10844 18.5% BM_EigencolPivQR/512 16052546 16037381 43 5.1% BM_EigencolPivQR/4k 15149263620 15132025316 2 -2.0% Performance-wise there seems to be a ~18.5% degradation for small (64x64) matrices, probably due to the cost of more O(min(m,n)^2) sqrt operations that are not needed for the unstable formula. | |||
* | | bug #178: get rid of some const_cast in SparseCore | 2016-01-28 | ||
| | | ||||
* | | bug #178: remove additional const on nested expression, and remove several ↵ | 2016-01-28 | ||
| | | | | | | | | const_cast. | |||
* | | Fix compilation with gcc | 2016-01-28 | ||
| | | ||||
* | | merge | 2016-01-28 | ||
|\ \ | ||||
* | | | bug #1158: PartialReduxExpr is a vector expression, and it thus must expose ↵ | 2016-01-28 | ||
| | | | | | | | | | | | | the LinearAccessBit flag | |||
* | | | Disable stupid MSVC warning | 2016-01-28 | ||
| | | | ||||
* | | | Fix MSVC warning. | 2016-01-28 | ||
| | | | ||||
* | | | bug #96, bug #1006: fix by value argument in result_of. | 2016-01-28 | ||
| | | | ||||
* | | | Fixed some compilation problems with nvcc + clang | 2016-01-27 | ||
| | | | ||||
* | | | Update link to suitesparse. | 2016-01-27 | ||
| | | | ||||
| * | | digamma special function: merge shared code. | 2016-01-27 | ||
| | | | | | | | | | | | | Moved type-specific code into a helper class digamma_impl_maybe_poly<Scalar>. | |||
* | | | bug #1156: fix several function declarations whose arguments were passed by ↵ | 2016-01-27 | ||
| | | | | | | | | | | | | value instead of being passed by reference | |||
* | | | bug #1154: move to dynamic scheduling for spmv products. | 2016-01-27 | ||
| | | | ||||
* | | | Fix tri = complex * real product, and add respective unit test. | 2016-01-27 | ||
| | | | ||||
* | | | Add meta_least_common_multiple helper. | 2016-01-27 | ||
| | | | ||||
* | | | Extend doc on shifting strategy | 2016-01-27 | ||
| | | | ||||
* | | | Remove dead code. | 2016-01-26 | ||
| | | | ||||
* | | | Re-enable blocking on rows in non-l3 blocking mode. | 2016-01-26 | ||
| | | | ||||
* | | | Make sure that micro-panel-size is smaller than blocking sizes (otherwise we ↵ | 2016-01-26 | ||
| | | | | | | | | | | | | might get a buffer overflow) | |||
* | | | Make sure that block sizes are smaller than input matrix sizes. | 2016-01-26 | ||
| | | |