✦ LIBER ✦

A rank correlation-based method for power network reduction

✍ Scribed by E. Atmaca; N. Serifoglu

Publisher: Springer
Year: 2003
Tongue: English
Weight: 457 KB
Volume: 85
Category: Article
ISSN: 1432-0487
DOI: 10.1007/s00202-003-0165-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A synthesis method for power network ext

A synthesis method for power network extension

✍ Dr. Károly Szendy 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB

A diagnostic for heteroscedasticity base

A diagnostic for heteroscedasticity based on the spearman rank correlation

✍ Y. Yin; R.J. Carroll 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 526 KB

A simplified method for cross correlatio

A simplified method for cross correlation power spectrum analysis

✍ Norikazu Horiuchi 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 387 KB

A base reduction method for convex progr

A base reduction method for convex programming

✍ João J.S. Sentieiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 226 KB

A symbolic method for network function a

A symbolic method for network function approximation with order reduction

✍ Aguirre, Idoia; Carlosena, Alfonso 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

This letter presents a method to approximate a symbolic network function of any order to a second-order one. The method is based on the symbolic calculation of the displacement of the main roots of a polynomial due to the variations of a given parameter, assuming the ideal circuit (polynomial) of or

A transformation method for the solution

A transformation method for the solution of power switching circuits based on network topological concepts

✍ J. Milias-Argitis; Th. Zacharias 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 951 KB