The discrete dynamics generated by a continuous map can be represented combinatorially by an appropriate multivalued map on a discretization of the phase space such as a cubical grid or triangulation. In this paper we provide explicit algorithms and computational complexity bounds for computing dynamical structures for the resulting combinatorial multivalued maps. Specifically we focus on the c...

In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank completed matrix. The divide-and-conquer approach can significantly reduce computation complexity and storage requirement. Moreover, the proposed decomposition m...

Recently, we have been developing general multireso-lution signal decomposition schemes that unify traditional (linear) approaches and allow use of nonlinear ltering techniques in the decomposition. This paper summarizes our approach and provides several simple examples. Some of these examples are known in the literature (e.g., Haar pyramid and wavelet) and some of them are new (e.g., morpholog...

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...

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain produced by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...

Lagrangean decomposition has been recognized as a promising approach for solving large-scale optimization problems. However, Lagrangean decomposition is critically dependent on the method of updating the Lagrangean multipliers used to decompose the original model. This paper presents a Lagrangean decomposition approach based on Nelder–Mead optimization algorithm to update the Lagrangean multipl...

Naval research programs are focusing on a distributed architecture approach for successful migration of data from one region to another. This presents a challenging area of modeling and managing the distributed approaches. This article describes a service-based model, which comprises of two steps that are decomposition and orchestration, for effectively managing distributed cluster networks. Th...

This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...

In the present study, a comprehensive and systematic strategy was described to evaluate the performance of several three-way calibration methods on a bio-analytical problem. Parallel factor analysis (PARAFAC), alternating trilinear decomposition (ATLD), self-weighted alternating trilinear decomposition (SWATLD), alternating penalty trilinear decomposition (APTLD) and unfolded partial least squa...