aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/LU
Commit message (Collapse)AuthorAge
* * 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
| * fix misc warnings, more importantly when NDEBUG is defined, assert() is aGravatar Thomas Capricelli2010-03-27
| | | | | | | | nop.
* | fix the flags and matrix options, to always have the right RowMajor bit in ↵Gravatar Benoit Jacob2010-03-19
|/ | | | the vector case
* 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.
* * let a = foo() work when a is a row-vector xpr and foo() returns a ↵Gravatar Benoit Jacob2010-03-08
| | | | | | ReturnByValue col-vector * remove a few useless resize() in evalTo() implementations
* Added a missing inline hints.Gravatar Hauke Heibel2010-03-03
| | | | Removed a useless Nested temporary.
* Hide some internal stuff from the docs.Gravatar Hauke Heibel2010-02-28
|
* 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
| |
| * 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
| * 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
| * add missing return valueGravatar Gael Guennebaud2010-02-20
| |
| * Renamed PlainMatrixType to PlainObject (Array != Matrix).Gravatar Hauke Heibel2010-02-20
|/ | | | Renamed ReturnByValue::ReturnMatrixType ReturnByValue::ReturnType (again, Array != Matrix).
* fix a couple of ICE with gcc 4.0.1Gravatar Gael Guennebaud2010-02-12
|
* * move dummy_precision and epsilon to NumTraitsGravatar Gael Guennebaud2010-02-10
| | | | * make NumTraits inherits std::numeric_limits
* Introduced NestParentByRefBit and NestByRefBit - this should fix temporaries ↵Gravatar Hauke Heibel2010-02-06
| | | | | | related to nested products. Fixed a few typos and a few warnings.
* fix compilation on 32bits systemsGravatar Gael Guennebaud2010-02-01
|
* EIGEN_ENUM_MIN ---> EIGEN_SIZE_MINGravatar Benoit Jacob2010-01-27
|
* add SSE code (from Intel) for the fast inversion of 4x4 matrices of doubleGravatar Gael Guennebaud2010-01-19
|
* update the fast 4x4 SSE inversion code from more recent Intel's codeGravatar Gael Guennebaud2010-01-19
|
* remove the Triangular suffix to Upper, Lower, UnitLower, etc,Gravatar Gael Guennebaud2010-01-07
| | | | and remove the respective bit flags
* merge and add start/end to Eigen2SupportGravatar Gael Guennebaud2010-01-05
|\
| * Big renaming:Gravatar Benoit Jacob2010-01-04
| | | | | | | | | | | | start ---> head end ---> tail Much frustration with sed syntax. Need to learn perl some day.
* | a couple of fixes after thye mergeGravatar Gael Guennebaud2009-12-23
| |
* | merge with default branchGravatar Gael Guennebaud2009-12-22
|\|
| * add missing inclusion of LU/arch, thanks to J.B. RouaultGravatar Gael Guennebaud2009-12-19
| |
* | partial LU optimization: noaliasGravatar Gael Guennebaud2009-12-17
| |
| * suppress unused variable warningsGravatar Gael Guennebaud2009-12-15
| |
| * no, this wasn't equivalent to ei_pload at all, after all!Gravatar Benoit Jacob2009-12-15
| |
| * Gael, who is a man of few words^Winstructions, is right, as usual.Gravatar Benoit Jacob2009-12-15
| |
| * *use scalar instructions, packet not needed hereGravatar Benoit Jacob2009-12-14
| | | | | | | | *remove unused var warning
| * add SSE path for Matrix4f inverse, taken from Intel except that we do a kosherGravatar Benoit Jacob2009-12-14
| | | | | | | | | | | | division instead of RCPPS-followed-by-Newton-Raphson. The rationale for that is that elsewhere in Eigen we dont allow ourselves this approximation (which throws 2 bits of mantissa), so there's no reason we should allow it here.
| * Warning 4512 (assignment operators could not be generated) is now simply ↵Gravatar Hauke Heibel2009-12-14
| | | | | | | | | | | | disabled. All unimplemented assignment operators have been removed.
| * Added to possibility to compile unit tests at maximum warning level.Gravatar Hauke Heibel2009-12-12
| | | | | | | | Silenced (amongst others) many conversion related warnings.
| * * 4x4 inverse: revert to cofactors methodGravatar Benoit Jacob2009-12-09
| | | | | | | | | | | | | | * inverse tests: use createRandomMatrixOfRank, use more strict precision * tests: createRandomMatrixOfRank: support 1x1 matrices * determinant: nest the xpr * Minor: add comment
| * mergeGravatar Hauke Heibel2009-12-02
| |\
| * | minor cleanupGravatar Benoit Jacob2009-12-01
| | |
| | * Even more NestByValue cleanup...Gravatar Hauke Heibel2009-12-01
| | |
| | * Removed NestByValue dependency from Cholesky, Eigenvalues, LU and QR.Gravatar Hauke Heibel2009-12-01
| |/
| * 4x4 inverse:Gravatar Benoit Jacob2009-11-23
| | | | | | | | | | * change block selection threshold from 1e-2 to 1e-1 * add rigorous precision test
* | Another big refactoring change:Gravatar Gael Guennebaud2009-11-18
| | | | | | | | | | | | * add a new Eigen2Support module including Cwise, Flagged, and some other deprecated stuff * add a few cwiseXxx functions * adapt a few modules to use cwiseXxx instead of the .cwise() prefix
| * port the QR module to PermutationMatrixGravatar Benoit Jacob2009-11-17
| |
| * PermutationMatrix: add setIdentity and transpositions methodsGravatar Benoit Jacob2009-11-16
| | | | | | | | LU: make use of that
| * Port FullPivLU to PermutationMatrixGravatar Benoit Jacob2009-11-16
| |
| * PartialPivLU: port to PermutationMatrixGravatar Benoit Jacob2009-11-16
|/ | | | PermutationMatrix: add resize()
* last round of changes, mainly to return derived types instead of base types, ↵Gravatar Benoit Jacob2009-11-09
| | | | and fix various compilation issues
* simplifications in the ei_solve_impl system, factor out some boilerplate codeGravatar Benoit Jacob2009-11-08
|
* port the qr module to ei_solve_xxx.Gravatar Benoit Jacob2009-11-08
|
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-05 00:12:10 +0000