abcd-rf-fit 0.1.3__tar.gz

abcd_rf_fit-0.1.3/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2023 abcd_rf_fit developers
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

abcd_rf_fit-0.1.3/PKG-INFO

@@ -0,0 +1,20 @@
+Metadata-Version: 2.1
+Name: abcd_rf_fit
+Version: 0.1.3
+Summary: Rational function fit library
+Home-page: https://github.com/UlysseREGLADE/abcd_rf_fit
+Author: Ulysse REGLADE
+Author-email: ulysse.reglade@yahoo.fr
+License: License :: OSI Approved :: BSD License
+Platform: UNKNOWN
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: BSD License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+License-File: LICENSE
+
+UNKNOWN
+

abcd_rf_fit-0.1.3/README.md

@@ -0,0 +1,339 @@
+# Optimal method for resonator scattering parameter fit
+
+## 0) Why spending time on this problem ?
+
+Fitting resonators is really the bread and butter of the circuit QED engineer. Hence, it is absolutely crucial to have fast and reliable routines to perform this task.
+
+To the best of my knowledge, there is currently no satisfying method in the literature to efficiently perform the fit of the scattering parameter of a resonator, apart from the one described in [this paper](https://arxiv.org/pdf/1410.3365.pdf) from 2014. This method is far from being perfect and has two main flaws:
+
+Frist, it simply tries to fit a circle to the data in the complex plane. Hence, this method completely ignores the "cinematic" encoded in the data when $\omega$ travels through the resonance. In particular, we will see that the gradient of the data encodes a lot of information.
+
+Secondly, if the fit of the electrical delay fails, then the data effectively lies on a circle of radius $\alpha$ centered around $0$ in the complex plane. As a consequence, the fit procedure will succeed, but the fitted parameters will be totally wrong.
+
+In this note, we present an analytical method to perform this task.
+
+## I) Derivation scattering parameter formula
+
+We use the convention described in the [Gardiner](https://journals.aps.org/pra/abstract/10.1103/PhysRevA.31.3761) for the input/output relation:
+
+$$
+\begin{align}
+a^i_{out}-a^i_{in} &= \sqrt{\kappa_c}a \\
+\frac{\partial a}{\partial t} &= -\frac{i}{\hbar}\frac{\partial H}{\partial a^\dagger} - \frac{\kappa_i}{2}a - \sum_i \left( \frac{\kappa^i_c}{2}a + \sqrt{\kappa^i_c}a^i_{in} \right)
+\end{align}
+$$
+
+In the rotating frame at $\omega$, the Hamiltonian we consider the one of a bar linear resonator:
+
+$$
+H/\hbar = (\omega-\omega_0)a^\dagger a
+$$
+
+By definition, the scattering parameter is defined by:
+
+$$
+S_{ij}(\omega) = \frac{a^i_{out}}{a^j_{in}}
+$$
+
+### 1. Transmission
+
+We consider:
+
+$$
+S_{21}(\omega) = S_T(\omega) = \frac{a^2_{out}}{a^1_{in}}
+$$
+
+We find:
+
+$$
+S_T(\omega) = \frac{2\sqrt{\kappa^1_c\kappa^2_c}}{2i(\omega-\omega_0) + \kappa_i+\kappa^1_c+\kappa^2_c}
+$$
+
+The only fittable parameters in this formula are $\omega_0$ and $\kappa = \kappa_i+\kappa^1_c+\kappa^2_c$. Since the numerator is constant, it will be entirely eaten by the amplification coefficient, hence we write:
+
+$$
+S_T(\omega) = \frac{1}{2i(\omega-\omega_0) + \kappa}
+$$
+
+### 2. Reflection
+
+$$
+S_{11}(\omega) = S_R(\omega) = \frac{a^1_{out}}{a^1_{in}}
+$$
+
+We find:
+
+$$
+S_R(\omega) = \frac{i(\omega-\omega_0) + (\kappa_i-\kappa_c)/2}{i(\omega-\omega_0) + (\kappa_i+\kappa_c)/2}
+$$
+
+In this case, both $\omega_0$, $\kappa_i$ and $\kappa_c$ are fittable, which makes a reflection measurement much more valuable than a transmission one. Both the transmission and reflection formula are derived in the thesis of Philippe Campagne-Ibarcq.
+
+### 3. Hanger
+
+To get the hanger scattering parameter, one should modify the input/output relation as follow:
+
+$$
+a^i_{out}-a^i_{in} = \frac{\sqrt{\kappa^i_c}}{2}a
+$$
+
+In this context, we can now compute:
+
+$$
+S_{11}(\omega) = S_H(\omega) = \frac{a^1_{out}}{a^1_{in}}
+$$
+
+We find:
+
+$$
+S_H(\omega) = \frac{i(\omega-\omega_0) + \kappa_i/2}{i(\omega-\omega_0) + (\kappa_i+\kappa_c)/2}
+$$
+
+Again, $\omega_0$, $\kappa_i$ and $\kappa_c$ are fittable.
+
+### 4. Hanger with impedance mismatch
+
+In [this paper](https://arxiv.org/pdf/1410.3365.pdf) from 2014 is described how to take into account the effect of an impedance mismatch in the context of the hanger geometry. In this case, $\kappa_c$ can be view as a complex number, in this situation, we write:
+
+$$
+\kappa_c = |\kappa_c|e^{i\phi_0}
+$$
+
+In this case, only the real part of the complex coupling rates contribute to the total loss-rate of the cavity $\kappa$ .
+
+$$
+\kappa = \kappa_i + \Re(\kappa_c)
+$$
+
+One should introduce the parameter $\phi_0$ in the scattering parameter of the hanger as follow:
+
+$$
+S_{HM}(\omega) = \frac{2i(\omega-\omega_0) + \kappa - \Re(\kappa_c)(1+i\tan(\phi_0))}{2i(\omega-\omega_0) + \kappa}
+$$
+
+From a geometrical point of view in the complex plan, it allows the rotation of the circle described by $S_H(\omega)$ around $1$. Empirically, one can also see it as a modification of the input/output relation:
+
+$$
+a^i_{out}-a^i_{in} = \frac{\sqrt{|\kappa^i_c| e^{i\phi_0}}}{2}a
+$$
+
+In practise, adding this degree of freedom to the formula loosens the precision of the fit of $\kappa_i$ and $\kappa_c$. Hence, one should be cautious when allowing for this offset.
+
+### 5. Reflection with impedance mismatch
+
+Taking inspiration for what was done for the hanger, we allow the rotation around $1$ in the complex plan by writing the input/output relation as follow. THERE IS NO PHYSICAL INTUITION BEHIND THIS FORMULA AND IT IS WRITTEN PURELY BY ANALOGY:
+
+$$
+a^i_{out}-a^i_{in} = \sqrt{|\kappa^i_c|e^{i\phi_0}}a
+$$
+
+The modified scattering parameter for the reflection geometry is as follow:
+
+$$
+S_{RM}(\omega) = \frac{2i(\omega-\omega_0) + \kappa -  2\Re(\kappa_c)(1+i\tan(\phi_0))}{2i(\omega-\omega_0) + \kappa}
+$$
+
+Again, the precision of the fit of $\kappa_i$ and $\kappa_c$ are loosened, and this formula is to be taken with the same caveat than the previous one. abcd_rf_fit will return a warning when the value of $\phi_0$ in greater than 0.25 .
+
+### Effect of electrical delay and amplification chain
+
+In a real life scenario of circuit QED, the scattering parameter of a resonator is always dressed.
+
+First, since these resonators are meant to operate at very low energy scales, one always uses an extensive attenuation chain to send signal in, and a powerful amplification chain to retrieve the outputted signal. This results in an arbitrary complex multiplicative prefactor $\alpha \in \mathbb{C}$.
+
+Second, the resonator is always at a finite distance from the instrument used to measure it. As a consequence, the phase of the outputted signal will vary as a function of its frequency depending on this distance and the speed of light in the medium that carries the signal. This has the effect to multiply the scattering parameter by a factor $e^{2i\pi\lambda\omega}$, where $\lambda \in \mathbb{R}$ is a typical time called the electrical delay that encodes for cables length and the speed of light among them.
+
+Hence, what is actually to be fitted in most cases is:
+
+$$
+\begin{align}
+S(\omega) &= \alpha \times S_X(\omega) \times e^{2i\pi\lambda\omega} \\
+X &= T, R, H, RM, HM
+\end{align}
+$$
+
+## II) Fit of a rationnal function of degree one
+
+Ingoring the electrical for now, one can observe that all the scattering parameters we described can be written in the form:
+
+$$
+S_{X}(\omega) = \frac{a+b\omega}{c+d\omega}, (a, b, c, d) \in \mathbb{C}
+$$
+
+We propose a efficent procedure to extract these coefficents from a noised signal.
+
+### 1. Side note: least square regression of an n-degree polynomial
+
+As described in the [lecture notes](https://www.di.ens.fr/~fbach/mlclass/lecture2.pdf) of Francis Bach, given a set of points $(x_i, y_i), i \in$ ⟦1, N⟧, one can write the empirical risk $R(w)$ associated with the least square regression of an $n$-degree polynomial with coefficients $w_0, ..., w_n$ as follow:
+
+$$
+R_{LS}(w) = \frac{1}{N} || Xw - y ||_2^2
+$$
+
+with:
+
+$$
+X =
+\begin{bmatrix}
+1, x_1, \ldots, x_1^n \\
+\vdots \\
+1, x_N, \ldots, x_N^n \\
+\end{bmatrix},
+y =
+\begin{bmatrix}
+y_1 \\
+\vdots \\
+y_N \\
+\end{bmatrix}
+w =
+\begin{bmatrix}
+w_0 \\
+\vdots \\
+w_n \\
+\end{bmatrix}
+$$
+
+We can now easily solve for $\nabla_w R(w) = 0$ to find the global minimum of this convex optimization problem:
+
+$$
+w = (X^T X)^{-1} Xy
+$$
+
+Not only is this formulation super elegant, it allows for very fast compution. It is actually the one implemented in the Python libreary numpy in the function `polyfit`. 
+
+We take inspiration of this approach in the next section to find an efficient fitting procedure in our case.
+
+### 2. Least square regression of a degree one rationnal function
+
+We are given a set $(\omega_i, s_i), i \in$ ⟦1, N⟧, where $\omega_i$ is a frequency and $s_i$ the signal measured by the instrument, for instance a vectorial network analyser (VNA).
+
+We whould like the find the global minimum of the least square risk. In this context it reads:
+
+$$
+R_{LS}(a, b, c, d) = \frac{1}{N}\sum_i \left| s_i - \frac{a+b\omega_i}{c+d\omega_i}\right|^2
+$$
+
+We write:
+
+$$
+X =
+\begin{bmatrix}
+1, \omega_1 \\
+\vdots \\
+1, \omega_N \\
+\end{bmatrix},
+y =
+\begin{bmatrix}
+s_1 \\
+\vdots \\
+s_N \\
+\end{bmatrix}
+w =
+\begin{bmatrix}
+a \\
+b \\
+\end{bmatrix},
+m =
+\begin{bmatrix}
+c \\
+d \\
+\end{bmatrix}
+$$
+
+We now introduce the following empirical risk:
+
+$$
+R(w, m) = || \mathcal{D}(y)Xm - Xw||_2^2
+$$
+
+Where $\mathcal{D}$ is a short hand for the diagonal matrix with the elements of $y$ on its diagonal:
+
+$$
+\mathcal{D}(y) = \begin{bmatrix}
+y_1 & & \\
+& \ddots & \\
+& & y_N
+\end{bmatrix}
+$$
+
+Note that this risk is not yet the one associated with the least square regression, however its zeros includes the one of the least square risk. Indeed, if $R_{LS}(w, m) = 0$ then we have $R(w, m) = 0$.
+
+We now solve for $\nabla_w R(w, m) = \nabla_m R(w, m) = 0$ :
+
+$$
+\begin{align}
+X^\dagger X w - X^\dagger \mathcal{D}(y) X m = 0 \\
+X^\dagger \mathcal{D}(|y|^2) Xw - X^\dagger \mathcal{D}(y^*) X m = 0
+\end{align}
+$$
+
+We write:
+
+$$
+\begin{align}
+A &= (X^\dagger X)^{-1} X^\dagger \mathcal{D}(y) X \\
+B &= (X^\dagger \mathcal{D}(|y|^2) X)^{-1} X^\dagger \mathcal{D}(y^*) X \\
+C &= \begin{bmatrix}
+0_2, A \\
+B, 0_2
+\end{bmatrix}
+\end{align}
+$$
+
+Leading to:
+
+$$
+\begin{bmatrix}
+w \\
+m
+\end{bmatrix} = C \begin{bmatrix}
+w \\
+m
+\end{bmatrix}
+$$
+
+Diagonalizing this $4\times4$ matrix and looking for its eigen vector associated with the eigen value $1$ allows to efficiently solve for $a, b, c, d$.
+
+This is very nice and efficient to compute, though in the case of noised signals the fit while eventually fail since this risk dose not coincide with $R_{LS}(w, m)$.
+
+To solve this issue, one can observe that the $R(w, m)$ we introduce corresponds to $R_{LS}(w, m)$ where each data point has been weighted by $|c+d\omega|$ which has the bad taste of being maximal away from the resonance. Fortunately for us, it happens that the empirical gradient of the signal encodes for this quantity:
+
+$$
+\sqrt{|\nabla_\omega S_X(\omega)|} = \sqrt{\left|\frac{b}{d}\left(\frac{c}{d}-\frac{a}{b} \right)\right|}\frac{1}{|c+d\omega|} \propto \frac{1}{|c+d\omega|}
+$$
+
+You can now pick your prefered empirical estimator of the gradient $\tilde\nabla_X(y)$ such as the convolution with the derivative of a gaussian kernel for instance. In the limite where this estimation of the gradient is accurate, we have $R_{LS}(w, m) = R^*(w, m)$, where:
+
+$$
+R^*(w, m) = \frac{1}{N}||\mathcal{D}\left(\sqrt{|\tilde{\nabla}_X(y)|}\right) (\mathcal{D}(y)Xm - Xw)||_2^2
+$$
+
+The corrected values for the matrices $A$ and $B$ are:
+
+$$
+\begin{align}
+A &= (X^\dagger \mathcal{D}(|\tilde{\nabla}_X(y)|) X)^{-1} X^\dagger \mathcal{D}(y|\tilde{\nabla}_X(y)|) X \\
+B &= (X^\dagger \mathcal{D}(|\tilde{\nabla}_X(y)||y|^2) X)^{-1} X^\dagger \mathcal{D}(y^*|\tilde{\nabla}_X(y)|) X
+\end{align}
+$$
+
+Performing the conversion from the coefficients $a, b, c, d$ to the relevent quantities depending on the resonator geometry is now only a matter of simple algebra.
+
+### 3. Estimation of the electrical delay
+
+Assuming a flat frequencial landscape, the best estimator of the electrical delay one can write is the following:
+
+$$
+\lambda_\text{flat} = \frac{1}{N} \sum_{i=0}^{N-1} \frac{\arg(s_{i+1}/s_i)}{\omega_{i+1} - \omega_{i}}
+$$
+
+Please observe that this estimator should be much more robust to noised signals than performing an unwraping of the signal phase such as the one implemented in the Python library Numpy in the function `unwrap`.
+
+In the case of a simple resonator, the signal performs at wrost a full revolution around the origin of the complex plane. Since on modern hardware the diagonalisation of a four by four matrix such as $C$ is so fast, one can brute force all the values of lambda in the range:
+
+$$
+\lambda \in \left[ \lambda_\text{flat} - \frac{1.5}{\max_{i}(\omega_i)-\min_{i}(\omega_i)}, \lambda_\text{flat} + \frac{1.5}{\max_{i}(\omega_i)-\min_{i}(\omega_i)} \right]
+$$
+
+
+This simple method proves to be really efficient.

abcd_rf_fit-0.1.3/abcd_rf_fit/__init__.py

@@ -0,0 +1,4 @@
+from .abcd_rf_fit import fit_signal, get_abcd, analyze
+from .plot import plot
+from .synthetic_signal import get_synthetic_signal
+from .resonators import ResonatorParams, get_fit_function