Difference between revisions of "Main Page"
| (21 intermediate revisions by the same user not shown) | |||
| Line 8: | Line 8: | ||
| | | | ||
| − | Efficient Java Matrix Library (EJML) is a [ | + | Efficient Java Matrix Library (EJML) is a [https://en.wikipedia.org/wiki/Linear_algebra 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. |
| − | EJML has three distinct ways to interact with it: 1) ''procedural'', 2) ''SimpleMatrix'', and 3) ''Equations''. ''Procedure'' provides all capabilities of EJML and almost complete control over memory creation, speed, and specific algorithms. ''SimpleMatrix'' provides a simplified subset of the core capabilities in an easy to use flow styled object-oriented API, inspired by [ | + | EJML has three distinct ways to interact with it: 1) ''procedural'', 2) ''SimpleMatrix'', and 3) ''Equations''. ''Procedure'' provides all capabilities of EJML and almost complete control over memory creation, speed, and specific algorithms. ''SimpleMatrix'' provides a simplified subset of the core capabilities in an easy to use flow styled object-oriented API, inspired by [https://math.nist.gov/javanumerics/jama/ Jama]. ''Equations'' is a symbolic interface, similar in spirit to [https://www.mathworks.com/products/matlab/ Matlab] and other [https://en.wikipedia.org/wiki/Computer_algebra_system CAS], that provides a compact way of writing equations. |
|} | |} | ||
| Line 18: | Line 18: | ||
{|style="font-size:120%; text-align:left;" | {|style="font-size:120%; text-align:left;" | ||
|- | |- | ||
| − | | '''Version:''' ''v0. | + | | '''Version:''' ''v0.45.0'' |
|- | |- | ||
| − | | '''Date:''' '' | + | | '''Date:''' ''May 15, 2026'' |
|- | |- | ||
| − | | [https://github.com/lessthanoptimal/ejml/blob/master/convert_to_ejml31.py Upgrade Script] | + | | [https://github.com/lessthanoptimal/ejml/blob/master/convert_to_ejml31.py v0.31 Upgrade Script] |
|- | |- | ||
| − | | [https://github.com/lessthanoptimal/ejml/blob/v0. | + | | [https://github.com/lessthanoptimal/ejml/blob/v0.45.0/change.txt Change Log] |
|} | |} | ||
|- valign="top" | |- valign="top" | ||
| Line 34: | Line 34: | ||
| [[manual|Manual]] | | [[manual|Manual]] | ||
|- | |- | ||
| − | | [ | + | | [https://ejml.org/javadoc/ JavaDoc] |
|} | |} | ||
| width="220pt" | | | width="220pt" | | ||
{| width="200pt" border="1" align="center" style="font-size:120%; text-align:center; border-collapse:collapse; background-color:#ffffee;" | {| width="200pt" border="1" align="center" style="font-size:120%; text-align:center; border-collapse:collapse; background-color:#ffffee;" | ||
|- | |- | ||
| − | | [ | + | | [https://groups.google.com/group/efficient-java-matrix-library-discuss Message Board] |
|- | |- | ||
| [https://github.com/lessthanoptimal/ejml/issues Bug Reports] | | [https://github.com/lessthanoptimal/ejml/issues Bug Reports] | ||
|- | |- | ||
| [[Frequently Asked Questions|FAQ]] | | [[Frequently Asked Questions|FAQ]] | ||
| + | |- | ||
| + | | [[Kotlin|Kotlin]] | ||
|} | |} | ||
| width="220pt" | | | width="220pt" | | ||
| Line 54: | Line 56: | ||
| [[Users|Users]] | | [[Users|Users]] | ||
|} | |} | ||
| + | |} | ||
| + | |||
| + | == News 2026 == | ||
| + | |||
| + | {| width="500pt" | | ||
| + | | - | ||
| + | | | ||
| + | * Faster low level BLAS-1 style operations | ||
| + | * New customizable format() for serializing Matrices and other structures | ||
| + | * Equations has gotten more functions | ||
| + | * SimpleMatrix improvements | ||
| + | * More concurrency | ||
| + | * Block Cholesky supports more variants and has much better runtime | ||
|} | |} | ||
| Line 93: | Line 108: | ||
| style="vertical-align:top;" | | | style="vertical-align:top;" | | ||
* Fixed Sized | * Fixed Sized | ||
| + | ** Matrix 2x2 to 6x6 | ||
| + | ** Vector 2 to 6 | ||
* Dense Real | * Dense Real | ||
** Row-major | ** Row-major | ||
| Line 98: | Line 115: | ||
* Dense Complex | * Dense Complex | ||
** Row-major | ** Row-major | ||
| + | * Sparse Real | ||
| + | ** Compressed Column | ||
| style="vertical-align:top;" | | | style="vertical-align:top;" | | ||
| + | * Full support for floats and doubles | ||
* Basic Operators (addition, multiplication, ... ) | * Basic Operators (addition, multiplication, ... ) | ||
* Matrix Manipulation (extract, insert, combine, ... ) | * Matrix Manipulation (extract, insert, combine, ... ) | ||
| Line 130: | Line 150: | ||
|} | |} | ||
Support for floats (32-bit) and doubles (64-bit) is available. Sparse matrix support is only available for basic operations at this time. | Support for floats (32-bit) and doubles (64-bit) is available. Sparse matrix support is only available for basic operations at this time. | ||
| − | |||
| − | |||
</center> | </center> | ||
Latest revision as of 15:03, 15 May 2026
|
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 2026
| - |
|
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.
