in this paper we derive convergence theorems for an -nonexpansive mappingof a nonempty closed and convex subset of a complete cat(0) space for sp-iterative process and thianwan's iterative process.

A smoothing theorem for normal crossings to Calabi-Yau manifolds was proved by Y. Kawamata and Y. Namikawa ([KaNa]). This paper is a study of the observation that the Picard groups and Chern classes of these Calabi-Yau manifolds are constructible from the normal crossings in such smoothings. We provide and prove the formula for the construction in its full generality and various applications ar...

A few of the contributions of Poincaré to algebraic geometry are described, with emphasis on his late work on normal functions. A very brief description of some recent works is also given. Although the subject of algebraic geometry was not one of Poincaré's major preoccupations, his work in the field showed characteristic insight and brilliance and certainly has had a lasting effect. I shall br...

We investigate a method of construction of Calabi–Yau manifolds, that is, by smoothing normal crossing varieties. We develop some theories for calculating the Picard groups of the Calabi–Yau manifolds obtained in this method. As an application, we construct more than two hundred new families of Calabi–Yau 3-folds with Picard number one that have different Hodge numbers (h’s). We also exhibit a ...

For an arbitrary curve Z ⊂ P (possibly reducible, non-reduced, unmixed) lying on a normal surface, the general surface S of high degree containing Z is also normal, but often singular. We compute the class groups of the very general such surface, thereby extending the Noether-Lefschetz theorem (the special case when Z is empty). Our method is an adaptation of Griffiths and Harris’ degeneration ...

we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...