roots_matching

wield.control.algorithms.zpk.roots_matching

Functions

SOS_pair_rolloff(Zr, Zc, Pr, Pc[, ...])
match_SOS_pairs(Zr, Zc, Pr, Pc[, ...])	Match and create pairs suitable for SOS representation.
nearest_idx(lst_1[, lst_2, ...])	If lst_2 is given, this returns all of the nearest items in lst_2 to lst_1.
nearest_pairs(l1, l2[, metric_pair_dist])
nearest_unique_idx(l1, l2)
nearest_unique_pairs(l1, l2[, metric_pair_dist])

Details

SOS_pair_rolloff(Zr, Zc, Pr, Pc, metric_rolloff=<built-in function abs>)

match_SOS_pairs(Zr, Zc, Pr, Pc, F_nyquist_Hz=None, metric_rolloff=None, metric_pair_dist=None)

Match and create pairs suitable for SOS representation. The output is a list of 4-tuples with z1, z2, p1, p2. If roots are complex, they are guaranteed to be partnered with their conjugate.

Some z, or p may be None, indicating that the system ran out.

nearest_idx(lst_1, lst_2=None, metric_pair_dist=None, return_distances=False)

If lst_2 is given, this returns all of the nearest items in lst_2 to lst_1. If not given, this returns all of the nearest elements of lst_1 to itself, ignoring self elements.

if metric_pair_dist is None, use the standard distance on complex plane. This is the fastest.

nearest_pairs(l1, l2, metric_pair_dist=None)

nearest_unique_idx(l1, l2)

nearest_unique_pairs(l1, l2, metric_pair_dist=None)