A generalization of the Kaplan-Meier estimator to Harris-recurrent Markov chains. - In: Statistical papers, ISSN 1613-9798, Bd. 38 (1997), 1, S. 63-75
https://doi.org/10.1007/BF02925215
Strong convergence of kernel estimators for product densities of absolutely regular point processes. - In: Journal of nonparametric statistics, ISSN 1048-5252, Bd. 8 (1997), 1, S. 65-96
Unvollständige LU-Zerlegung und approximative Inverse von Blocktridiagonalmatrizen. - Ilmenau : Techn. Univ., Inst. für Mathematik, 1997. - 17 S. = 268,2 KB. - (Preprint ; M97,05)
http://www.db-thueringen.de/servlets/DocumentServlet?id=6105
Numerical simulation of subharmonically reacting nonlinear electrical circuits. - Ilmenau : Techn. Univ., Inst. für Mathematik, 1997. - 14 S. = 509,8 KB. - (Preprint ; M97,10)
http://www.db-thueringen.de/servlets/DocumentServlet?id=6103
Characterization of homoclinic points bifurcating from degenerate homoclinic orbits. - Ilmenau : Techn. Univ., Inst. für Mathematik, 1997. - 14 S. = 184,1 KB, Text. - (Preprint ; M97,13)
http://www.db-thueringen.de/servlets/DocumentServlet?id=6205
Convergence speed of an integral method for computing the essential supremum. - In: Developments in global optimization, (1997), S. 153-170
We give an equivalence between the tasks of computing the essential supremum of a summable function and of finding a certain zero of a one-dimensional convex function. Interpreting the integral method as Newton-type method we show that in the case of objective functions with an essential supremum that is not spread the algorithm can work very slowly. For this reason we propose a method of accelerating the algorithm which is in some respect similar to the method of Aitken/Steffensen.
On the best approximation of set-valued functions. - In: Recent advances in optimization, (1997), S. 61-74
Let M be a Hausdorff compact topological space, let C(M) be the Banach space of the continuous on M functions supplied with the supremum norm and let V be a finite dimensional subspace of C(M). The problem of the Chebyshev approximation of a function f of C(M) by functions from V is generalized to two Chebyshev kind approximations of a point-to set mapping by a single valued continuous function from V using suitable distances between a point and a set. The first problem occur e.g. in curve fitting with noisy data or in approximating spatial bodies by circular cylinders with respect to a proper distance. The second problem is useful for calculating continuous selections with special uniform distance properties.
Nichtlineare autoregressive Modelle der Zeitreihenanalyse. - In: Beiträge aus dem wissenschaftlichen Leben, Bd. 2 (1997), S. 18-21
Ein multikriterielles, fuzzybasiertes Lastverteilungssystem. - In: Informatik und Automatisierung im Zeitalter der Informationsgesellschaft ; Bd. 1:[Vortragsreihen / Gens, Wolfgang *1933-*. - Ilmenau : Technische Univ., 1997, (1997), S. 269-274
https://www.worldscientific.com/worldscinet/apjor