Improved methods of synthesizing linear networks by coefficient matching

Attention is drawn to a number of possible variants in the detailed application of the coefficient matching technique to the computer synthesis of lumped linear networks. Tables of run times obtained with a numerical example provide some indication of the relative computational efficiency of the methods instanced. Simple closed form expressions for the optimum value of the multiplicative constant are derived for three variants; an illustrative table demonstrates that their use greatly improves the rate and range of convergence of the method.