In this paper, Adomian Decomposition Method (ADM) is used to study the linear time-invariant transistor circuit. The results obtained using Adomian Decomposition Method and the methods taken from the literature [5] were compared with the exact solutions of the linear time-invariant transistor circuit. It is found that the solution obtained using the Adomian Decomposition Method is closer to the...

\Tree-codes" and \Multigrid" methods are both hierarchical, recursive algorithms for solving vector eld equations, faster than traditional methods. If the methods are non-adaptive, then both Tree-codes and Multigrid methods require identical parallel communication strategies since they share the same internal structure. This paper contains a description of Tree-codes followed by an overview of ...

The balancing domain decomposition method for mixed finite elements by Cowsar, Mandel, and Wheeler is extended to the case of mortar mixed finite elements on non-matching multiblock grids. The algorithm involves an iterative solution of a mortar interface problem with one local Dirichlet solve and one local Neumann solve per subdomain on each iteration. A coarse solve is used to guarantee that ...

the main purpose of this paper is to consider adomian's decomposition method in non-linear volterra integro-differential equations. the advantages of this method, compared with the recent numerical techniques (in particular the implicitly linear collocation methods) , and the convergence of adomian's method applied to such nonlinear integro-differential equations are discussed. finall...

The non-overlapping domain decomposition method is an efficient approach for solving time harmonic scattering wave problems. It is used here to reduce large size systems solution to that of several systems of small size and to construct efficient procedures to couple finite element and boundary element methods. The lack of a satisfactory treatment of the so-called cross-points, nodes being shar...

A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization, balancing domain decomposition with constraints (BDDC) algorithms are designed and analyzed as an additive Schwarz method (ASM). The coarse and local problems are defined using special partitions of unity and edge co...

to determine the effects of vinasse on physicochemical properties of a calcareous and an acidic soil experiment was factorial and had a complete randomized design and three replications. factorial combinations of five vinasse levels (0, 5, 10, 20 and 40 t/ha) and three exposure times (10, 20 and 30 days) were considered as the treatments of this experiment. the result of experiment showed that ...

A new definition of the homotopy analysis method is given by means of the decomposition method in this paper. The convergence of the homotopy decomposition method is proved under some reasonable hypotheses, which provide the theoretical basis of the homotopy decomposition method for solving nonlinear problems. AMS subject classification: 34A34.

This paper proposes an entropy-based best tree decomposition and reconstruction method for signals on graphs. A recently popular method for graph signal decomposition is to down-sample and filter a graph signal by low-pass and high-pass filters, then iterate decomposition on every low-pass component. This method is not well-suited for graph signals with significant high frequency components. We...