Froissart doublets in Padé approximation in the case of polynomial noise
First, we study the relation between the zeros of random polynomials Rn+1 and the zeros and poles of their Pade approximants [n/n]Rn+1. Next, we consider the distribution of zeros and poles of Pade approximants to the geometric series perturbed by a random polynomial noise. We observe numerically interesting connections between two above problems. Some numerical observations on the Froissart doublets have been also made.
We analyze the parallelization of QR factorization by means of Householder transformations. This parallelization is carried out on a machine with a mesh topology (a 2-D torus to be more precise). We use a cyclic distribution of the elements of the sparse matrix M we want to decompose over the processors. Each processor represents the nonzero elements of its part of the matrix by a one-dimensional doubly linked list data structure. Then, we describe the different procedures that constitute the parallel algorithm. As an application of QR factorization, we concentrate on the least squares problem and finally we present an evaluation of the efficiency of this algorithm for a set of test matrices from the Harwell-Boeing sparse matrix collection.