in this paper, a practical review of the adomian decomposition method, to extend the procedure to handle the strongly nonlinear problems under the mixed conditions, is given and the convergence of the algorithm is proved. for this respect, a new and simple way to generate the adomian polynomials, for a general nonlinear function, is proposed. the proposed procedure, provides an explicit formula...

A promising approach to tackle intractable problems is given by a combination of decomposition methods with dynamic algorithms. One such decomposition concept is tree decomposition. However, several heuristics for obtaining a tree decomposition exist and, moreover, also the subsequent dynamic algorithm can be laid out differently. In this paper, we provide an experimental evaluation of this com...

We present an overview of the banded Invariant Subspace Decomposition Algorithm for symmetric matrices and describe a parallel implementation of this algorithm. The algorithm described here is a promising variant of the Invariant Subspace Decomposition Algorithm for dense symmetric matrices (SYISDA) that retains the property of using scalable primitives, while requiring signiicantly less overal...

We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...

We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...

in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...

In Noro (2010) we proposed an algorithm for computing primary ideal decomposition by using the notion of separating ideal and showed that it can efficiently decompose several examples which are hard to decompose by existing algorithms. In particular the number of redundant components produced in the algorithm is zero or very small in many examples, but no theoretical explanation for the efficie...

In the long-term evolution (LTE) system, channel equalization makes compensation to restore the original signal, the paper puts forward iteration sphere decoding algorithm which combines traditional sphere decoding and the improved QR based on the conventional QR decomposition detection algorithm. It can effectively reduce the system complexity. At the same time, in QPSK and 16QAM, the simulati...

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are still efficient. This theory not only unifies the usual modular decomposition generalisations such as modular decomposition of directed graphs or decomposition ...

background: electromyographic (emg) signal decomposition is the process by which an emg signal is decomposed into its constituent motor unit potential trains (mupts). a major step in emg decomposition is feature extraction in which each detected motor unit potential (mup) is represented by a feature vector. as with any other pattern recognition system, feature extraction has a significant impac...