posed of MulliportsMftn fre,; Vol 39 Nov 1970

pp. 1013-1014. [ 3 ] Reed J., and G.J. Wheeler, "A Method of Analysis of

Symmetrical Four-port Networks," IRE Trans. Micro

wave Theory Tech, Vol. MTT-4, Oct. 1956, pp. 246 262 14] Weinberg.L., Scattering Matrix and Transfer Scattering

Matrix," in Amplifiers К F Shea, Ed New York- McGraw

Ш1, 1966

[5] Monaco, V.A., and P. Tiberio, Coraputer-Aided Analysis of

Microwave Circuits," IEEE Trans. Microwave Theory Tech

Vol. МТГ.22, Mar 1974, pp. 249-263. [6] Monaco, V.A., and P. Tiberio, "Automatic Scattering Matrix

Computation of Microwave Circuits " Alta Freq. Vol 39

Feb. 1970, pp 59-64. [7] Okoshi т., et al.. "The Segmentation Method - An Approach

to the Analysis of Microwave Planar Circuits," IEEE Trans.

Microwave Theory Tech., Vol. МТГ-24, Oct. 1976, pp 662

[8] Chadha, R. and K.C Gupta, "Segmentation Method Using Impedance Matrices for Analysis of Planar Microwave Circuits," IEEE Ti-ans. Microwave Theory Tech Vol MTT-29, Jan 1981 pp. 71-74

[9] Sharma, P.C., and K.C. Gupta, "Desegmentstion Method for Analysis of Two-dimensional Microwave Circuits," IEEE Trans. Microwave Theory Tech., Vol. MTT-29, Oct. 1981 (to appear)

110] Sharma, P.C., and*KC. Gupts, "A Generalized Method for De-embedding of Multiport Networks " (to be published)

U] Calahan, D.A., Computer-AidedNetwork Design, New York McGraw-HUl, 1972, Ch. 5, "Sensitivity Calculations

[2 ] Chua, L.0 , and P M. Lin, Computer Aided Analysis of Electronic Circuits: Algorithms and Computational Tech niques, Englewood Cliffs, New Jersey Prentice-Hall Inc., 1976, Ch. 15, "Frequency-Domain and Tune-Domain Se-isitlvity Calculations."

[3J Fidler, J.K., and С Nightingale Q>mputer Aided Orcuit Design, Middlesex U.K.: Thomas Nelson and Sons Ltd., 1978 Ch. 6 on "Sensitivity."

[4] luculano G , etfl/., "A Computer Program for Sensitivity and Group Delay Evaluation of Linear Networks," Alta Freq., Vol. 40, Nov. 1971, pp. 873-880

[5] Handler, J.W., and R E. Seviora, Wave Sensitivities ot Networks," IEEE Trans. Microwave Theory Tech Vol MTT-20, Feb. 1972, pp. 138-147.

[6] Rauscher C, "A Fast Evaluation of S-parameter Sensitiv ities,"A £ a. Band 28, Heft 3 1974, pp. 113-114

[7] Sablatasii, M., and R. Seviora Sensitivity Invariants for Scattering Matrices," IEEE Trans Circuit Theory, Vol CT.18, Mar 1971 pp. 282 284

[8] Rauscher, C, and G. Epprecht, Large-change Sensitivity Analysis of a Microwave Network by Means of Scattering Parameters, Band28 Heft 2, 1974, pp 95 96

] 1 ] Geher, K., TTieory of Network Tolerances Budapest Akademiai Kiodo 1971

[2] Calahan, D.A., Computer-.MdedNetwork Design, New York McGraw-Hill, 1972, Ch. 7 on "Tolerance Analysis.

[3] Fidler,4 K., and С Nightingale, Computer/lirfed Circuit Design, Middlesex U.K.: Thomson Nelson and Sons Ltd , 1978, Sec 6.3 on "Tolerance Analysis."

[4 ] Dnector, S.W., and G D. Hachtel, "The Siraplicial Approximation Approach to Design Centering," IEEE Trans. Circuits and Systems, Vol. CAS-24, July 1977, pp 363-372.

[6] Bandler, J.W., etflf. Integrated Approach to Microwave

Design," IEEE Trans Microwave Theory Tech Vol MTT 24 Sept. 1976, pp. 584 591.

[6] Karafm, B.J., "Optimum Assignment of Component Toler ancestor Electrical Networks,"SS Г J Vol 60, No 4, April 1971, pp. 1225-1242

17) Gupta, К С, and R Chadha, "Design Real World Stripline

Circuits," Aficroiyoues /о1 П, No 12. Dec 1978, pp. 70«).

{Bj Monroe. ME, Theory of Probobi/iYy, New York McGraw Hill, 1951

[9] Chambers, R.P., "Random Number Generation on Digital Computers," ffi££5pec(rum Vol 4. Feb 1967 pp 48-56

[ 1 ] Branin, F H., "Transient Analysis of Lossless Transmission Lines," Proc. IEEE, Vol. 55,1967, pp. 2012-2013

[2] Dvorak, V. "Transient Analjis of Non-uniform Transmission Lines, Proc. IEEE, Vol. 58. 1970, pp. 844 845

[ 3 ] Ames, W.F., Nonlinear Partial Differential Equations in Engineering New York: Academic Press, 1965, Chap. 7

[4] Silverberg, M., and O. Wmg, ""Пте Domain Computer Solu tions for Networks Containing Lumped Nonlinear Elements " IEEE Tram. Circuit Theory, Vol. CT 15, 1968 pp. 292-294

[ 5 ] Allen, J.L. "Time-domain Analysis of Lumped-Distributed Networks," IEEE Trans. Microwave Theory Tech. Vol. MTT-27,1979. pp. 890-896.

[63 Calahan, D.A., Computer-Aided Network Design, New York: McGraw-Hill, 1972, Chapter 4 "Transient Analysis of Dynamic Networks." pp. 80-105.

[7] Fidler, J.K., and C. Nightingale, Computer Aided Circuit Analysis, Middlesex (U.K.): Thomas Nelson and Sons Ltd 1978, Chap. 5, "Transient Analysis." pp. 127-169.

[8] Rohrer. R.A.. Circuit Theory An Introduction to the State Variable Approach, New York McGraw-Hill, 1970

[9] Chua, L.O., and P.M. Lin, Computer-Aided Analysis of Elec tronic Circuits. Algorithms and Computational Techniques, Englewood Cliffs, New Jersey: Prentice-Hall, 1975. Chapters 8 to 11

[1] Chua, L.O., and P.M Lm, Computer-Aided Analysis of

Electronic Circuits: Algorithms and Computational Tech niques Englewood Cliffs New Jersey Prentice Hall, Inc,

1975, Chapter 16. "Introduction to Sparse-Matrix Tech

niques for Circuit Analysis " [2] Fox, L An Introduction to Numerical Linear AlgebYa New

York: Oxford University Press, Inc., 1965. [3] Bonfatti, F., etal, "Microwave Circuit Analysis by Sparse

matrix Techniques," IEEE Trans. Microwave Theory Tech

Vol. MTT 22, March 1974, pp 264-269 [4] Rose, D.J., and R.A Willoughby, eds., Sparse Matrices and

Their Applications, New York. Plenum Press 1972 [5] Tewarson RP Sparse Matrices New York Academic

Press, 1973

[6] Bunch, J.R. and D.J. Rose, Sparse Ma(nx Com/»u(a((ons

New York- Academic Press. 1976. [ 7 ] Duff, I.S., A Survey of Sparse Matrix Research, Рюс

IEEE, Vol. 65 1977, pp 500-535. [8] Markowitz, H.M., "ТЪе Elimination Form o( the Inverse

and its Application to Linear Programming " Management

Sci., Vol. 3.1957 pp. 255-269 [9] Duff, L.S.. "On the Number of Non-Zeros Added when Gaus

sian Elimination is Performed on Sparse Random Matrices,"

Math. Comput, Vol. 28,1974, pp 219-230. [ 10] Haieh, H.Y., and M.S. Ghousi, "On Optimal Pivoting AJgo

rithms in arse Matrices," IEEE Trans Circuit Theory

Vol. CT-19.1972. pp. 93-96. [11] Knuth, O.E. The Art of Computer Programming. Уо] 1

Fundamental Algorithm* Reading MA- Addison Wesley

1968

[ 12] Gustavson, F.G.. et ai, "SymboUc Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations " J Assoc. Comput Math., Vol. 17, 1970, pp. 87 109

[13] Curtis, A.R., and J.K. Reid, The Solution of Iarge arse

Unsymmetric Systems of Linear Equations," J Inst Math

Appi, Vol. 8 1971. pp. 344-353 [ 14] Cbuobiri, E.C., et ai, "Sparsity-Directed Decomposition for

Gaussian Elimination of Matrices," IEEE Trans. Power App.

Syst Vol PA8-89 1970 pp 141 150

[11 Temes, G.C and D A Caiahan,43omputer-Aided Network Optimization, the State-of Art," Proc IEEE, Vol 55 Nov 1967. pp. 1832 1863

[2] Waren, A.D., L.S. Lasdon, and D.F. Suchman, "Optimization in Engineering Design," A-oc IEEE Vol 55 Nov 1967, pp. 1865-1897

13] Bandler, J.W, Optimization Methods for Computer-Aided Deagn." IEEE Thins. Microivave Theory and Techniques, Vol МТГ 17 Aug. 1969. pp 533 552

[4] Temes. G.C, "Optimization Methods m Circuit Design in Computer Oriented Circuit Design, F.F. Kuo and W G Magnuson, ir.. Eds., Englewood Cliffs, N.J.: Prentice-Hall, 1969

[ 5 ] Director, S W.. "Survey of Circuit-Oriented Optimization Techniques," IEEE Trans. Circuit Theory Vol CT 18 Jan. 1971, pp. 3-10.

[6] Charalambous, C, * AUnified Review o! i ipumization "

IEEE Trans. Microivave Theory and Techniques, Vol.

МТГ-22 March 1974, pp. 289-300 17] Fidler. J.K., and C. Nightingale, Computer Aided Circuit

Design, Middlesex: Thomas Nelson and Sons Ltd., 1978

Chapter 7 on "Circuit Optimization " [8] Rao S S.. Optimization - Theory and Applications,

New Delhi: Wiley Eastern Limited. 1978

[9] Lavi, A.,and T.P. Vogel, Eds. Recent Advances in Optimization Techniques, New York: Wfley, 1966

[ 10] Box, M.J., D. Davies, and W.H Swann, Nonlinear Optimization Techniques, ЖдлпЬт Scotland: Oliver and Boyd, 1969

[ 11 ] Box, M.J "A Comparison of Several Current Optimization Methods and the Use of Transformation in Constrained Problems," Computer J, Vol. 9, May 1966. pp 67-77.

[12] Fiacco, A. v., and G.P. McCormick, "1Ъе Sequential Un constrained Minimization Technique for Nonlinear Programming, a Primal-Dual Mathod," Management Sci, Vol 10, Jan 1964, pp. 360-366

113] Fiacco. A.v., and G.P. McCormick, Computational

Algorithm for the Sequential Unconstrained Minimization Technique for Non-linear Programming," Management Set Vol. 10, July 1964. pp. 601-617

[ 14] Wilde, D.J., Optimum Seeking Methods Englewood Cliffs NJ.: Prentice Hall 1964

[15] Powell, M.J.D., "An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives " Computer J., Vol. 7, July 1964, pp. 155-162

[16] Fletcher, R., and CM. Reeves, Function Minimization hy Conjugate Gradients," Computer J., Vol. 7, July 1964 pp. 149-154.

[ 1 ] Hooke, R., and T.A. Jeeves. "Direct Search Solution of Numerical and Statistical Problems." Jour ACM Vol. 8, 1961, pp. 212-229.

[2] Powell, M.J.D., "An Efficient Method for Fmdmg the Minimum of a Function of Several Variables without Calculating Derivatives." Computer J., Vol. 7 No 4 1964, pp. 303-307

f3] Bandler, J W., and P A MacDonald Optimization of Microwave Networks by Razor Search." IEEE Trans Microwave Theory Tech., Vol MTT-17 1969, pp. 552 562

[4] Rosenbrock, H.H., An Automatic Method for Finding the Greatest or Least Value of a Function," Computer J Vol 3, Oct 1960. pp 175-184

[5] Spendley.W G.R. Hext and F.R Hirnsworth. "Sequential Application of Simplex Designs in Optimization and Evolutionary Operation," Technometrics Vol. 4,1962 p. 441.

[6] Nelder, J. A, and R Mead, "A Simplex Method for Function Minimization." Computer J Vol. 7.1965, p. 308

f 7] Rao, S.S., Optimization: Theory and Applications, New Delhi: Wiley Eastern Limited, 1978, p. 270

[8] Ralston A, A First Course in Numerical Analysis, New