Bibliothek

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Opus-Repositorium ZIB  (127)
  • 2020-2024
  • 2005-2009  (20)
  • 1995-1999  (107)
  • 1940-1944
  • 1910-1914
  • 1840-1849
  • 2007  (20)
  • 1996  (55)
  • 1995  (52)
  • ddc:000  (127)
  • Englisch  (127)
Datenquelle
  • Opus-Repositorium ZIB  (127)
Erscheinungszeitraum
  • 2020-2024
  • 2005-2009  (20)
  • 1995-1999  (107)
  • 1940-1944
  • 1910-1914
  • +
Jahr
Schlagwörter
Sprache
  • 1
    Publikationsdatum: 2020-08-05
    Beschreibung: This article is about the optimal track allocation problem (OPTRA) to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programming formulations: a standard formulation that models block conflicts in terms of packing constraints, and a new extended formulation that is based on additional configuration' variables. We show that the packing constraints in the standard formulation stem from an interval graph, and that they can be separated in polynomial time. It follows that the LP relaxation of a strong version of this model, including all clique inequalities from block conflicts, can be solved in polynomial time. We prove that the extended formulation produces the same LP bound, and that it can also be computed with this model in polynomial time. Albeit the two formulations are in this sense equivalent, the extended formulation has advantages from a computational point of view, because it features a constant number of rows and is therefore amenable to standard column generation techniques. Results of an empirical model comparison on mesoscopic data for the Hannover-Fulda-Kassel region of the German long distance railway network are reported.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Publikationsdatum: 2016-06-09
    Beschreibung: We study barrier methods for state constrained optimal control problems with PDEs. In the focus of our analysis is the path of minimizers of the barrier subproblems with the aim to provide a solid theoretical basis for function space oriented path-following algorithms. We establish results on existence, continuity and convergence of this path. Moreover, we consider the structure of barrier subdifferentials, which play the role of dual variables.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2016-06-09
    Beschreibung: For the treatment of equilibrated molecular systems in a heat bath we propose a transition state theory that is based on conformation dynamics. In general, a set-based discretization of a Markov operator ${\cal P}^\tau$ does not preserve the Markov property. In this article, we propose a discretization method which is based on a Galerkin approach. This discretization method preserves the Markov property of the operator and can be interpreted as a decomposition of the state space into (fuzzy) sets. The conformation-based transition state theory presented here can be seen as a first step in conformation dynamics towards the computation of essential dynamical properties of molecular systems without time-consuming molecular dynamics simulations.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Publikationsdatum: 2021-01-22
    Beschreibung: We present a middleware to store multidimensional data sets on Internet-scale distributed systems and to efficiently perform range queries on them. Our structured overlay network \emph{SONAR (Structured Overlay Network with Arbitrary Range queries)} puts keys which are adjacent in the key space on logically adjacent nodes in the overlay and is thereby able to process multidimensional range queries with a single logarithmic data lookup and local forwarding. The specified ranges may have arbitrary shapes like rectangles, circles, spheres or polygons. Empirical results demonstrate the routing performance of SONAR on several data sets, ranging from real-world data to artificially constructed worst case distributions. We study the quality of SONAR's routing information which is based on local knowledge only and measure the indegree of the overlay nodes to find potential hot spots in the routing process. We show that SONAR's routing table is self-adjusting, even under extreme situations, keeping always a maximum of $\lceil \log N \rceil$ routing entries.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Publikationsdatum: 2016-06-09
    Beschreibung: \begin{abstract} In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematically speaking, such models require the numerical solution of the underlying evolution equat ion, also known as the chemical master equation (CME). Up to now, the CME has almost exclusively been treated by Monte-Carlo techniques, the most prominent of which is the simulation algorithm suggest ed by Gillespie in 1976. Since this algorithm requires an update for each single reaction event, realizations can be computationally very costly. As an alternative, we here propose a novel approach, which focuses on the discrete partial differential equation (PDE) structure of the CME and thus allows to adopt ideas from adaptive discrete Galerkin methods (as designed by two of the present authors in 1989), which have proven to be highly efficient in the mathematical modelling of polyreaction kinetics. Among the two different options of discretizing the CME as a discrete PDE, the method of lines approach (first space, then time) and the Rothe method (first time, then space), we select the latter one for clear theoretical and algorithmic reasons. First numeric al experiments at a challenging model problem illustrate the promising features of the proposed method and, at the same time, indicate lines of necessary further research. \end{abstract}
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Publikationsdatum: 2014-02-26
    Beschreibung: Chvatal-Gomory cuts are among the most well-known classes of cutting planes for general integer linear programs (ILPs). In case the constraint multipliers are either 0 or $\frac{1}{2}$, such cuts are known as $\{0,\frac{1}{2}\}$-cuts. It has been proven by Caprara and Fischetti (1996) that separation of $\{0,\frac{1}{2}\}$-cuts is NP-hard. In this paper, we study ways to separate $\{0,\frac{1}{2}\}$-cuts effectively in practice. We propose a range of preprocessing rules to reduce the size of the separation problem. The core of the preprocessing builds a Gaussian elimination-like procedure. To separate the most violated $\{0,\frac{1}{2}\}$-cut, we formulate the (reduced) problem as integer linear program. Some simple heuristic separation routines complete the algorithmic framework. Computational experiments on benchmark instances show that the combination of preprocessing with exact and/or heuristic separation is a very vital idea to generate strong generic cutting planes for integer linear programs and to reduce the overall computation times of state-of-the-art ILP-solvers.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper a Godunov-type projection method for computing approximate solutions of the zero Froude number (incompressible) shallow water equations is presented. It is second-order accurate and locally conserves height (mass) and momentum. To enforce the underlying divergence constraint on the velocity field, the predicted numerical fluxes, computed with a standard second order method for hyperbolic conservation laws, are corrected in two steps. First, a MAC-type projection adjusts the advective velocity divergence. In a second projection step, additional momentum flux corrections are computed to obtain new time level cell-centered velocities, which satisfy another discrete version of the divergence constraint. The scheme features an exact and stable second projection. It is obtained by a Petrov-Galerkin finite element ansatz with piecewise bilinear trial functions for the unknown incompressible height and piecewise constant test functions. The stability of the projection is proved using the theory of generalized mixed finite elements, which goes back to Nicola{\"i}des (1982). In order to do so, the validity of three different inf-sup conditions has to be shown. Since the zero Froude number shallow water equations have the same mathematical structure as the incompressible Euler equations of isentropic gas dynamics, the method can be easily transfered to the computation of incompressible variable density flow problems.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Publikationsdatum: 2020-12-15
    Beschreibung: We provide information on the Survivable Network Design Library (SNDlib), a data library for fixed telecommunication network design that can be accessed at http://sndlib.zib.de. In version 1.0, the library contains data related to 22 networks which, combined with a set of selected planning parameters, leads to 830 network planning problem instances. In this paper, we provide a mathematical model for each planning problem considered in the library and describe the data concepts of the SNDlib. Furthermore, we provide statistical information and details about the origin of the data sets.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Publikationsdatum: 2020-08-05
    Beschreibung: The \emph{optimal track allocation problem} (\textsc{OPTRA}), also known as the train routing problem or the train timetabling problem, is to find, in a given railway network, a conflict-free set of train routes of maximum value. We propose a novel integer programming formulation for this problem that is based on additional configuration' variables. Its LP-relaxation can be solved in polynomial time. These results are the theoretical basis for a column generation algorithm to solve large-scale track allocation problems. Computational results for the Hanover-Kassel-Fulda area of the German long distance railway network involving up to 570 trains are reported.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Publikationsdatum: 2020-12-15
    Beschreibung: We consider a multicommodity routing problem, where demands are released \emph{online} and have to be routed in a network during specified time windows. The objective is to minimize a time and load dependent convex cost function of the aggregate arc flow. First, we study the fractional routing variant. We present two online algorithms, called Seq and Seq$^2$. Our first main result states that, for cost functions defined by polynomial price functions with nonnegative coefficients and maximum degree~$d$, the competitive ratio of Seq and Seq$^2$ is at most $(d+1)^{d+1}$, which is tight. We also present lower bounds of $(0.265\,(d+1))^{d+1}$ for any online algorithm. In the case of a network with two nodes and parallel arcs, we prove a lower bound of $(2-\frac{1}{2} \sqrt{3})$ on the competitive ratio for Seq and Seq$^2$, even for affine linear price functions. Furthermore, we study resource augmentation, where the online algorithm has to route less demand than the offline adversary. Second, we consider unsplittable routings. For this setting, we present two online algorithms, called U-Seq and U-Seq$^2$. We prove that for polynomial price functions with nonnegative coefficients and maximum degree~$d$, the competitive ratio of U-Seq and U-Seq$^2$ is bounded by $O{1.77^d\,d^{d+1}}$. We present lower bounds of $(0.5307\,(d+1))^{d+1}$ for any online algorithm and $(d+1)^{d+1}$ for our algorithms. Third, we consider a special case of our framework: online load balancing in the $\ell_p$-norm. For the fractional and unsplittable variant of this problem, we show that our online algorithms are $p$ and $O{p}$ competitive, respectively. Such results where previously known only for scheduling jobs on restricted (un)related parallel machines.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Publikationsdatum: 2017-08-01
    Beschreibung: In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facet-defining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulting cutset polyhedra translate into facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Second, we provide an analysis of the facial structure of cutset polyhedra, elaborating the differences caused by the three different types of capacity constraints. We present flow-cutset inequalities for all three models and show under which conditions these are facet-defining. We also state a new class of facets for the bidirected and undirected case and it is shown how to handle multiple capacity modules by Mixed Integer Rounding (MIR).
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Publikationsdatum: 2020-12-15
    Beschreibung: In this paper we study online multicommodity routing problems in networks, in which commodities have to be routed sequentially. The flow of each commodity can be split on several paths. Arcs are equipped with load dependent price functions defining routing costs, which have to be minimized. We discuss a greedy online algorithm that routes each commodity by minimizing a convex cost function that only depends on the demands previously routed. We present a competitive analysis of this algorithm showing that for affine linear price functions this algorithm is 4K2 (1+K)2 -competitive, where K is the number of commodities. For the single-source single-destination case, this algorithm is optimal. Without restrictions on the price functions and network, no algorithm is competitive. Finally, we investigate a variant in which the demands have to be routed unsplittably.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Publikationsdatum: 2020-12-15
    Beschreibung: In this paper, we empirically investigate the NP-hard problem of finding sparse solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. This problem has received considerable interest in the sparse approximation and signal processing literature, recently. We use a branch-and-cut approach via the maximum feasible subsystem problem to compute optimal solutions for small instances and investigate the uniqueness of the optimal solutions. We furthermore discuss five (modifications of) heuristics for this problem that appear in different parts of the literature. For small instances, the exact optimal solutions allow us to evaluate the quality of the heuristics, while for larger instances we compare their relative performance. One outcome is that the basis pursuit heuristic performs worse, compared to the other methods. Among the best heuristics are a method due to Mangasarian and a bilinear approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Publikationsdatum: 2014-02-26
    Beschreibung: The performance evaluation of W-CDMA networks is intricate as cells are strongly coupled through interference. Pole equations have been developed as a simple tool to analyze cell capacity. Numerous scientific contributions have been made on their basis. In the established forms, the pole equations rely on strong assumptions such as homogeneous traffic, uniform users, and constant downlink orthogonality factor. These assumptions are not met in realistic scenarios. Hence, the pole equations are typically used during initial network dimensioning only. Actual network (fine-) planning requires a more faithful analysis of each individual cell's capacity. Complex analytical analysis or Monte-Carlo simulations are used for this purposes. In this paper, we generalize the pole equations to include inhomogeneous data. We show how the equations can be parametrized in a cell-specific way provided the transmit powers are known. This allows to carry over prior results to realistic settings. This is illustrated with an example: Based on the pole equation, we investigate the accuracy of average snapshot'' approximations for downlink transmit powers used in state-of-the-art network optimization schemes. We confirm that the analytical insights apply to practice-relevant settings on the basis of results from detailed Monte-Carlo simulation on realistic datasets.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Publikationsdatum: 2017-08-01
    Beschreibung: This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutset-inequalities.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Publikationsdatum: 2020-02-04
    Beschreibung: Wigner transformation provides a one-to-one correspondence between functions on position space (wave functions) and functions on phase space (Wigner functions). Weighted integrals of Wigner functions yield quadratic quantities of wave functions like position and momentum densities or expectation values. For molecular quantum systems, suitably modified classical transport of Wigner functions provides an asymptotic approximation of the dynamics in the high energy regime. The article addresses the computation of Wigner functions by Monte Carlo quadrature. An ad aption of the Metropolis algorithm for the approximation of signed measures with disconnected support is systematically tested in combination with a surface hopping algorithm for non-adiabatic quantum dynamics. The numerical experiments give expectation values and level populations with an error of two to three percent, which agrees with the theoretically expected accuracy.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Publikationsdatum: 2020-11-13
    Beschreibung: We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with problem-specific preprocessing and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context, helping to increase the dual bound and to reduce the optimality gaps.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Publikationsdatum: 2020-08-05
    Beschreibung: In \emph{classical optimization} it is assumed that full information about the problem to be solved is given. This, in particular, includes that all data are at hand. The real world may not be so nice'' to optimizers. Some problem constraints may not be known, the data may be corrupted, or some data may not be available at the moments when decisions have to be made. The last issue is the subject of \emph{online optimization} which will be addressed here. We explain some theory that has been developed to cope with such situations and provide examples from practice where unavailable information is not the result of bad data handling but an inevitable phenomenon.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Publikationsdatum: 2022-07-07
    Beschreibung: A new approach to derive transparent boundary conditions (TBCs) for wave, Schrödinger, heat and drift-diffusion equations is presented. It relies on the pole condition and distinguishes between physical reasonable and unreasonable solutions by the location of the singularities of the spatial Laplace transform of the exterior solution. To obtain a numerical algorithm, a Möbius transform is applied to map the Laplace transform onto the unit disc. In the transformed coordinate the solution is expanded into a power series. Finally, equations for the coefficients of the power series are derived. These are coupled to the equation in the interior, and yield transparent boundary conditions. Numerical results are presented in the last section, showing that the error introduced by the new approximate TBCs decays exponentially in the number of coefficients.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Publikationsdatum: 2022-07-19
    Beschreibung: We present a unified approach for consistent remeshing of arbitrary non-manifold triangle meshes with additional user-defined feature lines, which together form a feature skeleton. Our method is based on local operations only and produces meshes of high regularity and triangle quality while preserving the geometry as well as topology of the feature skeleton and the input mesh.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper provides the {\em first} detailed description of the architecture of the computing machines Z1 and Z3 designed by Konrad Zuse in Berlin between 1936 to 1941. The necessary information was obtained from a careful evaluation of the patent application filed by Zuse in 1941. Additional insight was gained from a software simulation of the machine's logic. The Z1 was built using purely mechanical components, the Z3 using electromechanical relays. However, both machines shared a common logical structure and the programming model was exactly the same. We argue that both the Z1 and the Z3 possessed features akin to those of modern computers: memory and processor were separate units, the processor could handle floating-point numbers and compute the four basic arithmetical operations as well as the square root of a number. The program was stored on punched tape and was read sequentially. In the last section of this paper we bring the architecture of the Z1 and Z3 into historical perspective by offering a comparison with computing machines built in other countries.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Publikationsdatum: 2014-11-11
    Beschreibung: We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on different parallel platforms, including heterogeneous workstation clusters, Sun S20-502, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    Publikationsdatum: 2014-02-26
    Beschreibung: We present an algorithm for solving stochastic integer programming problems with recourse, based on a dual decomposition scheme and Lagrangian relaxation. The approach can be applied to multi-stage problems with mixed-integer variables in each time stage. %We outline a branch-and-bound algorithm for obtaining primal feasible and %possibly optimal solutions. Numerical experience is presented for some two-stage test problems.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper presents the concept of a new type of algorithm for the numerical computation of what the authors call the {\em essential dynamics\/} of molecular systems. Mathematically speaking, such systems are described by Hamiltonian differential equations. In the bulk of applications, individual trajectories are of no specific interest. Rather, time averages of physical observables or relaxation times of conformational changes need to be actually computed. In the language of dynamical systems, such information is contained in the natural invariant measure (infinite relaxation time) or in almost invariant sets ("large" finite relaxation times). The paper suggests the direct computation of these objects via eigenmodes of the associated Frobenius-Perron operator by means of a multilevel subdivision algorithm. The advocated approach is different to both Monte-Carlo techniques on the one hand and long term trajectory simulation on the other hand: in our setup long term trajectories are replaced by short term sub-trajectories, Monte-Carlo techniques are just structurally connected via the underlying Frobenius-Perron theory. Numerical experiments with a first version of our suggested algorithm are included to illustrate certain distinguishing properties. A more advanced version of the algorithm will be presented in a second part of this paper.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 25
    Publikationsdatum: 2014-02-26
    Beschreibung: The aim of this work is to study the accuracy and stability of the Chebyshev--approximation method as a time--discretization for wavepacket dynamics. For this frequently used discretization we introduce estimates of the approximation and round--off error. These estimates mathematically confirm the stability of the Chebyshev--approximation with respect to round--off errors, especially for very large stepsizes. But the results also disclose threads to the stability due to large spatial dimensions. All theoretical statements are illustrated by numerical simulations of an analytically solvable example, the harmonic quantum oszillator.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 26
    Publikationsdatum: 2014-02-26
    Beschreibung: We present an integrated time--space adaptive finite element method for solving systems of twodimensional nonlinear parabolic systems in complex geometry. The partial differential system is first discretized in time using a singly linearly implicit Runge--Kutta method of order three. Local time errors for the step size control are defined by an embedding strategy. These errors are used to propose a new time step by a PI controller algorithm. A multilevel finite element method with piecewise linear functions on unstructured triangular meshes is subsequently applied for the discretization in space. The local error estimate of the finite element solution steering the adaptive mesh refinement is obtained solving local problems with quadratic trial functions located essentially at the edges of the triangulation. This two--fold adaptivity successfully ensures an a priori prescribed tolerance of the solution. The devised method is applied to laminar gaseous combustion and to solid--solid alloying reactions. We demonstrate that for such demanding applications the employed error estimation and adaption strategies generate an efficient and versatile algorithm.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 27
    Publikationsdatum: 2015-06-01
    Beschreibung: \iffalse Recently, Todorov and Wilf independently realized that de Branges' original proof of the Bieberbach and Milin conjectures and the proof that was later given by Weinstein deal with the same special function system that de Branges had introduced in his work. In this article, we present an elementary proof of this statement based on the defining differential equations system rather than the closed representation of de Branges' function system. Our proof does neither use special functions (like Wilf's) nor the residue theorem (like Todorov's) nor the closed representation (like both), but is purely algebraic. On the other hand, by a similar algebraic treatment, the closed representation of de Branges' function system is derived. Our whole contribution can be looked at as the study of properties of the Koebe function. Therefore, in a very elementary manner it is shown that the known proofs of the Bieberbach and Milin conjectures can be understood as a consequence of the Löwner differential equation, plus properties of the Koebe function. \fi In his 1984 proof of the Bieberbach and Milin conjectures de Branges used a positivity result of special functions which follows from an identity about Jacobi polynomial sums that was found by Askey and Gasper in 1973, published in 1976. In 1991 Weinstein presented another proof of the Bieberbach and Milin conjectures, also using a special function system which (by Todorov and Wilf) was realized to be the same as de Branges'. In this article, we show how a variant of the Askey-Gasper identity can be deduced by a straightforward examination of Weinstein's functions which intimately are related with a Löwner chain of the Koebe function, and therefore with univalent functions.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 28
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisions. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with \mbox{RELAX-IV}, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 29
    Publikationsdatum: 2014-02-26
    Beschreibung: Integrals of optimal values of random optimization problems depending on a finite dimensional parameter are approximated by using empirical distributions instead of the original measure. Under fairly broad conditions, it is proved that uniform convergence of empirical approximations of the right hand sides of the constraints implies uniform convergence of the optimal values in the linear and convex case.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 30
    Publikationsdatum: 2014-02-26
    Beschreibung: The adaptive Rothe method approaches a time-dependent PDE as an ODE in function space. This ODE is solved {\em virtually} using an adaptive state-of-the-art integrator. The {\em actual} realization of each time-step requires the numerical solution of an elliptic boundary value problem, thus {\em perturbing} the virtual function space method. The admissible size of that perturbation can be computed {\em a priori} and is prescribed as a tolerance to an adaptive multilevel finite element code, which provides each time-step with an individually adapted spatial mesh. In this way, the method avoids the well-known difficulties of the method of lines in higher space dimensions. During the last few years the adaptive Rothe method has been applied successfully to various problems with infinite speed of propagation of information. The present study concerns the adaptive Rothe method for hyperbolic equations in the model situation of the wave equation. All steps of the construction are given in detail and a numerical example (diffraction at a corner) is provided for the 2D wave equation. This example clearly indicates that the adaptive Rothe method is appropriate for problems which can generally benefit from mesh adaptation. This should be even more pronounced in the 3D case because of the strong Huygens' principle.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 31
    Publikationsdatum: 2014-02-26
    Beschreibung: A numerical method for the treatment of moving discontinuities in the model equations of chemical engineering systems is presented. The derived model describing the effects of condensation and evaporation in a regenerative air to air heat exchanger yields an illustrative example for these so called moving boundary problems. The presented adaptive moving grid method is based on the algorithm {\sc Pdex} for parabolic partial differential equations. It is shown that the method is suited for problems where the arising discontinuities cause low rates of convergence if the equations are solved with a static grid.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 32
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: Nahezu flächendeckend sind die mathematischen Fachbereiche der BRD zum Jahresende '95 im WWW vertreten. Durch die relative hohe Zahl von Servern entstehen Schwierigkeiten bei der Sichtung der angebotenen Information. Wir besprechen "Harvest" als brauchbares und gebrauchsfähiges Hilfsmittel zur Dokumentation.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 33
    Publikationsdatum: 2014-02-27
    Beschreibung: In this thesis we describe a practical problem that we encountered in the on--line optimization of a complex Flexible Manufacturing System. In the considered system a stacker crane has to fulfill all transportation tasks (jobs) in a single aisled automatic storage system. The jobs have to be sequenced in such a way, that the time needed for the unloaded moves is minimized. The modelling of this question leads to the so--called on--line Hamiltonian path problem. We computationally compare several on--line heuristics and derive lower bounds on the value obtained by an optimal on--line strategy by analyzing two off--line Combinatorial Optimization problems: the asymmetric Hamiltonian path problem with precedence constraints, also called sequential ordering problem (SOP), and the asymmetric Hamiltonian path problem with time windows (AHPPTW). We study the SOP and AHPPTW from a polyhedral point of view and derive several new classes of valid inequalities. Based on the polyhedral investigations we develop branch&cut algorithms for both problems and can achieve encouraging results on solving problem instances from real--world examples of the practical application.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 34
    Publikationsdatum: 2018-02-27
    Beschreibung: The Internet and the new electronic means of information and communication are transforming scientific communication fundamentally. In particular, mathematicians, physicists and other natural scientists intensify, accelerate and extend their communication by the use of the Internet and its tools, from electronic mail up to the World Wide Web. In doing so, they also exchange scientific results of a new kind and quality yet unknown to traditional information providers such as publishers, libraries, and database suppliers (e.g. in the form of current research software, scientific data collections, observations and experimental data, visualizations, animations etc.). They, on the other hand, perceive the new ways, which are passing their own field of activity, as breakdowns of traditional publishing, as it was termed by the Association of Computing Machinery. In addition, scientific libraries find themselves caught in a structural crisis -- not only because of budget restraints. The {\it Deutsche Mathematiker-Vereinigung} (DMV), however, sees the new electronic means as an opportunity to master a crisis of this kind rather than a threat. By discussing concrete models, which may be - in a certain technical sense -- realizable already today, the article gives an introduction into the subject of a {\it Distributed Information- and Communication System for Mathematics}, a project prepared and planned by the DMV for the years 1996 to 1998. In the context of possible realization variants it also deals with questions of costs, resulting load of network connections, and -- showing the beginnings -- the (absolutely essential) solution of problems related to quality, authenticity, archival and intellectual property rights, which arise with the employment of electronic means. Obviously (even if not discussed explicitly) also computing centers, whose tasks and position are also affected by the electronic revolution, have the chance to find a new and forward-looking role in this field - in particular by new forms of cooperation with scientific libraries.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 35
    Publikationsdatum: 2014-02-26
    Beschreibung: We present parallel formulations of the well established extrapolation algorithms EULSIM and LIMEX and its implementation on a distributed memory architecture. The discretization of partial differential equations by the method of lines yields large banded systems, which can be efficiently solved in parallel only by iterative methods. Polynomial preconditioning with a Neumann series expansion combined with an overlapping domain decomposition appears as a very efficient, robust and highly scalable preconditioner for different iterative solvers. A further advantage of this preconditioner is that all computation can be restricted to the overlap region as long as the subdomain problems are solved exactly. With this approach the iterative algorithms operate on very short vectors, the length of the vectors depends only on the number of gridpoints in the overlap region and the number of processors, but not on the size of the linear system. As the most reliable and fast iterative methods based on this preconditioning scheme appeared GMRES or FOM and BICGSTAB. To further reduce the number of iterations in GMRES or FOM we can reuse the Krylov-spaces constructed in preceeding extrapolation steps. The implementation of the method within the program LIMEX results in a highly parallel and scalable program for solving differential algebraic problems getting an almost linear speedup up to 64 processors even for medium size problems. Results are presented for a difficult application from chemical engineering simulating the formation of aerosols in industrial gas exhaust purification.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 36
    Publikationsdatum: 2014-02-26
    Beschreibung: We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We show that simple semidefinite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 37
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper presents computations of decaying two--dimensional turbulence in an adaptive wavelet basis. At each time step the vorticity is represented by an adaptively selected set of wavelet functions which adjusts to the instantaneous distribution of vorticity. The results of this new algorithm are compared to a classical Fourier method and a Fourier method supplemented with wavelet compression in each time step.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 38
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: For a polyhedral cone $C=$ pos $\{a^1,\dots,a^m\}\subset R^d$, $a^i\in Z^d$, a subset of integral vectors $H(C)\subset C \cap Z^d$ is called a Hilbert basis of $C$ iff (i) each element of $C\cap Z^d$ can be written as a non-negative integer combination of elements of $H(C)$ and (ii) $H(C)$ has minimal cardinality with respect to all subsets of $C \cap Z^d$ for which (i) holds. We show that various problems related to Hilbert bases are hard in terms of computational complexity. However, if the dimension and the number of elements of the Hilbert basis are fixed, a Hilbert basis can always be computed in polynomial time. Furthermore we introduce a (practical) algorithm for computing the Hilbert basis of a polyhedral cone. The finiteness of this method is deduced from a result about the height of a Hilbert basis which, in particular, improves on former estimates.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 39
    Publikationsdatum: 2014-02-26
    Beschreibung: In General Relativity, the motion of expanding shearfree perfect fluids is governed by the ordinary differential equation $y^{\prime \prime }=$ $% F(x)\,y^2$ , where $F$ is an arbitrary function from which the equation of state can be computed. A complete symmetry analysis of this differential equation is given; its solutions are classified according to this scheme, and in particular the relation to Wyman's Painlev\'e analysis is clarified.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 40
    Publikationsdatum: 2020-12-15
    Beschreibung: We perform a high statistics calculation of the equation of state for non-compact QED on large lattices. The calculation extends to fermionic correlation lengths of $\approx 8$, and it is combined with a finite size scaling analysis of the lattice data.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 41
    Publikationsdatum: 2014-02-26
    Beschreibung: We consider the fast solution of large, piecewise smooth minimization problems as resulting from the approximation of elliptic free boundary problems. The most delicate question in constructing a multigrid method for a nonlinear, non--smooth problem is how to represent the nonlinearity on the coarse grids. This process usually involves some kind of linearization. The basic idea of monotone multigrid methods to be presented here is first to select a neighborhood of the actual smoothed iterate in which a linearization is possible and then to constrain the coarse grid correction to this neighborhood. Such a local linearization allows to control the local corrections at each coarse grid node in such a way that the energy functional is monotonically decreasing. This approach leads to globally convergent schemes which are robust with respect to local singularities of the given problem. The numerical performance is illustrated by approximating the well-known Barenblatt solution of the porous medium equation.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 42
    Publikationsdatum: 2014-02-26
    Beschreibung: We prove inequalities relating the inradius of a convex body with interior containing no point of the integral lattice, with the volume or surface area of the body. These inequalities are tight and generalize previous results.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 43
    Publikationsdatum: 2014-02-26
    Beschreibung: \small Many interesting phenomena in molecular systems like interactions between macro-molecules, protein-substrate docking, or channeling processes in membranes are gouverned to a high degree by classical Coulomb or van-der-Waals forces. The visualization of these force fields is important for verifying numerical simulations. Moreover, by inspecting the forces visually we can gain deeper insight into the molecular processes. Up to now the visualization of vector fields is quite unusual in computational chemistry. In fact many commercial software packages do not support this topic at all. The reason is not that vector fields are considered unimportant, but mainly because of the lack of adequate visualization methods. In this paper we survey a number of methods for vector field visualization, ranging from well-known concepts like arrow or streamline plots to more advanced techniques like line integral convolution, and show how these can be applied to computational chemistry. A combination of the most meaningful methods in an interactive 3D visualization environment can provide a powerful tool box for analysing simulations in molecular dynamics.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 44
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper we generalize a result by Rubin and Ungar on Hamiltonian systems containing a strong constraining potential to Langevin dynamics. Such highly oscillatory systems arise, for example, in the context of molecular dynamics. We derive constrained equations of motion for the slowly varying solution components. This includes in particular the derivation of a correcting force-term that stands for the coupling of the slow and fast degrees of motion. We will identify two limiting cases: (i) the correcting force becomes, over a finite interval of time, almost identical to the force term suggested by Rubin and Ungar (weak thermal coupling) and (ii) the correcting force can be approximated by the gradient of the Fixman potential as used in statistical mechanics (strong thermal coupling). The discussion will shed some light on the question which of the two correcting potentials is more appropriate under which circumstances for molecular dynamics. In Sec.~7, we also discuss smoothing in the context of constant temperature molecular dynamics.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 45
    Publikationsdatum: 2014-02-26
    Beschreibung: We present efficient techniques for the numerical approximation of complicated dynamical behavior. In particular, we develop numerical methods which allow to approximate SBR-measures as well as (almost) cyclic behavior of a dynamical system. The methods are based on an appropriate discretization of the Frobenius-Perron operator, and two essentially different mathematical concepts are used: the idea is to combine classical convergence results for finite dimensional approximations of compact operators with results from Ergodic Theory concerning the approximation of SBR-measures by invariant measures of stochastically perturbed systems. The efficiency of the methods is illustrated by several numerical examples.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 46
    Publikationsdatum: 2014-02-26
    Beschreibung: We present Multilevel Finite Element computations for twodimensional reaction-diffusion systems modelling laminar flames. These systems are prototypes for extreme stiffness in time and space. The first of these two rather general features is accounted for by an improved control mechanism for the time step. The second one is reflected through very thin travelling reaction fronts for which we propose an anisotropic discretization by local directional refinement.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 47
    Publikationsdatum: 2014-02-26
    Beschreibung: Simplified chemical kinetic schemes are a crucial prerequisite for the simulation of complex three-dimensional turbulent flows, and various methods for the generation of reduced mechanisms have been developed in the past. The method of intrinsic low-dimensional manifolds (ILDM), e.g., provides a mathematical tool for the automatic simplification of chemical kinetics, but one problem of this method is the fact that the information which comes out of the mechanism reduction procedure has to be stored for subsequent use in reacting flow calculations. In most cases tabulation procedures are used which store the relevant data (such as reduced reaction rates) in terms of the reaction progress variables, followed by table look-up during the reacting flow calculations. This can result in huge amounts of storage needed for the multi-dimensional tabulation. In order to overcome this problem we present a storage scheme which is based on orthogonal polynomials. Instead of using small tabulation cells and local mesh refinement, the thermochemical state space is divided into a small number of coarse cells. Within these coarse cells polynomial approximations are used instead of frequently used multi-linear interpolation. This leads to a considerable decrease of needed storage. The hydrogen-oxygen system is considered as an example. Even for this small chemical system we obtain a decrease of the needed storage requirement by a factor of 100.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 48
    Publikationsdatum: 2014-02-26
    Beschreibung: The Car-Parrinello (CP) approach to ab initio molecular dynamics serves as an approximation to time-dependent Born-Oppenheimer (BO) calculations. It replaces the explicit minimization of the energy functional by a fictitious Newtonian dynamics and therefore introduces an artificial mass parameter $\mu$ which controls the electronic motion. A recent theoretical investigation shows that the CP-error, i.e., the deviation of the CP--solution from the BO-solution {\em decreases} like $\mu^{1/2}$ asymptotically. Since the computational effort {\em increases} like $\mu^{-1/2}$, the choice of $\mu$ has to find a compromise between efficiency and accuracy. The asymptotical result is used in this paper to construct an easily implemented algorithm which automatically controls $\mu$: the parameter $\mu$ is repeatedly adapted during the simulation by choosing $\mu$ as large as possible while pushing an error measure below a user-given tolerance. The performance and reliability of the algorithm is illustrated by a typical example.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 49
    Publikationsdatum: 2014-02-26
    Beschreibung: The Car-Parrinello method for ab-initio molecular dynamics avoids the explicit minimization of energy functionals given by functional density theory in the context of the quantum adiabatic approximation (time-dependent Born-Oppenheimer approximation). Instead, it introduces a fictitious classical dynamics for the electronic orbitals. For many realistic systems this concept allowed first-principle computer simulations for the first time. In this paper we study the {\em quantitative} influence of the involved parameter $\mu$, the fictitious electronic mass of the method. In particular, we prove by use of a carefully chosen two-time-scale asymptotics that the deviation of the Car-Parrinello method from the adiabatic model is of order ${\rm O}(\mu^{1/2})$ --- provided one starts in the ground state of the electronic system and the electronic excitation spectrum satisfies a certain non-degeneracy condition. Analyzing a two-level model problem we prove that our result cannot be improved in general. Finally, we show how to use the gained quantitative insight for an automatic control of the unphysical ``fake'' kinetic energy of the method.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 50
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: We consider backward error analysis of numerical approximations to ordinary differential equations, i.e., the numerical solution is formally interpreted as the exact solution of a modified differential equation. A simple recursive definition of the modified equation is stated. This recursion is used to give a new proof of the exponentially closeness of the numerical solutions and the solutions to an appropriate truncation of the modified equation. We also discuss qualitative properties of the modified equation and apply these results to the symplectic variable step-size integration of Hamiltonian systems, the conservation of adiabatic invariants, and numerical chaos associated to homoclinic orbits.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 51
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper presents two Lagrangean relaxation approaches for the {\em NP}-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions efficiently. A further application is to use the Lagrangean relaxations as new pricing strategies for a delayed column generation of a branch-and-cut approach. The computational investigations are based on real-world test sets from the cities of Berlin and Hamburg having up to 25 thousand timetabled trips and 70 million dead-head trips.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 52
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2015-06-01
    Beschreibung: It is well-known that by polynomial elimination methods, in particular by the computation of Gröbner bases, proofs for geometric theorems can be automatically generated. %% Several monographs On the other hand, it is much less known that Gröbner bases, in combination with rational factorization, can be even used to {\sl find} new geometric theorems. In this article such a method is described, and some new theorems on plane triangles are deduced.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 53
    Publikationsdatum: 2015-06-01
    Beschreibung: \begin{enumerate} \item[] {{\small In this article explicit formulas for the recurrence equation \[ p_{n+1}(x)=(A_n\,x+B_n)\,p_n(x)-C_n\,p_{n-1}(x) \] and the derivative rules \[ \sigma(x)\,p_n'(x)=\alpha_n\,p_{n+1}(x)+\beta_n\,p_n(x)+\gamma_n\,p_{n-1}(x) \] and \[ \sigma(x)\,p_n'(x)=(\tilde\alpha_n\,x+\tilde\beta_n)\,p_n(x)+ \tilde\gamma_n\,p_{n-1}(x) \] respectively which are valid for the orthogonal polynomial solutions $p_n(x)$ of the differential equation \[ \sigma(x)\,y''(x)+\tau(x)\,y'(x)+\lambda_n\,y(x)=0 \] of hypergeometric type are developed that depend {\sl only} on the coefficients $\sigma(x)$ and $\tau(x)$ % and $\lambda_n$ which themselves are polynomials w.r.t.\ $x$ of degrees not larger than $2$ and $1$% and $0$ , respectively. Partial solutions of this problem had been previously published by Tricomi, and recently by Y\'a\~nez, Dehesa and Nikiforov. Our formulas yield an algorithm with which it can be decided whether a given holonomic recurrence equation (i.e.\ one with polynomial coefficients) generates a family of classical orthogonal polynomials, and returns the corresponding data (density function, interval) including the standardization data in the affirmative case. In a similar way, explicit formulas for the coefficients of the recurrence equation and the difference rule \[ \sigma(x)\,\nabla p_n(x)= \alpha_n\,p_{n+1}(x)+\beta_n\,p_n(x)+\gamma_n\,p_{n-1}(x) \] of the classical orthogonal polynomials of a discrete variable are given that depend only on the coefficients $\sigma(x)$ and $\tau(x)$ of their difference equation \[ \sigma(x)\,\Delta\nabla y(x)+\tau(x)\,\Delta y(x)+\lambda_n\,y(x)=0 \;. \] Here \[ \Delta y(x)=y(x+1)-y(x) \quad\quad\mbox{and}\quad\quad \nabla y(x)=y(x)-y(x-1) \] denote the forward and backward difference operators, respectively. In particular this solves the corresponding inverse problem to find the classical discrete orthogonal polynomial solutions of a given holonomic recurrence equation. \iffalse Furthermore, an algorithmic approach to deduce these and similar properties is presented which is implementable in computer algebra, and which moreover generates relations between different standardizations of the polynomial system considered. \fi }} \end{enumerate}
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 54
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper addresses the possibilities of reducing the overall number of degrees of freedom in large scale reactive flow computations. Attention focusses on the dimension reduction technique ILDM due to {\sc Maas and Pope}, which treats certain automatically detected fast dynamic components as algebraic equations (so-called slow manifold). In earlier papers, the dimension of the reduction had been kept constant throughout each computation. Recently, a mathematically sound and nevertheless cheap dimension monitor for the chemistry part only has been suggested by {\sc Deuflhard and Heroth}. The present paper reports about first steps taken towards the implementation of that monitor into a flame code. Moreover, a sparse grid storage scheme is advocated and analyzed in view of the construction of efficient table look--ups for nested manifolds.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 55
    Publikationsdatum: 2020-11-13
    Beschreibung: Using the full multigrid method {\em without} any coarse grid correction steps but with an a posteriori control of the number of smoothing iterations was shown by Bornemann and Deuflhard [1996] to be an optimal iteration method with respect to the energy norm. They named this new kind of multigrid iteration the {\em cascadic multigrid method}. However, numerical examples with {\em linear} finite elements raised serious doubts whether the cascadic multigrid method can be made optimal with respect to the {\em $L^2$-norm}. In this paper we prove that the cascadic multigrid method cannot be optimal for linear finite elements and show that the case might be different for higher order elements. We present a careful analysis of the two grid variant of the cascadic multigrid method providing a setting where one can understand the methodical difference between the cascadic multigrid method and the classical multigrid $V$-cycle almost immediately. As a rule of thumb we get that whenever the cascadic multigrid works the classical multigrid will work too but not vice versa.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 56
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: An integrated time--space adaptive finite element method for solving mixed systems of nonlinear parabolic, elliptic, and differential algebraic equations is presented. The approach is independent of the spatial dimension. For the discretization in time we use singly diagonally linearly implicit Runge--Kutta methods of Rosenbrock type. Local time errors for the step size control are defined by an embedded strategy. A multilevel finite element Galerkin method is subsequently applied for the discretization in space. A posteriori estimates of local spatial discretization errors are obtained solving local problems with higher order approximation. Superconvergence arguments allow to simplify the required computations. Two different strategies to obtain the start grid of the multilevel process are compared. The devised method is applied to a solid--solid combustion problem.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 57
    Publikationsdatum: 2014-11-02
    Beschreibung: This paper investigates the solution of the linear programming (LP) relaxation of the multicommodity flow formulation of the multiple-depot vehicle scheduling problems arising in public mass transit. We develop a column generation technique that makes it possible to solve the huge linear programs that come up there. The technique, which we call {\em Lagrangean pricing}, is based on two different Lagrangean relaxations. We describe in detail the basic ingredients of our approach and give computational results for large-scale test data (with up to 70 million variables) from three German public transportation companies. Because of these results, we propose Lagrangean pricing as one of the basic ingredients of an effective method to solve multiple-depot vehicle scheduling problems to proven optimality.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 58
    Publikationsdatum: 2019-01-29
    Beschreibung: The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex functionals. Uniform ellipticity of the underlying PDE shows up as strict convexity of the arising nonlinear functional. The paper analyzes computational variants of Newton's method for convex optimization in an affine conjugate setting, which reflects the appropriate affine transformation behavior for this class of problems. First, an affine conjugate Newton--Mysovskikh type theorem on the local quadratic convergence of the exact Newton method in Hilbert spaces is given. It can be easily extended to inexact Newton methods, where the inner iteration is only approximately solved. For fixed finite dimension, a special implementation of a Newton--PCG algorithm is worked out. In this case, the suggested monitor for the inner iteration guarantees quadratic convergence of the outer iteration. In infinite dimensional problems, the PCG method may be just formally replaced by any Galerkin method such as FEM for linear elliptic problems. Instead of the algebraic inner iteration errors we now have to control the FE discretization errors, which is a standard task performed within any adaptive multilevel method. A careful study of the information gain per computational effort leads to the result that the quadratic convergence mode of the Newton--Galerkin algorithm is the best mode for the fixed dimensional case, whereas for an adaptive variable dimensional code a special linear convergence mode of the algorithm is definitely preferable. The theoretical results are then illustrated by numerical experiments with a {\sf NEWTON--KASKADE} algorithm.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 59
    Publikationsdatum: 2014-02-26
    Beschreibung: {\footnotesize In classical Molecular Dynamics a molecular system is modelled by classical Hamiltonian equations of motion. The potential part of the corresponding energy function of the system includes contributions of several types of atomic interaction. Among these, some interactions represent the bond structure of the molecule. Particularly these interactions lead to extremely stiff potentials which force the solution of the equations of motion to oscillate on a very small time scale. There is a strong need for eliminating the smallest time scales because they are a severe restriction for numerical long-term simulations of macromolecules. This leads to the idea of just freezing the high frequency degrees of freedom (bond stretching and bond angles) via increasing the stiffness of the strong part of the potential to infinity. However, the naive way of doing this via holonomic constraints mistakenly ignores the energy contribution of the fast oscillations. The paper presents a mathematically rigorous discussion of the limit situation of infinite stiffness. It is demonstrated that the average of the limit solution indeed obeys a constrained Hamiltonian system but with a {\em corrected soft potential}. An explicit formula for the additive potential correction is given via a careful inspection of the limit energy of the fast oscillations. Unfortunately, the theory is valid only as long as the system does not run into certain resonances of the fast motions. Behind those resonances, there is no unique limit solution but a kind of choatic scenario for which the notion ``Takens chaos'' was coined. For demonstrating the relevance of this observation for MD, the theory is applied to a realistic, but still simple system: a single butan molecule. The appearance of ``Takens chaos'' in smoothed MD is illustrated and the consequences are discussed.}
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 60
    Publikationsdatum: 2014-02-26
    Beschreibung: Recently subdivision techniques have been introduced in the numerical investigation of complicated temporal behavior of dynamical systems. In this article we intertwine the subdivision process with the computation of invariant measures and propose an adaptive scheme for the box refinement which is based on the combination of these methods. Using this new algorithm the numerical effort for the computation of box coverings is in general significantly reduced, and we illustrate this fact by several numerical examples.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 61
    Publikationsdatum: 2020-02-11
    Beschreibung: In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called {\em SteinLib} that is accessible via World Wide Web.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 62
    Publikationsdatum: 2014-02-26
    Beschreibung: In the highly competitive area of telecommunications, cost, quality, and network management are among the most important aspects to be considered when designing a network. We study the problem of dimensioning a telecommunication network that is still operating in case of a failure of a network component. Given a demand between each pair of nodes of a telecommunication network and a finite set of possible capacities for each edge of the network, we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes, even if a network component fails. The routing of the demands must satisfy the following additional restrictions: (a) there is a maximum number of nodes allowed in each path between any pair of nodes (path length restriction), and (b) there is a maximum percentage of the demand between each pair of nodes that can be routed through any network component (diversification restriction). Moreover, the chosen capacities must be such that, for every single node or single edge failure, a certain percentage of the demand between any pair of nodes is reroutable (i.e. it ``survives'' the particular failure). We formulate the problem as a mixed integer linear programming problem and present a cutting plane algorithm as well as several heuristics for its solution. Furthermore, we discuss several ways to implement survivability into a telecommunication network.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 63
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: A perfect graph is critical if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We investigate the relationship of critically perfect graphs to well-known classes of perfect graphs and study operations preserving critical perfectness.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 64
    Publikationsdatum: 2014-02-26
    Beschreibung: Designing low cost networks that survive certain failure situations belongs to one of the prime tasks in the telecommunications industry. In this paper we describe a mathematical model combining several aspects of survivability that are elsewhere treated in a hierarchical fashion. We present mathematical investigations of this integrated model, a cutting plane algorithm, as well as several heuristics for its solution. Moreover, we report computational results with real world data. The problem we address is the following. Suppose, between each pair of nodes in a region, a communication demand is given. We want to determine the topology of a telecommunication network connecting the given nodes and to dimension all potential physical links. For each link, the possible capacities are restricted to a given finite set. The capacities must be chosen such that the communication demands are satisfied, even if certain network components fail, and such that the network building costs are as small as possible. Moreover, for each pair of nodes and each failure situation, we want to determine the paths on which the demand between the nodes is routed.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 65
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2015-06-01
    Beschreibung: In this note we solve a problem about the rational representability of hypergeometric terms which represent hypergeometric sums. This problem was proposed by Koornwinder in Koornwinder, T. H.: Hypergeometric series evaluation by Zeilberger's algorithm. In: Open Problems, ed. by Walter van Assche. J. of Comput. and Appl. Math.48, 1993, 225--243.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 66
    Publikationsdatum: 2015-06-01
    Beschreibung: In many applications (hypergeometric-type) special functions like orthogonal polynomials are needed. For example in more than 50 \% of the published solutions for the (application-oriented) questions in the Problems Section'' of SIAM Review special functions occur. In this article the Mathematica package {\tt SpecialFunctions} which can be obtained from the URL {\tt http://www.zib.de/koepf} is introduced. Algorithms to convert between power series representations and their generating functions is the main topic of this package, extending the previous package {\tt PowerSeries}. Moreover the package automatically finds differential and recurrence equations for expressions and for sums (the latter using Zeilberger's algorithm. As an application the fast computation of polynomial approximations of solutions of linear differential equations with polynomial coefficients is presented. This is the asymptotically fastest known algorithm for series computations, and it is much faster than Mathematica's builtin {\tt Series} command if applicable. Many more applications are considered. Finally the package includes implementations supporting the efficient computation of classical continuous and discrete orthogonal polynomials.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 67
    Publikationsdatum: 2014-02-26
    Beschreibung: A widely used approach for the computation of time-harmonic electromagnetic fields is based on the well-known double-curl equation for either $\vec E$ or $\vec H$. An appealing choice for finite element discretizations are edge elements, the lowest order variant of a $H(curl)$-conforming basis. However, the large nullspace of the curl-operator gives rise to serious drawbacks. It comprises a considerable part of all spectral modes on the finite element grid, polluting the solution with non-physical contributions and causing the deterioration of standard iterative solvers. We tackle these problems by a nested multilevel algorithm. After every V-cycle in the $H(curl)$-conforming basis, the non-physical contributions are removed by a projection scheme. It requires the solution of Poisson's equation in the nullspace, which can be carried out efficiently by another multilevel iteration. The whole procedure yields convergence rates independent of the refinement level of the mesh. Numerical examples demonstrate the efficiency of the method.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 68
    Publikationsdatum: 2020-03-09
    Beschreibung: After a short summary on therapy planning and the underlying technologies we discuss quantitative medicine by giving a short overview on medical image data, summarizing some applications of computer based treatment planning, and outlining requirements on medical planning systems. Then we continue with a description of our medical planning system {\sf HyperPlan}. It supports typical working steps in therapy planning, like data aquisition, segmentation, grid generation, numerical simulation and optimization, accompanying these with powerful visualization and interaction techniques.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 69
    Publikationsdatum: 2014-11-11
    Beschreibung: We consider a single server system consisting of $n$ queues with different types of customers and $k$ permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). By means of Loynes' monotonicity method a stationary work load process is constructed and using sample path analysis general stability conditions are derived. They allow to decide which queues are stable and moreover to compute the fraction of processor capacity devoted to the permanent customers. In case of a stable system the constructed stationary state process is the only one and for any initial state the system converges pathwise to the steady state.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 70
    Publikationsdatum: 2014-02-26
    Beschreibung: For the simulation of one-dimensional flame configurations reliabl e numerical tools are needed which have to be both highly efficient (large num ber of parametric calculations) and at the same time accurate (in order t o avoid numerical errors). This can only be accomplished using fully adapt ive discretization techniques both in space and time together with a c ontrol of the discretization error. We present a method which accomplishes this task. It is based on a n adative MOL (method of lines) treatment. Space discretization is done by means of finite difference approxi mations on non-uniform grids. Time is discretized by the linearly-implicit Euler method. In order to control the discretization errors an extrapolation pro cedure is used in space and time. Results are presented for simple laser-induced ignition processes. The method, however, can be applied to other combustion processes, too.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 71
    Publikationsdatum: 2019-01-29
    Beschreibung: The paper deals with the multilevel solution of {\em elliptic} partial differential equations (PDEs) in a {\em finite element} setting: {\em uniform ellipticity} of the PDE then goes with {\em strict monotonicity} of the derivative of a nonlinear convex functional. A {\em Newton multigrid method} is advocated, wherein {\em linear residuals} are evaluated within the multigrid method for the computation of the Newton corrections. The globalization is performed by some {\em damping} of the ordinary Newton corrections. The convergence results and the algorithm may be regarded as an extension of those for local Newton methods presented recently by the authors. An {\em affine conjugate} global convergence theory is given, which covers both the {\em exact} Newton method (neglecting the occurrence of approximation errors) and {\em inexact} Newton--Galerkin methods addressing the crucial issue of accuracy matching between discretization and iteration errors. The obtained theoretical results are directly applied for the construction of adaptive algorithms. Finally, illustrative numerical experiments with a~{\sf NEWTON--KASKADE} code are documented.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 72
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper is about algorithmic invariant theory as it is required within equivariant dynamical systems. The question of generic bifurcation equations requires the knowledge of fundamental invariants and equivariants. We discuss computations which are related to this for finite groups and semisimple Lie groups. We consider questions such as the completeness of invariants and equivariants. Efficient computations are gained by the Hilbert series driven Buchberger algorithm. Applications such as orbit space reduction are presented.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 73
    Publikationsdatum: 2014-02-26
    Beschreibung: Preprocessing in two-stage stochastic programming is considered from the viewpoint of Fourier-Motzkin elimination. Although of exponential complexity in general, Fourier-Motzkin elimination is shown to provide valuable insights into specific topics such as solving integer recourse stochastic programs or verifying stability conditions. Test runs with the computer code PORTA [1994] are reported.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 74
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: The standard technique of reduced cost fixing from linear programming is not trivially extensible to semidefinite relaxations as the corresponding Lagrange multipliers are usually not available. We propose a general technique for computing reasonable Lagrange multipliers to constraints which are not part of the problem description. Its specialization to the semidefinite $\left\{-1,1\right\}$ relaxation of quadratic 0-1 programming yields an efficient routine for fixing variables. The routine offers the possibility to exploit problem structure. We extend the traditional bijective map between $\left\{0,1\right\}$ and $\left\{-1,1\right\}$ formulations to the constraints such that the dual variables remain the same and structural properties are preserved. In consequence the fixing routine can efficiently be applied to optimal solutions of the semidefinite $\left\{0,1\right\}$ relaxation of constrained quadratic 0-1 programming, as well. We provide numerical results showing the efficacy of the approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 75
    Publikationsdatum: 2022-07-07
    Beschreibung: We present a general technique for constructing nonlocal transparent boundary conditions for one-dimensional Schrödinger-type equations. Our method supplies boundary conditions for the $\theta$-family of implicit one-step discretizations of Schrödinger's equation in time. The use of Mikusi\'nski's operator approach in time avoids direct and inverse transforms between time and frequency domains and thus implements the boundary conditions in a direct manner.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 76
    Publikationsdatum: 2014-02-26
    Beschreibung: The paper discusses the approximation of scattered data on the sphere which is one of the major tasks in geomathematics. Starting from the discretization of singular integrals on the sphere the authors devise a simple approximation method that employs locally supported spherical polynomials and does not require equidistributed grids. It is the basis for a hierarchical approximation algorithm using differently scaled basis functions, adaptivity and error control. The method is applied to two examples one of which is a digital terrain model of Australia.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 77
    Publikationsdatum: 2015-06-01
    Beschreibung: In this article we present new results for families of orthogonal polynomials and special functions, that are determined by algorithmical approaches. In the first section, we present new results, especially for discrete families of orthogonal polynomials, obtained by an application of the celebrated Zeilberger algorithm. Next, we present algorithms for holonomic families $f(n,x)$ of special functions which possess a derivative rule. We call those families {\sl admissible}. A family $f(n,x)$ is holonomic if it satisfies a holonomic recurrence equation with respect to $n$, and a holonomic differential equation with respect to $x$, i.\ e. linear homogeneous equations with polynomial coefficients. The rather rigid property of admissibility has many interesting consequences, that can be used to generate and verify identities for these functions by linear algebra techniques. On the other hand, many families of special functions, in particular families of orthogonal polynomials, are admissible. We moreover present a method that generates the derivative rule from the holonomic representation of a holonomic family. % whenever one exists. As examples, we find new identities for the Jacobi polynomials and for the Whittaker functions, and for families of discrete orthogonal polynomials by the given approach. Finally, we present representations for the parameter derivatives of the Gegenbauer and the generalized Laguerre polynomials.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 78
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper the programs {\tt APPLYSYM}, {\tt QUASILINPDE} and {\tt DETRAFO} are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of {\tt QUASILINPDE} is the general solution of quasilinear PDEs. This procedure is used by {\tt APPLYSYM} for the application of point symmetries for either \begin{itemize} \item calculating similarity variables to perform a point transformation which lowers the order of an ODE or effectively reduces the number of explicitly occuring independent variables in a PDE(-system) or for \item generalizing given special solutions of ODEs/PDEs with new constant parameters. \end{itemize} The program {\tt DETRAFO} performs arbitrary point- and contact transformations of ODEs/PDEs and is applied if similarity and symmetry variables have been found. The program {\tt APPLYSYM} is used in connection with the program {\tt LIEPDE} for formulating and solving the conditions for point- and contact symmetries which is described in LIEPDE(1992). The actual problem solving is done in all these programs through a call to the package {\tt CRACK} for solving overdetermined PDE-systems.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 79
    Publikationsdatum: 2014-02-26
    Beschreibung: Spiral-like patterns are an often observed phenomenon in chemical experiments such as the Belousov-Zhabotinskii reaction. The talk is concerned with a new PDE model whose solutions have the form of rotating spirals. In contrast to previous approaches it is based on a {\em scalar\/} reaction diffusion equation defined on a disk. A particular choice of boundary conditions leads to a non-selfadjoint operator which permits non-trivial dynamics. We study this equation using a combination of equivariant bifurcation theory and numerical simulations. The latter involves the direct simulation of the time dependent system as well as the computation of rotating waves and their stability.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 80
    Publikationsdatum: 2014-02-26
    Beschreibung: In this paper we develop a method for the simulation of wave propagation on artificially bounded domains. The acoustic wave equation is solved at all points away from the boundaries by a pseudospectral Chebychev method. Absorption at the boundaries is obtained by applying one-way wave equations at the boundaries, without the use of damping layers. The theoretical reflection coefficient for the method is compared to theoretical estimates of reflection coefficients for a Fourier model of the problem. These estimates are confirmed by numerical results. Modification of the method by a transformation of the grid to allow for better resolution at the center of the grid reduces the maximum eigenvalues of the differential operator. Consequently, for stability the maximum timestep is $O(1/N)$ as compared to $O(1/N^2)$ for the standard Chebychev method. Therefore, the Chebychev method can be implemented with efficiency comparable to that of the Fourier method. Moreover, numerical results presented demonstrate the superior performance of the new method.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 81
    Publikationsdatum: 2014-02-26
    Beschreibung: {\def\xnew{x^{\mbox{\tiny new}}}\def\Z{{{\rm Z}\!\! Z}}For every fixed set ${\cal F}\subseteq\{0,1\}^n$ the following problems are strongly polynomial time equivalent: given a feasible point $x\in\cal F$ and a linear objective function $c\in\Z^n$, \begin{itemize} \item find a feasible point $x^*\in\cal F$ that maximizes $cx$ (Optimization), \item find a feasible point $\xnew\in\cal F$ with $c\xnew〉cx$ (Augmentation), and \item find a feasible point $\xnew\in\cal F$ with $c\xnew〉cx$ such that $\xnew-x$ is ``irreducible''\\(Irreducible Augmentation). \end{itemize} This generalizes results and techniques that are well known for $0/1$--integer programming problems that arise from various classes of combinatorial optimization problems.}
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 82
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2014-02-26
    Beschreibung: In the recent years symmetric chaos has been studied intensively. One knows which symmetries are admissible as the symmetry of an attractor and which transitions are possible. The numeric has been developed using equivariant functions for detection of symmetry and augmented systems for determination of transition points. In this paper we look at this from a sophisticated group theoretic point of view and from the view of scientific computing, i.e. efficient evaluation of detectives is an important point. The constructed detectives are based on Young's seminormal form for $S_n$. An application completes the paper.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 83
    Publikationsdatum: 2015-06-01
    Beschreibung: Orthogonal polynomials %like the Chebyshev polynomials can be calculated by computation of determinants, by the use of generating functions, in terms of Rodrigues formulas, by iterating recurrence equations, calculating the polynomial solutions of differential equations, through closed form representations and by other means. In this article, we give an overview about the efficiency of the above methods in Maple, Mathematica, and REDUCE. As a noncommercial package we include the MuPAD system.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 84
    Publikationsdatum: 2014-02-26
    Beschreibung: Many physical systems exhibit rapid motion coupled to a slowly varying motion. Often the rapid motion is associated with a stiff contribution in the potential energy function. In this context, the situation typically considered in the literature is the one with a strictly convex potential. Under some technical assumptions, one can then show that the slow motion is reproduced by a properly constrained system. In this paper we are concerned with a different situation: Often different time-scales can be found because of many local minima and barrier crossing between these minima. We suggest here to replace the detailed motion in the minima and the local barrier crossings by a statistical model which is then coupled to the slow equations of motion over long periods of time. This leads to Langevin type equations of motion subject to an appropriate time transformation.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 85
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper presents some connections between test sets and valid inequalities of integer programs. The reason for establishing such relationships is the hope that information (even partial) on one of these objects can be used to get information on the other and vice versa. We approach this study from two directions: On the one hand we examine the geometric process by which the secondary polytope associated with a matrix $A$ transforms to the state polytope as we pass from linear programs that have $A$ as coefficient matrix to the associated integer programs. The second direction establishes the notion of classes of augmentation vectors parallel to the well known concept of classes of facet defining inequalities for integer programs. We show how certain inequalities for integer programs can be derived from test sets for these programs.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 86
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper presents an explicit and symplectic integrator called PICKABACK for quantum-classical molecular dynamics. This integration scheme is time reversible and unitary in the quantum part. We use the Lie formalism in order to construct a formal evolution operator which then is split using the Strang splitting yielding the symplectic discretization PICHABACK. Finally the new method is compared with a hybrid method in application to two examples: a collinear collision with a quantum oscillator and additionally a photodissociation process of a collinear ArHCI-molecule.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 87
    Publikationsdatum: 2014-02-26
    Beschreibung: This paper makes use of statistical mechanics in order to construct effective potentials for Molecular Dynamics for systems with nonstationary thermal embedding. The usual approach requires the computation of a statistical ensemble of trajectories. In the context of the new model the evaluation of only one single trajectory is sufficient for the determination of all interesting quantities, which leads to an enormous reduction of computational effort. This single trajectory is the solution to a corrected Hamiltonian system with a new potential $\tilde{V}$. It turns out that $\tilde{V}$ can be defined as spatial average of the original potential $V$. Therefore, the Hamiltonian dynamics defined by $\tilde{V}$ is smoother than that effected by $V$, i.e. a numerical integration of its evolution in time allows larger stepsizes. Thus, the presented approach introduces a Molecular Dynamics with smoothed trajectories originating from spatial averaging. This is deeply connected to time--averaging in Molecular Dynamics. These two types of {\em smoothed Molecular Dynamics} share advantages (gain in efficiency, reduction of error amplification, increased stability) and problems (necessity of closing relations and adaptive control schemes) which will be explained in detail.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 88
    Publikationsdatum: 2014-02-26
    Beschreibung: Based on the concept of free energy, we give a Hamiltonian formulation for the torsion dynamics of macromolecules. The appropriate reaction coordinates for the free energy calculations are defined in terms of soft constraints as introduced in Brooks, B.R., Zhou, J., and Reich, S., Elastic molecular dynamics with flexible constraints, in preparation and Reich, S., Smoothed Dynamics of Highly Oscillatory Hamiltonian Systems, Physica D, to appear, 1995. We consider a few simplifications that allow one to calculate the free energy analytically and to write the corresponding equations of motion as a constrained Hamiltonian system. We also discuss a possible stochastic embedding of the reduced dynamics by means of a generalized Langevin approach.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 89
    Publikationsdatum: 2014-02-26
    Beschreibung: Integer stochastic linear programming is considered from the viewpoint of discontinuous optimization. After reviewing solution approaches via mollifier subgradients and decomposition we outline how to base a solution method on efficient pointwise calculation of the objective employing computer algebra.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 90
    Publikationsdatum: 2021-03-19
    Beschreibung: A set of adaptive algorithms for quadrature on multi-dimensional polyhedral domains is presented. Several kinds of refinement are discussed, covering local improvement of quadrature order and splitting the domain into sub-domains, resulting in isotropic, graded or anisotropic grids. The algorithms are pure local heuristics using no a priori knowledge or tuning parameters. This approach was motivated by results from finite element theory for optimal approximation results. Numerical experiments show the optimality of pure local greedy-like algorithms for singularity-type functions typically occurring in finite element computations.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 91
    Publikationsdatum: 2014-02-26
    Beschreibung: The first part of the report contains a lecture presented at ``Scientific Computing in der Theoretischen Physik'', a workshop organized by the DMV-Fachgruppe Scientific Computing in cooperation with the GAMM-Fachauschuß Scientific Computing at Freie Universit{ä}t Berlin in March 1994. To complete this lecture, a slightly modified version of TR 93-12 is appended.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 92
    Publikationsdatum: 2020-12-15
    Beschreibung: International Workshop with support of the Deutsche Forschungsgemeinschaft (DFG) and Max-Planck-Gesellschaft (MPG) Berlin (Dahlem), Germany, May 30 - June 2, 1995
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 93
    Publikationsdatum: 2015-06-01
    Beschreibung: In this report, we present a collection of new REDUCE packages that recently have been developed. These are the packages {\tt FPS}, {\tt ZTRANS}, {\tt RESIDUE} and {\tt TRIGSIMP} on the following topics: \begin{itemize} \item[] FPS Calculation of differential equations and formal power series representations, in particular for orthogonal polynomials and special functions of the hypergeometric type. \item[] ZTRANS Calculation of the Z-Transformation and its inverse. % to be used for the solution of linear recurrence equations. \item[] RESIDUE Calculation of residues of meromorphic functions. \item[] TRIGSIMP Simplification of expressions involving trigonometric and hyperbolic functions. \end{itemize} % These packages can be obtained via anonymous {\tt ftp} from % {\tt } in the directories {\tt ..}, ) For each of these packages, a description in form of a \LaTeX\ file is distributed together with the package. These documentations are collected here. In a final chapter, we show how to solve some difficult problems with these packages, and how they usefully can be combined.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 94
    Publikationsdatum: 2019-05-10
    Beschreibung: KASKADE 3.0 was developed for the solution of partial differential equations in one, two, or three space dimensions. Its object-oriented implementation concept is based on the programming language C++$\,$.~Adaptive finite element techniques are employed to provide solution procedures of optimal computational complexity. This implies a posteriori error estimation, local mesh refinement and multilevel preconditioning. The program was designed both as a platform for further developments of adaptive multilevel codes and as a tool to tackle practical problems. Up to now we have implemented scalar problem types like stationary or transient heat conduction. The latter one is solved with the Rothe method, enabling adaptivity both in space and time. Some nonlinear phenomena like obstacle problems or two-phase Stefan problems are incorporated as well. Extensions to vector-valued functions and complex arithmetic are provided. %Such free boundary problems ... We have implemented several iterative solvers for both symmetric and unsymmetric systems together with multiplicative and additive multilevel preconditioners. Systems arising from the nonlinear problems can be solved with lately developed monotone multigrid methods. %An object-oriented concept was chosen for KASKADE~3.0, based on the programming %language C++$\,$. This should provide the desired extensibilty and clearly %reflect the structure of the code. %A direct sparse matrix solver (Harwell MA28) is included.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 95
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2019-05-10
    Beschreibung: KASKADE 3.x was developed for the solution of partial differential equations in one, two, or three space dimensions. Its object-oriented implementation concept is based on the programming language C++$\,$.~Adaptive finite element techniques are employed to provide solution procedures of optimal computational complexity. This implies a posteriori error estimation, local mesh refinement and multilevel preconditioning. The program was designed both as a platform for further developments of adaptive multilevel codes and as a tool to tackle practical problems. Up to now we have implemented scalar problem types like stationary or transient heat conduction. The latter one is solved with the Rothe method, enabling adaptivity both in space and time. Some nonlinear phenomena like obstacle problems or two-phase Stefan problems are incorporated as well. Extensions to vector-valued functions and complex arithmetic are provided. This report helps to work with KASKADE Especially we \begin{itemize} \setlength{\parskip}{0ex} \item [{\bf --}] study a set of examples, \item [{\bf --}] explain how to define a user's problem and \item [{\bf --}] introduce a graphical user interface. \end{itemize} We are extending this guide continuously. The latest version is available by network.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 96
    Publikationsdatum: 2021-03-19
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 97
    Publikationsdatum: 2020-03-09
    Beschreibung: Line Integral Convolution (LIC) is a powerful technique for generating striking images and animations from vector data. Introduced in 1993, the method has rapidly found many application areas, ranging from computer arts to scientific visualization. Based upon locally filtering an input texture along a curved stream line segment in a vector field, it is able to depict directional information at high spatial resolutions. We present a new method for computing LIC images, which minimizes the total number of stream lines to be computed and thereby reduces computational costs by an order of magnitude compared to the original algorithm. Our methods utilizes fast, error-controlled numerical integrators. Decoupling the characteristic lengths in vector field grid, input texture and output image, it allows to compute filtered images at arbitrary resolution. This feature is of great significance in computer animation as well as in scientific visualization, where it can be used to explore vector data by smoothly enlarging structure of details. We also present methods for improved texture animation, employing constant filter kernels only. To obtain an optimal motion effect, spatial decay of correlation between intensities of distant pixels in the output image has to be controlled. This is achieved by blending different phase shifted box filter animations and by adaptively rescaling the contrast of the output frames.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 98
    Publikationsdatum: 2014-02-26
    Beschreibung: {\def\N{{\mbox{{\rm I\kern-0.22emN}}}}In this paper we introduce a multivariate grading of the toric ideal associated with the integer program $min \{ cx : Ax = b, x \in \N^n \}$, and a truncated Buchberger algorithm to solve the program. In the case of $max \{ cx : Ax \leq b, x \leq u, x \in \N^n \}$ in which all data are non-negative, this algebraic method gives rise to a combinatorial algorithm presented in UWZ94}.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 99
    Publikationsdatum: 2014-02-26
    Beschreibung: The aim of this paper is to demonstrate a specific application of Computer Algebra to bifurcation theory with symmetry. The classification of different bifurcation phenomena in case of several parameters is automated, based on a classification of Gröbner bases of possible tangent spaces. The computations are performed in new coordinates of fundamental invariants and fundamental equivariants, with the induced weighted ordering. In order to justify the approach the theory of intrinsic modules is applied. Results for the groups $D_3, Z_2,$ and $ Z_2\times Z_2$ demonstrate that the algorithm works independent of the group and that new results are obtained.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 100
    facet.materialart.
    Unbekannt
    Publikationsdatum: 2015-06-01
    Beschreibung: Recently, Todorov and Wilf independently realized that de Branges' original proof of the Bieberbach and Milin conjectures and the proof that was later given by Weinstein deal with the same special function system that de Branges had introduced in his work. In this article, we present an elementary proof of this statement based on the defining differential equations system rather than the closed representation of de Branges' function system. Our proof does neither use special functions (like Wilf's) nor the residue theorem (like Todorov's) nor the closed representation (like both), but is purely algebraic. On the other hand, by a similar algebraic treatment, the closed representation of de Branges' function system is derived. Our whole contribution can be looked at as the study of properties of the Koebe function. Therefore, in a very elementary manner it is shown that the known proofs of the Bieberbach and Milin conjectures can be understood as a consequence of the Löwner differential equation, plus properties of the Koebe function.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...