ON SOLVING BROAD-BAND MATCHING DESIGN EQUATIONS

Algorithms are presented which may be applied to: (1) Determining the real solution set in one variable plane, of a polynomial equation in many variables, where each variable other than the chosen one is confined to given intervals. (2) Determining the real solution set in one variable plane, of a system of polynomial equations and inequalities, where the number of variables is greater than the number of equations, and each variable other than the chosen one is confined to given intervals. These algorithms are applied in certain cases of broadband matching design, which presented in the past some numerical difficulties. Illustrative examples are provided.