Displaying 341 – 360 of 702

Showing per page

A Test for the Stability of Networks

Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller (2013)

Formalized Mathematics

A complex polynomial is called a Hurwitz polynomial, if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical (analog or digital) networks. In this article we prove that a polynomial p can be shown to be Hurwitz by checking whether the rational function e(p)/o(p) can be realized as a reactance of one port, that is as an electrical impedance or admittance consisting of inductors and capacitors. Here e(p) and o(p) denote...

A topological dichotomy with applications to complex analysis

Iosif Pinelis (2015)

Colloquium Mathematicae

Let X be a compact topological space, and let D be a subset of X. Let Y be a Hausdorff topological space. Let f be a continuous map of the closure of D to Y such that f(D) is open. Let E be any connected subset of the complement (to Y) of the image f(∂D) of the boundary ∂D of D. Then f(D) either contains E or is contained in the complement of E. Applications of this dichotomy principle are given, in particular for holomorphic maps, including maximum and minimum modulus principles,...

Currently displaying 341 – 360 of 702