Polynomial solutions to H∞ problems

The paper presents a polynomial solution to the standard H∞-optimal control problem. Based on two polynomial J-spectral factorization problems, a parameterization of all suboptimal compensators is obtained. A bound on the McMillan degree of suboptimal compensators is derived and an algorithm is formulated that may be used to solve polynomial J-spectral factorization problems

Elementary Darboux transformations and factorization

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.Comment: 10 page

Supersymmetric pairing of kinks for polynomial nonlinearities

We show how one can obtain kink solutions of ordinary differential equations with polynomial nonlinearities by an efficient factorization procedure directly related to the factorization of their nonlinear polynomial part. We focus on reaction-diffusion equations in the travelling frame and damped-anharmonic-oscillator equations. We also report an interesting pairing of the kink solutions, a result obtained by reversing the factorization brackets in the supersymmetric quantum mechanical style. In this way, one gets ordinary differential equations with a different polynomial nonlinearity possessing kink solutions of different width but propagating at the same velocity as the kinks of the original equation. This pairing of kinks could have many applications. We illustrate the mathematical procedure with several important cases, among which the generalized Fisher equation, the FitzHugh-Nagumo equation, and the polymerization fronts of microtubulesComment: 13 pages, 2 figures, revised during the 2nd week of Dec. 200

Prime Factorization in the Duality Computer

We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.Comment: 4 page