We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in most cases faster (sometimesâ€¦ (More)

Leonard Yves, R Ust, +43 authorsBernhard Von Stengel

2007

The goal of this thesis is to give a better understanding of the linear complementarity problem with a P-matrix (PLCP). Finding a polynomial time algorithm for the PLCP is a longstanding openâ€¦ (More)

We have used techniques of nonlinear dynamics to compare a special model for the reversals of the Earth's magnetic eld with the observational data. Although this model is rather simple, there is noâ€¦ (More)

-We caJculated the static and dynamic susceptibilities x (Q) and x (Q, w) , the neutron scattering cross-section S (Q) , and the scattering law S (Q, w ) for amorphous magnets with small randomâ€¦ (More)

We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n= d+1), derive the necessaryâ€¦ (More)

Neutron diffraction investigations on a single crystal of GdBa2Cu307-6 (6 = 0.5) show that the Gd moments order at TN = 2.2 K with a wave vector (1/2, 1/2, 0). The Gd moments areâ€¦ (More)