A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.     

Local solution for the Kadomtsev-Petviashvili equation with periodic conditions

In this article we prove a local existence and uniqueness theorem for the Kadomtsev-Petviashvili Equation (u _t +u _xxx +uu _x ) _x −u _yy =0) in the Sobolev spaces of orders≥3, with initial values in the same spaces, and periodic boundary conditions. This theorem improves previous results based upon the application of singular perturbation techniques.     

A supraconvergent scheme for the Korteweg-de Vries equation

Summary A finite-difference method for the integration of the Korteweg-de Vries equation on irregular grids is analyzed. Under periodic boundary conditions, the method is shown to be supraconvergent in the sense that, though being inconsistent, it is second order convergent. However, such a convergence only takes place on grids with an odd number of points per period. When a grid with an even number of points is used, the inconsistency of the method leads to divergence. Numerical results backing the analysis are presented.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

The bestL 2-approximation by finite sums of functions with separable variables

Summary We consider the problem of the best approximation of a given functionh L ² (X × Y) by sums _k=1 ⁿ f _k f _k, with a prescribed numbern of products of arbitrary functionsf _k L ² (X) andg _k L ² (Y). As a co-product we develop a new proof of the Hilbert—Schmidt decomposition theorem for functions lying inL ² (X × Y).     

A moment problem associated to rational Szegő functions

Leta ₁,...,a _p be distinct points in the finite complex plane ?, such that |a _j|>1,j=1,..., p and let \(b_j = 1/\bar \alpha _j ,\) j=1,..., p. Let μ₀, μ _π ^(j) , ν _π ^(j) j=1,..., p;n=1, 2,... be given complex numbers. We consider the following moment problem. Find a distribution ψ on [?π, π], with infinitely many points of increase, such that $$\begin{array}{l} \int_{ - \pi }^\pi {d\psi (\theta ) = \mu _0 ,} \\ \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - a_j )^n }} = \mu _n^{(j)} ,} \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - b_j )^n }} = v_n^{(j)} ,} j = 1,...,p;n = 1,2,.... \\ \end{array}$$ It will be shown that this problem has a unique solution if the moments generate a positive-definite Hermitian inner product on the linear space of rational functions with no poles in the extended complex plane ?^* outside {a ₁,...,a _p,b ₁,...,b _p}.     

Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.     

Fluorescence of metal complexes of 8-hydroxyquinoline derivatives in aqueous micellar media

The fluorescence characteristics of 8-hydroxyquinoline derivative complexes of A1(III), Ga(III), In(III), Zn(II), and Be(II) in differently charged micellar media are reported. For most of the chelates studied, large increases are observed in micellar media compared with those obtained in hydroorganic solvents. However, some exceptions are observed, of which the low fluorescence of Zn(II) chelates in anionic sodium lauryl sulfate media is the most noticeable.