The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 3 of 3

Showing per page

Schur's Theorem on the Stability of Networks

Christoph Schwarzweller, Agnieszka Rowińska-Schwarzweller (2006)

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 networks.In this article we prove Schur's criterion [17] that allows to decide whether a polynomial p(x) is Hurwitz without explicitly computing its roots: Schur's recursive algorithm successively constructs polynomials pi(x) of lesser degree by division with x - c, ℜ {c} < 0, such that pi(x) is Hurwitz if...

Signals generated in memristive circuits

Artur Sowa (2012)

Nanoscale Systems: Mathematical Modeling, Theory and Applications

Signals generated in circuits that include nano-structured elements typically have strongly distinct characteristics, particularly the hysteretic distortion. This is due to memristance, which is one of the key electronic properties of nanostructured materials. In this article, we consider signals generated from a memrsitive circuit model. We demonstrate numerically that such signals can be efficiently represented in certain custom-designed nonorthogonal bases. The proposed method ensures that the...

Currently displaying 1 – 3 of 3

Page 1