✦ LIBER ✦

A note on the computation of large-change sensitivities

✍ Scribed by Downs, T.

Book ID: 114614673
Publisher: Institute of Electrical and Electronics Engineers
Year: 1973
Tongue: English
Weight: 214 KB
Volume: 20
Category: Article
ISSN: 0018-9324
DOI: 10.1109/tct.1973.1083772

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the computation of large-chang

A note on the computation of large-change multiparameter sensitivities

✍ R. Krishnan; T. Downs 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

Comments on "Large-Change Sensitivities

Comments on "Large-Change Sensitivities of Linear Digital Networks

✍ Lawson, S. 📂 Article 📅 1979 🏛 IEEE ⚖ 195 KB

Efficient computation of large change mu

Efficient computation of large change multiparameter sensitivity

✍ K. Singhal; J. Vlach; P. R. Bryant 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

## Abstract In many applications, a network has to be solved repeatedly while certain element values are changed. The computation is reduced significantly if the network functions are generated in terms of these variable parameters explicitly. This paper presents a method of doing this which requir

A Note on the Computation of Orbits.

✍ P. Herget 📂 Article 📅 1934 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

A note on the ‘parallel computation thes

A note on the ‘parallel computation thesis’

✍ Norbert Blum 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 221 KB

A note on the computation of Markovian s

A note on the computation of Markovian systems

✍ N. Limnios 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 180 KB

In this paper we propose a new method for the numerical resolution of the Kolmogorov equations for continuous time Markov chains. The numerical treatment required is very simple as for the discrete time Markov chain. An accurate error analysis is derived by Shur's theorem.