AAA

wield.control.AAA.AAA

Classes

Structish(*args, **kwargs)

rtAAAResults(zvals_full, fvals_full, fit_list)

Functions

Q_rank_calc(z, p)

domain_sort(X, *Y)

eigAE(A, E)

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_pairs(l1, l2[, metric_pair_dist])

order_reduce_zp(zeros, poles[, Q_rank_cutoff])

residuals(xfer, fit, w, rtype)

tfAAA(F_Hz, xfer[, exact, res_tol, s_tol, ...])

tf_bary_interp(F_Hz, zvals, fvals, wvals[, ...])

tf_bary_zpk(zvals, fvals, wvals[, ...])

tf_bary_zpk_real(zvals, fvals, wvals[, ...])

This version is for the all-real computation, which has half as many weights

Details

Q_rank_calc(z, p)[source][github]
domain_sort(X, *Y)[source][github]
eigAE(A, E)[source][github]
nearest_idx(lst_1, lst_2=None, metric_pair_dist=None, return_distances=False)[source][github]

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)[source][github]
nearest_unique_pairs(l1, l2, metric_pair_dist=None)[source][github]
order_reduce_zp(zeros, poles, Q_rank_cutoff=1e-05)[source][github]
residuals(xfer, fit, w, rtype)[source][github]
tfAAA(F_Hz, xfer, exact=True, res_tol=None, s_tol=None, w=1, w_res=None, degree_max=30, nconv=None, nrel=10, rtype='log', lf_eager=True, supports=None, minreal_cutoff=None, all_real=False, all_pos=False)[source][github]
tf_bary_interp(F_Hz, zvals, fvals, wvals, all_real=False, all_pos=False)[source][github]
tf_bary_zpk(zvals, fvals, wvals, minreal_cutoff=0.01)[source][github]
tf_bary_zpk_real(zvals, fvals, wvals, minreal_cutoff=0.01)[source][github]

This version is for the all-real computation, which has half as many weights