Higher derivative network sensitivities using adjoint network

Higher derivative sensitivity coefficients for a lumped linear time‐invariant networks are derived by an extension of the method used by Richards to calculate second derivative sensitivity coefficients. A computer algorithm to generate these coefficients efficiently is provided together with array space and the number of operations required at each stage. Extensions of the above approach for networks containing distributed and nonlinear elements are also discussed. Finally, time domain sensitivity results are derived and the corresponding changes in the computer algorithm indicated.