Config References¶
System¶
Option | Value | Info | Accepted values |
---|---|---|---|
freq | 60 | base frequency [Hz] | float |
mva | 100 | system base MVA | float |
store_z | 0 | store limiter status in TDS output | (0, 1) |
ipadd | 1 | use spmatrix.ipadd if available | (0, 1) |
seed | None | seed (or None) for random number generator | int or None |
diag_eps | 0.000 | small value for Jacobian diagonals | |
warn_limits | 1 | warn variables initialized at limits | (0, 1) |
warn_abnormal | 1 | warn initialization out of normal values | (0, 1) |
dime_enabled | 0 | ||
dime_name | andes | ||
dime_address | ipc:///tmp/dime2 | ||
numba | 0 | use numba for JIT compilation | (0, 1) |
numba_parallel | 0 | enable parallel for numba.jit | (0, 1) |
yapf_pycode | 0 | format generated code with yapf | (0, 1) |
np_divide | warn | treatment for division by zero | {'ignore', 'log', 'call', 'warn', 'raise', 'print'} |
np_invalid | warn | treatment for invalid floating-point ops. | {'ignore', 'log', 'call', 'warn', 'raise', 'print'} |
pickle_path | /home/docs/.andes/calls.pkl | path models should be (un)dilled to/from |
PFlow¶
Option | Value | Info | Accepted values |
---|---|---|---|
sparselib | klu | linear sparse solver name | ('klu', 'umfpack', 'spsolve', 'cupy') |
linsolve | 0 | solve symbolic factorization each step (enable when KLU segfaults) | (0, 1) |
tol | 0.000 | convergence tolerance | float |
max_iter | 25 | max. number of iterations | >=10 |
method | NR | calculation method | ('NR', 'dishonest') |
check_conn | 1 | check connectivity before power flow | (0, 1) |
n_factorize | 4 | first N iterations to factorize Jacobian in dishonest method | >0 |
report | 1 | write output report | (0, 1) |
degree | 0 | use degree in report | (0, 1) |
init_tds | 0 | initialize TDS after PFlow | (0, 1) |
TDS¶
Option | Value | Info | Accepted values |
---|---|---|---|
sparselib | klu | linear sparse solver name | ('klu', 'umfpack', 'spsolve', 'cupy') |
linsolve | 0 | solve symbolic factorization each step (enable when KLU segfaults) | (0, 1) |
tol | 0.000 | convergence tolerance | float |
t0 | 0 | simulation starting time | >=0 |
tf | 20 | simulation ending time | >t0 |
fixt | 1 | use fixed step size (1) or variable (0) | (0, 1) |
shrinkt | 1 | shrink step size for fixed method if not converged | (0, 1) |
honest | 0 | honest Newton method that updates Jac at each step | (0, 1) |
tstep | 0.033 | the initial step step size | float |
max_iter | 15 | maximum number of iterations | >=10 |
refresh_event | 0 | refresh events at each step | (0, 1) |
check_conn | 1 | re-check connectivity after event | (0, 1) |
g_scale | 1 | scale algebraic residuals with time step size | positive |
qrt | 0 | quasi-real-time stepping | bool |
kqrt | 1 | quasi-real-time scaling factor; kqrt > 1 means slowing down | positive |
store_f | 0 | store RHS of diff. equations | (0, 1) |
store_h | 0 | store RHS of external diff. equations | (0, 1) |
store_i | 0 | store RHS of external algeb. equations | (0, 1) |
EIG¶
Option | Value | Info | Accepted values |
---|---|---|---|
sparselib | klu | linear sparse solver name | ('klu', 'umfpack', 'spsolve', 'cupy') |
linsolve | 0 | solve symbolic factorization each step (enable when KLU segfaults) | (0, 1) |
plot | 0 | show plot after computation | (0, 1) |