Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | improve SYMV it is now faster and ready for use | 2009-07-23 | |
| | |||
* | formating | 2009-07-23 | |
| | |||
* | addd matrix * self adjoint high level API | 2009-07-23 | |
| | |||
* | bugfix in SYMM | 2009-07-22 | |
| | |||
* | implement high level API for SYMM and fix a couple of bugs related to complex | 2009-07-22 | |
| | |||
* | * GEMM enhencement: no need to pre-transpose the rhs | 2009-07-22 | |
| | | | | | | | => faster a * b.transpose() product => this also fix a bug in a so far untested situation * SYMM is now ready for use => still have to write the high level stuff to convert natural expressions into a call to SYMM | ||
* | more refactoring in the level3 products | 2009-07-22 | |
| | |||
* | * refactoring of the matrix product into multiple small kernels | 2009-07-21 | |
| | | | | | * started an efficient selfadjoint matrix * general matrix product based on the generic kernels ( => need a very little LOC) | ||
* | * various fixes related to sub diagonals and band matrix | 2009-07-21 | |
| | | | | * allows 0 sized objects in Block/Map | ||
* | * bugfixes in Product, and test/product_selfadjoint | 2009-07-16 | |
| | | | | * speed up in the extraction of the matrix Q in Tridiagonalization | ||
* | synch with main devel branch | 2009-07-15 | |
|\ | |||
* | | add a TridiagonalMatrix wrapper arround BandMatrix, and extend this latter | 2009-07-15 | |
| | | |||
* | | add BandMatrix::col() | 2009-07-15 | |
| | | |||
* | | change the implementation of BandMatrix to follow the BLAS/LAPACK storage scheme | 2009-07-15 | |
| | | |||
| * | fix issue #25 : the problem was that we assumed Dynamic was a multiple of a ↵ | 2009-07-15 | |
| | | | | | | | | | | | | packet size (also disable the test of blueNorm) | ||
* | | started an implementation of BandMatrix: at least the read/write access | 2009-07-14 | |
| | | | | | | | | to the main/sub/super diagonals seems to work well. | ||
* | | synch with main devel branch | 2009-07-14 | |
|\ \ | |||
| | * | fix typo in blue norm | 2009-07-14 | |
| |/ | |||
* | | some cleaning/renaming is Triangular/SelfadjointView | 2009-07-14 | |
| | | |||
| * | add a blueNorm() function implementing the Blues's stable norm | 2009-07-13 | |
| | | | | | | | | | | algorithm. it is currently provided for experimentation purpose only. | ||
| * | one more fix of the previous commit (forgot to update ei_must_nest_by_value) | 2009-07-13 | |
| | | |||
| * | fix typo in previous commit | 2009-07-13 | |
| | | |||
| * | add a SparseNestByValue expression and fix issue in sparse adjoint evaluation | 2009-07-13 | |
| | | |||
* | | add triangular * vector product | 2009-07-13 | |
| | | |||
* | | Add an efficient rank2 update function (like the level2 blas xSYR2 routine). | 2009-07-11 | |
| | | | | | | | | Note that it is already used in Tridiagonalization. | ||
| * | more sun studio fixes | 2009-07-10 | |
| | | |||
| * | Set of fixes and workaround to make sun studio more happy. | 2009-07-10 | |
| | | | | | | | | Still remains the problem of alignment and vectorization. | ||
* | | add a meta unroller for the triangular solver (only for vectors as rhs) | 2009-07-10 | |
| | | |||
* | | finally directly calling the low-level products is faster | 2009-07-10 | |
| | | |||
| * | merge | 2009-07-10 | |
| |\ | |||
| * | | slight change in the comparison to -1 | 2009-07-10 | |
| | | | |||
* | | | commit woking versions of triangular solvers naturally | 2009-07-09 | |
| | | | | | | | | | | | | | | | | | | 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... | ||
* | | | started to simplify the triangular solvers | 2009-07-09 | |
| | | | |||
* | | | ok now all the complex mat-mat and mat-vec products involving conjugate, | 2009-07-08 | |
| | | | | | | | | | | | | | | | adjoint, -, and scalar multiple seems to be well handled. It only remains the simpler case: C = alpha*(A*B) ... for the next commit | ||
* | | | conjugate expressions are now properly caught by Product | 2009-07-07 | |
| | | | | | | | | | | | | | | | => significant speedup in expr. like a.adjoint() * b, for complex scalar type (~ x3) | ||
* | | | started to catch scalar multiple and conjugate xpr in Product | 2009-07-07 | |
| | | | |||
* | | | * change the nesting order of adjoint_return_type to | 2009-07-07 | |
| | | | | | | | | | | | | | | | | | | 1 - make it easier to catch conjugate expressions 2 - make sure there is no unecessary copy (we had NestByValue<Derived> which seems to be very bad) * update eigensolver wrt recent changes | ||
* | | | * take advantage of new possibilies in LLT (mat -= product) | 2009-07-07 | |
| | | | | | | | | | | | | | | | * fix Block::operator+= product which was not optimized * fix some compilation issues | ||
* | | | * extended the cache friendly products to support C = alpha * A * M and C += ↵ | 2009-07-07 | |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | 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 | ||
* | | | add a generic mechanism to copy a special matrix to a dense matrix so that | 2009-07-07 | |
| | | | | | | | | | | | | | | | we don't need to add other specialization of MatrixBase::operator=, Matrix::=, and Matrix::Matrix(...) | ||
* | | | * bybye Part, welcome TriangularView and SelfAdjointView. | 2009-07-06 | |
| | | | | | | | | | | | | | | | | | | | | | | | | * move solveTriangular*() to TriangularView::solve*() * move .llt() to SelfAdjointView * add a high level wrapper to the efficient selfadjoint * vector product * improve LLT so that we can specify which triangular part is meaningless => there are still many things to do (doc, cleaning, improve the matrix products, etc.) | ||
| | * | add matrixQR() method exposing the storage. that's where the householder ↵ | 2009-07-06 | |
| | | | | | | | | | | | | thing impacts the API. | ||
| | * | fix some search-and-replace damage | 2009-07-06 | |
| | | | |||
| | * | * rename QR to HouseholderQR because really that impacts the API, not just ↵ | 2009-07-06 | |
| | | | | | | | | | | | | | | | | | | | | | | | | the impl. * rename qr() to householderQr(), for same reason. * clarify that it's non-pivoting, non-rank-revealing, so remove all the rank API, make solve() be void instead of bool, update the docs/test, etc. * fix warning in SVD | ||
| * | | include the fixes of the third edition | 2009-07-06 | |
| |/ | |||
| * | quick reimplementation of SVD from the numeral recipes book: | 2009-07-06 | |
| | | | | | | | | | | | | this is still not Eigen style code but at least it works for n>m and it is more accurate than the JAMA based version. (I needed it now, this is why I did that) | ||
| * | switch from eigensolver to SVD which seems to be more accurate with float | 2009-07-06 | |
| | | |||
| * | significantly improve the accuracy of setFromTwoVectors (fixes #21) | 2009-07-06 | |
| | | |||
| * | fix doc of Quaternion::setFromTwoVectors | 2009-07-06 | |
| | | |||
| * | add a VectorBlock expr as a specialization of Block | 2009-07-05 | |
| | |