Difference between revisions of "Main Page"
(47 intermediate revisions by the same user not shown) | |||
Line 7: | Line 7: | ||
|- | |- | ||
| | | | ||
− | |||
− | EJML has three distinct ways to interact with it: 1) ''procedural'', 2) '' | + | Efficient Java Matrix Library (EJML) is a [http://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 [http://math.nist.gov/javanumerics/jama/ Jama]. ''Equations'' is a symbolic interface, similar in spirit to [http://www.mathworks.com/products/matlab/ Matlab] and other [http://en.wikipedia.org/wiki/Computer_algebra_system CAS], that provides a compact way of writing equations. | ||
|} | |} | ||
{| | {| | ||
− | | colspan="3 | + | | colspan="3" align="center" | |
− | {| | + | {|style="font-size:120%; text-align:left;" |
|- | |- | ||
− | | '''Version:''' ''v0. | + | | '''Version:''' ''v0.43.1'' |
|- | |- | ||
− | | '''Date:''' ''September | + | | '''Date:''' ''September 23, 2023'' |
+ | |- | ||
+ | | [https://github.com/lessthanoptimal/ejml/blob/master/convert_to_ejml31.py v0.31 Upgrade Script] | ||
+ | |- | ||
+ | | [https://github.com/lessthanoptimal/ejml/blob/v0.43.1/change.txt Change Log] | ||
|} | |} | ||
|- valign="top" | |- valign="top" | ||
Line 35: | Line 41: | ||
| [http://groups.google.com/group/efficient-java-matrix-library-discuss Message Board] | | [http://groups.google.com/group/efficient-java-matrix-library-discuss Message Board] | ||
|- | |- | ||
− | | [ | + | | [https://github.com/lessthanoptimal/ejml/issues Bug Reports] |
|- | |- | ||
| [[Frequently Asked Questions|FAQ]] | | [[Frequently Asked Questions|FAQ]] | ||
+ | |- | ||
+ | | [[Kotlin|Kotlin]] | ||
|} | |} | ||
| width="220pt" | | | width="220pt" | | ||
Line 50: | Line 58: | ||
|} | |} | ||
+ | == News 2023 == | ||
+ | |||
+ | {| 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 | ||
+ | |} | ||
== Code Examples == | == Code Examples == | ||
− | + | Demonstrations on how to compute the Kalman gain "K" using each interface in EJML. | |
{| width="500pt" | | {| width="500pt" | | ||
|- | |- | ||
| | | | ||
− | ''' | + | '''Procedural''' |
<syntaxhighlight lang="java"> | <syntaxhighlight lang="java"> | ||
− | + | 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); | ||
</syntaxhighlight> | </syntaxhighlight> | ||
− | ''' | + | '''SimpleMatrix''' |
<syntaxhighlight lang="java"> | <syntaxhighlight lang="java"> | ||
SimpleMatrix S = H.mult(P).mult(H.transpose()).plus(R); | SimpleMatrix S = H.mult(P).mult(H.transpose()).plus(R); | ||
Line 69: | Line 92: | ||
</syntaxhighlight> | </syntaxhighlight> | ||
− | ''' | + | '''Equations''' |
<syntaxhighlight lang="java"> | <syntaxhighlight lang="java"> | ||
− | + | eq.process("K = P*H'*inv( H*P*H' + R )"); | |
− | |||
− | |||
− | |||
− | |||
− | |||
</syntaxhighlight> | </syntaxhighlight> | ||
|} | |} | ||
Line 82: | Line 100: | ||
== Functionality == | == Functionality == | ||
− | {| class="wikitable" width=" | + | {| class="wikitable" width="650pt" border="1" | |
! Data Structures || Operations | ! Data Structures || Operations | ||
|- | |- | ||
| style="vertical-align:top;" | | | style="vertical-align:top;" | | ||
+ | * Fixed Sized | ||
+ | ** Matrix 2x2 to 6x6 | ||
+ | ** Vector 2 to 6 | ||
* Dense Real | * Dense Real | ||
** Row-major | ** Row-major | ||
Line 91: | Line 112: | ||
* 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 101: | Line 124: | ||
* Random Matrices (covariance, orthogonal, symmetric, ... ) | * Random Matrices (covariance, orthogonal, symmetric, ... ) | ||
* Unit Testing | * Unit Testing | ||
+ | |}. | ||
+ | |||
+ | |||
+ | {| class="wikitable" width="650pt" border="1" | | ||
+ | ! style="width: 40%;" | Decomposition || style="width: 15%;" |Dense Real || style="width: 15%;" |Dense Complex || style="width: 15%;" |Sparse Real || style="width: 15%;" |Sparse Complex | ||
+ | |- | ||
+ | | LU || style="text-align:center;" | X || style="text-align:center;" | X || style="text-align:center;" | X || | ||
+ | |- | ||
+ | | Cholesky LL || style="text-align:center;" | X || style="text-align:center;" | X || style="text-align:center;" | X || | ||
+ | |- | ||
+ | | Cholesky LDL || style="text-align:center;" | X || style="text-align:center;" | || || | ||
+ | |- | ||
+ | | QR || style="text-align:center;" | X || style="text-align:center;" | X || style="text-align:center;" | X || | ||
+ | |- | ||
+ | | QRP || style="text-align:center;" | X || style="text-align:center;" | || || | ||
+ | |- | ||
+ | | SVD || style="text-align:center;" | X || style="text-align:center;" | || || | ||
+ | |- | ||
+ | | Eigen-Symmetric || style="text-align:center;" | X || style="text-align:center;" | || || | ||
+ | |- | ||
+ | | Eigen-General || style="text-align:center;" | X || style="text-align:center;" | || || | ||
|} | |} | ||
+ | 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 20:33, 23 September 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.