-
Notifications
You must be signed in to change notification settings - Fork 0
Bezoutian, Block hankel matrix, structured linearization (for polynomial matrices with symmetric coefficient matrices)
madhunbelur/Scilab-polynomial-matrix-manipulations
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
// This Scilab program was written by Madhu N. Belur (IIT Bombay) in // year 2008 in the context of an alternative method to compute the // H-infinity norm of a transfer matrix. // Comments/criticisms about the program -> Madhu // Madhu Belur's website: http://www.ee.iitb.ac.in/~belur // This is a free program, you can do whatever you want. // This is released under the GPL license 2. better_method.sci for overall implementation of H-infinity norm computation two_var_mat.sci some two-variable polynomial matrix manipulation, (unlikely to be very useful). bezoutian.sci Takes two VECTORS (coefficients) and returns bezoutian MATRIX. constr_hankel.sci Takes a WIDE matrix A (square blocks in a row) and returns a Hankel matrix (A chopped if little too large.) make_pencil_for_symm.sci Takes a square polynomial matrix P with each coefficient a symmetric matrix, and returns two large matrices A and E such that zeros(P)=spec(A,-E) (Structured linearization) precondition.sci Some routine preconditioning sylvester_mat.sci Takes p and q (with deg q = deg p -1) and gives their Sylvester matrix
About
Bezoutian, Block hankel matrix, structured linearization (for polynomial matrices with symmetric coefficient matrices)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published