Rational bases for system identification
|
|
- Merryl Dorsey
- 5 years ago
- Views:
Transcription
1 Rational bases for system identification Adhemar Bultheel, Patrick Van gucht Department Computer Science Numerical Approximation and Linear Algebra Group (NALAG) K.U.Leuven, Belgium adhemar.bultheel.cs.kuleuven.ac.be ade/ March 2001
2 Systems 1/25 We consider discrete time systems u G y u is input U(z) = k u kz 1 k y is output Y (z) = k y kz 1 k G transfer function Y (z) = G(z)U(z)
3 Frequency Domain Identification 2/25 Estimate G as Ĝ such that we minimize (L2 (T)-norm) Y Ŷ = GU ĜU = (G Ĝ)U = G Ĝ w +π min 1 G(z) 2π Ĝ(z) 2 w(z)dω, z = e iω, w(z) = U(z) 2 π Measurements {G(z j )} N j=1, z j T, with variance {σ j } N j=1. min G Ĝ w = min N j=1 G(z j ) Ĝ(z j) 2 σ 2 j 1/2, w j = σ 2 j,
4 Frequency Domain Identification(2) 3/25 or Y Ŷ = (G Ĝ)U = G Ĝ w N = G(z j ) Ĝ(z j) 2 w j j=1 1/2, w j = U(z j ) 2 /σ 2 j or G Ĝ = Y U B A = Y A BU AU = Y A BU w, w = 1/ AU 2
5 Linear/Nonlinear problem 4/25 Since the approximant Ĝ is a rational function, we have a mixed linear/nonlinear approximation problem. Ĝ(z) = B(z) A(z), A, B Π n nonlinear A(z) = linear B(z) = n b k z k k=0 n a k z k = k=0 n (1 α k /z). k=1 Given an estimate for A, finding B is a weighted but linear least squares problem.
6 Nonlinear problem 5/25 Given a stable and efficient method to solve the linear parameters λ as a function of the nonlinear parameters ν, we can consider the problem of minimizing a cost function C(ν) = K(ν, λ(ν)). Need system stability. If ν = α (system poles), then need α k < 1. So have to solve a constrained nonlinear weighted least squares problem in C. Solve nonlinear problem with standard routine. How to solve the linear problem?
7 Orthogonal Rational Functions Ĝ(z) = n λ k φ k (z), k=0 6/25 with for given α k φ k (z) L k = { } p k (z) k j=1 (1 α j/z) : p k Π k orthogonal basis functions with respect to an appropriate inner product. The inner product can be discrete or continuous, but is in general with respect to a weight (measure) on T. f, g µ = T f(z)g(z)dµ(z) or f, g w = N f(z j )g(z j )w j. j=1
8 ORF recurrence 7/25 Forward recursion [ φn (z) φ n(z) ] = e n z α n 1 z α n [ 1 Ln L n 1 φ k, 1 α n 1z z α n φ n 1 L n =, e n = φ k, z α n 1 z α n φ n 1 ] [ ζn 1 (z) ] [ φn 1 (z) φ n 1(z) ( 1 αn 2 ) 1/2 1 1 α n L n 2 ζ k (z) = 1 α kz z α k, B n = ζ 1 ζ n, φ n(z) = B n (z)φ n (1/z). Backward recursion = Nevanlinna-Pick algorithm ]
9 Inner product evaluation 8/25 If data are available in z = {z j } N j=1 T with corresponding weights w = {w j } N j=1 then choose the discrete inner product. For a continuous inner product, choose points on the circle, e.g. equidistant z j = exp{2ijπ/n}, j = 1,..., N and evaluate weight w j = w(z j ) and use discrete inner product. For example w(z) = U(z) 2, and z j equidistant on T, then given time domain data u k, this can be computed very efficiently by FFT. We can evaluate the moments c l in U(z) 2 = l Z c lz l by convolution and use a Nevanlinna-Pick type algorithm on the PR function Ω(z) = c 0 /2 + l=1 c lz l. (approximately)
10 The linear least squares problem 9/25 So we can compute Φ(α) = Φ(z; α) = [φ 0 (z) φ 1 (z) φ n (z)] C N n+1 W 1/2 = diag(w) 1/2, λ = {λ k } n k=0, G = G(z) Setting Ĝn = n k=0 λ kφ k, solve in least squares sense W 1/2 Φ(α)λ(α) = W 1/2 G by orthogonality however, λ(α) = Φ(α) H WG.
11 Related work 10/25 Work by Ninnes, Van den Hof, Hueberger, Bokor, and others: Use ORF with respect to Lebesgue measure. These have explicit expressions 1 αn φ n (z) = 2 z B n 1 (z) z α n but that does not help for the condition number of Φ H WΦ in the linear least squares problem. And/or use a finite number of α k that are cyclically repeated.
12 Nonlinear problem 11/25 K(α) = j G(z j ) n k=0 λ k (α)φ k (z j ; α) 2 w j min α D K(α) = (I Φ(α)Φ(α) H W)G 2 w constraint: set α j = r j e iω j with 1 r j 1, j = 1,..., n. α j can be forced to be real or complex conjugate.
13 Robot arm 12/ data points, 200 Hz, condensed in the beginning, order [6/6] 10 2 frequency response fct variance relative error poles ± i ± i ± i zeros , ± i ± i
14 Band pass filter 50 data points, 20 khz, in lower half, order [6/6] 13/ frequency response fct variance poles zeros i i i i i i relative error
15 Band pass filter 14/25 50 data points, 20 khz, in lower half, order [22/22] 1.5 frequency response fct 4 frequency response fct variance 10 0 relative error
16 Electrical Machine 110 data points, 4 khz, condensed in the beginning, order [5/5] 15/ frequency response fct variance relative error poles zeros
17 Sensitivity, Electrical Machine 16/ relative error, variable parameters
18 Polynomial method 17/25 min Y U B A 2 = min Y A UB 2 AU 2 The weight depends on the solution. Estimate A so that we have an estimate for the weight 1/ AU, Set w = [Y/AU U/AU], P = [A B] T min N P (z j ) H W j P (z j ), W j = w(z j ) H w(z j ) j=1 need orthogonal block polynomials φ k and write P = n k=0 φ kλ k, φ k Π 2 2 k, λ k C 2 1. Constraint: P monic.
19 Monic solution 18/25 Φ = [φ 0 (z)... φ n (z)] C 2N 2(n+1), W = diag(w j ) C 2N 2N min λ H Φ H WΦλ, Φλ monic orthogonal polynomial Φ H WΦ = I P = φ n λ n. Szegő-type recurrence φ n σ n = zφ n 1 + φ n 1γ n φ nσ H n = zφ n 1 γ H n + φ n 1 σ n, γ n C 2 2 (block Schur parameters)
20 Hessenberg matrix 19/25 w 1 z 1 w 2 z 2... w N z N unitary similarity transf. Block Upper Hessenberg
21 Efficient algorithm 20/25 Store the block upper Hessenberg matrix in factored form H = G 1 G 2 G m G k = I 2(k 1) γ k ˆσ k σ k ˆγ k I... Chasing the elements to block upper Hessenberg form by similarity transformations percolating through the product requires operations on 3 3 or 5 5 blocks fast algorithm.
22 Nonlinear problem 21/25 Once P = [A B] T has been found, use A to modify the weight w = 1/ AU and reiterate. or Use nonlinear method to improve the estimate n k=0 φ kλ k. Weight depends on A loss of orthogonality, but condition number of Jacobian increases only slightly.
23 CD s radial servo system 22/25 sampling frequency 9.7 khz, order [5/5] 40 Magnitude FRF (db) frf error Relative Freq
24 Conclusion 23/25 Rational approximation in weighted discrete least squares sense. Linear and nonlinear parameters. Solve for linear in terms of nonlinear. Use orthogonal basis to minimize the condition number. Either direct orthogonal rational basis or linearized vector polynomial as a combination of orthogonal block polynomials.
25 References ORF 24/25 [1], P. González-Vera, E. Hendriksen, and O. Njåstad. Orthogonal rational functions. Cambridge University Press, [2] P. Van gucht,. Using orthogonal rational functions for system identification, Report TW314, Dept. Computer Science, K.U.Leuven, September [3] P. Van gucht,. Matlab routines for system identification using orthogonal rational functions. nalag/research/software/orf/orfidentification.html.
26 References OPV 25/25 [1], M. Van Barel, Y. Rolain. Robust rational approximation for identification, 2001, Submitted [2] M. Van Barel,, Discrete linearized least squares approximation on the unit circle, J. Comput. Appl. Math. 50 (1994) [3], M. Van Barel. Vector orthogonal polynomials and least squares approximation, SIAM J. Matrix Anal. Appl. 16 (1995) [4] M. Van Barel,, Orthogonal polynomial vectors and least squares approximation for a discrete inner product, Electron. Trans. Numer. Anal. 3 (1995) 1-23.
Szegő-Lobatto quadrature rules
Szegő-Lobatto quadrature rules Carl Jagels a,, Lothar Reichel b,1, a Department of Mathematics and Computer Science, Hanover College, Hanover, IN 47243, USA b Department of Mathematical Sciences, Kent
More informationKatholieke Universiteit Leuven Department of Computer Science
Separation of zeros of para-orthogonal rational functions A. Bultheel, P. González-Vera, E. Hendriksen, O. Njåstad Report TW 402, September 2004 Katholieke Universiteit Leuven Department of Computer Science
More informationRational Gauss-Radau and rational Szegő-Lobatto quadrature on the interval and the unit circle respectively
Rational Gauss-Radau and rational Szegő-Lobatto quadrature on the interval and the unit circle respectively Francisco Perdomo-Pio Departament of Mathematical Analysis. La Laguna University. 38271 La Laguna.
More informationA matricial computation of rational quadrature formulas on the unit circle
A matricial computation of rational quadrature formulas on the unit circle Adhemar Bultheel and Maria-José Cantero Department of Computer Science. Katholieke Universiteit Leuven. Belgium Department of
More informationComputation of Rational Szegő-Lobatto Quadrature Formulas
Computation of Rational Szegő-Lobatto Quadrature Formulas Joint work with: A. Bultheel (Belgium) E. Hendriksen (The Netherlands) O. Njastad (Norway) P. GONZÁLEZ-VERA Departament of Mathematical Analysis.
More informationSome notes about signals, orthogonal polynomials and linear algebra
Some notes about signals, orthogonal polynomials and linear algebra Adhemar Bultheel Report TW 180, November 1992 Revised February 1993 n Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan
More informationKatholieke Universiteit Leuven Department of Computer Science
Growth properties of Nevanlinna matrices for rational moment problems Adhemar Bultheel, Pablo González-Vera, Erik Hendriksen, Olav Njåstad eport TW 56, February 200 Katholieke Universiteit Leuven Department
More informationGeneralizations of orthogonal polynomials
WOG project J. Comput. Appl. Math., Preprint 28 June 2004 Generalizations of orthogonal polynomials A. Bultheel Dept. Computer Science (NALAG), K.U.Leuven, Celestijnenlaan 200 A, B-300 Leuven, Belgium.
More information1. Introduction. Let µ(t) be a distribution function with infinitely many points of increase in the interval [ π, π] and let
SENSITIVITY ANALYSIS OR SZEGŐ POLYNOMIALS SUN-MI KIM AND LOTHAR REICHEL Abstract Szegő polynomials are orthogonal with respect to an inner product on the unit circle Numerical methods for weighted least-squares
More informationKatholieke Universiteit Leuven
Generalizations of orthogonal polynomials A. Bultheel, Annie Cuyt, W. Van Assche, M. Van Barel, B. Verdonk Report TW 375, December 2003 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan
More informationOrthogonal Rational Functions on the Unit Circle with Prescribed Poles not on the Unit Circle
Symmetry, Integrability and Geometry: Methods and Applications SIGMA 13 (27), 090, 49 pages Orthogonal Rational Functions on the Unit Circle with Prescribed Poles not on the Unit Circle Adhemar BULTHEEL,
More informationChapter 3 Data Acquisition and Manipulation
1 Chapter 3 Data Acquisition and Manipulation In this chapter we introduce z transf orm, or the discrete Laplace Transform, to solve linear recursions. Section 3.1 z-transform Given a data stream x {x
More informationA numerical solution of the constrained weighted energy problem and its relation to rational Lanczos iterations
A numerical solution of the constrained weighted energy problem and its relation to rational Lanczos iterations Karl Deckers, Andrey Chesnokov, and Marc Van Barel Department of Computer Science, Katholieke
More informationSchur parametrizations of stable all-pass discrete-time systems and balanced realizations. Application to rational L 2 approximation.
Schur parametrizations of stable all-pass discrete-time systems and balanced realizations. Application to rational L 2 approximation. Martine Olivi INRIA, Sophia Antipolis 12 Mai 2004 1 Outline. Introduction
More informationIdentification of Linear Systems
Identification of Linear Systems Johan Schoukens http://homepages.vub.ac.be/~jschouk Vrije Universiteit Brussel Department INDI /67 Basic goal Built a parametric model for a linear dynamic system from
More informationMatrix methods for quadrature formulas on the unit circle. A survey
Matrix methods for quadrature formulas on the unit circle A survey Adhemar Bultheel a, María José Cantero b,1,, Ruymán Cruz-Barroso c,2 a Department of Computer Science, KU Leuven, Belgium b Department
More informationCOMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS
Series Logo Volume 00, Number 00, Xxxx 19xx COMPLETELY INVARIANT JULIA SETS OF POLYNOMIAL SEMIGROUPS RICH STANKEWITZ Abstract. Let G be a semigroup of rational functions of degree at least two, under composition
More informationSchur parametrizations and balanced realizations of real discrete-time stable all-pass systems.
1 Schur parametrizations and balanced realizations of real discrete-time stable all-pass systems Martine Olivi Jean-Paul Marmorat Bernard Hanzon Ralf LM Peeters Abstract We investigate the parametrization
More informationPROPERTIES OF SCHWARZIAN DIFFERENCE EQUATIONS
Electronic Journal of Differential Equations, Vol. 2015 (2015), No. 199, pp. 1 11. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu PROPERTIES OF
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 informationMachine Learning 2: Nonlinear Regression
15-884 Machine Learning : Nonlinear Regression J. Zico Kolter September 17, 01 1 Non-linear regression Peak Hourly Demand (GW).5 0 0 40 60 80 100 High temperature / peak demand observations for all days
More informationNumerically Reliable Identification of Fast Sampled Systems: A Novel δ-domain Data-Dependent Orthonormal Polynomial Approach
Numerically Reliable Identification of Fast Sampled Systems: A Novel δ-domain Data-Dependent Orthonormal Polynomial Approach Robbert Voorhoeve, and Tom Oomen Abstract The practical utility of system identification
More informationZERO DISTRIBUTION OF POLYNOMIALS ORTHOGONAL ON THE RADIAL RAYS IN THE COMPLEX PLANE* G. V. Milovanović, P. M. Rajković and Z. M.
FACTA UNIVERSITATIS (NIŠ) Ser. Math. Inform. 12 (1997), 127 142 ZERO DISTRIBUTION OF POLYNOMIALS ORTHOGONAL ON THE RADIAL RAYS IN THE COMPLEX PLANE* G. V. Milovanović, P. M. Rajković and Z. M. Marjanović
More informationPRODUCTS OF TOEPLITZ OPERATORS ON THE FOCK SPACE
PRODUCTS OF TOEPLITZ OPERATORS ON THE FOCK SPACE HONG RAE CHO, JONG-DO PARK, AND KEHE ZHU ABSTRACT. Let f and g be functions, not identically zero, in the Fock space F 2 α of. We show that the product
More informationSpectral Theory of Orthogonal Polynomials
Spectral Theory of Orthogonal Polynomials Barry Simon IBM Professor of Mathematics and Theoretical Physics California Institute of Technology Pasadena, CA, U.S.A. Lecture 1: Introduction and Overview Spectral
More informationz, w = z 1 w 1 + z 2 w 2 z, w 2 z 2 w 2. d([z], [w]) = 2 φ : P(C 2 ) \ [1 : 0] C ; [z 1 : z 2 ] z 1 z 2 ψ : P(C 2 ) \ [0 : 1] C ; [z 1 : z 2 ] z 2 z 1
3 3 THE RIEMANN SPHERE 31 Models for the Riemann Sphere One dimensional projective complex space P(C ) is the set of all one-dimensional subspaces of C If z = (z 1, z ) C \ 0 then we will denote by [z]
More informationKatholieke Universiteit Leuven Department of Computer Science
Orthogonal Rational Functions and Structured Matrices Marc Van Barel Luca Gemignani Dario Fasino Nicola Mastronardi Report TW 350, November 2002 Katholieke Universiteit Leuven Department of Computer Science
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 informationDiscrete-time first-order systems
Discrete-time first-order systems 1 Start with the continuous-time system ẏ(t) =ay(t)+bu(t), y(0) Zero-order hold input u(t) =u(nt ), nt apple t
More informationRecursive, Infinite Impulse Response (IIR) Digital Filters:
Recursive, Infinite Impulse Response (IIR) Digital Filters: Filters defined by Laplace Domain transfer functions (analog devices) can be easily converted to Z domain transfer functions (digital, sampled
More informationOPUC, CMV MATRICES AND PERTURBATIONS OF MEASURES SUPPORTED ON THE UNIT CIRCLE
OPUC, CMV MATRICES AND PERTURBATIONS OF MEASURES SUPPORTED ON THE UNIT CIRCLE FRANCISCO MARCELLÁN AND NIKTA SHAYANFAR Abstract. Let us consider a Hermitian linear functional defined on the linear space
More information1 Assignment 1: Nonlinear dynamics (due September
Assignment : Nonlinear dynamics (due September 4, 28). Consider the ordinary differential equation du/dt = cos(u). Sketch the equilibria and indicate by arrows the increase or decrease of the solutions.
More informationEstimates for Bergman polynomials in domains with corners
[ 1 ] University of Cyprus Estimates for Bergman polynomials in domains with corners Nikos Stylianopoulos University of Cyprus The Real World is Complex 2015 in honor of Christian Berg Copenhagen August
More informationPARA-ORTHOGONAL POLYNOMIALS IN FREQUENCY ANALYSIS. 1. Introduction. By a trigonometric signal we mean an expression of the form.
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 33, Number 2, Summer 2003 PARA-ORTHOGONAL POLYNOMIALS IN FREQUENCY ANALYSIS LEYLA DARUIS, OLAV NJÅSTAD AND WALTER VAN ASSCHE 1. Introduction. By a trigonometric
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 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 information1. Z-transform: Initial value theorem for causal signal. = u(0) + u(1)z 1 + u(2)z 2 +
1. Z-transform: Initial value theorem for causal signal u(0) lim U(z) if the limit exists z U(z) u(k)z k u(k)z k k lim U(z) u(0) z k0 u(0) + u(1)z 1 + u(2)z 2 + CL 692 Digital Control, IIT Bombay 1 c Kannan
More informationAdaptive Fourier series a variation of greedy algorithm
Adv Comput Math (2011) 34:279 293 DOI 10.1007/s10444-010-9153-4 Adaptive Fourier series a variation of greedy algorithm Tao Qian Yan-Bo Wang Received: 5 September 2009 / Accepted: 6 April 2010 / Published
More informationZeros of Polynomials: Beware of Predictions from Plots
[ 1 / 27 ] University of Cyprus Zeros of Polynomials: Beware of Predictions from Plots Nikos Stylianopoulos a report of joint work with Ed Saff Vanderbilt University May 2006 Five Plots Fundamental Results
More informationAlgebraic aspects of the Dirichlet problem
Algebraic aspects of the Dirichlet problem P. Ebenfelt, D. Khavinson, and H. S. Shapiro. Introction Our aim in this paper is to make some remarks about certain algebraic aspects of the classical Dirichlet
More informationInverses of regular Hessenberg matrices
Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010 27 30 June 2010. Inverses of regular Hessenberg matrices J. Abderramán
More informationDavid Weenink. First semester 2007
Institute of Phonetic Sciences University of Amsterdam First semester 2007 Digital s What is a digital filter? An algorithm that calculates with sample values Formant /machine H 1 (z) that: Given input
More informationDIAGONAL TOEPLITZ OPERATORS ON WEIGHTED BERGMAN SPACES
DIAGONAL TOEPLITZ OPERATORS ON WEIGHTED BERGMAN SPACES TRIEU LE Abstract. In this paper we discuss some algebraic properties of diagonal Toeplitz operators on weighted Bergman spaces of the unit ball in
More informationULTRASPHERICAL TYPE GENERATING FUNCTIONS FOR ORTHOGONAL POLYNOMIALS
ULTRASPHERICAL TYPE GENERATING FUNCTIONS FOR ORTHOGONAL POLYNOMIALS arxiv:083666v [mathpr] 8 Jan 009 Abstract We characterize, up to a conjecture, probability distributions of finite all order moments
More informationTRUNCATED TOEPLITZ OPERATORS ON FINITE DIMENSIONAL SPACES
TRUNCATED TOEPLITZ OPERATORS ON FINITE DIMENSIONAL SPACES JOSEPH A. CIMA, WILLIAM T. ROSS, AND WARREN R. WOGEN Abstract. In this paper, we study the matrix representations of compressions of Toeplitz operators
More informationMORE NOTES FOR MATH 823, FALL 2007
MORE NOTES FOR MATH 83, FALL 007 Prop 1.1 Prop 1. Lemma 1.3 1. The Siegel upper half space 1.1. The Siegel upper half space and its Bergman kernel. The Siegel upper half space is the domain { U n+1 z C
More informationUsing Hankel structured low-rank approximation for sparse signal recovery
Using Hankel structured low-rank approximation for sparse signal recovery Ivan Markovsky 1 and Pier Luigi Dragotti 2 Department ELEC Vrije Universiteit Brussel (VUB) Pleinlaan 2, Building K, B-1050 Brussels,
More informationBank-Laine functions with periodic zero-sequences
Bank-Laine functions with periodic zero-sequences S.M. ElZaidi and J.K. Langley Abstract A Bank-Laine function is an entire function E such that E(z) = 0 implies that E (z) = ±1. Such functions arise as
More informationORTHOGONAL POLYNOMIALS WITH EXPONENTIALLY DECAYING RECURSION COEFFICIENTS
ORTHOGONAL POLYNOMIALS WITH EXPONENTIALLY DECAYING RECURSION COEFFICIENTS BARRY SIMON* Dedicated to S. Molchanov on his 65th birthday Abstract. We review recent results on necessary and sufficient conditions
More informationMatrix Rational H 2 Approximation: a State-Space Approach using Schur Parameters
Matrix Rational H 2 Approximation: a State-Space Approach using Schur Parameters J.P. Marmorat, M. Olivi, B. Hanzon, R. Peeters Sophia Antipolis, France 1 Introduction We present a method to compute a
More informationRatio Asymptotics for General Orthogonal Polynomials
Ratio Asymptotics for General Orthogonal Polynomials Brian Simanek 1 (Caltech, USA) Arizona Spring School of Analysis and Mathematical Physics Tucson, AZ March 13, 2012 1 This material is based upon work
More informationMATH 185: COMPLEX ANALYSIS FALL 2009/10 PROBLEM SET 9 SOLUTIONS. and g b (z) = eπz/2 1
MATH 85: COMPLEX ANALYSIS FALL 2009/0 PROBLEM SET 9 SOLUTIONS. Consider the functions defined y g a (z) = eiπz/2 e iπz/2 + Show that g a maps the set to D(0, ) while g maps the set and g (z) = eπz/2 e
More informationRealization formulae for bounded holomorphic functions on certain domains and an application to the Carathéodory extremal problem
Realization formulae for bounded holomorphic functions on certain domains and an application to the Carathéodory extremal problem Nicholas Young Leeds and Newcastle Universities Joint work with Jim Agler,
More informationAn Arnoldi Gram-Schmidt process and Hessenberg matrices for Orthonormal Polynomials
[ 1 ] University of Cyprus An Arnoldi Gram-Schmidt process and Hessenberg matrices for Orthonormal Polynomials Nikos Stylianopoulos, University of Cyprus New Perspectives in Univariate and Multivariate
More informationEXTREMAL DOMAINS FOR SELF-COMMUTATORS IN THE BERGMAN SPACE
EXTREMAL DOMAINS FOR SELF-COMMUTATORS IN THE BERGMAN SPACE MATTHEW FLEEMAN AND DMITRY KHAVINSON Abstract. In [10], the authors have shown that Putnam's inequality for the norm of self-commutators can be
More informationNewton s method and voronoi diagram
2015; 1(3): 129-134 ISSN Print: 2394-7500 ISSN Online: 2394-5869 Impact Factor: 3.4 IJAR 2015; 1(3): 129-134 www.allresearchjournal.com Received: 20-12-2014 Accepted: 22-01-2015 Anudeep Nain M. SC. 2nd
More informationBoundary behaviour of optimal polynomial approximants
Boundary behaviour of optimal polynomial approximants University of South Florida Laval University, in honour of Tom Ransford, May 2018 This talk is based on some recent and upcoming papers with various
More informationEXTENDED LAGUERRE INEQUALITIES AND A CRITERION FOR REAL ZEROS
EXTENDED LAGUERRE INEQUALITIES AND A CRITERION FOR REAL ZEROS DAVID A. CARDON Abstract. Let fz) = e bz2 f z) where b 0 and f z) is a real entire function of genus 0 or. We give a necessary and sufficient
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 informationM. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium
MATRIX RATIONAL INTERPOLATION WITH POLES AS INTERPOLATION POINTS M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium B. BECKERMANN Institut für Angewandte
More information1. Find the Taylor series expansion about 0 of the following functions:
MAP 4305 Section 0642 3 Intermediate Differential Equations Assignment 1 Solutions 1. Find the Taylor series expansion about 0 of the following functions: (i) f(z) = ln 1 z 1+z (ii) g(z) = 1 cos z z 2
More informationarxiv: v1 [math.fa] 26 Dec 2018
arxiv:82.0248v [math.fa] 26 Dec 208 COMPLEX SYMMETRIC WEIGHTED COMPOSITION OPERATORS ON DIRICHLET SPACES AND HARDY SPACES IN THE UNIT BALL XIAO-HE HU, ZI-CONG YANG AND ZE-HUA ZHOU Abstract. In this paper,
More informationDIFFERENTIAL SUBORDINATION RESULTS FOR NEW CLASSES OF THE FAMILY E(Φ, Ψ)
DIFFERENTIAL SUBORDINATION RESULTS FOR NEW CLASSES OF THE FAMILY E(Φ, Ψ) Received: 05 July, 2008 RABHA W. IBRAHIM AND MASLINA DARUS School of Mathematical Sciences Faculty of Science and Technology Universiti
More informationThe restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics 149 (2002) 415 422 www.elsevier.com/locate/cam The restarted QR-algorithm for eigenvalue computation of structured matrices Daniela Calvetti a; 1, Sun-Mi
More informationR a. Aeolian Church. A O g C. Air, Storm, Wind. P a h. Affinity: Clan Law. r q V a b a. R 5 Z t 6. c g M b. Atroxic Church. d / X.
A M W A A A A R A O C A () A 6 A A G A A A A A A-C Au A A P 0 V A T < Au J Az01 Az02 A Au A A A A R 5 Z 6 M B G B B B P T Bu B B B B S B / X B A Cu A, S, W A: S Hu Ru A: C L A, S, F, S A, u F C, R C F
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 informationFitting Linear Statistical Models to Data by Least Squares II: Weighted
Fitting Linear Statistical Models to Data by Least Squares II: Weighted Brian R. Hunt and C. David Levermore University of Maryland, College Park Math 420: Mathematical Modeling April 21, 2014 version
More informationOn Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line Adhemar Bultheel, Ruymán Cruz-Barroso,, Marc Van Barel Department of Computer Science, K.U.Leuven, Celestijnenlaan 2 A,
More informationMajorization Properties for Subclass of Analytic p-valent Functions Defined by the Generalized Hypergeometric Function
Tamsui Oxford Journal of Information and Mathematical Sciences 284) 2012) 395-405 Aletheia University Majorization Properties for Subclass of Analytic p-valent Functions Defined by the Generalized Hypergeometric
More informationCOMPOSITION OPERATORS ON HARDY-SOBOLEV SPACES
Indian J. Pure Appl. Math., 46(3): 55-67, June 015 c Indian National Science Academy DOI: 10.1007/s136-015-0115-x COMPOSITION OPERATORS ON HARDY-SOBOLEV SPACES Li He, Guang Fu Cao 1 and Zhong Hua He Department
More informationANONSINGULAR tridiagonal linear system of the form
Generalized Diagonal Pivoting Methods for Tridiagonal Systems without Interchanges Jennifer B. Erway, Roummel F. Marcia, and Joseph A. Tyson Abstract It has been shown that a nonsingular symmetric tridiagonal
More informationMatrix Functions and their Approximation by. Polynomial methods
[ 1 / 48 ] University of Cyprus Matrix Functions and their Approximation by Polynomial Methods Stefan Güttel stefan@guettel.com Nicosia, 7th April 2006 Matrix functions Polynomial methods [ 2 / 48 ] University
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis Volume 14, pp 127-141, 22 Copyright 22, ISSN 168-9613 ETNA etna@mcskentedu RECENT TRENDS ON ANALYTIC PROPERTIES OF MATRIX ORTHONORMAL POLYNOMIALS F MARCELLÁN
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 informationTopic 7: Filter types and structures
ELEN E481: Digital Signal Processing Topic 7: Filter tpes and structures 1. Some filter tpes 2. Minimum and maximum phase 3. Filter implementation structures 1 1. Some Filter Tpes We have seen the basics
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 informationDiscrete Orthogonal Polynomials on Equidistant Nodes
International Mathematical Forum, 2, 2007, no. 21, 1007-1020 Discrete Orthogonal Polynomials on Equidistant Nodes Alfredo Eisinberg and Giuseppe Fedele Dip. di Elettronica, Informatica e Sistemistica Università
More informationCOMPOSITION OPERATORS ON ANALYTIC WEIGHTED HILBERT SPACES
COMPOSITION OPERATORS ON ANALYTIC WEIGHTE HILBERT SPACES K. KELLAY Abstract. We consider composition operators in the analytic weighted Hilbert space. Various criteria on boundedness, compactness and Hilbert-Schmidt
More informationarxiv:math/ v1 [math.cv] 28 Jan 2003
THE CONSTANT OF INTERPOLATION arxiv:math/0301334v1 [math.cv] 28 Jan 2003 ARTUR NICOLAU, JOAQUIM ORTEGA-CERDÀ, AND KRISTIAN SEIP Abstract. We prove that a suitably adjusted version of Peter Jones formula
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 informationRobust Stabilization with Real Parametric Uncertainty via Linear Programming
Proceedings of the 19th International Symposium on Mathematical heory of Networks and Systems MNS 010 5 9 July, 010 Budapest, Hungary Robust Stabilization with Real Parametric Uncertainty via Linear Programming
More informationThe Inner Mapping Radius of Harmonic Mappings of the Unit Disk 1
The Inner Mapping Radius of Harmonic Mappings of the Unit Disk Michael Dorff and Ted Suffridge Abstract The class S H consists of univalent, harmonic, and sense-preserving functions f in the unit disk,,
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 informationSingular Perturbation on a Subdomain*
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 937 997 ARTICLE NO. AY97544 Singular Perturbation on a Subdomain* G. Aguilar Departamento de Matematica Aplicada, Centro Politecnico Superior, Uniersidad
More informationWHEN studying distributed simulations of power systems,
1096 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 21, NO 3, AUGUST 2006 A Jacobian-Free Newton-GMRES(m) Method with Adaptive Preconditioner and Its Application for Power Flow Calculations Ying Chen and Chen
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 9 Minimizing Residual CG
More informationCONSTRUCTIVE APPROXIMATION 2001 Springer-Verlag New York Inc.
Constr. Approx. (2001) 17: 267 274 DOI: 10.1007/s003650010021 CONSTRUCTIVE APPROXIMATION 2001 Springer-Verlag New York Inc. Faber Polynomials Corresponding to Rational Exterior Mapping Functions J. Liesen
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationCharacterization of half-radial matrices
Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the
More informationIndex. for generalized eigenvalue problem, butterfly form, 211
Index ad hoc shifts, 165 aggressive early deflation, 205 207 algebraic multiplicity, 35 algebraic Riccati equation, 100 Arnoldi process, 372 block, 418 Hamiltonian skew symmetric, 420 implicitly restarted,
More informationHarmonic Mappings and Shear Construction. References. Introduction - Definitions
Harmonic Mappings and Shear Construction KAUS 212 Stockholm, Sweden Tri Quach Department of Mathematics and Systems Analysis Aalto University School of Science Joint work with S. Ponnusamy and A. Rasila
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationSolutions to Exercises 6.1
34 Chapter 6 Conformal Mappings Solutions to Exercises 6.. An analytic function fz is conformal where f z. If fz = z + e z, then f z =e z z + z. We have f z = z z += z =. Thus f is conformal at all z.
More information3.1. Determine the z-transform, including the region of convergence, for each of the following sequences: N, N::: n.
Chap. 3 Problems 27 versa. Specifically, we showed that the defining power series of the z-transform may converge when the Fourier transform does not. We explored in detail the dependence of the shape
More informationA Note on Simple Nonzero Finite Generalized Singular Values
A Note on Simple Nonzero Finite Generalized Singular Values Wei Ma Zheng-Jian Bai December 21 212 Abstract In this paper we study the sensitivity and second order perturbation expansions of simple nonzero
More informationRECURSIVE ESTIMATION AND KALMAN FILTERING
Chapter 3 RECURSIVE ESTIMATION AND KALMAN FILTERING 3. The Discrete Time Kalman Filter Consider the following estimation problem. Given the stochastic system with x k+ = Ax k + Gw k (3.) y k = Cx k + Hv
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 informationSystem Identification (CH 5230)
Classification of Models System Identification (CH 5230) Arun K. Tangirala Department of Chemical Engineering, IIT Madras January - April 2010 Lecture Set 1 Models can assume various forms depending on
More informationA NEW SUBCLASS OF MEROMORPHIC FUNCTION WITH POSITIVE COEFFICIENTS
Bulletin of Mathematical Analysis and Applications ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 32010), Pages 109-121. A NEW SUBCLASS OF MEROMORPHIC FUNCTION WITH POSITIVE COEFFICIENTS S.
More informationthat determines x up to a complex scalar of modulus 1, in the real case ±1. Another condition to normalize x is by requesting that
Chapter 3 Newton methods 3. Linear and nonlinear eigenvalue problems When solving linear eigenvalue problems we want to find values λ C such that λi A is singular. Here A F n n is a given real or complex
More information