On the computation of the defining polynomial of the algebraic Riccati equation Yamaguchi Univ. Takuya Kitamoto Cybernet Systems, Co. LTD Tetsu Yamaguchi.

Slides:

Advertisements

Similar presentations

Notes 6.6 Fundamental Theorem of Algebra

Advertisements

Rules of Matrix Arithmetic

The CORS method Selecting the roots of a system of polynomial equations with combinatorial optimization H. Bekker E.P. Braad B. Goldengorin University.

Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University in Prague MAKING MINIMAL SOLVERS.

Solving Linear Systems (Numerical Recipes, Chap 2)

Data mining and statistical learning - lecture 6

© 2009 Maplesoft, a division of Waterloo Maple Inc. Computer Algebra vs. Reality Erik Postma and Elena Shmoylova Maplesoft June 25, 2009.

Extended Baum-Welch algorithm Present by shih-hung Liu

SECTION 3.6 COMPLEX ZEROS; COMPLEX ZEROS; FUNDAMENTAL THEOREM OF ALGEBRA FUNDAMENTAL THEOREM OF ALGEBRA.

September 2008CORTONA-ITALY, DOUBLY STRUCTURED SETS OF SYMPLECTIC MATRICES Froilán M. Dopico Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM.

Computing the Rational Univariate Reduction by Sparse Resultants Koji Ouchi, John Keyser, J. Maurice Rojas Department of Computer Science, Mathematics.

1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 7 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,

6/20/2015List Decoding Of RS Codes 1 Barak Pinhas ECC Seminar Tel-Aviv University.

Princeton University COS 423 Theory of Algorithms Spring 2002 Kevin Wayne Fast Fourier Transform Jean Baptiste Joseph Fourier ( ) These lecture.

An Exact Toric Resultant-Based RUR Approach for Solving Polynomial Systems Koji Ouchi, John Keyser, J. Maurice Rojas Department of Computer Science, Mathematics.

On the fundamental matrix of the inverse of a polynomial matrix and applications N. P. Karampetakis S. Vologiannidis Department of Mathematics Aristotle.

Section 3.3 Dividing Polynomials; Remainder and Factor Theorems

1 Section 1.9 Division of Algebraic Expressions. 2 I. Dividing Monomials Divide the numerical coefficients; then divide the literal numbers (variables)

Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University in Prague Methods for Solving Systems.

Numerical Computations in Linear Algebra. Mathematically posed problems that are to be solved, or whose solution is to be confirmed on a digital computer.

Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.

Dr. Mubashir Alam King Saud University. Outline Systems of Linear Equations (6.1) Matrix Arithmetic (6.2) Arithmetic Operations (6.2.1) Elementary Row.

Selecting Class Polynomials for the Generation of Elliptic Curves Elisavet Konstantinou joint work with Aristides Kontogeorgis Department of Information.

9.9 The Fundamental Theorem of Algebra

Robustness in Numerical Computation I Root Finding Kwanghee Ko School of Mechatronics Gwnagju Institute of Science and Technology.

7.6 Rational Zero Theorem Algebra II w/ trig. RATIONAL ZERO THEOREM: If a polynomial has integer coefficients, then the possible rational zeros must be.

Introduction to Numerical Analysis I MATH/CMPSC 455 Interpolation.

© 2013 Toshiba Corporation An Estimation of Computational Complexity for the Section Finding Problem on Algebraic Surfaces Chiho Mihara (TOSHIBA Corp.)

On the Use of Sparse Direct Solver in a Projection Method for Generalized Eigenvalue Problems Using Numerical Integration Takamitsu Watanabe and Yusaku.

The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Introduction Course Outline.

Learning Mixtures of Structured Distributions over Discrete Domains Xiaorui Sun Columbia University Joint work with Siu-On Chan(UC Berkeley), Ilias Diakonikolas(U.

Solving Network Coding Problems with Genetic Algorithmic Methods Anthony Kim Advisers: Muriel Medard and Una-May O’Reilly.

Introduction to Numerical Analysis I MATH/CMPSC 455 Splines.

Solving Equations Binomials Simplifying Polynomials

Computer Theory Michael J. Watts

The Fundamental Theorem of Algebra It’s in Sec. 2.6a!!! Homework: p odd, all.

Stats & Summary. The Woodbury Theorem where the inverses.

Solve polynomial equations with complex solutions by using the Fundamental Theorem of Algebra. 5-6 THE FUNDAMENTAL THEOREM OF ALGEBRA.

MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments Eigenvectors and eigenvalues of a matrix.

Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.

Polynomial P(x) Linear Factors Solutions of P(x)=0 Zeros of P(x) P(x) = 0.

S5.40. Module Structure 30% practical tests / 70% written exam 3h lectures / week (except reading week) 3 x 2h of computer labs (solving problems practicing.

Appendix A Basic Algebra Review

The Fundamental Theorem of Algebra and Complete Factorization

Big-O notation.

Algebra II Explorations Review ( )

Copyright © Cengage Learning. All rights reserved.

Extended Baum-Welch algorithm

Rational Root and Complex Conjugates Theorem

Analytic Number Theory MTH 435

An Introduction to Maple

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Presenter: Xia Li.

Nuclear Norm Heuristic for Rank Minimization

Lial/Hungerford/Holcomb: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All right.

If a polynomial q(x) is divided by x – 4, the quotient is 2

Michael Overton Scientific Computing Group Broad Interests

Find all solutions of the polynomial equation by factoring and using the quadratic formula. x = 0 {image}

Review Algebra.

Zeros of a Polynomial Function

Last Lesson: Upshot: We can show a system of equations has no solutions by computing the reduced Groebner basis.

Fundamental Theorem of Algebra

3.4 Zeros of Polynomial Functions: Real, Rational, and Complex

Chapter R Algebra Reference.

Multiplying monomial with polynomial

Fundamental Theorem of Algebra

Co-efficient, Degree and value of an algebraic expression

(1) Find all of the zeros of f.

Matrix arithmetic: the product of two matrices

Lecture 2-3 Basic Number Theory and Algebra

Copyright © Cengage Learning. All rights reserved.

Presentation transcript:

On the computation of the defining polynomial of the algebraic Riccati equation Yamaguchi Univ. Takuya Kitamoto Cybernet Systems, Co. LTD Tetsu Yamaguchi

Outline of the presentation What is ARE (Algebraic Riccati Equation)? Properties of ARE Problem formulation Algorithm description Numerical experiments Conclusion

What is ARE (Algebraic Riccati Equation)?

Properties of ARE Important equation for control theory (H2 optimal control, etc) Symmetric solutions (solution matrices are symmetric) are important. There are 2^n symmetric solutions. When matrices A, W, Q are numerical matrices, a numerical algorithm to compute the solutions is already known. The numerical algorithm can not be applied when matrices A, W, Q contain a parameter.

Problem formulation Example:

We can compute the defining polynomial of entries of P, not P itself.

The method with Groebner Basis: Effective for only small degree n (n=2), because of its heavy numerical complexities

Algorithm description

Algorithm

Example

Conversion from floating point numbers to integers Arbitrary precision arithmetic can be used. Precision required is unknown.

Conversion from integers to polynomials Polynomial interpolation can be used. The degree of the polynomial is unknown.

Computation of

Numerical experiments (1)

Numerical experiments (2) Environments: Maple 10 on the machine with Pentium M 2.0GHz, 1.5Gbyte memory n2345 M ××× M × Computation time (in seconds)

Conclusion An algorithm to compute the defining polynomial of ARE with a parameter is given. The algorithm uses polynomial interpolations and arbitrary precision arithmetic. Numerical experiments suggest that the algorithm is practical for the system with size n<5. The algorithm is suitable for multi-CPU environments.

Future direction Further improvements of efficiency is necessary. Modular algorithm instead of floating point arithmetic can be used (provided the head coefficient is known). Extend application of the defining polynomial.