We consider the problem of computing stable/unstable manifolds attached to periodic orbits of maps, and develop quasi-numerical methods for polynomial approximation of the manifolds to any desired order. The methods avoid function compositions by exploiting an idea inspired by multiple shooting schemes for periodic orbits. We consider a system of conjugacy equations which characterize chart map...

Abstract. The distribution function for the first eigenvalue spacing in the Laguerre unitary ensemble of finite rank random matrices is found in terms of a Painlevé V system, and the solution of its associated linear isomonodromic system. In particular it is characterised by the polynomial solutions to the isomonodromic equations which are also orthogonal with respect to a deformation of the La...

We survey some recent results on iterative methods for approximating the least solution of a system of monotone fixed-point polynomial equations.

the aim of this investigation was to prepare, characterize and optimize the aceclofenac proniosomes using central composite design and carry out stability studies. three independent variables selected were molar ratio of drug to lipid (x1), surfactant loading (x2) and volume of hydration (x3). based on central composite design, 16 batches of proniosomes were prepared by slurry method and evalua...

the index of matrix a in cn.n is equivalent to the dimension of largest jor-dan block corresponding to the zero eigenvalue of a. in this paper, indicialequations and normal equations for solving inconsistent singular linear systemof equations are investigated.

We examine the spectra of boolean functions obtained as the sign of a real polynomial of degree d. A tight lower bound on various norms of the lower d levels of the function's Fourier transform is established. The result is applied to derive best possible lower bounds on the influences of variables on linear threshold functions. Some conjectures are posed concerning upper and lower bounds on in...

The Simulation Evaluation of Heat Balancing Strategies for Btree Index over Parallel Shared Nothing Machines Hisham Feelifl and Masaru Kitsuregawa Institute of Industrial Science, The University of Tokyo {hisham, kitsure} @tkl.iis.u-tokyo.ac.jp In shared nothing machines the data are typically declustered across the system processing elements (PEs) to exploit the I/O bandwidth of the PEs. Notwi...

We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...