Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | fix ei_add_property | 2011-11-12 | |
| | |||
* | optimize vectorized reductions by peeling the loop: | 2011-11-12 | |
| | | | | | | - x2 for squaredNorm() on double - peeling the loop with a peeling factor of 4 leads to even better perf for large vectors (e.g., >64) but it makes more difficult to keep good performance on smaller ones. | ||
* | fix performance issue with SPMV | 2011-11-11 | |
| | |||
* | merge with hauke/eigen-cdash-improvements branch | 2011-11-09 | |
|\ | |||
* | | [Core/Matrix] Fix: Clear the right typedef macro | 2011-11-09 | |
| | | |||
* | | reimplement abs2 not to use std::norm which is incredibly slow. | 2011-11-08 | |
| | | |||
* | | Add simple example on how to compute Cholesky decomposition. | 2011-11-07 | |
| | | |||
* | | Patches to support ARM NEON with Clang 3.0 and LLVM-GCC | 2011-11-04 | |
| | | |||
* | | Refactor force-inlining macros and use EIGEN_ALWAYS_INLINE to force inlining ↵ | 2011-11-06 | |
| | | | | | | | | of the integer overflow helpers, whose non-inlining caused major performance problems, see the mailing list thread 'Significant perf regression probably due to bug #363 patches' | ||
* | | Add test for Matrix(x, y) ctor static assert added in previous changeset | 2011-11-06 | |
| | | |||
* | | In the Matrix constructor taking (rows, cols), statically assert that the ↵ | 2011-11-05 | |
| | | | | | | | | | | | | types are integer. The 2D vector ctor taking (x, y) is not concerned. | ||
* | | fix a couple of warnings in the unit tests | 2011-11-05 | |
| | | |||
* | | Automatically produce a tgz archive of the documentation. | 2011-11-05 | |
| | | |||
* | | completely remove EIGEN_BUILD_BLAS_LAPACK option | 2011-11-05 | |
| | | |||
* | | fix compilation | 2011-11-05 | |
| | | |||
* | | remove deprecated assert | 2011-11-04 | |
| | | |||
* | | use runtest.sh script iif /bin/bash does exist | 2011-11-03 | |
| | | |||
* | | fix fftw cmake stuff | 2011-11-03 | |
| | | |||
* | | Allow for more iterations in SelfAdjointEigenSolver (bug #354). | 2011-11-02 | |
| | | | | | | | | | | Add an assert to guard against using eigenvalues that have not converged. Add call to info() in tutorial example to cover non-convergence. | ||
* | | Mention that the axis in AngleAxis have to be normalized. | 2011-11-01 | |
| | | |||
* | | bug #365 - Rename B0 in GeneralBlockPanelKernel.h to avoid name clash | 2011-10-31 | |
| | | | | | | | | with termios.h on POSIX systems. | ||
* | | bug #365 - Add test for non-usage of B0 | 2011-10-31 | |
| | | |||
* | | bug #369 - Quaternion alignment is broken | 2011-10-31 | |
| | | | | | | | | | | | | The problem was two-fold: * missing aligned operator new * Flags were mis-computed, the Aligned constant was misused | ||
* | | fix more variable-set-but-not-used warnings on gcc 4.6 | 2011-10-31 | |
| | | |||
* | | Fix some unused-variable warnings with GCC 4.6 | 2011-10-30 | |
| | | |||
* | | bug #206 - part 4: Removes heap allocations from JacobiSVD and its ↵ | 2011-10-30 | |
| | | | | | | | | preconditioners | ||
* | | bug #206 - part 3: Reimplement FullPivHouseholderQR<T>::matrixQ() using ↵ | 2011-03-08 | |
| | | | | | | | | ReturnByValue | ||
* | | bug #206 - part 2: For HouseholderSequence objects, added non-allocating ↵ | 2011-10-30 | |
| | | | | | | | | versions of evalTo() and applyThisOnTheRight/Left that take additional working vector parameters. | ||
* | | The most important inline keyword ever? Without it, gcc failed to inline ↵ | 2011-10-25 | |
| | | | | | | | | this function, which is called by all matrix constructors... | ||
* | | remove the MSVC specific blas/lapack option | 2011-10-24 | |
| | | |||
* | | hopefully this workaround of cmake bug #9220 works for MSVC too | 2011-10-24 | |
| | | |||
* | | update sparse*sparse product: the default is now a conservative algorithm ↵ | 2011-10-24 | |
| | | | | | | | | preserving symbolic non zeros. The previous with auto pruning of the small value is avaible doing: (A*B).pruned() or (A*B).pruned(ref) or (A*B).pruned(ref,eps) | ||
* | | mark deprecated sparse solvers as so. | 2011-10-24 | |
| | | |||
* | | add the possiibility to disable deprectated warnings (useful for deprecated ↵ | 2011-10-24 | |
| | | | | | | | | unit tests!) | ||
* | | factorize solving with guess | 2011-10-24 | |
| | | |||
* | | move DynamicSparseMatrix to SparseExtra | 2011-10-24 | |
| | | |||
* | | move the blas.h header to blas/ and remove declaration of function returning ↵ | 2011-10-19 | |
| | | | | | | | | a complex | ||
* | | forgot inline keyword | 2011-10-17 | |
| | | |||
* | | Throw std::bad_alloc even when exceptions are disabled, by doing new ↵ | 2011-10-17 | |
| | | | | | | | | | | | | | | int[size_t(-1)]. Don't throw exceptions on aligned_malloc(0) (just because malloc's retval is null doesn't mean error, if size==0). Remove EIGEN_NO_EXCEPTIONS option, use only compiler standard defines. Either exceptions are enabled or they aren't. | ||
* | | bug #363 - add test for integer overflow in size computations | 2011-10-16 | |
| | | |||
* | | bug #363 - check for integer overflow in size=rows*cols computations | 2011-10-16 | |
| | | |||
* | | bug #363 - check for integer overflow in byte-size computations | 2011-10-16 | |
| | | |||
* | | update the decomposition catalogue | 2011-10-14 | |
| | | |||
* | | add a basic ILU preconditioner | 2011-10-11 | |
| | | |||
* | | fix sparse tri-solve for full matrices | 2011-10-11 | |
| | | |||
* | | extend BiCGSTAB to arbitrary rhs | 2011-10-11 | |
| | | |||
* | | add proper bicgstab unit test | 2011-10-11 | |
| | | |||
* | | add a unit test for permutation applied to sparse objects | 2011-10-11 | |
| | | |||
* | | refactor sparse solving unit tests | 2011-10-11 | |
| | | |||
* | | extend SimplicialCholesky for sparse rhs, and add determinant | 2011-10-11 | |
| | |