Further Results on Bose s 2D Stability Test
|
|
- Jane Berry
- 6 years ago
- Views:
Transcription
1 Further Results on Bose s D Stability Test Minoru Yamada, Li Xu, Osami Saito Gifu National College of Technology, Shinsei-cho, Gifu, Japan, Faculty of System Science and Technology, Akita Prefecture University, 84-4 Ebinokuchi, Tsuchiya, Honjo, Akita , Japan, Chiba University, Inageku, Chiba, Japan myamada@gifu-nct.ac.jp, xuli@akita-pu.ac.jp saito@cute.te.chiba-u.ac.jp Keywords: discrete system, D systems, stability test, Sturm s method. Abstract This paper proposes some further improvements on Bose s D stability test by revealing symmetric properties of the polynomials and resultant occurring in the test and utilizing Sturm s method. Consequently, the improved test can be fulfilled by a totally algebraic algorithm and the complexcity of computation is largely reduced as it involves only certain real variable polynomials with degrees not exceeding half of their previous complex variable counterparts. Nontrivial examples are also illustrated. Introduction Owing to its great importance, the problem of algebraic test for D (two-dimensional) filter stability has been continuously attracting considerable attention,, 4. A D discrete filter given by the transfer function G(z, z ) = N(z, z ) D(z, z ) is (structurally) stable by definition iff () D(z, z ) 0, z, z () where N and D are assumed to be D factor coprime polynomials. It is well known that the condition of () is equivalent to the conditions 5 D(z, 0) 0, z (3) D(z, z ) 0, z =, z. (4) The condition of (3) can be checked by the well-known D methods, and the main difficulty is how to test the condition (4). Based on Schussler s D stability criterion, Bose has developed a resultant-based algebraic test for (4) and further a simplified version of it as follows,. Let D(z, z ) be a D polynomial which may have complex coefficients, n the degree of D(z, z ) in z, and write D (z, z ) = z n D(z, z ) in the form n D (z, z ) = d k (z )z k (5) where d k (z ) are D polynomials in z with perhaps complex coefficients. Furthermore, define D s (z, z ) = n n d k (z )z k + z n d k (z )z k D a (z, z ) = n n d k (z )z k z n d k (z )z k where d k (z ) denotes the complex conjugates of both the coefficients and the indeterminate z. Then, the (simplified) Bose s test for (4) is given by the following theorem. Theorem The polynomial D (z, z ) 0 for z =, z, or equivalently, D(z, z ) 0 for z =, z iff (a) d 0 ()/d n () <, (b) all the zeros of D s (, z ) and D a (, z ) are simple, are located and also alternate on z =, and (c) the resultant R(z ) of D s (z, z ) and D a (z, z ) satisfies that R(z ) 0 for z = e jθ, 0 θ < π. Since D s (, z ) and D a (, z ) are both D polynomials, it is possible to test the conditions of (b) by using e.g. the D continued fraction expansion method. On the other hand, the resultant R(e jθ ) is a trigonometric function and it may not be so straightforward in general to simplify systematically this trigonometric function and carry out the test of condition (c) though a possibility utilizing Chebyshev polynomials has been suggested in. The purpose of this paper is to propose some further improvements on Bose s test so that the test can be fulfilled more efficiently by a totally algebraic algorithm and can be implemented more easily and systematically into a D CAD
2 system 6. As main results, it is first shown that D s (, z ), D a (, z ) can be expressed in the form D s (, z ) = L (z )F (z ) and D a (, z ) = L (z )F (z ) where F (z ), F (z ) are certain self-inversive polynomials, thus can be easily converted into polynomials F (x ), F (x ) with degrees in the real variable x = (z + z )/ not exceeding n /. This fact leads to a result that the condition (b) holds true iff the zeros of F (x ) and F (x ) are simple, are located and also alternate in certain order within < x <, and this can be tested by using some extended results of Sturm s method. In fact, this is a significant new result even for D stability test as it clarified that by utilizing the symmetric properties of the related polynomials we only need to carry out the test for certain real variable polynomials with degrees not exceeding half of the degrees of the original polynomials. Further, it is shown that the resultant R(z ) is in fact a self-inversive polynomial itself and thus can be converted into a polynomial R(x) with the degree in x = (z + z )/ being only half of the degree of R(z ) in z. Therefore, the test of (c) can be readily accomplished by direct application of Sturm s method to R(x ) on x without any other computational effort which is generally required for testing R(e jθ ) = 0 on 0 θ < π as mentioned above. For simplicity, we will only consider the case for stability test of polynomials with real coefficients in this paper, and will report its extensions to the case with complex coefficients on some other occasion. The paper is organized as follows. In Section, new results for D stability test will be given, while in Section 3 the self-inversive property of the resultant R(z ) will be shown and possible improvements for Bose s D stability test will be summarized. Nontrivial examples for polynomials having both numerical and literal coefficients will be also shown in Section 4 to illustrate the computational advantages of the improved test. Finally, Section 5 concludes the paper with some comments for related further topics. New Results for D Test Let F (z) be a D polynomial of degree n described by F (z) = n f k z k (6) where f k, k = 0,,..., n are real coefficients and define F, F as F (z) = (F (z) + zn F (z )) = F (z) = (F (z) zn F (z )) = n f,k z k (7) n f,k z k (8) For the stability of F (z), the following result has been well known 7. Lemma The polynomial F (z) is stable, i.e., F (z) 0, z > iff f 0 /f n <, and the zeros of F (z) and F (z) are simple, are located and further alternate with each other on the unit circle z =. This stability criterion can be tested by the well-known CFE (continued fraction expansion) approach. However, we want to show here that by revealing and utilizing the symmetrical properties of F (z), F (z), two real variable polynomials F (x), F (x) corresponding respectively to F (z) and F (z) can be constructed which have degrees not exceeding half of the ones for F (z), F (z), and the stability of F (z) can now be tested by just checking if F (x), F (x) satisfy the conditions of Lemma within the real interval < x < which can be easily fulfilled by using some extended results of Sturm s method. Lemma F (z), F (z) can be expressed as follows. F (z) = F (z) = z n/ F (z) z (n )/ (z + ) F (z) n: evne n: odd (9) z n/ (z z ) F (z) n: even z (n )/ (z ) F (z) n: odd (0) where F i (z), i =, are self-inversive polynomials given by F i (z) = m f i,0 + f i,k (z k + z k ) () and when n is even, f,k = f,n/+k, k = 0,,, n/(= m) () f,k = f,n/+k+ + f,n/+k f,n/+l, l = when n is odd, k = 0,,..., n/ (= m) (3) n/ n/ + k : even, (4) n/ n/ + k : odd; f,k = f,(n+)/+k f,(n+)/+k+ +f,(n+)/+k+ + ( ) (n )/+k f,n, k = 0,,..., (n )/(= m) (5) f,k = f,(n+)/+k + f,(n+)/+k+ + + f,n k = 0,,..., (n )/(= m). (6) Proof. F (z), F (z) can be always written as F (z) = n n f k z k + z n f k z k = n n f k z k + f k z n k = n n f k z k + f n k z k
3 = n (f k + f n k )z k (7) F (z) = n n f k z k z n f k z k = n (f k f n k )z k (8) Comparing (7), (8) with (7), (8), we see f,k = f,n k = f k + f n k (9) f,k = f,n k = f k f n k (0) If n is even, multiplying (7) by z n/ yields z n/ F (z) = n f,k z k n/ = n/ n f,k z k n/ + f,n/ + f,k z k n/ k=n/+ = n/ n/ f,n/ k z k + f,n/ + f,n/+k z k = n/ n/ f,n/+k z k + f,n/ + f,n/+k z k = n/ f,n/ + f,n/+k (z k + z k ) () where f,k = f,n k was used. Setting the right-hand side of () as F (z), we get the results of (9), () and (3). Further, multiplying (8) by z n/ gives z n/ F (z) = n f,k z k n/ = n/ n f,k z k n/ + f,n/ + f,k z k n/ k=n/+ = n/ n/ f,n/ k z k + f,n/ + f,n/+k z k = n/ n/ f,n/+k z k + f,n/+k z k n/ = f,n/+k (z k z k ) () where the relations f,k = f,n k, f,n/ = f n/ f n/ = 0 were applied. Since z k z k = (z z )(z k + z k z k+3 + z k+ ) for k, () can be expanded as z n/ F (z) = (z z ) f,n/+ ( ) +f,n/+ ( z +z ) +f,n/+3 ( z + + z ) +f,n/+4 ( z 3 + z +z + z 3 ) +f,n/+5 (z 4 +z + + z + z 4 )... f,n (z z n/ n )}, : odd f,n (z n/ + +z+z + +z n/ )}, n : even By collecting all the coefficients of the terms of and (z k + z k ), k =,..., n/ in the parentheses and denoting the calculated coefficients as f,k, the relation z n/ F (z) = (z z ) f,0 + n/ f,k (z k + z k ) (3) can be obtained which implies (0), (). It is ready to verify that f,k satisfy (3). The results corresponding to the case when n is odd can be shown in similar way, thus is omitted here for brevity. Corollary The coefficients f i,k, i =, for F i (z) defined by () can be calculated recursively as follows. f, n +k, k = 0,,..., n n : even f,k = f, n+ +k f,k+, k =0,,..., n n : odd (with f, n = f,n ) f,k = f, n +k+ + f,k+, k = 0,,..., n 3, n : even (with f, n = f,n, f, n = f,n ) +k+ f,k+, k = 0,,..., n, n : odd (with f, n = f,n ). f, n+ Proof. It follows directly from (3) (6). As F i (z), i =,, are self-inversive polynomials and z = z on the unit circle z =, Fi (z), i =, can be converted into polynomials in real variable x = (z + z )/ by the method given in 3. Theorem The polynomial F (z) is stable iff f 0 /f n < and all the zeros of ˆF (x) and ˆF (x) are simple, are located and also alternate within the interval < x <. Further, when n is odd, ˆF (x) has a zero on the most right side, or equivalently, ˆF (x) has a zero on the most left side. Proof. Omitted. We show next the conditions of Theorem can be easily tested by using the extended Sturm s theorem given by Lemma 3. Let g(x), g (x) be two given real variable polynomials, and without loss of generality denote g(x) the one whose degree is not less than the other one. Further, for simplicity, suppose that g(x) and g (x) possess no common zeros. Define the following function series starting from g(x), g (x). g(x), g (x), g (x),, g l (x) (4)
4 where g i (x) = h i (x)g i (x) g i+ (x), i =,,..., l (5) Lemma 3 8 Let V (x) denote the number of variation of the sign in the polynomial series (4) constructed from g(x) and g (x), and suppose that for the interval a < x < b, g(x)/g (x) 0 at the points x = a, x = b. Then, V (a) V (b) = χ(x 0 ) (6) where x 0 x g(x)/g (x)=0} X (x 0 ) 0, the sign of g(x)/g (x) does not change =, the sign of g(x)/g (x) changes from to +, the sign of g(x)/g (x) changes from + to Based on the above lemmas, the following theorem can now be given. Lemma 4 Let g(x) = ˆF (x), g (x) = ˆF (x), and define V (x) as above for the polynomial series (4) corresponding to ˆF (x), ˆF (x). Then, polynomial F (z) satisfies the conditions of Theorem, i.e., F (z) is stable, iff V ( ) V () = sign(f,n f,n ) n, (7) when n is even, while when n is odd. Proof. Omitted. V ( ) V () = sign(f,n f,n ) n 3 New Results for D Test (8) Another important step in Bose s D stability test is testing whether the resultant R(z ) of D s (z, z ) and D a (z, z ) is devoid of zeros on z =. In this section, we first show that R(z ) is in fact a self-inversive polynomial itself on z =, so it can also be converted into a real variable polynomial with a reduction in the degree to half of the degree for R(z ). Then, an improved version of Bose s D stability test will be given based on the results obtained in this and the previous sections. Lemma 5 The resultant R(z ) is self-inversive on z =. Proof. Since z = z on z =, D s (z, z ), D a (z, z ) can be respectively written as D s (z, z ) = n dk (z ) + d n k(z ) } z k D a (z, z ) = n dk (z ) d n k(z ) } z k Therefore, defining h s,k (z ) = (d k (z ) + d n k(z ))/, h a,k (z ) = (d k (z ) d n k(z ))/, the resultant R(z ) of D s (z, z ) and D a (z, z ) with respect to z is given by R(z ) = h s,n h s,n h s, h s,0 0 h s,n h s, h s, h s, h s,n h s,n h s,n h s,0 h a,n h a,n h a, h a,0 0 h a,n h a, h a, h a, h a,n h a,n h a,n h a,0 where the argument z was omitted for brevity. Then, reversing the order of all the colunms, and reversing the order of the upper n rows, and the lower n rows respectively, we can get the following result no matter n is even or odd. R(z ) = ( ) n h s,0 h s, h s,n h s,n 0 h s,0 h s,n h s,n h s,n h s,0 h s, h s, h s,n h a,0 h a, h a,n h a,n 0 h a,0 h a,n h a,n h a,n h a,0 h a, h a, h a,n It follows from h s,k (z ) = h s,n k(z a,k(z ) = h a,n k(z R(z ) = ( )n h s,n h s,n h s,0 0 h s,n h s, h s, h s,n h s,n h s,0 h a,n h a,n h a,0 0 h a,n h a, h a, h a,n h a,n h a,0 Multiplying the lower n rows by, we see that R(z ) = R(z ) which means that R(z ) is self-inversive. Now, we can transform R(z ) into a polynomial ˆR(x ) in the real variable x = (z + z )/. It should be clear that to test the condition (c) of Theorem we only need to see whether or not ˆR(x ) 0 on x which can be easily carried out by Sturm s method. Based on the above results and those given in the previous section, we can now give an improved version of Bose s D stability test as follows. Define D s (z ), Da (z ), and ˆD s (x ), ˆDa (x ) for D s (, z ) and D a (, z ) in the same way as the definition
5 of F (z ), F (z ) and ˆF (x ), ˆF (x ) for F (z ), F (z ) in Section, respectively. Theorem 3 The polynomial D (z, z ) 0 for z =, z, or equivalently, D(z, z ) = 0 for z =, z iff (a) d 0 ()/d n () <, (b) all the zeros of ˆD s (x ) and ˆD a (x ) are simple, are located and also alternate within < x < where x = (z + z )/, particularly when n is odd, ˆD s (x ) has a zero on the most right side, or equivalently, ˆDa (x ) has a zero on the most left side, and further (c) ˆR(x ) constructed from the resulatant R(z ) of D s (z, z ) and D a (z, z ) satisfies that ˆR(x ) 0 for x where x = (z + z )/. Proof. It follows immediately from the results of Theorem and Lemma 5. It is obvious that the condition (b) of Theorem 3 can be tested by the criteria of Theorem and the condition (c) can be checked directly by Sturm s method. i.e., d 0 ()/d n () <. If not, then unstable. 4 Illustrating Examples Several nontrivial examples are given to show the testing procedure and the effectiveness of the proposed method. Example. Consider the stability of the following D polynomial used in,. D(z, z ) = ( + 0z + z ) + (6 + 5z + z )z (9) Step. Obviously, D(z, 0) = + 0z + z = (z + )(z + 3) has zeros of, 3, thus is D stable. Step. Since d 0 () d () = 4 = <, the condition (a) of Theorem 3 is satisfied. Step 3. It is easy to see that D s (, z ) = 8( + z ) D a (, z ) = 6(z ) and D s (z ) = 8, Da (z ) = 6. Clearly, the condition (b) of Theorem 3 is satisfied. Step 4. The resultant R(z ) is calculated as R(z ) = (z + z ) 9(z + z ) Let x = (z + z = z + z z + z )/, then it follows that = z + z z + z x x and ˆR(x ) = = 75 05x 36x Then, the Sturm s functions can be constructed as x x f 0 (x ) = ˆR(x ) = 36x 05x 75 (30) f (x ) = f 0(x ) = 7x 05 (3) f (x ) = 5 (3) 44 and it is ready to verify that V ( ) = 0, V () = 0. Then, due to Sturm s Theorem we conclude that ˆR(x ) 0, for x, and therefore the D polynomial given in (9) is stable. Noting that the above ˆR(x ) is only a second degree polynomial, while the one obtained in is a 8th degree polynomial and the one in is a trigonometric function. Example. Show the conditions for the following D polynomial to be stable, where n = n =, and a, b, c are real numbers. D(z, z ) = + az + bz + cz z (33) Step. To ensure that D(z, 0) = + az 0 for z, it is necessary to have that a >. Step. Since d 0 (z ) = b + cz and d (z ) = + az, the following relation must hold. d 0 () d () = b + c + a < (34) Step 3. Since it follows that D (z, z ) = (b + cz ) + ( + az )z (35) D (, z ) = (b + c) + ( + a)z, (36) D s (, z ) = (z + )( + a + b + c) (37) D a (, z ) = (z )( + a + b + c) (38) which have already satisfied the condition (b) of Theorem 3. Step 4. we have D s (z, z ) = (cz + b + + az ) + (az + + b + cz )z } D a (z, z ) = (cz + b az ) + (az + b cz )z }. Therefore, the resultant R(z ) is given by R(z ) = h s (z ) h s0 (z ) h a (z ) h a0 (z ) = (a bc)z + ( + a b c ) + (a bc)z } 4
6 where h s (z ) = (az + + b + cz ) h s0 (z ) = (cz + b + + az ) h a (z ) = (az + b cz ) h a0 (z ) = (cz + b az ). Letting x = (z + z )/ and using the transformation shown in 3, we have the result ˆR(x ) = 4 ( + a b c ) + (a bc)x } (39) Following Sturm s method, set f 0 (x ) = ˆR(x ), f (x ) = f 0(x ) = (a bc)/. Since f (x ) has already been a constant, to see if ˆR(x ) = 0 for x we only need to see if V ( ) V () = 0 where V (x ) denots the number of the sign variation in the polynomial sequence f 0 (x ), f (x ). It is easy to see that f 0 ( ) = ( + a b c ) a(a bc) } 4 f ( ) = (a bc) f 0 () = ( + a b c ) + a(a bc) } 4 f () = (a bc). As f ( ) = f (), to satisfy that V ( ) V () = 0, f 0 ( ) and f 0 () must have the same sign which is equivalent to requiring that f 0 () f 0 ( ) = + a b c (a bc) + a b c + (a bc) = ( a) (b c) ( + a) (b + c) > 0 (40) Due to (34), we have ( + a) (b + c) > 0. Therefore, for (40) to be true, it must be which is equivalent to ( a) (b c) > 0 (4) b c a <. (4) Now, we see that the necessary and sufficient condition for the polynomial of (33) to be stable is a >, b + c + a <, b c a <. (43) 5 Conclusions Some improvements have been proposed for Bose s D stability test by revealing symmetric properties of the polynomials and resultant occurring in the test and utilizing Sturm s method. Consequently, the improved test can be fulfilled by a totally algebraic algorithm and the complexcity of computation is largely reduced as it involves only certain real variable polynomials with degrees not exceeding half of their previous complex variable counterparts. Kurosawa et al. 9 have recently proposed an efficient algorithm for calculating the determinant of a matrix with D polynomial entrices by making use of DFT (or FFT). It should be clear that this algorithm can be directly applied to compute the resultant R(z ) so that the complexity of Bose s D stability test can be improved even more. Nontrivial examples have also been shown. References Bose N. K. Implementation of a new stability test for two-dimensional filters. IEEE Trans. Acoustics, Speech and Signal Processing, Vol.5, pp.7 0, 977. Bose N. K. Simplification of a Multidimensional Digital Filter Stability Test. Journal of the Franklin Institute, Vol.330, No.5, pp.905 9, Hu X. H. D filter stability test using polynomial array for F (z, z ) on z =. IEEE Trans. Circuits and Systems, Vol.38, No.9, pp , Hu X. H. On Two-Dimensional Filter Stability Test. IEEE Trans. Circuits and Systems II: Analog and Digital Signal Processing, Vol.4, No.7, pp , Huang T. S. Stability of two-dimensional recursive filters. IEEE Trans. Audio Electroacoust, Vol.0, pp.58 63, Xu L., Yamada M. and Saito O. Development of nd Control System Toolbox for Use with MATLAB. Proc. of CCA99, pp , August -7, Hawaii, Schüssler H. W. Stability Theorem for Discrete Systems IEEE Trans. Acoustics, Speech, and Signal Processing, Vol.4, No., pp.87 89, T. Takagi. Algebra Lecture, Kyoritu Shuppan, Tokyo, 965 (in Japanese). 9 Kurosawa K., Yamada I. and Yokokawa T. A Fast -D stability Test Procedure Based on FFT and its Computational Complexity. IEEE Trans. Circuits and Systems II: Analog and Digital Signal Processing, Vol.4, No.0, pp , 995. This result is the same as the one given in but the derivation shown here is much simpler.
Algebraic Algorithm for 2D Stability Test Based on a Lyapunov Equation. Abstract
Algebraic Algorithm for 2D Stability Test Based on a Lyapunov Equation Minoru Yamada Li Xu Osami Saito Abstract Some improvements have been proposed for the algorithm of Agathoklis such that 2D stability
More informationCHAPTER 2 LITERATURE REVIEW FOR STABILITY TESTING OF TWO DIMENSIONAL RECURSIVE DIGITAL FILTERS
0 CHAPTER 2 LITERATURE REVIEW FOR STABILITY TESTING OF TWO DIMENSIONAL RECURSIVE DIGITAL FILTERS The methods for testing the stability of two dimensional recursive digital filters fall into two categories.
More informationCERTAIN ALGEBRAIC TESTS FOR ANALYZING APERIODIC AND RELATIVE STABILITY IN LINEAR DISCRETE SYSTEMS
CERTAIN ALGEBRAIC TESTS FOR ANALYZING APERIODIC AND RELATIVE STABILITY IN LINEAR DISCRETE SYSTEMS Ramesh P. and Manikandan V. 2 Department of Electrical and Electronics Engineering, University College
More informationA Slice Based 3-D Schur-Cohn Stability Criterion
A Slice Based 3-D Schur-Cohn Stability Criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A Slice Based 3-D Schur-Cohn Stability Criterion. ICASSP 007, Apr 007, Honolulu,
More informationA new multidimensional Schur-Cohn type stability criterion
A new multidimensional Schur-Cohn type stability criterion Ioana Serban, Mohamed Najim To cite this version: Ioana Serban, Mohamed Najim. A new multidimensional Schur-Cohn type stability criterion. American
More informationUse: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}
1 VI. Z Transform Ch 24 Use: Analysis of systems, simple convolution, shorthand for e jw, stability. A. Definition: X(z) = x(n) z z - transforms Motivation easier to write Or Note if X(z) = Z {x(n)} z
More informationA = , A 32 = n ( 1) i +j a i j det(a i j). (1) j=1
Lecture Notes: Determinant of a Square Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Determinant Definition Let A [a ij ] be an
More informationLecture 14 Conformal Mapping. 1 Conformality. 1.1 Preservation of angle. 1.2 Length and area. MATH-GA Complex Variables
Lecture 14 Conformal Mapping MATH-GA 2451.001 Complex Variables 1 Conformality 1.1 Preservation of angle The open mapping theorem tells us that an analytic function such that f (z 0 ) 0 maps a small neighborhood
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More informationChapter 5 THE APPLICATION OF THE Z TRANSFORM. 5.3 Stability
Chapter 5 THE APPLICATION OF THE Z TRANSFORM 5.3 Stability Copyright c 2005- Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org February 13, 2008 Frame # 1 Slide # 1 A. Antoniou Digital Signal
More informationIMMITTANCE-TYPE TABULAR STABILITY TEST FOR 2-D LSI SYSTEMS BASED ON A ZERO LOCATION TEST FOR 1-D COMPLEX POLYNOMIALS*
CIRCUITS SYSTEMS SIGNAL PROCESS VOL. 19, NO. 3, 2000, PP. 245 265 IMMITTANCE-TYPE TABULAR STABILITY TEST FOR 2-D LSI SYSTEMS BASED ON A ZERO LOCATION TEST FOR 1-D COMPLEX POLYNOMIALS* Yuval Bistritz 1
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 19: Lattice Filters Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 2008 K. E. Barner (Univ. of Delaware) ELEG
More informationWavelet Filter Transforms in Detail
Wavelet Filter Transforms in Detail Wei ZHU and M. Victor WICKERHAUSER Washington University in St. Louis, Missouri victor@math.wustl.edu http://www.math.wustl.edu/~victor FFT 2008 The Norbert Wiener Center
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
More information5.3 The Upper Half Plane
Remark. Combining Schwarz Lemma with the map g α, we can obtain some inequalities of analytic maps f : D D. For example, if z D and w = f(z) D, then the composition h := g w f g z satisfies the condition
More informationCHARACTERIZATIONS OF LINEAR DIFFERENTIAL SYSTEMS WITH A REGULAR SINGULAR POINT
CHARACTERIZATIONS OF LINEAR DIFFERENTIAL SYSTEMS WITH A REGULAR SINGULAR POINT The linear differential system by W. A. HARRIS, Jr. (Received 25th July 1971) -T = Az)w (1) where w is a vector with n components
More informationSDP APPROXIMATION OF THE HALF DELAY AND THE DESIGN OF HILBERT PAIRS. Bogdan Dumitrescu
SDP APPROXIMATION OF THE HALF DELAY AND THE DESIGN OF HILBERT PAIRS Bogdan Dumitrescu Tampere International Center for Signal Processing Tampere University of Technology P.O.Box 553, 3311 Tampere, FINLAND
More informationAN important issue in the design and analysis of twodimensional
666 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL. 46, NO. 6, JUNE 1999 Stability Testing of Two-Dimensional Discrete Linear System Polynomials by a Two-Dimensional
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationModule 6: Deadbeat Response Design Lecture Note 1
Module 6: Deadbeat Response Design Lecture Note 1 1 Design of digital control systems with dead beat response So far we have discussed the design methods which are extensions of continuous time design
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 5 Divide and Conquer: Fast Fourier Transform Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationSome special cases
Lecture Notes on Control Systems/D. Ghose/2012 87 11.3.1 Some special cases Routh table is easy to form in most cases, but there could be some cases when we need to do some extra work. Case 1: The first
More informationF (z) =f(z). f(z) = a n (z z 0 ) n. F (z) = a n (z z 0 ) n
6 Chapter 2. CAUCHY S THEOREM AND ITS APPLICATIONS Theorem 5.6 (Schwarz reflection principle) Suppose that f is a holomorphic function in Ω + that extends continuously to I and such that f is real-valued
More informationTHIS PAPER will present a new procedure that tests
1312 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL 51, NO 7, JULY 2004 Testing Stability of 2-D Discrete Systems by a Set of Real 1-D Stability Tests Yuval Bistritz, Fellow, IEEE Abstract
More informationExample 9 Algebraic Evaluation for Example 1
A Basic Principle Consider the it f(x) x a If you have a formula for the function f and direct substitution gives the indeterminate form 0, you may be able to evaluate the it algebraically. 0 Principle
More informationCHAPTER 9. Conformal Mapping and Bilinear Transformation. Dr. Pulak Sahoo
CHAPTER 9 Conformal Mapping and Bilinear Transformation BY Dr. Pulak Sahoo Assistant Professor Department of Mathematics University of Kalyani West Bengal, India E-mail : sahoopulak@gmail.com Module-3:
More informationResearch Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field
Complexity, Article ID 6235649, 9 pages https://doi.org/10.1155/2018/6235649 Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Jinwang Liu, Dongmei
More informationChapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn
Chapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn Formulation of the D&C principle Divide-and-conquer method for solving a problem instance of size n: 1. Divide
More informationDesign Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
CENTER FOR COMPUTER RESEARCH IN MUSIC AND ACOUSTICS DEPARTMENT OF MUSIC, STANFORD UNIVERSITY REPORT NO. STAN-M-4 Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
More informationNew series expansions of the Gauss hypergeometric function
New series expansions of the Gauss hypergeometric function José L. López and Nico. M. Temme 2 Departamento de Matemática e Informática, Universidad Pública de Navarra, 36-Pamplona, Spain. e-mail: jl.lopez@unavarra.es.
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationSchwarz lemma and automorphisms of the disk
Chapter 2 Schwarz lemma and automorphisms of the disk 2.1 Schwarz lemma We denote the disk of radius 1 about 0 by the notation D, that is, D = {z C : z < 1}. Given θ R the rotation of angle θ about 0,
More informationProof of a conjecture by Ðoković on the Poincaré series of the invariants of a binary form
Proof of a conjecture by Ðoković on the Poincaré series of the invariants of a binary form A. Blokhuis, A. E. Brouwer, T. Szőnyi Abstract Ðoković [3] gave an algorithm for the computation of the Poincaré
More informationor E ( U(X) ) e zx = e ux e ivx = e ux( cos(vx) + i sin(vx) ), B X := { u R : M X (u) < } (4)
:23 /4/2000 TOPIC Characteristic functions This lecture begins our study of the characteristic function φ X (t) := Ee itx = E cos(tx)+ie sin(tx) (t R) of a real random variable X Characteristic functions
More informationExtension of continuous functions in digital spaces with the Khalimsky topology
Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin
More informationFunctions of a Complex Variable
Functions of a Complex Variable In this chapter, we will study functions of a complex variables. The most interesting functions on the complex plane are those that are holomorphic. The most important holomorphic
More informationON THE REALIZATION OF 2D LATTICE-LADDER DISCRETE FILTERS
Journal of Circuits Systems and Computers Vol. 3 No. 5 (2004) 5 c World Scientific Publishing Company ON THE REALIZATION OF 2D LATTICE-LADDER DISCRETE FILTERS GEORGE E. ANTONIOU Department of Computer
More informationECE 238L Boolean Algebra - Part I
ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand
More informationInverse Polynomial Images which Consists of Two Jordan Arcs An Algebraic Solution
Inverse Polynomial Images which Consists of Two Jordan Arcs An Algebraic Solution Klaus Schiefermayr Abstract Inverse polynomial images of [ 1, 1], which consists of two Jordan arcs, are characterised
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationPoles and Zeros in z-plane
M58 Mixed Signal Processors page of 6 Poles and Zeros in z-plane z-plane Response of discrete-time system (i.e. digital filter at a particular frequency ω is determined by the distance between its poles
More informationDigital Control Systems
Digital Control Systems Lecture Summary #4 This summary discussed some graphical methods their use to determine the stability the stability margins of closed loop systems. A. Nyquist criterion Nyquist
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationProperties of Entire Functions
Properties of Entire Functions Generalizing Results to Entire Functions Our main goal is still to show that every entire function can be represented as an everywhere convergent power series in z. So far
More informationSOLUTIONS OF NONHOMOGENEOUS LINEAR DIFFERENTIAL EQUATIONS WITH EXCEPTIONALLY FEW ZEROS
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 23, 1998, 429 452 SOLUTIONS OF NONHOMOGENEOUS LINEAR DIFFERENTIAL EQUATIONS WITH EXCEPTIONALLY FEW ZEROS Gary G. Gundersen, Enid M. Steinbart, and
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
More information1.4 Complex random variables and processes
.4. COMPLEX RANDOM VARIABLES AND PROCESSES 33.4 Complex random variables and processes Analysis of a stochastic difference equation as simple as x t D ax t C bx t 2 C u t can be conveniently carried over
More informationOn the BMS Algorithm
On the BMS Algorithm Shojiro Sakata The University of Electro-Communications Department of Information and Communication Engineering Chofu-shi, Tokyo 182-8585, JAPAN Abstract I will present a sketch of
More informationLab 1 starts this week: go to your session
Lecture 3: Boolean Algebra Logistics Class email sign up Homework 1 due on Wednesday Lab 1 starts this week: go to your session Last lecture --- Numbers Binary numbers Base conversion Number systems for
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationQualifying Exam Complex Analysis (Math 530) January 2019
Qualifying Exam Complex Analysis (Math 53) January 219 1. Let D be a domain. A function f : D C is antiholomorphic if for every z D the limit f(z + h) f(z) lim h h exists. Write f(z) = f(x + iy) = u(x,
More informationChapter 30 MSMYP1 Further Complex Variable Theory
Chapter 30 MSMYP Further Complex Variable Theory (30.) Multifunctions A multifunction is a function that may take many values at the same point. Clearly such functions are problematic for an analytic study,
More informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationOn Tricomi and Hermite-Tricomi Matrix Functions of Complex Variable
Communications in Mathematics and Applications Volume (0), Numbers -3, pp. 97 09 RGN Publications http://www.rgnpublications.com On Tricomi and Hermite-Tricomi Matrix Functions of Complex Variable A. Shehata
More informationConformal maps. Lent 2019 COMPLEX METHODS G. Taylor. A star means optional and not necessarily harder.
Lent 29 COMPLEX METHODS G. Taylor A star means optional and not necessarily harder. Conformal maps. (i) Let f(z) = az + b, with ad bc. Where in C is f conformal? cz + d (ii) Let f(z) = z +. What are the
More informationLinear Algebra and Vector Analysis MATH 1120
Faculty of Engineering Mechanical Engineering Department Linear Algebra and Vector Analysis MATH 1120 : Instructor Dr. O. Philips Agboola Determinants and Cramer s Rule Determinants If a matrix is square
More informationComplex Analysis Important Concepts
Complex Analysis Important Concepts Travis Askham April 1, 2012 Contents 1 Complex Differentiation 2 1.1 Definition and Characterization.............................. 2 1.2 Examples..........................................
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationarxiv: v2 [math.nt] 9 Oct 2013
UNIFORM LOWER BOUND FOR THE LEAST COMMON MULTIPLE OF A POLYNOMIAL SEQUENCE arxiv:1308.6458v2 [math.nt] 9 Oct 2013 SHAOFANG HONG, YUANYUAN LUO, GUOYOU QIAN, AND CHUNLIN WANG Abstract. Let n be a positive
More informationNEW STEIGLITZ-McBRIDE ADAPTIVE LATTICE NOTCH FILTERS
NEW STEIGLITZ-McBRIDE ADAPTIVE LATTICE NOTCH FILTERS J.E. COUSSEAU, J.P. SCOPPA and P.D. DOÑATE CONICET- Departamento de Ingeniería Eléctrica y Computadoras Universidad Nacional del Sur Av. Alem 253, 8000
More informationA = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].
Appendix : A Very Brief Linear ALgebra Review Introduction Linear Algebra, also known as matrix theory, is an important element of all branches of mathematics Very often in this course we study the shapes
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 18: Applications of FFT Algorithms & Linear Filtering DFT Computation; Implementation of Discrete Time Systems Kenneth E. Barner Department of Electrical and
More informationLecture 04: Discrete Frequency Domain Analysis (z-transform)
Lecture 04: Discrete Frequency Domain Analysis (z-transform) John Chiverton School of Information Technology Mae Fah Luang University 1st Semester 2009/ 2552 Outline Overview Lecture Contents Introduction
More informationA VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 2010
A VERY BRIEF LINEAR ALGEBRA REVIEW for MAP 5485 Introduction to Mathematical Biophysics Fall 00 Introduction Linear Algebra, also known as matrix theory, is an important element of all branches of mathematics
More informationSOME COUNTEREXAMPLES IN DYNAMICS OF RATIONAL SEMIGROUPS. 1. Introduction
SOME COUNTEREXAMPLES IN DYNAMICS OF RATIONAL SEMIGROUPS RICH STANKEWITZ, TOSHIYUKI SUGAWA, AND HIROKI SUMI Abstract. We give an example of two rational functions with non-equal Julia sets that generate
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationMaximally Flat Lowpass Digital Differentiators
Maximally Flat Lowpass Digital Differentiators Ivan W. Selesnick August 3, 00 Electrical Engineering, Polytechnic University 6 Metrotech Center, Brooklyn, NY 0 selesi@taco.poly.edu tel: 78 60-36 fax: 78
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationQuasi-Convex Functions with Respect to Symmetric Conjugate Points
International Journal of Algebra, Vol. 6, 2012, no. 3, 117-122 Quasi-Convex Functions with Respect to Symmetric Conjugate Points 1 Chew Lai Wah, 2 Aini Janteng and 3 Suzeini Abdul Halim 1,2 School of Science
More informationCLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS
CLOSED FORM CONTINUED FRACTION EXPANSIONS OF SPECIAL QUADRATIC IRRATIONALS DANIEL FISHMAN AND STEVEN J. MILLER ABSTRACT. We derive closed form expressions for the continued fractions of powers of certain
More informationDamped Oscillators (revisited)
Damped Oscillators (revisited) We saw that damped oscillators can be modeled using a recursive filter with two coefficients and no feedforward components: Y(k) = - a(1)*y(k-1) - a(2)*y(k-2) We derived
More informationChebyshev coordinates and Salem numbers
Chebyshev coordinates and Salem numbers S.Capparelli and A. Del Fra arxiv:181.11869v1 [math.co] 31 Dec 018 January 1, 019 Abstract By expressing polynomials in the basis of Chebyshev polynomials, certain
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationLocal dynamics of holomorphic maps
5 Local dynamics of holomorphic maps In this chapter we study the local dynamics of a holomorphic map near a fixed point. The setting will be the following. We have a holomorphic map defined in a neighbourhood
More informationThe PLSI Method of Stabilizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters
EURASIP Journal on Applied Signal Processing 23:9, 914 921 c 23 Hindawi Pulishing Corporation The PLSI Method of Stailizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters N. Gangatharan
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationIV. Conformal Maps. 1. Geometric interpretation of differentiability. 2. Automorphisms of the Riemann sphere: Möbius transformations
MTH6111 Complex Analysis 2009-10 Lecture Notes c Shaun Bullett 2009 IV. Conformal Maps 1. Geometric interpretation of differentiability We saw from the definition of complex differentiability that if f
More informationAlgebra. Pang-Cheng, Wu. January 22, 2016
Algebra Pang-Cheng, Wu January 22, 2016 Abstract For preparing competitions, one should focus on some techniques and important theorems. This time, I want to talk about a method for solving inequality
More informationPhysics 251 Solution Set 1 Spring 2017
Physics 5 Solution Set Spring 07. Consider the set R consisting of pairs of real numbers. For (x,y) R, define scalar multiplication by: c(x,y) (cx,cy) for any real number c, and define vector addition
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationTHEORY OF MIMO BIORTHOGONAL PARTNERS AND THEIR APPLICATION IN CHANNEL EQUALIZATION. Bojan Vrcelj and P. P. Vaidyanathan
THEORY OF MIMO BIORTHOGONAL PARTNERS AND THEIR APPLICATION IN CHANNEL EQUALIZATION Bojan Vrcelj and P P Vaidyanathan Dept of Electrical Engr 136-93, Caltech, Pasadena, CA 91125, USA E-mail: bojan@systemscaltechedu,
More informationSection 4.1: Polynomial Functions and Models
Section 4.1: Polynomial Functions and Models Learning Objectives: 1. Identify Polynomial Functions and Their Degree 2. Graph Polynomial Functions Using Transformations 3. Identify the Real Zeros of a Polynomial
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: 2 x 3 + 3
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: x 3 + 3 x + x + 3x 7 () x 3 3x + x 3 From the standpoint of integration, the left side of Equation
More informationThe DFT as Convolution or Filtering
Connexions module: m16328 1 The DFT as Convolution or Filtering C. Sidney Burrus This work is produced by The Connexions Project and licensed under the Creative Commons Attribution License A major application
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationLaplace s Equation in Cylindrical Coordinates and Bessel s Equation (I)
Laplace s Equation in Cylindrical Coordinates and Bessel s Equation I) 1 Solution by separation of variables Laplace s equation is a key equation in Mathematical Physics. Several phenomena involving scalar
More information7.2 Conformal mappings
7.2 Conformal mappings Let f be an analytic function. At points where f (z) 0 such a map has the remarkable property that it is conformal. This means that angle is preserved (in the sense that any 2 smooth
More informationTwisted Filter Banks
Twisted Filter Banks Andreas Klappenecker Texas A&M University, Department of Computer Science College Station, TX 77843-3112, USA klappi@cs.tamu.edu Telephone: ++1 979 458 0608 September 7, 2004 Abstract
More informationFrom Satisfiability to Linear Algebra
From Satisfiability to Linear Algebra Fangzhen Lin Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Technical Report August 2013 1 Introduction
More informationThree Theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module 2 w
JOURNAL OF L A TEX CLASS FILES, VOL. 13, NO. 9, SEPTEMBER 014 1 Three Theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module w Atsushi Iwasaki,
More informationf(w) f(a) = 1 2πi w a Proof. There exists a number r such that the disc D(a,r) is contained in I(γ). For any ǫ < r, w a dw
Proof[section] 5. Cauchy integral formula Theorem 5.. Suppose f is holomorphic inside and on a positively oriented curve. Then if a is a point inside, f(a) = w a dw. Proof. There exists a number r such
More informationComplex Continued Fraction Algorithms
Complex Continued Fraction Algorithms A thesis presented in partial fulfilment of the requirements for the degree of Master of Mathematics Author: Bastiaan Cijsouw (s3022706) Supervisor: Dr W Bosma Second
More informationAbstract. 1 Introduction. 2 Idempotent filters. Idempotent Nonlinear Filters
Idempotent Nonlinear Filters R.K. Pearson and M. Gabbouj Tampere International Center for Signal Processing Tampere University of Technology P.O. Box 553, FIN-33101 Tampere, Finland E-mail: {pearson,gabbouj}@cs.tut.fi
More informationSignals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI
Signals and Systems Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Effect on poles and zeros on frequency response
More informationS. Lie has thrown much new light on this operation. The assumption
600 MATHEMATICS: A. E. ROSS PRoc. N. A. S. The operation of finding the limit of an infinite series has been one of the most fruitful operations of all mathematics. While this is not a group operation
More information