Solving Ratio-Dependent Predator-Prey System with Constant Effort Harvesting using Variational Iteration Method

Due to wide range of interest in use of bio-economic models to gain insight into the scientific management of renewable resources like fisheries and forestry,variational iteration method (VIM) is employed to approximate the solution of the ratio-dependent predator-prey system with constant effort prey harvesting.The results are compared with the results obtained by Adomian decomposition method and reveal that VIM is very effective and convenient for solving nonlinear differential equations.

Stability of the Iteration Method for non Expansive Mappings

The general iteration method for nonexpansive mappings on a Banach space is considered. Under some assumption of fast enough convergence on the sequence of (“almost” nonexpansive) perturbed iteration mappings, if the basic method is τ−convergent for a suitable topology τ weaker than the norm topology, then the perturbed method is also τ−convergent. Application is presented to the gradient-prox method for monotone inclusions in Hilbert spaces.

On The Critical Points of some Iteration Methods for Solving Algebraic Equations. Global Convergence Properties

In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.

Introduction to the Maple Power Tool Intpakx

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

Cryptographic Primitives with Quasigroup Transformations

AMS Subj. Classification: Primary 20N05, Secondary 94A60

A Solver for Complex-Valued Parametric Linear Systems

This work reports on a new software for solving linear systems involving affine-linear dependencies between complex-valued interval parameters. We discuss the implementation of a parametric residual iteration for linear interval systems by advanced communication between the system Mathematica and the library C-XSC supporting rigorous complex interval arithmetic. An example of AC electrical circuit illustrates the use of the presented software.

Weighted ICP Algorithm for Alignment of Stars from Scanned Astronomical Photographic Plates

ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2.

N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90

Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems

AMS subject classification: 65K10, 49M07, 90C25, 90C48.

A Method for Solving a Class of Multiple-Criteria Analysis Problems

AMS subject classification: 90C29.