Abstract Three types of previously used numerical methods are revisited for computing the streamfunction ? and velocity potential ? from horizontal v in limited domains. The first type, called SOR-based method, uses a classical successive over-relaxation (SOR) scheme to compute (or ) with an arbitrary boundary condition (BC) then BC derived ? . second spectral formulations construct inner part ...

We propose a variant of variable preconditioning for Generalized Conjugate Residual (GCR)-like methods. The preconditioning is carried out by roughly solving Az = v by an iterative method to a certain degree of accuracy instead of computing Kz = v in a conventional preconditioned algorithm. In our proposal, the number of iterations required for computing Az = v is changed at each iteration by e...

The organization and management of the intense computation involved in the solution of large, sparse and non-symmetric systems of equations, arising from the discretization of Elliptic Boundary Value Problems (BVPs) by the Hermite Collocation method, on a Distributed-Shared Memory (DSM) multiprocessor environment is the problem considered herein. As the size of the problem directly suggests the...

The streamed storage format for sparse matrices showed good performance improvement for sparse matrix and vector multiply (SpMV) compared with compressed sparse row (CSR) and block CSR (BCSR) formats, particularly on IBM Power processors. We extend the format to exploit single instruction multiple data (SIMD) instructions in order to utilize the vector unit, and discuss how the streamed formats...

The Euclidean division of two formal series in one variable produces a sequence of series that we obtain explicitly, remarking that the case where one of the two initial series is 1 is sufficiently generic. As an application, we define a Wronskian of symmetric functions. The Euclidean division of two polynomials P (z), Q(z), in one variable z, of consecutive degrees, produces a sequence of line...

We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the `1-`2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.

In this report, we review the construction of polar codes and we briefly present the main results that lead to the conclusion that polar codes are capacity achieving over binaryinput discrete memoryless channels. Moreover, we discuss a more sophisticated variant of successive cancellation decoding, namely list successive cancellation decoding, that aims to improve the finite-length performance ...

We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the `1-`2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.

In this paper, the successive overrelaxation iteration and the variation of parameters formula are used to discuss the stability of linear and nonlinear Volterra integrodifferential equations. Some sufficient conditions are obtained, such that the trivial solution of the Volterra integrodifferential equations is asymptotically stable; these stability conditions are given directly from the coeff...

Although reproducible results can be obtained in photometric set-point titrations of submicromolar amounts (5 -lo+ M and higher) of calcium(I1) and zinc(I1) by using an ? automatic titrator, the systematic error can be considerable. This error is partly intrinsic ; in nature, but there is an additional error caused by dilution in successive titrations_ Accurate values can be obtained only when ...