Displaying similar documents to “Multiplication of Polynomials using Discrete Fourier Transformation”

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

Schur's Theorem on the Stability of Networks

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

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

Subloops of sedenions

Benard M. Kivunge, Jonathan D. H Smith (2004)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This note investigates sedenion multiplication from the standpoint of loop theory. New two-sided loops are obtained within the version of the sedenions introduced by the second author. Conditions are given for the satisfaction of standard loop-theoretical identities within these loops.