I have employed in this paper, the application of potential operators theory to study the existence and uniqueness of maximal solutions of a semilinear second order parabolic equation with an initial data whose L- p norm is small. Results concerning an a.e. pointwise convergence and regularity...

The numerical treatment of stiff ODE systems is carried out by using implicit methods. A long sequence of non-linear systems has to be treated when implicit methods are used. The Newton iterative method is often used in the solution of these systems. This leads to the calculation of Jacobian...

A natural numerical measure of consanguinity is developed that applies to individuals with arbitrary multiple kinship connections. For simple relationships the consanguineal distance specializes to the civil degree, less two if the relationship goes through full siblings. This measure is deduced...

It is already known, under certain conditions including stochastic inequalities, the comparison of moments. In this paper, we will study in detail the reverse of this problem, that is, the stochastic orderings implied by moments inequalities. We will limit our study to the absolute value of...

Let Ω ⊂ ℝ be a smooth bounded domain. We give necessary and su cient conditions for the existence of positive solutions for sublinear Dirichlet periodic parabolic problems = (, , ) in Ω × ℝ for a wide class of Caratheodory functions : Ω × ℝ [0, ∞) → ℝ satisfying some...

The aim of this paper is to study the behavior of solutions of some nonlinear partial differential equations of Mac Kean-Vlasov type. The main tools used are, on one hand, the logarithmic Sobolev inequality and its connections with the concentration of measure and the transportation inequality...

The main goal in this paper is to prove existence of radial positive solutions of the quasilinear elliptic systemwhere Ω is a ball in and , are positive continuous functions satisfying (, 0, 0) = (, 0, 0) = 0 and some growth conditions which correspond, roughly speaking, to superlinear...

This paper concerns accurate computation of the singular value decomposition (SVD) of an × matrix . As is well known, cross-product matrix based SVD algorithms compute large singular values accurately but generally deliver poor small singular values. A new novel cross-product matrix based SVD...

We are concerned with conventional and refined projection methods for computing approximations to some eigenpairs (λ, ) of a large matrix . Given a subspace that contains an approximation to , these two methods compute approximations and to (λ, ), respectively. We establish three results....

Given a set of points in a plane, a spanning tree is a set of edges that connects all the points and contains no cycles. If each edge is weighted using the rectilinear distance metric, the rectilinear minimum spanning tree is a tree whose sum of edge weights is minimum. A naive approach to...