A new method for approximating passive network functions
β Scribed by H. J. Carlin; P. Kotiveeriah
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 736 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0098-9886
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The problem of efficiently approximating real frequency data, which represents either measured information of a physical system or idealized curves to be realized by rational positive real (PR) or bounded real (BR) functions is considered. The final rational function is guaranteed in advance to satisfy the conditions of physical realizability. All the steps of approximation are executed in the real frequency domain. Illustrative, numerical examples are given.
π SIMILAR VOLUMES
This letter presents a method to approximate a symbolic network function of any order to a second-order one. The method is based on the symbolic calculation of the displacement of the main roots of a polynomial due to the variations of a given parameter, assuming the ideal circuit (polynomial) of or
## Abstract We present a simple iterative procedure for approximating the Pareto surface of a set __S__ and the only assumption is that __S__ is closed and bounded. The algorithm creates a sequence of upper bounds for the Pareto surface and these upper bounds tighten towards the surface as the numb
In the framework of nonrelativistic quantum mechanics in 3 dimensions, we propose a new way of calculating the energies of the 1l-states from the properties of the 1s-state. The method is based on the generalized Bertlmann Martin inequalities, corrected to obtain approximative relationships relating
Fock scattering functions are necessarily used in the solution of cur¨ed surface diffraction problems faced by terrestrial communication system designers. These functions must be interpolated when their arguments are between y3 and 2. In the con¨entional method, a two-point Lagrange formula is used