variational iteration method using he's polynomials can be used to construct solitary solution and  compacton-like solution for nonlinear dispersive equatioons. the chosen initial solution can be determined in compacton-like form or in solitary form with some compacton-like or solitary forms with some unknown parameters, which can be determined in the solution procedure. the compacton-like solu...

and that the three demand constraints also sum up to this same expression. It follows that it is sufficient to work with any subset of 5 out of these 6 equations. To understand what this means more explicitly, suppose we are given a proposed solution to the original equations, and we are asked to check whether or not the given solution is feasible. To answer this, we would have to substitute th...

The concurrent FE2-method is a very powerful and flexible computational tool for multi-scale problems. However the effort high. conventional, staggered (“nested Newton”) solution scheme solves microscopic problem iteratively within each macroscopic Newton-Raphson (NR) iteration, although deformation gradients as boundary conditions at micro scale are only estimates. In this contribution monolit...

Background and purpose: Textile industries are among the most polluting industries regarding the volume and the complexity of treatment of its effluents discharge. This study investigated the efficiency of electrocoagulation process using aluminum electrodes in basic red 18 dye removal from aqueous solutions. Materials and Methods: This study was performed in a bipolar batch reactor with ...

The paper presents unified analytical solution for combining high-frequency and low-frequency economic time-series by additive and proportional Denton methods with parametrical dependence on the initial values of variable and indicator in evident form. This solution spans Denton’s original and Cholette’s advanced benchmarking initial conditions as the subcases. Computational complexity of the o...

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...