Created by accident
Fix bug in FastRationalFactory, added/improved constructors in Matrix and Vector classes
* removed references to junit 4.12 and depending test suites
Directory removed (created by mistake)
Initial import.
Added conversion to Vector<> from an object array
refactored DoubleWrapper
added demo for matrix multiplication.
merge of branch OpenJdk13
More cleanung up; removal od deprecated metods in LinAlgFactory
deleted file FieldPFactoryComparator.java
Replaced FieldPFactoryComparator with NumberComparator; code cleanup
fix def. of getFieldSize()
Fix generic def of some factory (-methods)
major rework of FieldP: Long/BigInteger are now hidden behind FieldP.
Junked deprecated methods in reduction interface.
Tasks for publising to local maven repo.
deleted empty directories
merged changes on trunk
merged changes from trunk.
Adapted build to Java 1.8
fix bug in Matrix iterator
Introduced interface IReducible and implemented it in Matrix and Vector. Reductions are operations only accessible in these two classes. Monadic and dyadic operatiors are now extending functional interfaces in the JDK. Fixed bug in max()-function of some datataypes.
Set compiler to version 1.9; remove forced project name in gradle settings
reconfigured project
reconfigured project
suppress warnings abou raw types
merged the result of cleaning up & migration to gradle to the trunk
Building the web site via gradle should work.
Fix broken tests due to removed methods
Cleanup javadoc
Fix ambiguous Polynomial.divide()
Fix build.gradle; added missing "public" to some classes
remove obsolete type parameters
Fixed ambigus def. of compareTo()
More cleaning up generics; relation between factories, factory maps and values
Moved all operators to the type factories.
Fixed some issues with generic types.
Set java version in gradle file.
FIX some issues with generic types, deprecated methods
Übersetzt wieder unter OpenJdk+Junit5+gradle 6.0.1
Migration auf OpenJDK13
Version switch
structure.html eingebunden
some changes to the GCD algorithm, so it will fit for polynomials
Changed demo to show off Euclidean Algorithm for Polynomials
some formating and save actions
GCD of univariate polynomials is unique if the highest coefficient has to be 1, whenever the degree is greater than 0.
media query for smaller displays
Where is the power method?
Hi Dear JLinAlg developers, I am trying to pre-allocate a n x 3 matrix, which I will...
First Version of EuclideanRingElement and gener...
Link to buck tracker.
Updated Link
Updated Link
Download link updated
Increased new version number after release v0.7
Changed compliance from 1.7 to 1.6 => Had to ch...
Changed compliance from 1.7 to 1.6
Version number for ant tasks modified
IRingElementFactory does not extend Serializabl...
Minor changes to website
Clean repariert
Another correction
Some corrections to make the HTML generation wo...
Added LGPL
Further work on compareTo for RationalFunctions...
Bugfix for Polynomial.gcd(...)
Beschreibung verbessert.
Removed annoying occurences target="_blank"
Added Links
Some tidying up of the demos.
HilbertMatrixDemo für Webseite vorbereitet.
HilbertMatrixDemo für Webseite vorbereitet.
Bugfix
Bugfix
Continued with Rational Functions. A few tests ...
Added some functions to Vector and some tests f...
Added a demo to show off arbitrary precision.
Removed some compiler warnings.
Making sure that annotation.include() also work...
Removed some compiler warnings.
Added some code for RationalFunction
Raised Code-Compliance from 1.5 to 1.7
Raised Code-Compliance from 1.5 to 1.7