The class of objects we consider are algebraic relations between the four kinds of classical Jacobi theta functions θj(z|τ), j = 1, . . . , 4, and their derivatives. We present an algorithm to prove such relations automatically where the function argument z is zero, but where the parameter τ in the upper half complex plane is arbitrary.

In this paper, the authors present a modified convergent analytic algorithm for the solution of nonlinear boundary value problems by means of a variable parameter method and briefly, the method is called optimal variable parameter method. This method, based on the embedding of a parameter and an auxiliary operator, provides a computational advantage for the convergence of the approximate soluti...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

In this work the problem of optimal input design (OID) in a receding-horizon framework for online parameter estimation is solved. The designed optimum input is used for dynamic experiment and subsequent estimation of parameters. A fuel cell experiment design and parameter estimation problem is investigated through the proposed approach. Some of the issues related to the application of the propo...

This paper presents case studies of robust algorithm of multi-parametric model predictive control (mpMPC). For discrete-time linear parameter-varying (LPV) systems, the robust algorithm is investigated based on the solution of the mpMPC problem for discrete-time linear time-invariant (LTI) systems. The algorithm provides a controller design method, adaptable to parameter changes of a LPV system...