Some geometrical iteration methods for nonlinear equations

This paper describes geometrical essentials of some iteration methods （e.g. Newton iteration, secant line method, etc.） for solving nonlinear equations and advances some geometrical methods of iteration that are flexible and efficient.     

Orthogonal similarity transformation into block‐semiseparable matrices of semiseparability rank k

Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd.     

Iteration 2-theories

The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iteration 2-theory generated by a 2-signature.     

The Radon-Nikodým Property Does Not Imply the Separable Complementation Property

There is a Banach space X enjoying the Radon-Nikodým Property and a separable subspace Y which is not contained in any complemented separable subspace of X.     

线性规划的σj迭代计算方法

本提出并证明了求解线性规划（LP）的单纯形法中检验数（σj）的迭代计算方法的定理，由此定理得到的迭代计算方法比传统的按定义式计算法的渐近时间复杂度降了一级，同时简化了计算过程并提高了计算效率。     

Application of Homotopy Perturbation Method and Variational Iteration Method to Nonlinear Oscillator Differential Equations

In this paper, homotopy perturbation method (HPM) and variational iteration method (VIM) are applied to solve nonlinear oscillator differential equations. Illustrative examples reveal that these methods are very effective and convenient for solving nonlinear differential equations. Moreover, the methods do not require linearization or small perturbation. Comparisons are also made between the exact solutions and the results of the homotopy perturbation method and variational iteration method in order to prove the precision of the results obtained from both methods mentioned.     

Increasing efficiency of inverse iteration

Inverse iteration is simple but not very efficient method for computing few eigenvalues with minimal absolute values and corresponding eigenvectors of a symmetric matrix. The idea is to increase its efficiency by technique similar to multigrid methods used for solving linear systems. This approach is not new, but until now multigrid was mostly used for solving linear system which appear in Rayleigh quotient iteration, inverse iteration and related iterative methods. Instead of choosing appropriate coordinates (grids), our algorithm performs inverse iteration on a sequence of subspaces with decreasing dimensions (multispace). Block Lanczos method is used for the selection of a smaller subspace. This will produce a banded matrix, which makes inverse iteration even faster in the smaller dimensions.      

Numerical methods for nonlinear partial differential equations of fractional order

In this article, we implement relatively new analytical techniques, the variational iteration method and the Adomian decomposition method, for solving nonlinear partial differential equations of fractional order. The fractional derivatives are described in the Caputo sense. The two methods in applied mathematics can be used as alternative methods for obtaining analytic and approximate solutions for different types of fractional differential equations. In these schemes, the solution takes the form of a convergent series with easily computable components. Numerical results show that the two approaches are easy to implement and accurate when applied to partial differential equations of fractional order.     

A FAMILY OF HIGH-ODER PARALLEL ROOTFINDERS FOR POLYNOMIALS

1. IntroductionLetbe a monic complex polynomial of degree n with zeros fi,'' 9 f.. Some authors havestudied the parallel iterations without evaluation of derivatives for simultaneous findingall zeros of f(t) (see [1]--[10]). The famous one is Weierstrass-Durand-Dochev-Kerneriterationwhere xo is the k-th approximation of (i(l 5 i 5 n) andwhich does not require any information of derivatives and was presented independentlyby Weierstrass[7], DurandlZ], Doche.[3] and Ke..e.14). It is well kno…     

Travelling wave fronts in a vector disease model with delay

In this paper, we study the diffusive vector disease model with delay. This problem with strong biological background has attracted much research attention. We focus on the existence of traveling wave fronts, and find that there is a moving zone for the transition from the disease-free state to the infective state. To complete the theoretical analysis, we employ the mathematical tools including the monotone iteration technique as well as the upper and lower solution method.