Release Notes: This alpha version of the future 3.1 finally brings to life a set of official sparse modules for the representation, assembly, and solving of sparse problems. A quick overview can be found in the manual, while the changelog contains some details on the main differences between this and the unstable 3.0 sparse modules. This alpha release also features closed-form algorithms for small eigenvalue problems, Cholesky updates/downdates, new coefficient-wise and vector-wise operators, as well as some performance and memory optimizations (for reductions and JacobiSVD respectively).
Release Notes: This is a maintenance releases with various bug and warning fixes. It is likely to be the last release for the 3.0.x branch.
Release Notes: This is a maintenance releases with various bug and warning fixes.
Release Notes: The key new features of this version are: a built-in supernodal sparse LU solver adapted from SuperLU, a rank-revealing sparse QR factorization with numerical column pivoting, a RealQZ factorization, a GeneralizedEigenSolver, and a Ref<> class allowing to write non-templated functions taking various kinds of Eigen dense objects without copies.
Release Notes: This second release candidate fixes a naming collision by renaming the isFinite() function to allFinite(), and fixes a compiler error with ICC 11.1.
Release Notes: This release introduces a few new features, such as: isFinite and hasNaN reductions, vector-wise normalize and normalized functions, support for mixed static/dynamic sizes in .block(), sparse determinant computation through SparseLU, access to L and U factors in SparseLU, and access to the Q factor in SparseQR. Major fixes comprise significantly improved robustness of BiCGSTAB, and JacobiSVD::solve(), as well as many other fixes of all kinds.