Difference between revisions of "Main Page"
Line 58: | Line 58: | ||
|} | |} | ||
− | == News | + | == News 2023 == |
{| width="500pt" | | {| width="500pt" | | ||
| - | | - | ||
| | | | ||
− | * | + | * SimpleMatrix is going through bit of a rejuvenation |
− | * | + | * SimpleMatrix has much improved support for complex matrices |
− | * | + | * Introduced ConstMatrix for when you want to restrict access to read only |
|} | |} | ||
Revision as of 08:39, 10 February 2023
Efficient Java Matrix Library (EJML) is a linear algebra library for manipulating real/complex/dense/sparse matrices. Its design goals are; 1) to be as computationally and memory efficient as possible for small and large, dense and sparse, real and complex matrices, and 2) to be accessible to both novices and experts. These goals are accomplished by dynamically selecting the best algorithms to use at runtime, clean API, and multiple interfaces. EJML is free, written in 100% Java and has been released under an Apache v2.0 license.
|
| ||||||||||||
|
|
|
News 2023
- |
|
Code Examples
Demonstrations on how to compute the Kalman gain "K" using each interface in EJML.
Procedural mult(H,P,c);
multTransB(c,H,S);
addEquals(S,R);
if( !invert(S,S_inv) )
throw new RuntimeException("Invert failed");
multTransA(H,S_inv,d);
mult(P,d,K);
SimpleMatrix SimpleMatrix S = H.mult(P).mult(H.transpose()).plus(R);
SimpleMatrix K = P.mult(H.transpose().mult(S.invert()));
Equations eq.process("K = P*H'*inv( H*P*H' + R )");
|
Functionality
Data Structures | Operations |
---|---|
|
|
Decomposition | Dense Real | Dense Complex | Sparse Real | Sparse Complex |
---|---|---|---|---|
LU | X | X | X | |
Cholesky LL | X | X | X | |
Cholesky LDL | X | |||
QR | X | X | X | |
QRP | X | |||
SVD | X | |||
Eigen-Symmetric | X | |||
Eigen-General | X |
Support for floats (32-bit) and doubles (64-bit) is available. Sparse matrix support is only available for basic operations at this time.