Displaying similar documents to “Schur's Theorem on the Stability of Networks”

A Test for the Stability of Networks

Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller (2013)

Formalized Mathematics

Similarity:

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)...

Introduction to Rational Functions

Christoph Schwarzweller (2012)

Formalized Mathematics

Similarity:

In this article we formalize rational functions as pairs of polynomials and define some basic notions including the degree and evaluation of rational functions [8]. The main goal of the article is to provide properties of rational functions necessary to prove a theorem on the stability of networks

Multiplication of Polynomials using Discrete Fourier Transformation

Krzysztof Treyderowski, Christoph Schwarzweller (2006)

Formalized Mathematics

Similarity:

In this article we define the Discrete Fourier Transformation for univariate polynomials and show that multiplication of polynomials can be carried out by two Fourier Transformations with a vector multiplication in-between. Our proof follows the standard one found in the literature and uses Vandermonde matrices, see e.g. [27].

Solving quadratic equations over polynomial rings of characteristic two.

Jorgen Cherly, Luis Gallardo, Leonid Vaserstein, Ethel Wheland (1998)

Publicacions Matemàtiques

Similarity:

We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A. We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction,...