The notion of finite zeros of continuous-time positive linear systems is introduced. It is shown that such zeros are real numbers. It is also shown that a square positive strictly proper or proper system of uniform rank with observability matrix of full column rank has no finite zeros. The problem of zeroing the system output for positive systems is defined. It is shown that a square positive s...

in this article, a numerical method based on  improvement of block-pulse functions (ibpfs) is discussed for solving the system of linear volterra and fredholm integral equations. by using ibpfs and their operational matrix of integration, such systems can be reduced to a linear system of algebraic equations. an efficient error estimation and associated theorems for the proposed method are also ...

In this paper we propose a new numerically reliable computational approach to determine the J inner outer factorization of a rational matrix G The proposed approach is completely general being ap plicable whenever G is proper or not or of full column row rank or not In contrast to existing one shot methods which require the solution of Riccati or generalized Riccati equations the new approach i...

When s = 1 and N = ‖n‖ − 1 this is the classical Hermite Padé approximation problem. Here we allow N to be arbitrary. We describe algorithms for computing an order N genset of type n: a matrix V ∈ k[x]∗×m such that every row of V is a solution to (1) and every solution P of (1) can be expressed as a k[x]-linear combination of the rows of V . Ideally, V will be a minbasis of solutions: V has ful...

A new numerically reliable computational approach is proposed to compute the facto-rization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved \one-shot" methods which require the solution of Riccati or generalized Riccati equations, the new approach relies on an eecient recursive pol...

We discuss methods for solving the key linear equations within primal-dual barrier methods for linear and quadratic programming. Following Freund and Jarre, we explore methods for reducing the Newton equations to 2× 2 block systems (KKT systems) in a stable manner. Some methods require partitioning the variables into two or more parts, but a simpler approach is derived and recommended. To justi...

In this paper we motivate, formulate and analyze the Multi-Configuration Time-Dependent Hartree-Fock (MCTDHF) equations for molecular systems under Coulomb interaction. They consist in approximating the Nparticle Schrödinger wavefunction by a (time-dependent) linear combination of (time-dependent) Slater determinants. The equations of motion express as a system of ordinary differential equation...