Commit message (Collapse) | Author | Age | ||
---|---|---|---|---|
... | ||||
| * | | Define sparseLU functions as static | Desire NUENTSA | 2012-09-25 | |
| | | | ||||
| | * | some clean-up and new comments. | giacomo po | 2012-09-24 | |
| | | | ||||
* | | | Remove unnecessary code. lazyAssign seems to fix all (noalias, ↵ | Chen-Pang He | 2012-09-24 | |
| | | | | | | | | | | | | initialization, etc.) | |||
| | * | Some minor optimization. | giacomo po | 2012-09-24 | |
| | | | ||||
| | * | moved MINRES to unsupported. Made unit test. | giacomo po | 2012-09-24 | |
| | | | ||||
* | | | Remove class MatrixPowerEvaluator with enhanced existing ↵ | Chen-Pang He | 2012-09-23 | |
| | | | | | | | | | | | | MatrixPowerReturnValue to simplicity, but docs are not completed yet. | |||
* | | | Fix bug in MatrixPower(expression) due to destruction of temporary objects. ↵ | Chen-Pang He | 2012-09-23 | |
| | | | | | | | | | | | | Sorry for ugly pointer manipulation but it prevents copying a PlainObject. | |||
| | * | working preconditioned MINRES solver | giacomo po | 2012-09-22 | |
| | | | ||||
* | | | Eliminate unnecessary evaluations | Chen-Pang He | 2012-09-23 | |
| | | | ||||
* | | | Avoid inefficient 2x2 LU | Chen-Pang He | 2012-09-22 | |
| | | | ||||
* | | | Fix my typo in MatrixPowerBase.h, no effect on the flow. | Chen-Pang He | 2012-09-22 | |
| | | | ||||
* | | | Fix cost evaluation. (chain product for integral power) | Chen-Pang He | 2012-09-22 | |
| | | | ||||
| * | | Make Ref<> suitable for both Matrix and Array kinds. Note that Matrix kind ↵ | Gael Guennebaud | 2012-09-22 | |
| | | | | | | | | | | | | objects can be implicitely converted to an Array kind Ref<> and vice versa | |||
* | | | Implement matrix power-matrix product again | Chen-Pang He | 2012-09-22 | |
| | | | ||||
* | | | Enable saving intermidiate (Schur decomposition) but disable unstable ↵ | Chen-Pang He | 2012-09-21 | |
| | | | | | | | | | | | | specialization for matrix power-matrix product. | |||
| * | | Improve BiCGSTAB : With exact preconditioner, the solution should be found ↵ | Desire NUENTSA | 2012-09-19 | |
| | | | | | | | | | | | | in one iteration | |||
* | | | Optimize matrix functions: m_fT is triangular and trmm is faster than gemm | Chen-Pang He | 2012-09-16 | |
| | | | ||||
| * | | workaround weird compilation error with MSVC | Gael Guennebaud | 2012-09-14 | |
| | | | ||||
| * | | fix compilation with m.array().min/max(scalar) | Gael Guennebaud | 2012-09-12 | |
| | | | ||||
| * | | Merged in jdh8/eigen (pull request PR-17) | Gael Guennebaud | 2012-09-11 | |
| |\ \ | |/ / |/| | | ||||
| * | | fix compilation on freebsd | Gael Guennebaud | 2012-09-11 | |
| | | | ||||
| * | | Incomplete Cholesky preconditioner... not yet stable | Desire NUENTSA | 2012-09-11 | |
| | | | ||||
| * | | Replace COPYING.LGPL by a copy of the LGPL 2.1 (instead of LGPL 3). | Benoit Jacob | 2012-09-10 | |
| | | | | | | | | | | | | Indeed, all the LGPL code we use, is licensed under LGPL 2.1 (with some files being "2.1 or later"). | |||
| * | | Clean the Colamd routine and add test for sparselu code | Desire NUENTSA | 2012-09-10 | |
| |\ \ | ||||
| | * | | Clean the Colamd routine | Desire NUENTSA | 2012-09-10 | |
| | | | | ||||
| | * | | add SparseLU in sparse bench | Desire NUENTSA | 2012-09-10 | |
| | | | | ||||
* | | | | Fix rank-1 update for self-adjoint packed matrices. | Chen-Pang He | 2012-09-10 | |
| | | | | ||||
* | | | | Implement packed triangular solver. | Chen-Pang He | 2012-09-10 | |
| | | | | ||||
* | | | | Implement packed triangular matrix-vector product. | Chen-Pang He | 2012-09-09 | |
| | | | | ||||
* | | | | Use conj_expr_if to clarify what it's doing. | Chen-Pang He | 2012-09-09 | |
| | | | | ||||
* | | | | Extend rank-1 updates for different storage orders. | Chen-Pang He | 2012-09-09 | |
| | | | | ||||
* | | | | Implement rank-1 update for self-adjoint packed matrices. | Chen-Pang He | 2012-09-08 | |
| | | | | ||||
* | | | | Simplify Rank2Update.h | Chen-Pang He | 2012-09-08 | |
| | | | | ||||
* | | | | Comment FIXMEs on Rank2Update.h and remove unused files. | Chen-Pang He | 2012-09-08 | |
| | | | | ||||
| * | | | Merged in jdh8/eigen (pull request PR-16) | Gael Guennebaud | 2012-09-08 | |
| |\ \ \ | ||||
| * | | | | fix bug #501: remove aggressive mat/scalar optimization (was replaced by ↵ | Gael Guennebaud | 2012-09-08 | |
| | | | | | | | | | | | | | | | | | | | | mat*(1/scalar) for non integer types) | |||
* | | | | | Implement rank-2 update for packed matrices. | Chen-Pang He | 2012-09-08 | |
| | | | | | ||||
* | | | | | Perform direct calls in xHEMV and xSYMV. | Chen-Pang He | 2012-09-08 | |
| |/ / / |/| | | | ||||
| * | | | remove stupid assert in blue norm. | Gael Guennebaud | 2012-09-07 | |
| |/ / | ||||
* | | | Implement SDSDOT with DSDOT and avoid allocating buffers in DSDOT. | Chen-Pang He | 2012-09-08 | |
| | | | ||||
* | | | Implement functors for rank-1 and rank-2 update. | Chen-Pang He | 2012-09-08 | |
| | | | ||||
| * | | multiple warnings for unused variable | Desire NUENTSA | 2012-09-07 | |
| | | | ||||
| * | | merge Sparse LU branch | Desire NUENTSA | 2012-09-07 | |
| |\ \ | ||||
| | * | | Add tutorial for sparse solvers | Desire NUENTSA | 2012-09-07 | |
| | | | | ||||
* | | | | Fix memory leak in DSDOT. | Chen-Pang He | 2012-09-07 | |
| | | | | ||||
* | | | | BLAS: implement DSDOT and SDSDOT; update test for them. | Chen-Pang He | 2012-09-05 | |
| | | | | ||||
| | * | | Init perf values | Desire NUENTSA | 2012-09-04 | |
| | | | | ||||
| | * | | correct bug in Blas 3 2D block update | Desire NUENTSA | 2012-09-04 | |
| | | | | ||||
| | * | | Bug in blas 3 2D block update | Desire NUENTSA | 2012-09-03 | |
| | | | | ||||
| * | | | Insert XSL styles into output XML files | Desire NUENTSA | 2012-09-03 | |
| | | | |