The object of this paper is to study invariant submanifoldsM of Sasakian manifolds ̃ M admitting a semisymmetric nonmetric connection, and it is shown that M admits semisymmetric nonmetric connection. Further it is proved that the second fundamental forms σ and σ with respect to Levi-Civita connection and semi-symmetric nonmetric connection coincide. It is shown that if the second fundamental fo...

Search-based methods like Branch and Bound and Branch and Cut are essential tools in solving diicult problems to optimality in the eld of combinatorial optimization, and much experience has been gathered regarding the design and implementation of parallel methods in this eld. Search-based methods appear, however, also in connection with certain continuous optimization problems and problems in A...

This paper reports on a fast implementation of the three-dimensional nonadaptive Parallel Multipole Method (PMM) on the Connection Machine system model CM—2. The data interactions within the decomposition tree are modeled by a hierarchy of three-dimensional grids forming a pyramid in which parent nodes have degree eight. The base of the pyramid is embedded in the Connection Machine as a three-d...

Acknowledgements The results presented in this thesis were obtained during my employment as a scientific coworker at the The colleagues at EELE for the good working atmosphere. The students who supported me with their projects.

We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be applied most efficiently for iterative methods on massively parallel machines. The algorithm and its implementation on the Connection Machine CM-2 are discussed in detail and supported by timings obtained from real pr...

the following way: This paper is devoted to a new deterministic and massively parallel alnorithm for combinatorial o~timization in a Markov Random F i e l i First, tbe a posteriori of a tentative labeling, Now, let R ~ M A be defined by: defined in terms of a Markov Random Field is generalized to continuous labelings. This merit function of probagilistic vectors is then convexified by changing ...

The valuation of interest rate contingencies relies on simulation methods that integrate models of the term structure of interest rates with estimations of the contingent cash flows. Such simulations are quite complex and computationally int.ensive. In this paper we describe the development of massively parallel procedures for financial modeling simulations on systems like the Connection Mlachi...