A symbolic sensitivity computation algorithm
Daniel, John Hale
Chan, Shugar G.
Bach, Ralph E. Jr.
MetadataShow full item record
A study and pursuant development is described of a digital computer program for the computation of transfer function sensitivities in a symbolic form suitable for storage and subsequent repetitive numerical evaluation over a range of frequencies or parameter values. The algorithm is implemented in conjunction with the Network Analysis for Systems Applications Program (NASAP) version developed by R. S. Schwartz at Northwestern University. Several sample problems, as well as suggestions for possible improvement of the algorithm and its extrapolation into the areas of optimization and automatic design, are included.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ...