Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | Correct bug in SPQR backend and replace matrixQR by matrixR | 2013-01-29 | |
| | |||
* | Change int to Index type for SparseLU | 2013-01-29 | |
| | |||
* | Merged local branch with main trunk | 2013-01-25 | |
|\ | |||
| * | add support for solving with sparse right hand side | 2013-01-25 | |
| | | |||
* | | Check that NeedsToAlign is properly sets before checking alignment | 2013-01-24 | |
|/ | |||
* | Fix test for Metis | 2013-01-21 | |
| | |||
* | Test for the sparse Blue norm | 2013-01-21 | |
| | |||
* | Unit test for the Metis Ordering package | 2013-01-21 | |
| | |||
* | Fix traits of Map<Quaternion>, and respectively extend the unit tests | 2013-01-20 | |
| | |||
* | Add a sparse QR factorization and update the elimination tree in SparseLU | 2013-01-11 | |
| | |||
* | Check that minCoeff(int*)/maxCoeff(int*) always pick the first entry in case ↵ | 2013-01-05 | |
| | | | | of multiple extrema. | ||
* | Make sure sqrt and the likes are not compiled for integer type in cwiseop ↵ | 2012-12-20 | |
| | | | | unit test. | ||
* | Move work in progress Levenberg Marquardt module in unsupported | 2012-12-08 | |
| | |||
* | Add tests for dense and sparse levenberg-Marquardt | 2012-12-07 | |
| | |||
* | Update SPQR module for Sparse LM | 2012-11-21 | |
| | |||
* | Remove Sparse/InnerVectorSet expression in favor of a more general Block<> ↵ | 2012-11-16 | |
| | | | | | | specialization for Sparse expression. The specializations for "InnerPanels" are still preserved for efficiency reasons and because they offer additional usefull features. | ||
* | Add support for Sparse QR factorization | 2012-11-12 | |
| | |||
* | Fix bug #314: | 2012-11-06 | |
| | | | | | - remove most of the metaprogramming kung fu in MathFunctions.h (only keep functions that differs from the std) - remove the overloads for array expression that were in the std namespace | ||
* | fix dense=sparse*diagonal (there was an issue in the values returned by the ↵ | 2012-10-03 | |
| | | | | .outer() function of the related iterators) | ||
* | extend unit tests to check rectangular matrices for sparse*diagonal products | 2012-10-02 | |
| | |||
* | add scalar multiple to diagonal matrices | 2012-09-27 | |
| | | | | | (transplanted from dc5b335f9fbc25b15a408d8b1458a0140c0a8248 ) | ||
* | fix compilation with m.array().min/max(scalar) | 2012-09-12 | |
| | |||
* | merge Sparse LU branch | 2012-09-07 | |
|\ | |||
* | | forward resize() function from Array/Matrix-Wrapper to the nested expression ↵ | 2012-08-30 | |
| | | | | | | | | such that mat.array().resize(a,b) is now allowed. | ||
* | | Fix out-of-range memory access in GEMV (the memory was not used for the ↵ | 2012-08-30 | |
| | | | | | | | | | | | | | | computation, only to assemble unaligned packets from aligned packet loads) (transplanted from 221f54698c2f6690da8c0f44c1e31e55118dedab ) | ||
| * | Add unit tests | 2012-08-03 | |
| | | |||
* | | Eigenvalues module: Implement setMaxIterations() methods. | 2012-07-28 | |
| | | |||
* | | Add a preliminary GeneralizedEigenSolver computing the eigenvalues of Av=lBv ↵ | 2012-07-26 | |
| | | | | | | | | | | | | with A and B general real matrices. Currently only the eigenvalues are reported. | ||
* | | Fix aliasing issue in sparse matrix assignment. | 2012-07-25 | |
| | | | | | | | | (m=-m; or m=m.transpose(); with m sparse work again) | ||
* | | real QZ: update license | 2012-07-24 | |
| | | |||
* | | Add a RealQZ class: a generalized Schur decomposition for real matrices | 2012-07-11 | |
| | | |||
* | | Allow user to specify max number of iterations (bug #479). | 2012-07-24 | |
| | | |||
* | | LDLT: Report sign consistent with D for indefinite matrices. | 2012-07-22 | |
| | | | | | | | | See http://forum.kde.org/viewtopic.php?f=74&t=106942 | ||
* | | bug #449: add SparseMatrix::conservativeResize feature | 2012-07-19 | |
| | | |||
* | | remove outdated "Eigen itself is part of the KDE project" outside of eigen2 ↵ | 2012-07-15 | |
| | | | | | | | | files | ||
* | | Manual MPL2 relicensing fixes | 2012-07-13 | |
| | | |||
* | | Automatic relicensing to MPL2 using Keirs script. Manual fixup follows. | 2012-07-13 | |
| | | |||
* | | Add a DynamicIndex constant for signed quantities and use it to fix the conflict | 2012-07-10 | |
| | | | | | | | | | | between Diagonal<S,-1> (the first sub diagonal) and a runtime super/sub diagonal which is now: Diagonal<S,DynamicIndex> | ||
* | | fix computation of fixed size sub/super diagonal size | 2012-07-10 | |
| | | |||
* | | fix bug #487: isometry * scaling was not compiling | 2012-07-04 | |
| | | |||
* | | Make product eval-at-once. | 2012-06-29 | |
| | | | | | | | | | | | | | | | | | | * Make product EvalAtOnce in cases OuterProduct, GemmProduct and GemvProduct * Ensure that product evaluators are nested inside EvalToTemp evaluator * As temporary kludge, evaluate expression to temporary in AllAtOnce traversal and pass expression operator to evalTo() | ||
* | | Implement interface for NoAlias assignments. | 2012-06-29 | |
| | | | | | | | | | | | | | | | | * Rename the old copy_using_evaluators to noalias_copy_using_evaluators. * Write a new copy_using_evaluators which strips NoAlias expression, if present, and calls noalias_copy_using_evaluators; in future, it will also take care of aliasing in products. * Add expression() getter to NoAlias. | ||
* | | Move (part of) evaluation of products to evaluator objects. | 2012-06-29 | |
| | | | | | | | | | | | | | | * Copy implementation from CoeffBasedProduct. * Copy implementation from GeneralProduct in InnerProduct case. * For GeneralProduct in other cases, call the evalTo() member function with expression objects in constructor of evaluator. | ||
* | | Resize lhs automatically in copy_using_evaluator(). | 2012-06-28 | |
| | | |||
* | | remove dynamic allocation for fixed size object and triangular matrix-matrix ↵ | 2012-06-26 | |
| | | | | | | | | products | ||
* | | Fix an evaluator test which was wrong and failed in debug builds. | 2012-06-24 | |
| | | |||
* | | resurrect expression evaluators | 2012-06-22 | |
| | | |||
* | | comment two tests in nomalloc (there is no regression here, it's just I've ↵ | 2012-06-20 | |
| | | | | | | | | been too optimistic when adding them recently) | ||
* | | fix a few warnings | 2012-06-15 | |
| | | |||
* | | extend nomalloc unit test to test the solve calls | 2012-06-12 | |
| | |