@book{Marohn1990,
  author    = {Marohn, Frank},
  title     = {On statistical information of extreme order statistics},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-47866},
  publisher      = {Universit{\"a}t W{\"u}rzburg},
  year      = {1990},
  abstract  = {No abstract available},
  subject      = {Rangstatistik},
  language  = {en}
}
@article{Marohn1991,
  author    = {Marohn, Frank},
  title     = {Global sufficiency of extreme order statistics in location models of Weibull type},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-47874},
  year      = {1991},
  abstract  = {In Janssen and Reiss (1988) it was shown that in a location model of a Weibull type sample with shape parameter -1 < a < 1 the k(n) lower extremes are asymptotically local sufficient. In the present paper we show that even global sufficiency holds. Moreover, it turns out that convergence of the given statistical experiments in the deficiency metric does not only hold for compact parameter sets but for the whole real line.},
  subject      = {Extremwertstatistik},
  language  = {de}
}
@incollection{FalkMarohn1992,
  author    = {Falk, Michael and Marohn, Frank},
  title     = {Laws of small numbers : Some applications to conditional curve estimation},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45841},
  publisher      = {Universit{\"a}t W{\"u}rzburg},
  year      = {1992},
  abstract  = {No abstract available},
  subject      = {Gesetz der kleinen Zahlen},
  language  = {en}
}
@article{FalkMarohn1993,
  author    = {Falk, Michael and Marohn, Frank},
  title     = {Von Mises condition revisited},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45790},
  year      = {1993},
  abstract  = {It is shown that the rate of convergence in the von Mises conditions of extreme value theory determines the distance of the underlying distribution function F from a generalized Pareto distribution. The distance is measured in terms of the pertaining densities with the limit being ultimately attained if and only if F is ultimately a generalized Pareto distribution. Consequently, the rate of convergence of the extremes in an lid sample, whether in terms of the distribution of the largest order statistics or of corresponding empirical truncated point processes, is determined by the rate of convergence in the von Mises condition. We prove that the converse is also true.},
  language  = {en}
}
@article{FalkMarohn1993,
  author    = {Falk, Michael and Marohn, Frank},
  title     = {Asymptotically optimal tests for conditional distributions},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45823},
  year      = {1993},
  abstract  = {No abstract available},
  language  = {en}
}
@article{Zillober1993,
  author    = {Zillober, Christian},
  title     = {A globally convergent version of the method of moving asymptotes},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-31984},
  year      = {1993},
  abstract  = {No abstract available},
  language  = {en}
}
@article{KredlerZilloberJohannesetal.1993,
  author    = {Kredler, Christian and Zillober, Christian and Johannes, Frank and Sigl, Georg},
  title     = {An application of preconditioned conjugate gradients to relative placement in chip design},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-31996},
  year      = {1993},
  abstract  = {In distance geometry problems and many other applications, we are faced with the optimization of high-dimensional quadratic functions subject to linear equality constraints. A new approach is presented that projects the constraints, preserving sparsity properties of the original quadratic form such that well-known preconditioning techniques for the conjugate gradient method remain applicable. Very-largescale cell placement problems in chip design have been solved successfully with diagonal and incomplete Cholesky preconditioning. Numerical results produced by a FORTRAN 77 program illustrate the good behaviour of the algorithm.},
  language  = {en}
}
@inproceedings{Zillober1993,
  author    = {Zillober, Christian},
  title     = {Sequential convex programming in theory and praxis},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-35513},
  year      = {1993},
  abstract  = {In this paper, convex approximation methods, suclt as CONLIN, the method of moving asymptotes (MMA) and a stabilized version of MMA (Sequential Convex Programming), are discussed with respect to their convergence behaviour. In an extensive numerical study they are :finally compared with other well-known optimization methods at 72 examples of sizing problems.},
  language  = {en}
}
@article{JanssenMarohn1994,
  author    = {Janssen, A. and Marohn, Frank},
  title     = {On statistical information of extreme order statistics, local extreme value alternatives, and Poisson point processes},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45816},
  year      = {1994},
  abstract  = {The aim of the present paper is to clarify the role of extreme order statistics in general statistical models. This is done within the general setup of statistical experiments in LeCam's sense. Under the assumption of monotone likelihood ratios, we prove that a sequence of experiments is asymptotically Gaussian if, and only if, a fixed number of extremes asymptotically does not contain any information. In other words: A fixed number of extremes asymptotically contains information iff the Poisson part of the limit experiment is non-trivial. Suggested by this result, we propose a new extreme value model given by local alternatives. The local structure is described by introducing the space of extreme value tangents. It turns out that under local alternatives a new class of extreme value distributions appears as limit distributions. Moreover, explicit representations of the Poisson limit experiments via Poisson point processes are found. As a concrete example nonparametric tests for Frechet type distributions against stochastically larger alternatives are treated. We find asymptotically optimal tests within certain threshold models.},
  language  = {en}
}
@inproceedings{Marohn1994,
  author    = {Marohn, Frank},
  title     = {On testing the exponential and Gumbel distribution},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45804},
  year      = {1994},
  abstract  = {No abstract available},
  subject      = {Gumbel-Verteilung},
  language  = {en}
}
@article{Marohn1994,
  author    = {Marohn, Frank},
  title     = {Asymptotic sufficiency of order statistics for almost regular Weibull type densities},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-45837},
  year      = {1994},
  abstract  = {Consider a location family which is defined via a Weibull type density having shape parameter a = 1. We treat the problem, which portion of the order statistics is asymptotically sufficient. It turns out that the intermediate order statistics are relevant.},
  language  = {en}
}
@phdthesis{Keilbach2000,
  author    = {Keilbach, Rupert},
  title     = {Minimalfl{\"a}chen und Bj{\"o}rlingsches Problem in der Relativgeometrie},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-2782},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2000},
  abstract  = {In dieser Arbeit besch{\"a}ftigen wir uns mit Themen aus der affinen Hyperfl{\"a}chentheorie. Nachdem wir die euklidische Normale, die Blaschkesche Affinnormale, eine gewisse Einparameterfamilie von Relativnormalen und die zentroaffine Normale besprochen und eine neue Einparameterfamilie von Relativnormalen definiert haben, behandeln wir die folgenden drei Schwerpunkte: Zuerst befassen wir uns mit Minimalfl{\"a}chen bez{\"u}glich verschiedener Volumina und der Rolle der jeweiligen Mittleren Kr{\"u}mmung. Wir berechnen die erste und zweite Variation der Volumina, die von den Normalen der erw{\"a}hnten Familien induziert werden. Hierbei stellen wir fest, daß die Mittlere Kr{\"u}mmung nicht immer das Verschwinden der ersten Variation des Volumens anzeigt. Anschließend {\"u}bertragen wir die Begriffe Adjungierte und Assoziierte bei euklidischen Minimalfl{\"a}chen auf Affinminimalfl{\"a}chen: Analog zum euklidischen Fall kann man die Konormale einer Affinminimalfl{\"a}che durch bestimmte ,,harmonische'' Abbildungen darstellen. Wir geben eine Methode an, wie man aus einer gegebenen Affinminimalfl{\"a}che weitere gewinnt, indem man diese Abbildungen entsprechend modifiziert. Schließlich l{\"o}sen wir eine Verallgemeinerung des Bj{\"o}rlingschen Problems f{\"u}r Normalen der oben erw{\"a}hnten Familien: Bei Vorgabe einer Kurve mit zwei Vektorfeldern und der Art der Normalisierung existiert - mit Ausnahmen - je genau eine elliptische und eine hyperbolische Fl{\"a}che in (pseudo-)isothermen Parametern mit folgenden Eigenschaften: Die Kurve ist eine Parameterlinie, die Normale l{\"a}ngs der Kurve stimmt mit dem einen Vektorfeld {\"u}berein, die Konormale mit dem anderen und die Mittlere und Gaußsche Kr{\"u}mmung erf{\"u}llen eine vorgegebene Bedingung.},
  subject      = {Minimalfl{\"a}che},
  language  = {de}
}
@phdthesis{Kessler2000,
  author    = {Keßler, Manuel},
  title     = {Die Ladyzhenskaya-Konstante in der numerischen Behandlung von Str{\"o}mungsproblemen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-2791},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2000},
  abstract  = {Charakteristisch f{\"u}r die L{\"o}sbarkeit von elliptischen partiellen Differentialgleichungssystemen mit Nebenbedingungen ist das Auftreten einer inf-sup-Bedingung. Im prototypischen Fall der Stokes-Gleichungen ist diese auch als Ladyzhenskaya-Bedingung bekannt. Die G{\"u}ltigkeit dieser Bedingung, bzw. die Existenz der zugeh{\"o}rigen Konstante ist eine Eigenschaft des Gebietes, innerhalb dessen die Differentialgleichung gel{\"o}st werden soll. W{\"a}hrend die Existenz schon die L{\"o}sbarkeit garantiert, ist beispielsweise f{\"u}r Fehleraussagen bei der numerischen Approximation auch die Gr{\"o}ße der Konstanten sehr wichtig. Insbesondere auch deshalb, weil eine {\"a}hnliche inf-sup-Bedingung auch bei der Diskretisierung mittel Finiter-Elemente-Methoden auftaucht, die hier Babuska-Brezzi-Bedingung heißt. Die Arbeit befaßt sich auf der einen Seite mit einer analytischen Absch{\"a}tzung der Ladyzhenskaya-Konstante f{\"u}r verschiedene Gebiete, wobei {\"A}quivalenzen mit verwandten Problemen aus der komplexen Analysis (Friedrichs-Ungleichung) und der Strukturmechanik (Kornsche Ungleichung) benutzt werden. Ein weiterer Teil befaßt sich mit dem Zusammenhang zwischen kontinuierlicher Ladyzhenskaya- Konstante und diskreter Babuska-Brezzi-Konstante. Die dabei gefundenen Ergebnisse werden mit Hilfe eines dazu entwickelten leistungsf{\"a}higen Finite-Elemente-Programmsystems numerisch verifiziert. Damit k{\"o}nnen erstmals genaue Absch{\"a}tzungen der Konstanten in zwei und drei Dimensionen gefunden werden. Aufbauend auf diesen Resultaten wird ein schneller L{\"o}sungsalgorithmus f{\"u}r die Stokes-Gleichungen vorgeschlagen und anhand von problematischen Gebieten dessen {\"U}berlegenheit gegen{\"u}ber klassischen Verfahren wie beispielsweise der Uzawa-Iteration demonstriert. W{\"a}hrend selbst bei einfachen Geometrien eine Konvergenzbeschleunigung um einen Faktor 5 erwartet werden kann, sind in kritischen F{\"a}llen Faktoren bis zu 1000 m{\"o}glich.},
  subject      = {Stokes-Gleichung},
  language  = {de}
}
@phdthesis{Dirr2001,
  author    = {Dirr, Gunther},
  title     = {Differentialgleichungen in Fr{\´e}chetr{\"a}umen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-1180417},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2001},
  abstract  = {Teil 1 der Arbeit beinhaltet eine Zusammenfassung grundlegender funktionalanalytischer Ergebnisse sowie eine Einf{\"u}hrung in die Integral- und Differentialrechnung in Fr{\´e}chetr{\"a}umen. Insbesondere wird in Kapitel 2 eine ausf{\"u}hrliche Darstellung des Lebesgue-Bochner-Integrals auf Fr{\´e}chetr{\"a}umen geliefert. Teil 2 behandelt die Theorie der linearen Differentialgleichungen auf Fr{\´e}chetr{\"a}umen. Dazu werden in Kapitel 3 stark differenzierbare Halbgruppen und deren infinitesimale Generatoren charakterisiert. In Kapitel 4 werden diese Ergebnisse benutzt, um lineare Evolutionsgleichungen (von hyperbolischem oder parabolischem Typ) zu untersuchen. Teil 3 enth{\"a}lt die zentralen Resultate der Arbeit. In Kapitel 5 werden zwei Existenz- und Eindeutigkeitss{\"a}tze f{\"u}r nichtlineare gew{\"o}hnliche Differentialgleichungen in zahmen Fr{\´e}chetr{\"a}umen bewiesen. Kapitel 6 liefert eine Anwendung der Ergebnisse aus Kapitel 5 auf nichtlineare partielle Differentialgleichungen erster Ordnung.},
  subject      = {Differentialgleichung},
  language  = {de}
}
@phdthesis{Dittmann2001,
  author    = {Dittmann, Ulrich},
  title     = {Coset Types and Tight Subgroups of Almost Completely Decomposable Groups},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-2762},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2001},
  abstract  = {A completely decomposable group is a direct sum of subgroups of the rationals. An almost completely decomposable group is a torsion free abelian group that contains a completely decomposable group as subgroup of finite index. Tight subgroups are maximal subgroups (with respect to set inclusion) among the completely decomposable subgroups of an almost completely decomposable group. In this dissertation we show an extended version of the theorem of Bezout, give a new criterion for the tightness of a completely decomposable subgroup, derive some conditions under which a tight subgroup is regulating and generalize a theorem of Campagna. We give an example of an almost completely decomposable group, all of whose regulating subgroups do not have a quotient with minimal exponent. We show that among the types of elements of a coset modulo a completely decomposable group there exists a unique maximal type and define this type to be -the- coset type. We give criteria for tightness and regulating in term of coset types as well as a representation of the type subgroups using coset types. We introduce the notion of reducible cosets and show their key role for transitions from one completely decomposable subgroup up to another one containing the first one as a proper subgroup. We give an example of a tight, but not regulating subgroup which contains the regulator. We develop the notion of a fully single covered subset of a lattice, show that V-free implies fully single covered, but not necessarily vice versa, and we define an equivalence relation on the set of all finite subsets of a given lattice. We develop some extension of ordinary Hasse diagrams, and apply the lattice theoretic results on the lattice of types and almost completely decomposable groups.},
  subject      = {Torsionsfreie Abelsche Gruppe},
  language  = {en}
}
@phdthesis{Nahler2001,
  author    = {Nahler, Michael},
  title     = {Isomorphism classes of almost completely decomposable groups},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-2817},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2001},
  abstract  = {In this thesis we investigate near-isomorphism classes and isomorphism classes of almost completely decomposable groups. In Chapter 2 we introduce the concept of almost completely decomposable groups and sum up their most important facts. A local group is an almost completely decomposable group with a primary regulator quotient. A uniform group is a rigid local group with a homocyclic regulator quotient. In Chapter 3 a weakening of isomorphism, called type-isomorphism, appears. It is shown that type-isomorphism agrees with Lady's near-isomorphism. By the Main Decomposition Theorem and the Primary Reduction Theorem we are allowed to restrict ourselves on clipped local groups, namely groups without a direct rank-one summand. In Chapter 4 we collect facts of matrices over commutative rings with an identity element. Matrices over the local ring (Z / p^e Z) of residue classes of the rational integers modulo a prime power play an important role. In Chapter 5 we introduce representing matrices of finite essential extensions. Here a normal form for local groups is found by the Gauß algorithm. Uniform groups have representing matrices in Hermite normal form. The classification problems for almost completely decomposable groups up to isomorphism and up to near-isomorphism can be rephrased as equivalence problems for the representing matrices. In Chapter 6 we derive a criterion for the representing matrices of local groups in Gauß normal form. In Chapter 7 we formulate the matrix criterion for uniform groups. Two representing matrices in Hermite normal form describe isomorphic groups if and only if the rest blocks of the representing matrices are T-diagonally equivalent. Starting from a fixed near-isomorphism class in Chapter 8 we investigate isomorphism classes of uniform groups. We count groups and isomorphism classes. In Chapter 9 we specialize on uniform groups of rank 2r with a regulator quotient of rank r such that the rest block of the representing matrix is invertible and normed.},
  subject      = {Fast vollst{\"a}ndig zerlegbare Gruppe},
  language  = {en}
}
@phdthesis{Trumpf2002,
  author    = {Trumpf, Jochen},
  title     = {On the geometry and parametrization of almost invariant subspaces and observer theory},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-5034},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {In my Ph.D. thesis "On the geometry and parametrization of almost invariant subspaces and observer theory" I consider the set of almost conditioned invariant subspaces of fixed dimension for a given fixed linear finite-dimensional time-invariant observable control system in state space form. Almost conditioned invariant subspaces were introduced by Willems. They generalize the concept of a conditioned invariant subspace requiring the invariance condition to hold only up to an arbitrarily small deviation in the metric of the state space. One of the goals of the theory of almost conditioned invariant subspaces was to identify the subspaces appearing as limits of sequences of conditioned invariant subspaces. An example due to {\"O}zveren, Verghese and Willsky, however, shows that the set of almost conditioned invariant subspaces is not big enough. I address this question in a joint paper with Helmke and Fuhrmann (Towards a compactification of the set of conditioned invariant subspaces, Systems and Control Letters, 48(2):101-111, 2003). Antoulas derived a description of conditioned invariant subspaces as kernels of permuted and truncated reachability matrices of controllable pairs of the appropriate size. This description was used by Helmke and Fuhrmann to construct a diffeomorphism from the set of similarity classes of certain controllable pairs onto the set of tight conditioned invariant subspaces. In my thesis I generalize this result to almost conditioned invariant subspaces describing them in terms of restricted system equivalence classes of controllable triples. Furthermore, I identify the controllable pairs appearing in the kernel representations of conditioned invariant subspaces as being induced by corestrictions of the original system to the subspace. Conditioned invariant subspaces are known to be closely related to partial observers. In fact, a tracking observer for a linear function of the state of the observed system exists if and only if the kernel of that function is conditioned invariant. In my thesis I show that the system matrices of the observers are in fact the corestrictions of the observed system to the kernels of the observed functions. They in turn are closely related to partial realizations. Exploring this connection further, I prove that the set of tracking observer parameters of fixed size, i.e. tracking observers of fixed order together with the functions they are tracking, is a smooth manifold. Furthermore, I construct a vector bundle structure for the set of conditioned invariant subspaces of fixed dimension together with their friends, i.e. the output injections making the subspaces invariant, over that manifold. Willems and Trentelman generalized the concept of a tracking observer by including derivatives of the output of the observed system in the observer equations (PID-observers). They showed that a PID-observer for a linear function of the state of the observed system exists if and only if the kernel of that function is almost conditioned invariant. In my thesis I replace PID-observers by singular systems, which has the advantage that the system matrices of the observers coincide with the matrices appearing in the kernel representations of the subspaces. In a second approach to the parametrization of conditioned invariant subspaces Hinrichsen, M{\"u}nzner and Pr{\"a}tzel-Wolters, Fuhrmann and Helmke and Ferrer, F. Puerta, X. Puerta and Zaballa derived a description of conditioned invariant subspaces in terms of images of block Toeplitz type matrices. They used this description to construct a stratification of the set of conditioned invariant subspaces of fixed dimension into smooth manifolds. These so called Brunovsky strata consist of all the subspaces with fixed restriction indices. They constructed a cell decomposition of the Brunovsky strata into so called Kronecker cells. In my thesis I show that in the tight case this cell decomposition is induced by a Bruhat decomposition of a generalized flag manifold. I identify the adherence order of the cell decomposition as being induced by the reverse Bruhat order.},
  subject      = {Invarianter Unterraum},
  language  = {en}
}
@phdthesis{Staab2002,
  author    = {Staab, Patricia},
  title     = {Geometrische Eigenschaften von Spiraltypfl{\"a}chen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-3727},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {Spiraltypfl{\"a}chen sind Minimalfl{\"a}chen des dreidimensionalen euklidischen Raums, die sich durch hohe Symmetrie gegen{\"u}ber komplexen {\"A}hnlichkeitsabbildungen der Minimalkurve auszeichnen. Ihren Namen verdanken Sie folgender Eigenschaft: Sie und ihre komplex Homothetischen sind die einzigen auf Spiralfl{\"a}chen abwickelbaren Minimalfl{\"a}chen. Bekannte Spiraltypfl{\"a}chen sind die Spiralminimalfl{\"a}chen (zugleich Minimal- und Spiralfl{\"a}chen) und die Bourfl{\"a}chen (auf Rotationsfl{\"a}chen abwickelbare Minimalfl{\"a}chen). Das Katenoid und die Enneperfl{\"a}che sind spezielle Bourfl{\"a}chen. In dieser Arbeit werden die Spiraltypfl{\"a}chen auf ihre geometrischen Eigenschaften untersucht. Wir stellen ihre Periodizit{\"a}ten und Symmetrien fest und versuchen, ausgezeichnete Fl{\"a}chenkurven auf ihnen zu finden. Wir verwenden eine globale Weierstraß-Darstellung der Spiraltypfl{\"a}chen. In dieser Darstellung ergeben die Fl{\"a}chen eine Schar mit einem komplexen Scharparameter. Anhand dieser Darstellung leiten wir s{\"a}mtliche Symmetrien der Spiraltypfl{\"a}chen zu linearen {\"A}hnlichkeitsabbildungen der Minimalkurve her. Als Spezialf{\"a}lle erhalten wir die Symmetrien unter Assoziationen und Derivationen (Drehung der Minimalkurve um einen imagin{\"a}ren Drehwinkel), sowie die reellen Symmetrien (Dreh-, Spiegel- und Strecksymmetrien). Unter den Spiraltypfl{\"a}chen gibt es nur zwei translationssymmetrische Fl{\"a}chen. Die Umorientierung einer Spiraltypfl{\"a}che entspricht (bis auf komplexe Homothetie) dem Vorzeichenwechsel des Fl{\"a}chenparameters. Im {\"U}brigen kann durch einfache Spiegelungen an den Koordinatenebenen beziehungsweise Drehungen um die Koordinatenachsen das Vorzeichen von Real- beziehungsweise Imagin{\"a}rteil des Fl{\"a}chenparameters umgekehrt werden. Schließlich stellen wir noch ausgezeichnete Fl{\"a}chenkurven auf den Spiraltypfl{\"a}chen vor: Kr{\"u}mmungslinien, Asymptotenlinien und Geod{\"a}tische, sowie als deren Verallgemeinerungen die Pseudokr{\"u}mmungslinien und Pseudogeod{\"a}tischen.},
  subject      = {Spiraltypfl{\"a}che},
  language  = {de}
}
@phdthesis{Preiss2002,
  author    = {Preiß, Martin},
  title     = {Analytizit{\"a}tseigenschaften gewichteter zentraler Pfade bei monotonen Komplementarit{\"a}tsproblemen und ihre Ausnutzung},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-3969},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {Die vorliegende Arbeit untersucht die Analytizit{\"a}tseigenschaften unzul{\"a}ssiger Innerer-Punkte Pfade bei monotonen Komplementarit{\"a}tsproblemen und diskutiert m{\"o}gliche algorithmische Anwendungen. In Kapitel 2 werden einige matrixanalytische Konzepte und Resultate zusammengestellt, die f{\"u}r die Beweisf{\"u}hrung in den folgenden Kapiteln ben{\"o}tigt werden. Kapitel 3 gibt eine genaue Definition der Begriffe "monotones lineares Komplementarit{\"a}tsproblem" (LCP) bzw. "semidefinites monotones lineares Komplementarit{\"a}tsproblem" (SDLCP) und zeigt die Grundidee hinter den Innere-Punkte-Verfahren zur L{\"o}sung solcher Probleme. Kapitel 4 beinhaltet die analytischen Hauptresultate f{\"u}r monotone Komplementarit{\"a}tsprobleme. In Abschnitt 4.1 werden einige wohlbekannte Resultate {\"u}ber die Analytizit{\"a}tseigenschaften unzul{\"a}ssiger Innerer-Punkte-Pfade f{\"u}r LCP's wiedergegeben. Diese werden in Abschnitt 4.2 auf den semidefiniten Fall {\"u}bertragen. Unter der Annahme, dass das zugrundeliegende SDLCP eine strikt komplement{\"a}re L{\"o}sung besitzt, wird gezeigt, dass die Inneren-Punkte-Pfade sogar noch im Randpunkt analytisch sind. Kapitel 5 benutzt die Resultate aus Kapitel 4, um die lokal hohe Konvergenzordnung einer Langschrittmethode zur L{\"o}sung von SDLCP's zu zeigen. Kapitel 6 f{\"u}hrt eine neue Methode zur L{\"o}sung von LCP's und SDLCP's mit Hilfe von Inneren-Punkte-Techniken ein. Dabei werden die Pfadfunktionen derart gew{\"a}hlt, dass alle Iterierten auf unzul{\"a}ssigen zentralen Pfaden liegen. Es wird globale und lokale Konvergenz des Verfahrens bewiesen.},
  subject      = {Innere-Punkte-Methode},
  language  = {de}
}
@phdthesis{BletzSiebert2002,
  author    = {Bletz-Siebert, Oliver},
  title     = {Homogeneous spaces with the cohomology of sphere products and compact quadrangles},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-3994},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {We consider homogeneous spaces G/H with the same rational homotopy as a product of a 1-sphere and a (m+1)-sphere. We show that these spaces have also the rational cohomology of such a sphere product if H is connected and if the quotient has dimension m+2. Furthermore, we prove that if additionally the fundamental group of G/H is cyclic, then G/H is locally a product of a 1-torus and ofA/H, where A/H is a simply connected rational cohomology (m+1)-sphere (and hence classified). If H fails to be connected, then with U as the connected component of H the G-action on the covering space G/U of G/H has connected stabilizers, and the results apply to G/U. To show that under the assumptions above every natural number may be realized as the order of the group of connected components of H we calculate the cohomology of certain homogeneous spaces. We also determine the rational cohomology of the fibre bundle U-->G-->G/U if G/H meets the assumptions above. This is done by considering the respective Leray-Serre spectral sequence. The structure of the cohomology of U-->G-->G/U then gives a second proof for the structure of compact connected Lie groups acting transitively on spaces with the rational homotopy of a product of a 1-sphere and a (m+1)-sphere. Since a quotient of a homogeneous space with the same rational homotopy or cohomology as a product of a 1-sphere and a (m+1)-sphere is not simply connected, there often arises the question whether or not a considered fibre bundle or fibration is orientable. A large amount of space will therefore be given to the problem of showing that certain fibrations are orientable. For compact connected (m+2)-manifolds with cyclic fundamental groups and with the rational homotopy of a product of a 1-sphere and a (m+1)-sphere we show the following: if a connected Lie group acts transitively on the manifold, then the maximal compact subgroups are either transitive, or their orbits are simply connected rational cohomology spheres of codimension 1. Homogeneous spaces with the same rational cohomology or homotopy as a a product of a 1-sphere and a (m+1)-sphere play a role in the study of different types of geometrical objects. They appear for example as focal manifolds of isoparametric hypersurfaces with four distinct principal curvatures. Further examples of such spaces are the point spaces and the line spaces of compact connected generalized quadrangles. We determine the isometry groups of isoparametric hypersurfaces with 4 principal curvatures of multiplicities 1 and m which are transitive on the focal manifold with non-trivial fundamental group. Buildings were introduced by Jacques Tits to give interpretations of simple groups of Lie type. They are a far-reaching generalization of projective spaces, in particular a generalization of projective planes. There is another generalization of projective planes called generalized polygons. A projective plane is the same as a generalized triangle. The generalized polygons are also contained in the class of buildings: they are the buildings of rank 2. To compact quadrangles one can assign a pair of natural numbers called the topological parameters of the quadrangles. We treat the case k=1. It turns out that there are no other point-transitive compact connected Lie groups for (1,m)-quadrangles than the ones for the real orthogonal quadrangles. Furthermore, we solve the problem of three infinite series of group actions which Kramer left as open problems; there are no quadrangles with the homogeneous spaces in question as point spaces (up to maybe a finite number of small parameters in one of the three series).},
  subject      = {Homogener Raum},
  language  = {en}
}
@phdthesis{Grahl2002,
  author    = {Grahl, J{\"u}rgen},
  title     = {Blochsches Prinzip, L{\"u}ckenreihen und Semidualit{\"a}t},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-3477},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {Ein bekanntes heuristisches Prinzip von A. Bloch beschreibt die Korrespondenz zwischen Kriterien f{\"u}r die Konstanz ganzer Funktionen und Normalit{\"a}tskriterien. In der vorliegenden Dissertation untersuchen wir die G{\"u}ltigkeit des Blochschen Prinzip bei L{\"u}ckenreihenproblemen sowie Zusammenh{\"a}nge zwischen Normalit{\"a}tsfragen und der Semidualit{\"a}t von einer bzw. von zwei Funktionen. Die ersten beiden Kapitel stellen die im folgenden ben{\"o}tigten Hilfsmittel aus der Nevanlinnaschen Wertverteilungstheorie und der Normalit{\"a}tstheorie bereit. Im dritten Kapitel beweisen wir ein neues Normalit{\"a}tskriterium f{\"u}r Familien holomorpher Funktionen, f{\"u}r die ein Differentialpolynom einer bestimmten Gestalt nullstellenfrei ist. Dies verallgemeinert fr{\"u}here Resultate von Hayman, Drasin, Langley und Chen \& Hua. Kapitel 4 ist dem Beweis eines unserer im folgenden wichtigsten Hilfsmittel gewidmet: eines tiefliegenden Konvergenzsatzes von H. Cartan {\"u}ber Familien von p-Tupeln holomorpher nullstellenfreier Funktionen, welche einer linearen Relation unterliegen. In Kapitel 5 werden die Konzepte der Dualit{\"a}t und Semidualit{\"a}t eingef{\"u}hrt und die Verbindung zu Normalit{\"a}tsfragen diskutiert. Die neuen Ergebnisse {\"u}ber L{\"u}ckenreihen finden sich im sechsten Kapitel. Der Schwerpunkt liegt hierbei zum einen auf sog. AP-L{\"u}ckenreihen, zum anderen auf allgemeinen Konstruktionsverfahren, mit denen sich neue semiduale L{\"u}ckenstrukturen aus bereits bekannten gewinnen lassen. Zahlreiche unserer Beweise beruhen wesentlich auf dem Satz von Cartan aus Kapitel 4. Im siebten Kapitel erweitern wir unsere Semidualit{\"a}tsuntersuchungen auf Mengen aus zwei Funktionen. Wir ziehen Normalit{\"a}tskriterien (vor allem das in Kapitel 3 bewiesene sowie den Satz von Cartan) heran, um spezielle Mengen als nichtsemidual zu identifizieren. Zuletzt konstruieren wir ein Beispiel einer semidualen Menge aus zwei Funktionen.},
  subject      = {Blochsches Prinzip},
  language  = {de}
}
@phdthesis{Wolfrom2002,
  author    = {Wolfrom, Martin},
  title     = {Isoparametric hypersurfaces with a homogeneous focal manifold},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-3505},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2002},
  abstract  = {The classification of isoparametric hypersurfaces in spheres with a homogeneous focal manifold is a project that has been started by Linus Kramer. It extends results by E. Cartan and Hsiang and Lawson. Kramer does most part of this classification in his Habilitationsschrift. In particular he obtains a classification for the cases where the homogeneous focal manifold is at least 2-connected. Results of E. Cartan, Dorfmeister and Neher, and Takagi also solve parts of the classification problem. This thesis completes the classification. We classify all closed isoparametric hypersurfaces in spheres with g>2 distinct principal curvatures one of whose multiplicities is 2 such that the lower dimensional focal manifold is homogeneous. The methods are essentially the same as in Kramer's 'Habilitationsschrift'. The cohomology of the focal manifolds in question is known. This leads to two topological classification problems, which are also solved in this thesis. We classify simply connected homogeneous spaces of compact Lie groups with the same integral cohomology ring as a product of spheres S^2 x S^m and m odd on the one hand and a truncated polynomial ring Q[a]/(a^m) with one generator of even degree and m > 1 as its rational cohomology ring on the other hand.},
  subject      = {Isoparametrische Hyperfl{\"a}che},
  language  = {en}
}
@phdthesis{Kraus2003,
  author    = {Kraus, Daniela},
  title     = {Conformal pseudo-metrics and some applications},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-9193},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2003},
  abstract  = {The point of departure for the present work has been the following free boundary value problem for analytic functions \$f\$ which are defined on a domain \$G \subset \mathbb{C}\$ and map into the unit disk \$\mathbb{D}= \{z \in \mathbb{C} : |z|<1 \}\$. Problem 1: Let \$z_1, \ldots, z_n\$ be finitely many points in a bounded simply connected domain \$G \subset \mathbb{C}\$. Show that there exists a holomorphic function \$f:G \to \mathbb{D}\$ with critical points \$z_j\$ (counted with multiplicities) and no others such that \$\lim_{z \to \xi} \frac{|f'(z)|}{1-|f(z)|^2}=1\$ for all \$\xi \in \partial G\$. If \$G=\mathbb{D}\$, Problem 1 was solved by K?nau [5] in the case of one critical point, and for more than one critical point by Fournier and Ruscheweyh [3]. The method employed by K?nau, Fournier and Ruscheweyh easily extends to more general domains \$G\$, say bounded by a Dini-smooth Jordan curve, but does not work for arbitrary bounded simply connected domains. In this paper we present a new approach to Problem 1, which shows that this boundary value problem is not an isolated question in complex analysis, but is intimately connected to a number of basic open problems in conformal geometry and non-linear PDE. One of our results is a solution to Problem 1 for arbitrary simply connected domains. However, we shall see that our approach has also some other ramifications, for instance to a well-known problem due to Rellich and Wittich in PDE. Roughly speaking, this paper is broken down into two parts. In a first step we construct a conformal metric in a bounded regular domain \$G\subset \mathbb{C}\$ with prescribed non-positive Gaussian curvature \$k(z)\$ and prescribed singularities by solving the first boundary value problem for the Gaussian curvature equation \$\Delta u =-k(z) e^{2u}\$ in \$G\$ with prescribed singularities and continuous boundary data. This is related to the Berger-Nirenberg problem in Riemannian geometry, the question which functions on a surface R can arise as the Gaussian curvature of a Riemannian metric on R. The special case, where \$k(z)=-4\$ and the domain \$G\$ is bounded by finitely many analytic Jordan curves was treated by Heins [4]. In a second step we show every conformal pseudo-metric on a simply connected domain \$G\subseteq \mathbb{C}\$ with constant negative Gaussian curvature and isolated zeros of integer order is the pullback of the hyperbolic metric on \$\mathbb{D}\$ under an analytic map \$f:G \to \mathbb{D}\$. This extends a theorem of Liouville which deals with the case that the pseudo-metric has no zeros at all. These two steps together allow a complete solution of Problem 1. Contents: Chapter I contains the statement of the main results and connects them with some old and new problems in complex analysis, conformal geometry and PDE: the Uniformization Theorem for Riemann surfaces, the problem of Schwarz-Picard, the Berger-Nirenberg problem, Wittich's problem, etc.. Chapter II and III have preparatory character. In Chapter II we recall some basic results about ordinary differential equations in the complex plane. In our presentation we follow Laine [6], but we have reorganized the material and present a self-contained account of the basic features of Riccati, Schwarzian and second order differential equations. In Chapter III we discuss the first boundary value problem for the Poisson equation. We shall need to consider this problem in the most general situation, which does not seem to be covered in a satisfactory way in the existing literature, see [1,2]. In Chapter IV we turn to a discussion of conformal pseudo-metrics in planar domains. We focus on conformal metrics with prescribed singularities and prescribed non-positive Gaussian curvature. We shall establish the existence of such metrics, that is, we solve the corresponding Gaussian curvature equation by making use of the results of Chapter III. In Chapter V we show that every constantly curved pseudo-metric can be represented as the pullback of either the hyperbolic, the euclidean or the spherical metric under an analytic map. This is proved by using the results of Chapter II. Finally we give in Chapter VI some applications of our results. [1,2] Courant, H., Hilbert, D., Methoden der Mathematischen Physik, Erster/ Zweiter Band, Springer-Verlag, Berlin, 1931/1937. [3] Fournier, R., Ruscheweyh, St., Free boundary value problems for analytic functions in the closed unit disk, Proc. Amer. Math. Soc. (1999), 127 no. 11, 3287-3294. [4] Heins, M., On a class of conformal metrics, Nagoya Math. J. (1962), 21, 1-60. [5] K?nau, R., L?gentreue Randverzerrung bei analytischer Abbildung in hyperbolischer und sph?ischer Geometrie, Mitt. Math. Sem. Giessen (1997), 229, 45-53. [6] Laine, I., Nevanlinna Theory and Complex Differential Equations, de Gruyter, Berlin - New York, 1993.},
  subject      = {Freies Randwertproblem},
  language  = {en}
}
@phdthesis{Nagel2003,
  author    = {Nagel, Christian},
  title     = {Gl{\"a}ttungsverfahren f{\"u}r semidefinite Programme},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-8099},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2003},
  abstract  = {In dieser Arbeit werden Algorithmen zur L{\"o}sung von linearen semidefiniten Programmen beschrieben. Unter einer geeigneten Regularit{\"a}tsvoraussetzung ist ein semidefinites Programm {\"a}quivalent zu seinen Optimalit{\"a}tsbedingungen. Die Optimalit{\"a}tsbedingungen bzw. die Zentralen-Pfad-Bedingungen {\"u}berf{\"u}hren wir zun{\"a}chst durch matrixwertige NCP-Funktionen in ein nichtlineares Gleichungssystem. Dieses nichtlineare und teilweise nicht differenzierbare Gleichungssystem l{\"o}sen wir dann mit einem Newton-{\"a}hnlichen Verfahren. Durch die Umformulierung in ein nichtlineares Gleichungssystem muss w{\"a}hrend der Iteration nicht mehr explizit die positive (Semi-)Definitheit der beteiligten Matrizen beachtet werden. Weiter wird gezeigt, dass dieser Ansatz im Gegensatz zu Inneren-Punkte-Methoden sofort symmetrische Suchrichtungen erzeugt. Um globale Konvergenz zu erhalten, werden verschiedene Globalisierungsstrategien (Schrittweitenbestimmung, Trust-Region-Ansatz) untersucht. F{\"u}r das betrachtete Pr{\"a}diktor-Korrektor-Verfahren und das Trust-Region-Verfahren wird lokal superlineare Konvergenz unter strikter Komplementarit{\"a}t und Nichtdegeneriertheit gezeigt. Die theoretische Untersuchung eines nichtglatten Newton-Verfahrens liefert ein lokal quadratisches Konvergenzverhalten ohne strikte Komplementarit{\"a}t, wenn die Nichtdegeneriertheitsvoraussetzung geeignet modifiziert wird.},
  subject      = {Semidefinite Optimierung},
  language  = {de}
}
@phdthesis{Fleischmann2003,
  author    = {Fleischmann, Peter},
  title     = {Bildung reiner H{\"u}llen in vollst{\"a}ndig zerlegbaren torsionsfreien abelschen Gruppen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-5979},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2003},
  abstract  = {Reine Untergruppen von vollst{\"a}ndig zerlegbaren torsionsfreien abelschen Gruppen werden Butlergruppen genannt. Eine solche Gruppe l{\"a}ßt sich als endliche Summe von rationalen Rang-1-Gruppen darstellen. Eine solche Darstellung ist nicht eindeutig. Daher werden Methoden entwickelt, die zu einer Darstellung mit reinen Summanden f{\"u}hren. Weiter kann aus dieser Darstellung sowohl die kritische Typenmenge als auch die Typuntergruppen direkt abgelesen werden. Dies vereinfacht die Behandlung von Butlergruppen mit dem Computer und gestattet dar{\"u}berhinaus eine elegantere Darstellung.},
  subject      = {Torsionsfreie Abelsche Gruppe},
  language  = {de}
}
@phdthesis{Kramer2004,
  author    = {Kramer, Helmut},
  title     = {Inzidenzmatrizen endlicher projektiver Ebenen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-11215},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2004},
  abstract  = {Ziel dieser Arbeit ist eine computerunterst{\"u}tzte Suche nach, bis auf Isomorphie, allen projektiven Ebenen zu einer gegebenen Ordnung durch Berechnung ihrer Inzidenzmatrix. Dies gelingt durch geeignete Vorstrukturierung der Matrix mit Hilfe der Doppelordnung bis Ordnung 9 auf einem aktuellen PC. In diesem Zusammenhang ist insbesondere durch einen gen{\"u}gend schnellen Algorithmus das Problem zu l{\"o}sen, ob zwei Inzidenzmatrizen zu derselben projektiven Ebene geh{\"o}ren. Die besondere Struktur, die die berechneten Beispiele von doppelgeordneten Inzidenzmatrizen der desarguesschen Ebenen aufzeigen, wird zudem durch theoretische {\"U}berlegungen untermauert. In einem letzten Kapitel wird noch eine Verbindung der projektiven Ebenen zu besonderen Blockpl{\"a}nen geschaffen.},
  subject      = {Projektive Ebene},
  language  = {de}
}
@phdthesis{Kraus2004,
  author    = {Kraus, Christiane},
  title     = {On some maximal convergence theorems for real analytic functions in R^N},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-9795},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2004},
  abstract  = {Ausgangspunkt dieser Arbeit war eine Publikation von D. Braess [Bra01], in der die Approximationsg{\"u}te der Funktionen \$\$ \frac{1}{((x-x_0)^2 + (y-y_0)^2)^s}, \qquad x_0^2 + y_0^2 \ge 1, \quad s \in (0,\infty),\$\$ auf der Einheitskreisscheibe \$x^2+y^2 \le 1\$ durch reelle Polynome untersucht wurde. Braess's Ergebnisse und insbesondere die von ihm angesprochenen offenen Probleme waren von besonderem Interesse, da sie Anlaß zu der Vermutung gaben, dass die klassische Theorie der ``Maximalen Konvergenz'' in Sinne von Walsh auf (zun{\"a}chst) die oben erw{\"a}hnten reell analytischen Funktionen erweitert werden kann. (Die Theorie der Maximalen Konvergenz bringt die Approximationsg{\"u}te einer Funktion auf einer kompakten Menge durch Polynome mit der Analyzit{\"a}t dieser Funktion in Verbindung.) \\ Hauptgegenstand der Arbeit ist die Erweiterung des klassischen ``Maximalen Konvergenz''--Konzeptes auf reell analytische Funktionen in h{\"o}heren Dimensionen. Es werden verschiedene maximale Konvergenzs{\"a}tze sowohl in einer als auch in mehreren Ver{\"a}nderlichen bewiesen. \\ Die Arbeit gliedert sich in drei Hauptteile. \\[2mm] Im ersten Teil wird der theoretische Hintergrund der ``Maximalen Konvergenz'' mit dem Problemkreis von Braess in Zusammenhang gebracht. Es wird gezeigt, dass f{\"u}r betrags-quadratisch holomorphe Funktionen folgender Satz gilt: \\ { \bf {Satz 1}}: Es sei \$g\$ eine holomorphe Funktion auf der abgeschlossenen Einheitskreisscheibe \$\overline{\mathbb{D}}:=\{ z \in \mathbb{C} : |z| \le 1\}\$ und \$F(x,y):= |g(x+iy)|^2\$, \$x,y \in \mathbb{R}\$. Dann gilt: \$\$ \limsup_{n \to \infty} \sqrt[n]{E_n ( \overline{\mathbb{D}},F)} = \frac{1}{\rho}\$\$ genau dann, wenn \$g\$ auf \$ \{ z \in \mathbb{C} : |z| < \rho \}\$ holomorph ist, aber auf keiner echt gr\"o\3eren Kreisscheibe, wobei \$\$ E_n ( \overline{\mathbb{D}},F)= \inf \{ ||F -P_n||_{\overline{\mathbb{D}}}, \, P_n: \mathbb{R}^2 \to \mathbb{R} \mbox{ Polynom vom Grad } \le n \}.\$\$ Dieser Satz beinhaltet nicht nur die Ergebnisse von Braess [Bra01], sondern erweitert ihn, und beantwortet die von Braess aufgeworfenen Fragen vollst{\"a}ndig. Zudem zeigt der Satz die genaue Analogie des klassischen ``Maximalen Konvergenz''--Konzeptes f{\"u}r die Funktionenklasse der betrag--quadratisch holomorphen Funktionen im \$\mathbb{R}^2\$. \\[2mm] In der Literatur gibt es viele Verallgemeinerungen des ``Maximalen Konvergenz''--Begriffes f{\"u}r mehrere komplexe Ver{\"a}nderlichen. Im Hinblick auf die vorliegende Arbeit sind besonders die Artikel [Sic62] und [Sic81] zu erw{\"a}hnen. Diese bereits bekannten Ergebnisse werden im zweiten Teil der Arbeit herangezogen, um den ``Maximalen Konvergenz''--Begriff auf mehrere reelle Ver{\"a}nderlichen zu erweitern. Man beachte, dass der entscheidende Unterschied hier in der polynomialen Approximationsklasse liegt. \\[2mm] Der dritte Teil befaßt sich mit der Verallgemeinerung des Satzes 1 in mehreren Ver{\"a}nderlichen. Eng verbunden mit diesem Problemkreis ist die Charakterisierung einer gewissen Extremalfunktion. Diese Funktion wird zur Bestimmung des Analyzit{\"a}tsbereichs der zu approximierenden Funktion ben{\"o}tigt. Mittels geeigneter Darstellung der Extremalfunktion und Charakterisierung des Analyzit{\"a}tsbereichs gelingt es schließlich, den folgenden Hauptsatz der vorliegenden Arbeit zu beweisen:\\ { \bf { Satz 2}}: Es seien \$g,h\$ holomorphe Funktionen auf der abgeschlossenen Einheitskugel \$\overline{\mathbb{D}}_N:=\{ z \in \mathbb{C}^N : |z| \le 1\}\$ und \$F(x,y):= g(x+iy) \overline{h(x+iy)}\$, \$x,y \in \mathbb{R}^N\$. Dann gilt: \$\$ \limsup_{n \to \infty} \sqrt[n]{E_n ( \overline{\mathbb{D}}_N,F)} = \frac{1}{\rho}\$\$ genau dann, wenn \$g,h\$ auf \${\mathbb{D}}_{N,\rho}:= \{ z \in \mathbb{C}^N : |z| < \rho \}\$ holomorph sind, und mindestens eine der zwei Funktionen \$g,h\$ auf keinem echt gr\"o\3eren Ball als \$\mathbb{D}_{N,\rho}\$ holomorph fortsetzbar ist. Hierbei bezeichnet \$\$ E_n ( \overline{\mathbb{D}}_N,F)= \inf \{ ||F -P_n||_{\overline{\mathbb{D}}_N}, \, P_n: \mathbb{R}^{2N} \to \mathbb{C} \mbox{ Polynom vom Grad } \le n \}.\$\$ \$[\$Bra01\$]\$ Braess, D., {\it Note on the Approximation of Powers of the Distance in Two-Dimensional Domains}, Constructive Approximation (2001), {\bf 17} No. 1, 147-151. \\ \$[\$Sic62\$]\$ Siciak, J., {\it On some extremal functions and their applications in the theory of analytic functions of several complex variables}, Trans. Amer. Math. Soc. (1962), {\bf 105}, 322--357. \\ \$[\$Sic81\$]\$ Siciak, J., {\it Extremal plurisubharmonic functions in \$\mathbb{C}^N\$}, Ann. Pol. Math. (1981), {\bf 39}, 175--211.},
  subject      = {Reelle Funktion},
  language  = {de}
}
@phdthesis{Seider2004,
  author    = {Seider, David},
  title     = {Solving an eigenvalue problem in laser simulation},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-10057},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2004},
  abstract  = {In this thesis a new and powerful approach for modeling laser cavity eigenmodes is presented. This approach is based on an eigenvalue problem for singularly perturbed partial differential operators with complex coefficients; such operators have not been investigated in detail until now. The eigenvalue problem is discretized by finite elements, and convergence of the approximate solution is proved by using an abstract convergence theory also developed in this dissertation. This theory for the convergence of an approximate solution of a (quadratic) eigenvalue problem, which particularly can be applied to a finite element discretization, is interesting on its own, since the ideas can conceivably be used to handle equations with a more complex nonlinearity. The discretized eigenvalue problem essentially is solved by preconditioned GMRES, where the preconditioner is constructed according to the underlying physics of the problem. The power and correctness of the new approach for computing laser cavity eigenmodes is clearly demonstrated by successfully simulating a variety of different cavity configurations. The thesis is organized as follows: Chapter 1 contains a short overview on solving the so-called Helmholtz equation with the help of finite elements. The main part of Chapter 2 is dedicated to the analysis of a one-dimensional model problem containing the main idea of a new model for laser cavity eigenmodes which is derived in detail in Chapter 3. Chapter 4 comprises a convergence theory for the approximate solution of quadratic eigenvalue problems. In Chapter 5, a stabilized finite element discretization of the new model is described and its convergence is proved by applying the theory of Chapter 4. Chapter 6 contains computational aspects of solving the resulting system of equations and, finally, Chapter 7 presents numerical results for various configurations, demonstrating the practical relevance of our new approach.},
  subject      = {Laser},
  language  = {en}
}
@phdthesis{Joachim2004,
  author    = {Joachim, Silvia},
  title     = {Regulatorketten in Butlergruppen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-10438},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2004},
  abstract  = {Die fast vollst{\"a}ndig zerlegbaren Gruppen bilden eine Teilklasse der Butlergruppen. Das Konzept des Regulators, d.h. der Durchschnitt aller regulierenden Untergruppen, ist unverzichtbar f{\"u}r fast vollst{\"a}ndig zerlegbare Gruppen. Dieses Konzept l{\"a}sst sich in nat{\"u}rlicher Weise auf die ganze Klasse der Butlergruppen fortsetzen. Allerdings l{\"a}sst sich die Regulatorbildung im allgemeineren Fall der Butlergruppen a priori iterieren. Damit stellt sich erst einmal die Frage, ob es {\"u}berhaupt Butlergruppen gibt mit Regulatorketten, der L{\"a}nge gr{\"o}ßer als 1. Ein erstes Beispiel der L{\"a}nge 2 wurde 1997 von Lehrmann und Mutzbauer konstruiert. In dieser Dissertation wurden mit konzeptionell neuen Techniken Butlergruppen mit beliebiger vorgegebener endlicher Kettenl{\"a}nge angegeben. Grunds{\"a}tzliche Schwierigkeiten bei diesem Unterfangen resultieren aus dem Fehlen, bzw. der Unm{\"o}glichkeit, einer kanonischen Darstellung von Butlergruppen. Man verwendet die allseits gebrauchte Summendarstellung f{\"u}r Butlergruppen. Genau an dieser Stelle bedarf es v{\"o}llig neuer Methoden, verglichen mit den fast vollst{\"a}ndig zerlegbaren Gruppen mit ihrer kanonischen Regulatordarstellung. Alle Teilaufgaben bei der anstehenden Konstruktion von Butlergruppen, die f{\"u}r fast vollst{\"a}ndig zerlegbare Gruppen Standard sind, werden hierbei problematisch, u.a. die Bildung reiner H{\"u}llen, die Bestimmung regulierender Untergruppen und die Regulatorbildung.},
  subject      = {Butlergruppe},
  language  = {de}
}
@phdthesis{Flegel2005,
  author    = {Flegel, Michael L.},
  title     = {Constraint qualifications and stationarity concepts for mathematical programs with equilibrium constraints},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-12453},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2005},
  abstract  = {An exhaustive discussion of constraint qualifications (CQ) and stationarity concepts for mathematical programs with equilibrium constraints (MPEC) is presented. It is demonstrated that all but the weakest CQ, Guignard CQ, are too strong for a discussion of MPECs. Therefore, MPEC variants of all the standard CQs are introduced and investigated. A strongly stationary point (which is simply a KKT-point) is seen to be a necessary first order optimality condition only under the strongest CQs, MPEC-LICQ, MPEC-SMFCQ and Guignard CQ. Therefore a whole set of KKT-type conditions is investigated. A simple approach is given to acquire A-stationarity to be a necessary first order condition under MPEC-Guiganrd CQ. Finally, a whole chapter is devoted to investigating M-stationary, among the strongest stationarity concepts, second only to strong stationarity. It is shown to be a necessary first order condition under MPEC-Guignard CQ, the weakest known CQ for MPECs.},
  subject      = {Nichtlineare Optimierung},
  language  = {en}
}
@book{FalkMarohnMicheletal.2005,
  author    = {Falk, Michael and Marohn, Frank and Michel, Ren{\´e} and Hofmann, Daniel and Macke, Maria and Tewes, Bernward and Dinges, Peter},
  title     = {A First Course on Time Series Analysis : Examples with SAS},
  organization    = {Universit{\"a}t W{\"u}rzburg / Lehrstuhl f{\"u}r Statistik , Universit{\"a}t Eichst{\"a}tt/Rechenzentrum},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-12593},
  publisher      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2005},
  abstract  = {The analysis of real data by means of statistical methods with the aid of a software package common in industry and administration usually is not an integral part of mathematics studies, but it will certainly be part of a future professional work. The present book links up elements from time series analysis with a selection of statistical procedures used in general practice including the statistical software package SAS Statistical Analysis System). Consequently this book addresses students of statistics as well as students of other branches such as economics, demography and engineering, where lectures on statistics belong to their academic training. But it is also intended for the practician who, beyond the use of statistical tools, is interested in their mathematical background. Numerous problems illustrate the applicability of the presented statistical procedures, where SAS gives the solutions. The programs used are explicitly listed and explained. No previous experience is expected neither in SAS nor in a special computer system so that a short training period is guaranteed. This book is meant for a two semester course (lecture, seminar or practical training) where the first two chapters can be dealt with in the first semester. They provide the principal components of the analysis of a time series in the time domain. Chapters 3, 4 and 5 deal with its analysis in the frequency domain and can be worked through in the second term. In order to understand the mathematical background some terms are useful such as convergence in distribution, stochastic convergence, maximum likelihood estimator as well as a basic knowledge of the test theory, so that work on the book can start after an introductory lecture on stochastics. Each chapter includes exercises. An exhaustive treatment is recommended. This book is consecutively subdivided in a statistical part and an SAS-specific part. For better clearness the SAS-specific part, including the diagrams generated with SAS, always starts with a computer symbol, representing the beginning of a session at the computer, and ends with a printer symbol for the end of this session. This book is an open source project under the GNU Free Documentation License.},
  subject      = {Zeitreihenanalyse},
  language  = {en}
}
@phdthesis{Vodopivec2005,
  author    = {Vodopivec, Andrija},
  title     = {Quasibasen abelscher, nichtseparabler p-Gruppen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-15359},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2005},
  abstract  = {In dieser Arbeit wird der Bau der (abz{\"a}hlbaren) abelschen p-Gruppen untersucht, durch die Betrachtung der dazugeh{\"o}rigen Quasibasen, die als bestimmte erzeugende Systeme der gegebenen p-Gruppe definiert sind. Die Untersuchung wird insbesondere auf die nichtseparablen p-Gruppen und ihre induktiven Quasibasen bezogen.},
  subject      = {Abelsche p-Gruppe},
  language  = {de}
}
@phdthesis{Kleinsteuber2005,
  author    = {Kleinsteuber, Martin},
  title     = {Jacobi-type methods on semisimple Lie algebras : a Lie algebraic approach to numerical linear algebra},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-16454},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2005},
  abstract  = {Es wird eine Lie-algebraische Verallgemeinerung sowohl des klassischen als auch des Sortier-Jacobi-Verfahrens f{\"u}r das symmetrische Eigenwertproblem behandelt. Der koordinatenfreie Zugang erm{\"o}glicht durch eine neue Betrachtungsweise die Vereinheitlichung strukturierter Eigen- und Singul{\"a}rwertprobleme, darunter bis dato noch nicht betrachtete F{\"a}lle. F{\"u}r beide Verfahren wird lokal quadratische Konvergenz, sowohl f{\"u}r den regul{\"a}ren als auch f{\"u}r den irregul{\"a}ren Fall, gezeigt. Die Analyse und Verallgemeinerung der sog. speziellen Sweeps f{\"u}r das symmetrische Eigenwertproblem f{\"u}hrt zu neuen Sweep-Methoden f{\"u}r strukturierte Eigen- und Singul{\"a}rwertprobleme, die ein besseres Konvergenzverhalten als die bisher bekannten aufweisen.},
  subject      = {Eigenwert},
  language  = {en}
}
@phdthesis{Klug2006,
  author    = {Klug, Andreas},
  title     = {Affine-Scaling Methods for Nonlinear Minimization Problems and Nonlinear Systems of Equations with Bound Constraints},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-18851},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2006},
  abstract  = {In this thesis affine-scaling-methods for two different types of mathematical problems are considered. The first type of problems are nonlinear optimization problems subject to bound constraints. A class of new affine-scaling Newton-type methods is introduced. The methods are shown to be locally quadratically convergent without assuming strict complementarity of the solution. The new methods differ from previous ones mainly in the choice of the scaling matrix. The second type of problems are semismooth system of equations with bound constraints. A new affine-scaling trust-region method for these problems is developed. The method is shown to have strong global and local convergence properties under suitable assumptions. Numerical results are presented for a number of problems arising from different areas.},
  subject      = {Skalierungsfunktion},
  language  = {en}
}
@phdthesis{Michel2006,
  author    = {Michel, Ren{\´e}},
  title     = {Simulation and Estimation in Multivariate Generalized Pareto Models},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-18489},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2006},
  abstract  = {The investigation of multivariate generalized Pareto distributions (GPDs) in the framework of extreme value theory has begun only lately. Recent results show that they can, as in the univariate case, be used in Peaks over Threshold approaches. In this manuscript we investigate the definition of GPDs from Section 5.1 of Falk et al. (2004), which does not differ in the area of interest from those of other authors. We first show some theoretical properties and introduce important examples of GPDs. For the further investigation of these distributions simulation methods are an important part. We describe several methods of simulating GPDs, beginning with an efficient method for the logistic GPD. This algorithm is based on the Shi transformation, which was introduced by Shi (1995) and was used in Stephenson (2003) for the simulation of multivariate extreme value distributions of logistic type. We also present nonparametric and parametric estimation methods in GPD models. We estimate the angular density nonparametrically in arbitrary dimension, where the bivariate case turns out to be a special case. The asymptotic normality of the corresponding estimators is shown. Also in the parametric estimations, which are mainly based on maximum likelihood methods, the asymptotic normality of the estimators is shown under certain regularity conditions. Finally the methods are applied to a real hydrological data set containing water discharges of the rivers Altm{\"u}hl and Danube in southern Bavaria.},
  subject      = {Pareto-Verteilung},
  language  = {en}
}
@phdthesis{Petra2006,
  author    = {Petra, Stefania},
  title     = {Semismooth least squares methods for complementarity problems},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-18660},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2006},
  abstract  = {This thesis is concerned with numerical methods for solving nonlinear and mixed complementarity problems. Such problems arise from a variety of applications such as equilibria models of economics, contact and structural mechanics problems, obstacle problems, discrete-time optimal control problems etc. In this thesis we present a new formulation of nonlinear and mixed complementarity problems based on the Fischer-Burmeister function approach. Unlike traditional reformulations, our approach leads to an over-determined system of nonlinear equations. This has the advantage that certain drawbacks of the Fischer-Burmeister approach are avoided. Among other favorable properties of the new formulation, the natural merit function turns out to be differentiable. To solve the arising over-determined system we use a nonsmooth damped Levenberg-Marquardt-type method and investigate its convergence properties. Under mild assumptions, it can be shown that the global and local fast convergence results are similar to some of the better equation-based method. Moreover, the new method turns out to be significantly more robust than the corresponding equation-based method. For the case of large complementarity problems, however, the performance of this method suffers from the need for solving the arising linear least squares problem exactly at each iteration. Therefore, we suggest a modified version which allows inexact solutions of the least squares problems by using an appropriate iterative solver. Under certain assumptions, the favorable convergence properties of the original method are preserved. As an alternative method for mixed complementarity problems, we consider a box constrained least squares formulation along with a projected Levenberg-Marquardt-type method. To globalize this method, trust region strategies are proposed. Several ingredients are used to improve this approach: affine scaling matrices and multi-dimensional filter techniques. Global convergence results as well as local superlinear/quadratic convergence are shown under appropriate assumptions. Combining the advantages of the new methods, a new software for solving mixed complementarity problems is presented.},
  subject      = {Komplementarit{\"a}tsproblem},
  language  = {en}
}
@book{FalkMarohnMicheletal.2006,
  author    = {Falk, Michael and Marohn, Frank and Michel, Ren{\´e} and Hofmann, Daniel and Macke, Maria and Tewes, Bernward and Dinges, Peter},
  title     = {A First Course on Time Series Analysis : Examples with SAS},
  organization    = {Universit{\"a}t W{\"u}rzburg / Lehrstuhl f{\"u}r Statistik},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-16919},
  publisher      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2006},
  abstract  = {The analysis of real data by means of statistical methods with the aid of a software package common in industry and administration usually is not an integral part of mathematics studies, but it will certainly be part of a future professional work. The present book links up elements from time series analysis with a selection of statistical procedures used in general practice including the statistical software package SAS Statistical Analysis System). Consequently this book addresses students of statistics as well as students of other branches such as economics, demography and engineering, where lectures on statistics belong to their academic training. But it is also intended for the practician who, beyond the use of statistical tools, is interested in their mathematical background. Numerous problems illustrate the applicability of the presented statistical procedures, where SAS gives the solutions. The programs used are explicitly listed and explained. No previous experience is expected neither in SAS nor in a special computer system so that a short training period is guaranteed. This book is meant for a two semester course (lecture, seminar or practical training) where the first two chapters can be dealt with in the first semester. They provide the principal components of the analysis of a time series in the time domain. Chapters 3, 4 and 5 deal with its analysis in the frequency domain and can be worked through in the second term. In order to understand the mathematical background some terms are useful such as convergence in distribution, stochastic convergence, maximum likelihood estimator as well as a basic knowledge of the test theory, so that work on the book can start after an introductory lecture on stochastics. Each chapter includes exercises. An exhaustive treatment is recommended. This book is consecutively subdivided in a statistical part and an SAS-specific part. For better clearness the SAS-specific part, including the diagrams generated with SAS, always starts with a computer symbol, representing the beginning of a session at the computer, and ends with a printer symbol for the end of this session. This book is an open source project under the GNU Free Documentation License.},
  subject      = {Zeitreihenanalyse},
  language  = {en}
}
@phdthesis{Solak2007,
  author    = {Solak, Ebru},
  title     = {Almost Completely Decomposable Groups of Type (1,2)},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-24794},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2007},
  abstract  = {A torsion free abelian group of finite rank is called almost completely decomposable if it has a completely decomposable subgroup of finite index. A p-local, p-reduced almost completely decomposable group of type (1,2) is briefly called a (1,2)-group. Almost completely decomposable groups can be represented by matrices over the ring Z/hZ, where h is the exponent of the regulator quotient. This particular choice of representation allows for a better investigation of the decomposability of the group. Arnold and Dugas showed in several of their works that (1,2)-groups with regulator quotient of exponent at least p^7 allow infinitely many isomorphism types of indecomposable groups. It is not known if the exponent 7 is minimal. In this dissertation, this problem is addressed.},
  language  = {en}
}
@phdthesis{Lageman2007,
  author    = {Lageman, Christian},
  title     = {Convergence of gradient-like dynamical systems and optimization algorithms},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-23948},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2007},
  abstract  = {This work studies the convergence of trajectories of gradient-like systems. In the first part of this work continuous-time gradient-like systems are examined. Results on the convergence of integral curves of gradient systems to single points of Lojasiewicz and Kurdyka are extended to a class of gradient-like vector fields and gradient-like differential inclusions. In the second part of this work discrete-time gradient-like optimization methods on manifolds are studied. Methods for smooth and for nonsmooth optimization problems are considered. For these methods some convergence results are proven. Additionally the optimization methods for nonsmooth cost functions are applied to sphere packing problems on adjoint orbits.},
  subject      = {Dynamisches System},
  language  = {en}
}
@phdthesis{Winkler2008,
  author    = {Winkler, Ralf},
  title     = {Schwache Randwertprobleme von Systemen elliptischen Charakters auf konischen Gebieten},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-34544},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2008},
  abstract  = {In der vorliegenden Arbeit werden lineare Systeme elliptischer partieller Differentialgleichungen in schwacher Formulierung auf konischen Gebieten untersucht. Auf einem zun{\"a}chst unbeschr{\"a}nkten Kegelgebiet betrachten wir den Fall beschr{\"a}nkter und nur von den Winkelvariablen abh{\"a}ngiger Koeffizientenfunktionen. Die durch selbige definierte Bilinearform gen{\"u}ge einer G{\aa}rdingschen Ungleichung. In gewichteten Sobolevr{\"a}umen werden Existenz- und Eindeutigkeitsfragen gekl{\"a}rt, wobei das Problem mittels Fouriertransformation auf eine von einem komplexen Parameter abh{\"a}ngige Familie T(·) von Fredholmoperatoren zur{\"u}ckgef{\"u}hrt wird. Unter Anwendung des Residuenkalk{\"u}ls gewinnen wir eine Darstellung der L{\"o}sung in Form einer Zerlegung in einen glatten Anteil einerseits sowie eine endliche Summe von Singul{\"a}rfunktionen andererseits. Durch Abschneidetechniken werden die gewonnenen Erkenntnisse auf den Fall schwach formulierter elliptischer Systeme auf beschr{\"a}nkten Kegelgebieten unter Formulierung in gew{\"o}hnlichen, nicht-gewichteten Sobolevr{\"a}umen angewendet. Die f{\"u}r Regularit{\"a}tsfragen maßgeblichen Eigenwerte der Operatorfunktion T mit minimalem positiven Imagin{\"a}rteil werden im letzten Kapitel der Arbeit am Beispiel der ebenen elastischen Gleichungen numerisch bestimmt.},
  subject      = {Elliptische Differentialgleichung},
  language  = {de}
}
@phdthesis{Baumann2008,
  author    = {Baumann, Markus},
  title     = {Newton's Method for Path-Following Problems on Manifolds},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-28099},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2008},
  abstract  = {Many optimization problems for a smooth cost function f on a manifold M can be solved by determining the zeros of a vector field F; such as e.g. the gradient F of the cost function f. If F does not depend on additional parameters, numerous zero-finding techniques are available for this purpose. It is a natural generalization however, to consider time-dependent optimization problems that require the computation of time-varying zeros of time-dependent vector fields F(x,t). Such parametric optimization problems arise in many fields of applied mathematics, in particular path-following problems in robotics, recursive eigenvalue and singular value estimation in signal processing, as well as numerical linear algebra and inverse eigenvalue problems in control theory. In the literature, there are already some tracking algorithms for these tasks, but these do not always adequately respect the manifold structure. Hence, available tracking results can often be improved by implementing methods working directly on the manifold. Thus, intrinsic methods are of interests that evolve during the entire computation on the manifold. It is the task of this thesis, to develop such intrinsic zero finding methods. The main results of this thesis are as follows: - A new class of continuous and discrete tracking algorithms is proposed for computing zeros of time-varying vector fields on Riemannian manifolds. This was achieved by studying the newly introduced time-varying Newton Flow and the time-varying Newton Algorithm on Riemannian manifolds. - Convergence analysis is performed on arbitrary Riemannian manifolds. - Concretization of these results on submanifolds, including for a new class of algorithms via local parameterizations. - More specific results in Euclidean space are obtained by considering inexact and underdetermined time-varying Newton Flows. - Illustration of these newly introduced algorithms by examining time-varying tracking tasks in three application areas: Subspace analysis, matrix decompositions (in particular EVD and SVD) and computer vision.},
  subject      = {Dynamische Optimierung},
  language  = {en}
}
@phdthesis{Pechmann2008,
  author    = {Pechmann, Patrick R.},
  title     = {Penalized Least Squares Methoden mit st{\"u}ckweise polynomialen Funktionen zur L{\"o}sung von partiellen Differentialgleichungen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-28136},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2008},
  abstract  = {Das Hauptgebiet der Arbeit stellt die Approximation der L{\"o}sungen partieller Differentialgleichungen mit Dirichlet-Randbedingungen durch Splinefunktionen dar. Partielle Differentialgleichungen finden ihre Anwendung beispielsweise in Bereichen der Elektrostatik, der Elastizit{\"a}tstheorie, der Str{\"o}mungslehre sowie bei der Untersuchung der Ausbreitung von W{\"a}rme und Schall. Manche Approximationsaufgaben besitzen keine eindeutige L{\"o}sung. Durch Anwendung der Penalized Least Squares Methode wurde gezeigt, dass die Eindeutigkeit der gesuchten L{\"o}sung von gewissen Minimierungsaufgaben sichergestellt werden kann. Unter Umst{\"a}nden l{\"a}sst sich sogar eine h{\"o}here Stabilit{\"a}t des numerischen Verfahrens gewinnen. F{\"u}r die numerischen Betrachtungen wurde ein umfangreiches, effizientes C-Programm erstellt, welches die Grundlage zur Best{\"a}tigung der theoretischen Voraussagen mit den praktischen Anwendungen bildete.},
  subject      = {Approximationstheorie},
  language  = {de}
}
@phdthesis{Gregor2008,
  author    = {Gregor, Thomas},
  title     = {{0,1}-Matrices with Rectangular Rule},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-28389},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2008},
  abstract  = {The incidence matrices of many combinatorial structures satisfy the so called rectangular rule, i.e., the scalar product of any two lines of the matrix is at most 1. We study a class of matrices with rectangular rule, the regular block matrices. Some regular block matrices are submatrices of incidence matrices of finite projective planes. Necessary and sufficient conditions are given for regular block matrices, to be submatrices of projective planes. Moreover, regular block matrices are related to another combinatorial structure, the symmetric configurations. In particular, it turns out, that we may conclude the existence of several symmetric configurations from the existence of a projective plane, using this relationship.},
  subject      = {Projektive Ebene},
  language  = {en}
}
@phdthesis{Jordan2008,
  author    = {Jordan, Jens},
  title     = {Reachable sets of numerical iteration schemes : a system semigroup approach},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-28416},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2008},
  abstract  = {We investigate iterative numerical algorithms with shifts as nonlinear discrete-time control systems. Our approach is based on the interpretation of reachable sets as orbits of the system semigroup. In the first part we develop tools for the systematic analysis of the structure of reachable sets of general invertible discrete-time control systems. Therefore we merge classical concepts, such as geometric control theory, semigroup actions and semialgebraic geometry. Moreover, we introduce new concepts such as right divisible systems and the repelling phenomenon. In the second part we apply the semigroup approach to the investigation of concrete numerical iteration schemes. We extend the known results about the reachable sets of classical inverse iteration. Moreover, we investigate the structure of reachable sets and systemgroup orbits of inverse iteration on flag manifolds and Hessenberg varieties, rational iteration schemes, Richardson's method and linear control schemes. In particular we obtain necessary and sufficient conditions for controllability and the appearance of repelling phenomena. Furthermore, a new algorithm for solving linear equations (LQRES) is derived.},
  subject      = {Nichtlineare Kontrolltheorie},
  language  = {en}
}
@techreport{Englert2009,
  author    = {Englert, Stefan},
  title     = {Mathematica in 15 Minuten (Mathematica Version 6.0)},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-70275},
  year      = {2009},
  abstract  = {Mathematica ist ein hervorragendes Programm um mathematische Berechnungen - auch sehr komplexe - auf relativ einfache Art und Weise durchf{\"u}hren zu lassen. Dieses Skript soll eine wirklich kurze Einf{\"u}hrung in Mathematica geben und als Nachschlagewerk einiger g{\"a}ngiger Anwendungen von Mathematica dienen. Dabei wird folgende Grobgliederung verwendet: - Grundlagen: Graphische Oberfl{\"a}che, einfache Berechnungen, Formeleingabe - Bedienung: Vorstellung einiger Kommandos und Einblick in die Funktionsweise - Praxis: Beispielhafte Berechnung einiger Abitur- und {\"U}bungsaufgaben},
  subject      = {Anwendungssoftware},
  language  = {de}
}
@misc{Englert2009,
  type      = {Master Thesis},
  author    = {Englert, Stefan},
  title     = {Sch{\"a}tzer des Artenreichtums bei speziellen Erscheinungsh{\"a}ufigkeiten},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-71362},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {Bei vielen Fragestellungen, in denen sich eine Grundgesamtheit in verschiedene Klassen unterteilt, ist weniger die relative Klassengr{\"o}ße als vielmehr die Anzahl der Klassen von Bedeutung. So interessiert sich beispielsweise der Biologe daf{\"u}r, wie viele Spezien einer Gattung es gibt, der Numismatiker daf{\"u}r, wie viele M{\"u}nzen oder M{\"u}nzpr{\"a}gest{\"a}tten es in einer Epoche gab, der Informatiker daf{\"u}r, wie viele unterschiedlichen Eintr{\"a}ge es in einer sehr großen Datenbank gibt, der Programmierer daf{\"u}r, wie viele Fehler eine Software enth{\"a}lt oder der Germanist daf{\"u}r, wie groß der Wortschatz eines Autors war oder ist. Dieser Artenreichtum ist die einfachste und intuitivste Art und Weise eine Population oder Grundgesamtheit zu charakterisieren. Jedoch kann nur in Kollektiven, in denen die Gesamtanzahl der Bestandteile bekannt und relativ klein ist, die Anzahl der verschiedenen Spezien durch Erfassung aller bestimmt werden. In allen anderen F{\"a}llen ist es notwendig die Spezienanzahl durch Sch{\"a}tzungen zu bestimmen.},
  subject      = {Statistik},
  language  = {de}
}
@phdthesis{Hofmann2009,
  author    = {Hofmann, Daniel},
  title     = {Characterization of the D-Norm Corresponding to a Multivariate Extreme Value Distribution},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-41347},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {It is well-known that a multivariate extreme value distribution can be represented via the D-Norm. However not every norm yields a D-Norm. In this thesis a necessary and sufficient condition is given for a norm to define an extreme value distribution. Applications of this theorem includes a new proof for the bivariate case, the Pickands dependence function and the nested logistic model. Furthermore the GPD-Flow is introduced and first insights were given such that if it converges it converges against the copula of complete dependence.},
  subject      = {Kopula <Mathematik>},
  language  = {en}
}
@phdthesis{Hoheisel2009,
  author    = {Hoheisel, Tim},
  title     = {Mathematical Programs with Vanishing Constraints},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-40790},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {A new class of optimization problems name 'mathematical programs with vanishing constraints (MPVCs)' is considered. MPVCs are on the one hand very challenging from a theoretical viewpoint, since standard constraint qualifications such as LICQ, MFCQ, or ACQ are most often violated, and hence, the Karush-Kuhn-Tucker conditions do not provide necessary optimality conditions off-hand. Thus, new CQs and the corresponding optimality conditions are investigated. On the other hand, MPVCs have important applications, e.g., in the field of topology optimization. Therefore, numerical algorithms for the solution of MPVCs are designed, investigated and tested for certain problems from truss-topology-optimization.},
  subject      = {Nichtlineare Optimierung},
  language  = {en}
}
@phdthesis{vonHeusinger2009,
  author    = {von Heusinger, Anna},
  title     = {Numerical Methods for the Solution of the Generalized Nash Equilibrium Problem},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-47662},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {In the generalized Nash equilibrium problem not only the cost function of a player depends on the rival players' decisions, but also his constraints. This thesis presents different iterative methods for the numerical computation of a generalized Nash equilibrium, some of them globally, others locally superlinearly convergent. These methods are based on either reformulations of the generalized Nash equilibrium problem as an optimization problem, or on a fixed point formulation. The key tool for these reformulations is the Nikaido-Isoda function. Numerical results for various problem from the literature are given.},
  subject      = {Spieltheorie},
  language  = {en}
}
@phdthesis{Teichert2009,
  author    = {Teichert, Christian},
  title     = {Globale Minimierung von Linearen Programmen mit Gleichgewichtsrestriktionen und globale Konvergenz eines Filter-SQPEC-Verfahrens f{\"u}r Mathematische Programme mit Gleichgewichtsrestriktionen},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-38700},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {Mathematische Programme mit Gleichgewichtsrestriktionen (oder Komplementarit{\"a}tsbedingungen), kurz MPECs, sind als {\"a}ußerst schwere Optimierungsprobleme bekannt. Lokale Minima oder geeignete station{\"a}re Punkte zu finden, ist ein nichttriviales Problem. Diese Arbeit beschreibt, wie man dennoch die spezielle Struktur von MPECs ausnutzen kann und mittels eines Branch-and-Bound-Verfahrens ein globales Minimum von Linearen Programmen mit Gleichgewichtsrestriktionen, kurz LPECs, bekommt. Des Weiteren wird dieser Branch-and-Bound-Algorithmus innerhalb eines Filter-SQPEC-Verfahrens genutzt, um allgemeine MPECs zu l{\"o}sen. F{\"u}r das Filter-SQPEC Verfahren wird ein globaler Konvergenzsatz bewiesen. Außerdem werden f{\"u}r beide Verfahren numerische Resultate angegeben.},
  subject      = {Nichtlineare Optimierung},
  language  = {de}
}