A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(jlog j) steps of itera...

In this paper, we propose two models reduction algorithms for approximation of large-scale linear switched systems. We present at first the iterative dual rational krylov approach, that construct a union of krylov subspaces. The iterative dual rational Krylov is low in cost, numerical efficient but the stability of reduced system is not always guaranteed. In the second part we present, the iter...

The solution of non-linear sets of algebraic equations is usually obtained by the Newton's method, exhibiting quadratic convergence. For practical simulations, a signiicant computational eeort consists in the evaluation of the Jacobian matrices. In this paper, we propose and experiment various methods to speed the convergence process either by re-using information from previous iterates or by b...

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

‎In this article‎, ‎we introduce a new type iterative scheme for‎ ‎approximating common fixed points of two asymptotically‎ ‎nonexpansive mappings is defined‎, ‎and weak and strong convergence‎ ‎theorem are proved for the new iterative scheme in a uniformly‎ ‎convex Banach space‎. ‎The results obtained in this article‎ ‎represent an extension as well as refinement of previous known‎ ‎resu...

In this article an evaluation of two semi-analytical techniques is carried out, considering the quality and accuracy of these techniques in reproducing the ground-level concentration values of passive pollutant of the advection-diffusion equation by the Laplace transform technique. The second is a Lagrangian model based on solution of the Langevin equation through the Picard Iterative Method. T...

‎in this paper‎, ‎we propose two preconditioned aor iterative methods to solve systems of linear equations whose coefficient matrices are z-matrix‎. ‎these methods can be considered as improvements of two previously presented ones in the literature‎. ‎finally some numerical experiments are given to show the effectiveness of the proposed preconditioners‎.‎

body's iterative force-field computer program has been used to calculate strain energies in cyclooctanone (i). 348 mhz 1h nmr spectra of (i) have been investigated over the temperature range of 25° to -160°c. two conformation processes affect the 1h nmr spectrum of (i). iterative force-field calculations on the conformations and conformational interconversion paths of (i) give results consisten...