Solver¤
Root Solver¤
microlux.polynomial_solver.Aberth_Ehrlich(coff, roots, MAX_ITER=50)
¤
Solves a polynomial equation using the Aberth-Ehrlich method. Adopted from https://arxiv.org/abs/2206.00482 Hossein Fatheddin Use jax.lax.custom_root to get precise derivative in automatic differentiation
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
coff
|
ndarray
|
Coefficients of the polynomial equation. |
required |
roots
|
ndarray
|
Initial guesses for the roots of the polynomial equation. |
required |
MAX_ITER
|
int
|
Maximum number of iterations. Defaults to 100. |
50
|
Returns:
| Name | Type | Description |
|---|---|---|
roots |
ndarray
|
The roots of the polynomial equation. |
linear_sum_assignment solver¤
microlux.linear_sum_assignment.solve(cost)
¤
Solves the linear sum assignment problem using the Hungarian algorithm. adapted from https://github.com/google/jax/issues/10403
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
cost
|
ndarray
|
The cost matrix representing the assignment problem. |
required |
Returns:
| Name | Type | Description |
|---|---|---|
row_ind |
ndarray
|
The row indices of the assigned elements. |
col_ind |
ndarray
|
The column indices of the assigned elements. |