aboutsummaryrefslogtreecommitdiffhomepage
path: root/test
Commit message (Collapse)AuthorAge
* mergeGravatar Benoit Jacob2010-04-23
|\
| * restrict operator[] to vectors, not matrices.Gravatar Benoit Jacob2010-04-23
| |
* | add minor to Eigen2SupportGravatar Benoit Jacob2010-04-22
| |
* | remove MinorGravatar Benoit Jacob2010-04-22
| | | | | | | | adapt 3x3 and 4x4 (non-SSE) inverse paths
* | * fix Eigen2Support, was not including VectorBlock.hGravatar Benoit Jacob2010-04-22
| | | | | | | | | | * move the corners support stuff to a new Block.h there * expand the unit test
* | * implement the corner() API change: new methods topLeftCorner() etcGravatar Benoit Jacob2010-04-22
|/ | | | | | | | * get rid of BlockReturnType: it was not needed, and code was not always using it consistently anyway * add topRows(), leftCols(), bottomRows(), rightCols() * add corners unit-test covering all of that * adapt docs, expand "porting from eigen 2 to 3" * adapt Eigen2Support
* - Added problem size constructor to decompositions that did not have one. It ↵Gravatar Adolfo Rodriguez Tsouroukdissian2010-04-21
| | | | | | | | | | | preallocates member data structures. - Updated unit tests to check above constructor. - In the compute() method of decompositions: Made temporary matrices/vectors class members to avoid heap allocations during compute() (when dynamic matrices are used, of course). These changes can speed up decomposition computation time when a solver instance is used to solve multiple same-sized problems. An added benefit is that the compute() method can now be invoked in contexts were heap allocations are forbidden, such as in real-time control loops. CAVEAT: Not all of the decompositions in the Eigenvalues module have a heap-allocation-free compute() method. A future patch may address this issue, but some required API changes need to be incorporated first.
* shut up stupid gcc 4.5.0 warningGravatar Benoit Jacob2010-04-18
|
* Added support for STL lists with aligned Eigen types.Gravatar Hauke Heibel2010-04-18
|
* fix ei_blas_traits directaccess check: in the case of vectors, having a ↵Gravatar Benoit Jacob2010-04-16
| | | | nontrivial inner stride is OK.
* * add some 1x1 testsGravatar Benoit Jacob2010-04-16
| | | | * temporarily disable tests that strangely fail, with a big FIXME
* * merge with mainlineGravatar Benoit Jacob2010-04-16
|\ | | | | | | | | | | * adapt Eigenvalues module to the new rule that the RowMajorBit must have the proper value for vectors * Fix RowMajorBit in ei_traits<ProductBase> * Fix vectorizability logic in CoeffBasedProduct
* | * Refactoring of the class hierarchy: introduction of DenseDirectAccessBase, ↵Gravatar Benoit Jacob2010-04-16
| | | | | | | | | | | | | | | | | | removal of extra _Base/_Options template parameters. * Introduction of strides-at-compile-time so for example the optimized code really knows when it needs to evaluate to a temporary * StorageKind / XprKind * Quaternion::setFromTwoVectors: use JacobiSVD instead of SVD * ComplexSchur: support the 1x1 case
| * fix sparse squared normGravatar Gael Guennebaud2010-04-13
| |
| * RealSchur: Make sure zeros are really zero (cont'd); add default ctor, docs.Gravatar Jitse Niesen2010-04-12
| |
| * Add tests for real and complex Schur; extend test for Hessenberg.Gravatar Jitse Niesen2010-04-02
| | | | | | | | Make a minor correction to the ComplexSchur class.
| * Add the possibility to use the polynomial solver of the gsl.Gravatar Manuel Yguel2010-03-25
| |
* | * allow matrix dimensions to be 0 (also at compile time) and provide a ↵Gravatar Benoit Jacob2010-03-21
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | specialization of ei_matrix_array for size 0 * adapt many xprs to have the right storage order, now that it matters * add static assert on expressions to check that vector xprs have the righ storage order * adapt ei_plain_matrix_type_(column|row)_major * implement assignment of selfadjointview to matrix (was before failing to compile) and add nestedExpression() methods * expand product_symm test * in ei_gemv_selector, use the PlainObject type instead of a custom Matrix<...> type * fix VectorBlock and Block mistakes
| * Allow ComplexEigenSolver and ComplexSchur to work with real matrices.Gravatar Jitse Niesen2010-03-20
|/ | | | Add a test which covers this case.
* nomalloc: minor cleanupGravatar Benoit Jacob2010-03-08
|
* Propagate all five matrix template parameters to members and temporaries of ↵Gravatar Adolfo Rodriguez Tsouroukdissian2010-03-08
| | | | | | | decomposition classes. One particular advantage of this is that decomposing matrices with max sizes known at compile time will not allocate. NOTE: The ComplexEigenSolver class currently _does_ allocate (line 135 of Eigenvalues/ComplexEigenSolver.h), but the reason appears to be in the implementation of matrix-matrix products, and not in the decomposition itself. The nomalloc unit test has been extended to verify that decompositions do not allocate when max sizes are specified. There are currently two workarounds to prevent the test from failing (see comments in test/nomalloc.cpp), both of which are related to matrix products that allocate on the stack.
* mergeGravatar Mark Borgerding2010-03-07
|\
| * fix compilationGravatar Gael Guennebaud2010-03-07
| |
| * fix trsolveGravatar Gael Guennebaud2010-03-06
| |
| * * include Macros.h much earlier: since it takes care of the alignment ↵Gravatar Benoit Jacob2010-03-06
| | | | | | | | | | | | | | platform detection, it is needed before we do the vectorization stuff in Eigen/Core !! * kill EIGEN_DONT_ALIGN_HEAP option (one should use EIGEN_DONT_ALIGN) * rename EIGEN_DONT_ALIGN_STACK to EIGEN_DONT_ALIGN_STATICALLY. hope it's a better name.
| * introduce EIGEN_DONT_ALIGN_STACK (disables alignment attributes) and ↵Gravatar Benoit Jacob2010-03-06
| | | | | | | | | | | | EIGEN_DONT_ALIGN_HEAP (disables aligned malloc)... you can still use EIGEN_DONT_ALIGN to do both at once.
| * factorize default performance related settings to a single fileGravatar Gael Guennebaud2010-03-03
| | | | | | | | | | included after the architecture specific files such that they can be adapted by each platform.
| * Added initial NEON support, most tests pass however we had to use some ↵Gravatar Konstantinos Margaritis2010-03-03
| | | | | | | | | | | | | | | | hackish workarounds as gcc on ARM (both CodeSourcery 4.4.1 used and experimental 4.5) fail to ensure proper alignment with __attribute__((aligned(16))). This has to be fixed upstream to remove the workarounds.
| * add missing implementation of uniform scaling productsGravatar Gael Guennebaud2010-03-02
| |
| * fix compilationGravatar Benoit Jacob2010-03-02
| |
| * Add (failing) test for computing HouseholderQR of a 1x1 matrix.Gravatar Jitse Niesen2010-03-01
| |
| * Only include <iosfwd> unless either EIGEN_DEBUG_ASSIGN is defined or we're ↵Gravatar Benoit Jacob2010-02-27
| | | | | | | | in eigen2 support mode
| * Use a specialization of test_is_equal() instead of defining COMPARE()Gravatar Thomas Capricelli2010-02-27
| |
| * * define COMPARE(,), which prints expected/actual results in case of failureGravatar Thomas Capricelli2010-02-27
| | | | | | | | * use it in test/NonLinearOptimization.cpp
| * Fix Map-with-Stride and cover it by new unit tests.Gravatar Benoit Jacob2010-02-26
| |
| * * add VERIFY_IS_EQUAL, should compile faster and it's natural when no ↵Gravatar Benoit Jacob2010-02-26
| | | | | | | | | | | | | | | | | | arithmetic is involved. * rename 'submatrices' test to 'block' * add block-inside-of-block tests * remove old cruft * split diagonal() tests into separate file
| * mergeGravatar Benoit Jacob2010-02-25
| |\
| * | * Implement the ByOuterInner accessorsGravatar Benoit Jacob2010-02-25
| | | | | | | | | | | | | | | | | | | | | | | | * use them (big simplification in Assign.h) * axe (Inner|Outer)StrideAtCompileTime that were just introduced * ei_int_if_dynamic now asserts that the size is the expected one: adapt to that in Block.h * add rowStride() / colStride() in DenseBase * implement innerStride() / outerStride() everywhere needed
| | * detect and implement inplace permutationsGravatar Gael Guennebaud2010-02-25
| | |
| | * optimize inverse permutationsGravatar Gael Guennebaud2010-02-25
| | |
| | * add reconstructedMatrix() to LLT, and LUsGravatar Gael Guennebaud2010-02-24
| | | | | | | | | | | | | | | => they show that some improvements have still to be done for permutations, tr*tr, trapezoidal matrices
| | * make testsuite aware of EIGEN_CTEST_ARGSGravatar Gael Guennebaud2010-02-24
| | |
| | * Further LU test improvements. I'm not aware of any test failures anymore, ↵Gravatar Benoit Jacob2010-02-23
| | | | | | | | | | | | | | | | | | not even with huge numbers of repetitions. Finally the createRandomMatrixOfRank() function is renamed to createRandomPIMatrixOfRank, where PI stands for 'partial isometry', that is, a matrix whose singular values are 0 or 1.
| | * * FullPivLU: replace "remaining==0" termination condition (from Golub) by a ↵Gravatar Benoit Jacob2010-02-23
| |/ |/| | | | | | | | | | | | | | | fuzzy compare (fixes lu test failures when testing solve()) * LU test: set appropriate threshold and limit the number of times that a specially tricky test is run. (fixes lu test failures when testing rank()). * Tests: rename createRandomMatrixOfRank to createRandomProjectionOfRank
* | Renamed PlainMatrixType to PlainObject (Array != Matrix).Gravatar Hauke Heibel2010-02-20
| | | | | | | | Renamed ReturnByValue::ReturnMatrixType ReturnByValue::ReturnType (again, Array != Matrix).
| * miserable half-working state, commiting to a fork just in case, just to perfectGravatar Benoit Jacob2010-02-18
|/ | | | | my day, my hard disk would die. Will write a more detailed commit message once it's working.
* workaround weird gcc 4.0.1 compilation errorGravatar Gael Guennebaud2010-02-15
|
* fix a couple of ICE with gcc 4.0.1Gravatar Gael Guennebaud2010-02-12
|
* Fixed notemporary unit test.Gravatar Hauke Heibel2010-02-11
|
* Fixed warning.Gravatar Hauke Heibel2010-02-10
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-04 00:31:56 +0000