@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}
}
@phdthesis{Even2009,
  author    = {Even, Nadine},
  title     = {On Hydrodynamic Limits and Conservation Laws},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-38374},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {No abstract available},
  language  = {en}
}
@phdthesis{Wissel2009,
  author    = {Wissel, Julia},
  title     = {A new biased estimator for multivariate regression models with highly collinear variables},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-36383},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {Es ist wohlbekannt, dass der Kleinste-Quadrate-Sch{\"a}tzer im Falle vorhandener Multikollinearit{\"a}t eine große Varianz besitzt. Eine M{\"o}glichkeit dieses Problem zu umgehen, besteht in der Verwendung von verzerrten Sch{\"a}tzern, z.B den Ridge-Sch{\"a}tzer. In dieser Arbeit wird ein neues Sch{\"a}tzverfahren vorgestellt, dass auf Addition einer kleinen Konstanten omega auf die Regressoren beruht. Der dadurch erzeugte Sch{\"a}tzer wird in Abh{\"a}ngigkeit von omega beschrieben und es wird gezeigt, dass dessen Mean Squared Error kleiner ist als der des Kleinste-Quadrate-Sch{\"a}tzers im Falle von stark korrelierten Regressoren.},
  subject      = {Starke Kopplung},
  language  = {en}
}
@phdthesis{Moeller2009,
  author    = {M{\"o}ller, Florian},
  title     = {Exceptional polynomials and monodromy groups in positive characteristic},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-34871},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {We discuss exceptional polynomials, i.e. polynomials over a finite field \$k\$ that induce bijections over infinitely many finite extensions of \$k\$. In the first chapters we give the theoretical background to characterize this class of polynomials with Galois theoretic means. This leads to the notion of arithmetic resp. geometric monodromy groups. In the remaining chapters we restrict our attention to polynomials with primitive affine arithmetic monodromy group. We first classify all exceptional polynomials with the fixed field of the affine kernel of the arithmetic monodromy group being of genus less or equal to 2. Next we show that every full affine group can be realized as the monodromy group of a polynomial. In the remaining chapters we classify affine polynomials of a given degree.},
  subject      = {Algebraischer Funktionenk{\"o}rper},
  language  = {en}
}
@phdthesis{Kurniawan2009,
  author    = {Kurniawan, Indra},
  title     = {Controllability Aspects of the Lindblad-Kossakowski Master Equation : A Lie-Theoretical Approach},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-48815},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2009},
  abstract  = {One main task, which is considerably important in many applications in quantum control, is to explore the possibilities of steering a quantum system from an initial state to a target state. This thesis focuses on fundamental control-theoretical issues of quantum dynamics described by the Lindblad-Kossakowski master equation which arises as a bilinear control system on some underlying real vector spaces, e.g controllability aspects and the structure of reachable sets. Based on Lie-algebraic methods from nonlinear control theory, the thesis presents a unified approach to control problems of finite dimensional closed and open quantum systems. In particular, a simplified treatment for controllability of closed quantum systems as well as new accessibility results for open quantum systems are obtained. The main tools to derive the results are the well-known classifications of all matrix Lie groups which act transitively on Grassmann manifolds, and respectively, on real vector spaces without the origin. It is also shown in this thesis that accessibiity of the Lindblad-Kossakowski master equation is a generic property. Moreover, based on the theoretical accessibility results, an algorithm is developed to decide when the Lindblad-Kossakowski master equation is accessible.},
  subject      = {Kontrolltheorie},
  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}
}
@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{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{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}
}