One traditionally considers positive measures in the moment problem. However, this restriction makes its theory and application limited. The main purpose of this paper is to generalize it to deal with complex measures. More precisely, the theory of the truncated moment problem is extended to include complex measures. This extended theory provides considerable flexibility in its applications. In...

Optical pulse compression using similariton propagation in an optical fibre with decreasing dispersion has been demonstrated for the first time. This scheme is a practical application of sech-similariton solution to generalized nonlinear schrodinger equation(NLSE) distributed coefficients recently found self similarity technique. The profile constructed comb-profile approximation technique and ...

A new technique for polytope approximation of the feasible region for a design is presented. This method is computationally less expensive than the simplicial approximation method [1]. Results on several circuits are presented, and it is shown that the quality of the polytope approximation is substantially better than an ellipsoidal approximation.

In optical networks regenerators have to be placed on lightpaths every d nodes in order to regenerate the signal. In addition, grooming enables the use of the same regenerator by several lightpaths. Up to g (the grooming factor) lightpaths can use the same regenerator. In this work we consider the problem of minimizing the number of regenerators used in traffic grooming in optical networks. Sta...

It is shown how to find general multivariate Padé approximation using the Gröbner basis technique. This method is more flexible than previous approaches, and several examples are given to illustrate this advantage. When the number of variables is small compared to the degree of approximation, the Gröbner basis technique is more efficient than the linear algebra methods in the literature.

Linear programming relaxations have been used extensively in designing approximation algorithms for optimization problems. For vertex cover, linear programming and a thresholding technique gives a 2-approximate solution, rivaling the best known performance ratio. For a generalization of vertex cover we call vc t , in which we seek to cover t edges, this technique may not yield a feasible soluti...

An algorithm is introduced for model reduction of linear time invariant system using combine advantage of pade approximation technique and stability equation method. The denominator of reduced order model is derived by stability equation method and numerator of reduced order transfer function is obtained by pade approximation technique. This method guarantees stability of reduced model if high ...

The purpose of this paper is to introduce the concept of general fuzzy multivalued variational inclusions and to study the existence problem and the iterative approximation problem for certain fuzzy multivalued variational inclusions in Banach spaces. Using the resolvent operator technique and a new analytic technique, some existence theorems and iterative approximation techniques are presented...

A synthesis of a globally convergent numerical method for a coefficient inverse problem and the adaptivity technique is presented. First, the globally convergent method provides a good approximation for the unknown coefficient. Next, this approximation is refined via the adaptivity technique. The analytical effort is focused on a posteriori error estimates for the adaptivity. A numerical test i...