| Commit message (Collapse) | Author | Age |
|---|
| |
|
|
| |
Note that it is already used in Tridiagonalization.
|
| |
|
|
|
|
| |
handling conjuagted expression. still have to bench whether it
is faster (runtime and compile time) to directly call the
cache friendly functions, whence all the commented piece of code...
|
| | |
|
| |
|
|
|
| |
adjoint, -, and scalar multiple seems to be well handled. It only remains
the simpler case: C = alpha*(A*B) ... for the next commit
|
| |
|
|
|
|
|
|
|
| |
alpha * A * B
* this allows to optimize xpr like C -= lazy_product, still have to catch "scalar_product_of_lazy_product"
* started to support conjugate in cache friendly products (very useful to evaluate A * B.adjoint() without
evaluating B.adjoint() into a temporary
* compilation fix
|
| |
|
|
| |
it never made very precise sense. but now does it still make any?
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
| |
* add Homogeneous expression for vector and set of vectors (aka matrix)
=> the next step will be to overload operator*
* add homogeneous normalization (again for vector and set of vectors)
* add a Replicate expression (with uni-directional replication
facilities)
=> for all of them I'll add examples once we agree on the API
* fix gcc-4.4 warnings
* rename reverse.cpp array_reverse.cpp
|
|
|
* add an efficient selfadjoint * vector implementation (= blas symv)
perf are inbetween MKL and GOTO
=> the interface is still missing (have to be rethougth)
|
Gael Guennebaud
Benoit Jacob