Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2014-02-26
    Description: In this paper we consider the multiple knapsack problem which is defined as follows: given a set $N$ of items with weights $f_i$, $i \in N$, a set $M$ of knapsacks with capacities $F_k$, $k \in M$, and a profit function $c_{ik}, i \in N, k \in M$; find an assignment of a subset of the set of items to the set of knapsacks that yields maximum profit (or minimum cost). With every instance of this problem we associate a polyhedron whose vertices are in one to one correspondence to the feasible solutions of the instance. This polytope is the subject of our investigations. In particular, we present several new classes of inequalities and work out necessary and sufficient conditions under which the corresponding inequality defines a facet. Some of these conditions involve only properties of certain knapsack constraints, and hence, apply to the generalized assignment polytope as well. The results presented here serve as the theoretical basis for solving practical problems. The algorithmic side of our study, i.e., separation algorithms, implementation details and computational experience with a branch and cut algorithm are discussed in the companion paper SC 93-07.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2014-02-26
    Description: The Lanczos iteration for symmetric indefinite linear systems seems to be well--known for quite a while. However, in order to modify it with the aim of improved performance, the present paper studies certain aspects in terms of an adjoint scalar three--term recurrence. Thus, at least a different view is opened. Moreover, an alternative $3n$--implementation in terms of the Euclidean orthogonal basis has been found that easily permits generalizations. The study is understood as a start--off for further numerical investigations and experiments.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2020-10-02
    Description: We consider the discretization of obstacle problems for second order elliptic differential operators in three space dimensions by piecewise linear finite elements. Linearizing the discrete problems by suitable active set strategies, the resulting linear sub--problems are solved iteratively by preconditioned cg--iterations. We propose a variant of the BPX preconditioner and prove an $O(j)$ estimate for the resulting condition number. To allow for local mesh refinement we derive semi--local and local a posteriori error estimates. The theoretical results are illustrated by numerical computations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2014-02-26
    Description: \def\KPA{\hbox{\rm KPA}}\def\A{{\rm A}}\def\KPW{\hbox{\rm KPW}}\def\W{{\rm W}}\def\B{{\rm B}} \def\D{{\rm D}} Recently M.~M.~Kapranov [Kap] defined a poset $\KPA_{n-1}$, called the {\it permuto-associahedron}, which is a hybrid between the face poset of the permutahedron and the associahedron. Its faces correspond to the partially parenthesized, ordered, partitions of the set $\{1,2,\ldots,n\}$, with a natural partial order. Kapranov showed that $\KPA_{n-1}$ is the face poset of a CW-ball, and explored its connection with a category-theoretic result of MacLane, Drinfeld's work on the Knizhnik-Zamolodchikov equations, and a certain moduli space of curves. He also asked the question of whether this CW-ball can be realized as a convex polytope. We show that this permuto-associahedron corresponds to the type $\A_{n-1}$ in a family of convex polytopes $\KPW$ associated to each of the classical Coxeter groups, $\W = \A_{n-1}, \B_n, \D_n$. The embedding of these polytopes relies on the secondary polytope construction of the associahedron due to Gel'fand, Kapranov, and Zelevinsky. Our proofs yield integral coordinates, with all vertices on a sphere, and include a complete description of the facet-defining inequalities. Also we show that for each $\W$, the dual polytope $\KPW^*$ is a refinement (as a CW-complex) of the Coxeter complex associated to $\W$, and a coarsening of the barycentric subdivision of the Coxeter complex. In the case $\W=\A_{n-1}$, this gives an elementary proof of Kapranov's original sphericity result.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2020-11-13
    Description: In this paper we describe and discuss a problem that arises in the (global) design of a main frame computer. The task is to assign certain functional units to a given number of so called multi chip modules or printed circuit boards taking into account many technical constraints and minimizing a complex objective function. We describe the real world problem. A thorough mathematical modelling of all aspects of this problem results in a rather complicated integer program that seems to be hopelessly difficult -- at least for the present state of integer programming technology. We introduce several relaxations of the general model, which are also $NP$-hard, but seem to be more easily accessible. The mathematical relations between the relaxations and the exact formulation of the problem are discussed as well.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2014-02-26
    Description: Cascadic conjugate gradient methods for the numerical solution of elliptic partial differential equations consists of Galerkin finite element methods as outer iteration and (possibly preconditioned) conjugate gradient methods as inner iteration. Both iterations are known to minimize the energy norm of the arising iterations errors. A simple but efficient strategy to control the discretization errors versus the PCG iteration errors in terms of energy error norms is derived and worked out in algorithmic detail. In a unified setting, the relative merits of different preconditioners versus the case of no preconditioning is compared. Surprisingly, it appears that the cascadic conjugate gradient method without any preconditioning is not only simplest but also fastest. The numerical results seem to indicate that the cascade principle in itself already realizes some kind of preconditioning. A theoretical explanation of these observations will be given in Part II of this paper.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Publication Date: 2014-02-26
    Description: This paper throws light on the connection between the optimal condition number estimate for the BPX method and constructive approximation theory. We provide a machinery, which allows to understand the optimality as a consequence of an approximation property and an inverse inequality in $H^{1+\epsilon}$, $\epsilon 〉 0$. This machinery constructs so-called {\em approximation spaces}, which characterize a certain rate of approximation by finite elements and relates them with interpolation spaces, which characterize a certain smoothness.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    facet.materialart.
    Unknown
    Publication Date: 2014-02-26
    Description: These lecture notes have several aims: \begin{itemize} \item to give an introduction to some basic facts about convex polytopes, with an emphasis on the basic methods that yield them (Fourier-Motzkin elimination, Schlegel diagrams, shellability, Gale transforms and oriented matroids), \item to discuss some important examples and elegant constructions (cyclic and neighborly polytopes, zonotopes, Minkowski sums, permutahedra and associahedra, fiber polytopes, the Lawrence construction) \item and to illustrate why polytope theory is exciting, with highlights like Kalai's new diameter bounds, the construction of non-rational polytopes, the Bohne-Dress tiling theorem, shellability and the upper bound theorem, .... \end{itemize} For several of these topics the decisive break-through is very recent, which suggests that there is much more discovered.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Publication Date: 2019-05-10
    Description: The KASKADE toolbox defines an interface to a set of C subroutines which can be used to implement adaptive multilevel Finite Element Methods solving systems of elliptic equations in two and three space dimensions. The manual contains the description of the data structures and subroutines. The main modules of the toolbox are a runtime environment, triangulation and node handling, assembling, direct and iterative solvers for the linear systems, error estimators, refinement strategies, and graphic utilities. Additionally, we included appendices on the basic command language interface, on file formats, and on the definition of the partial differential equations which can be solved. The software is available on the ZIB ftp--server {\tt elib} in the directory {\tt pub/kaskade}. TR 93--5 supersedes TR 89--4 and TR 89--05.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2020-10-02
    Description: In this paper various algorithms for rendering gaseous phenomena are reviewed. In computer graphics such algorithms are used to model natural scenes containing clouds, fog, flames and so on. On the other hand it has become an important technique in scientific visualization to display three dimensional scalar datasets as cloudy objects. Our emphasis is on this latter subject of so-called {\em direct volume rendering}. All algorithms will be discussed within the framework of linear transport theory. The equation of transfer is derived. This equation is suitable to describe the radiation field in a participating medium where absorption, emission, and scattering of light can occur. Almost all volume rendering algorithms can be shown to solve special cases of the equation of transfer. Related problems like the mapping from data values to model parameters or possible parallelization strategies will be discussed as well.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 11
    Publication Date: 2014-02-26
    Description: This report describes the new object oriented implementation of extrapolation codes {\sc Eulex, Eulsim, Difex} for ordinary differential equations. The resulting C++ class library provides a simple and flexible interface to these methods and incorporates advanced features like continuous output and order-stepsize freezing. The interface of the ODE classes allows in particular a user-defined solver for the linear systems occuring in the linearly implicit discretization scheme. The library also provides some classes for numerical objects such as vectors and (full) matrices. Due to the underlying data-view concept it is possible to access substructures without copying. In addition, we included several utility classes such as a timer and a minimal command language that may be useful in other contexts, too.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 12
    Publication Date: 2014-02-26
    Description: The problem of nonlocal correlation and symmetry in space is of great importance in physical phenomena like the \underline{Einstein-Poloski-Rosen-Paradox} and others. It is shown that in Cellular Automata (Rechnender Raum) the structure of the space offers solutions for such problems.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 13
    Publication Date: 2014-02-26
    Description: A software package for the adaptive solution of time--dependent reaction--diffusion systems and linear elliptic systems in one space dimension is presented. The used algorithm is based on fundamental arguments in J.~Lang, A.~Walter: {\it A Finite Element Method Adaptive in Space and Time for Nonlinear Reaction--Diffusion Systems.} IMPACT of Computing in Science and Engineering, 4, p.~269--314 (1992). Here, only brief outlines of the algorithm are given. This software package is based on the KASKADE toolbox B.~Erdmann, J.~Lang, R.~Roitzsch: {\it KASKADE -- Manual.} To appear as Technical Report TR 93--5, Konrad--Zuse--Zentrum (ZIB) (1993).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 14
    Publication Date: 2014-02-27
    Description: A new approach to inexact Gauss Newton methods for the solution of underdetermined nonlinear problems is presented. It is based on a convergence theorem being invariant under affine transformations of the domain and results in an easily implementable accuracy matching strategy for the arising linear subproblems which guarantees the quadratic convergence. Thanks to the weak assumptions on the given nonlinear problem, the results provide a general framework for multilevel Newton and continuation methods. As an example, a new multilevel Newton h-p collocation method for boundary value problems of ordinary differential equations is developed. It combines the inexact Newton method with a linear collocation solver using adaptive refinement and variable orders. The performance of the resulting C++ class library {\sc Cocon} is demonstrated by some numerical examples including singular perturbed problems. In addition, the new method is applied to a realistic railway bogie model in which a branch of periodic solutions emanates from a branch of fixed points at a Hopf bifurcation.
    Keywords: ddc:000
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 15
    Publication Date: 2014-02-27
    Description: A new method for the numerical solution of highly nonlinear, coupled systems of parabolic differential equations in one space dimension is presented. The approach is based on a classical method of lines treatment. Time discretization is done by means of the semi--implicit Euler discretization. Space discretization is done with finite differences on non--uniform grids. Both basic discretizations are coupled with extrapolation techniques. With respect to time the extrapolation is of variable order whereas just one extrapolation step is done in space. Based on local error estimates for both, the time and the space discretization error, the accuracy of the numerical approximation is controlled and the discretization stepsizes are adapted automatically and simultaneously. Besides the local adaptation of the space grids after each integration step (static regridding), the grid may even move within each integration step (dynamic regridding). Thus, the whole algorithm has a high degree of adaptivity. Due to this fact, challenging problems from applications can be solved in an efficient and robust way.
    Keywords: ddc:000
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 16
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 17
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 18
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 19
    Publication Date: 2020-08-05
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 20
    Publication Date: 2020-11-16
    Language: English
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 21
    Publication Date: 2014-02-26
    Description: We present an algorithm that is able to confirm projective incidence statements by carrying out calculations in the ring of all formal determinants (brackets) of a configuration. We will describe an implementation of this power and present a series of examples treated by the prover, including {\it Pappos' and Desargues' Theorems,} the {\it Sixteen Point Theorem, Saam's Theorem, }the {\it Bundle Condition,} the uniqueness of a harmonic Point and {\it Pascal's Theorem.}
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 22
    Publication Date: 2020-12-14
    Description: We consider the important practical and theoretical problem of designing a low-cost communications network which can survive failures of certain network components. Our initial interest in this area was motivated by the need to design certain ``two-connected" survivable topologies for fiber optic communication networks of interest to the regional telephone companies. In this paper, we describe some polyhedral results for network design problems with higher connectivity requirements. We also report on some preliminary computational results for a cutting plane algorithm for various real-world and random problems with high connectivity requirements which shows promise for providing good solutions to these difficult problems. \def\NP{$\cal NP$}
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 23
    Publication Date: 2014-02-26
    Description: The subject of this study is a multilevel Finite Element Method based on an error estimator and step by step grid refinement as an universal tool for solving time--independent Schrödinger--eigenvalue problems. Numerical results for standard problems appearing in vibrational motion and molecular electronic structure calculations are given and discussed.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 24
    Publication Date: 2014-02-26
    Description: In two-parameter systems with symmetry two steady state bifurcation points of different symmetry types coalesce generically within one point. Under certain group theoretic conditions involving the action of the symmetry group on the kernels, we show that secondary Hopf bifurcation is borne by the mode interaction. We explain this phenomenon by using linear representation theory. For motivation an example with $D_3$-symmetry is investigated where the main properties causing the Hopf bifurcation are summarized.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 25
    Publication Date: 2021-03-19
    Description: Adaptive numerical methods using the $h$-$p$-version of finite elements require special kinds of shape functions. Desirable properties of them are symmetry, hierarchy and simple coupling. In a first step it is demonstrated that for standard polynomial vector spaces not all of these features can be obtained simultaneously. However, this is possible if these spaces are extended. Thus a new class of polynomial shape functions is derived, which is well-suited for the $p$- and $h$-$p$-version of finite elements on unstructured simplices. The construction is completed by minimizing the condition numbers of the arising finite element matrices. The new shape functions are compared with standard functions widely used in the literature.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 26
    Publication Date: 2019-05-10
    Description: {\def\enorm {\mathop{\mbox{\boldmath{$|\!|$}}}\nolimits} Let $u \in H$ be the exact solution of a given self--adjoint elliptic boundary value problem, which is approximated by some $\tilde{u} \in {\cal S}$, $\cal S$ being a suitable finite element space. Efficient and reliable a posteriori estimates of the error $\enorm u - \tilde{u}\enorm $, measuring the (local) quality of $\tilde{u}$, play a crucial role in termination criteria and in the adaptive refinement of the underlying mesh. A well--known class of error estimates can be derived systematically by localizing the discretized defect problem using domain decomposition techniques. In the present paper, we provide a guideline for the theoretical analysis of such error estimates. We further clarify the relation to other concepts. Our analysis leads to new error estimates, which are specially suited to three space dimensions. The theoretical results are illustrated by numerical computations.}
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 27
    Publication Date: 2014-02-26
    Description: The strategy for solving nonlinear equation systems automatically in the computer algebra system REDUCE is described. Kernel of the solver is a factoring Buchberger algorithm. Pre -- and postprocessors enable the use of the Gröbner techniques in a black box manner. In addition to polynomials equations with surds, trigonometric functions and separable transcendental functions are covered.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 28
    Publication Date: 2020-10-02
    Language: English
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 29
    Publication Date: 2014-02-26
    Description: In this paper we describe a cutting plane based algorithm for the multiple knapsack problem. We use our algorithm to solve some practical problem instances arising in the layout of electronic circuits and in the design of main frame computers, and we report on our computational experience. This includes a discussion and evaluation of separation algorithms, an LP-based primal heuristic and some implementation details. The paper is based on the polyhedral theory for the multiple knapsack polytope developed in our companion paper SC 93-04 and meant to turn this theory into an algorithmic tool for the solution of practical problems.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 30
    Publication Date: 2020-12-14
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 31
    Publication Date: 2014-02-26
    Description: One key problem in modern chemistry is the simulation of the dynamical reaction of a molecule subjected to external radiation. This is described by the Schrödinger equation, which, after eigenfunction expansion, can be written in form of a system of ordinary differential equations, whose solutions show a highly oscillatory behaviour. The oscillations with high frequencies and small amplitudes confine the stepsizes of any numerical integrator -- an effect, which, in turn, blows up the simulation time. Larger stepsizes can be expected by averaging these fast oscillations, thus smoothing the trajectories. This idea leads to the construction of a quasiresonant smoothing algorithm (QRS). In QRS, a natural and computationally available splitting parameter $\delta$ controls the smoothing properties. The performance of QRS is demonstrated in two applications treating the selective excitation of vibrational states by picosecond laser pulses. In comparison with standard methods a speedup factor of 60--100 is observed. A closer look to purely physically motivated quasiresonant approximations such as WFQRA shows some additional advantages of the above smoothing idea. Among these the possibility of an adaptive formulation of QRS via the parameter $\delta$ is of particular importance.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 32
    Publication Date: 2020-11-16
    Description: This paper will appear as Chapter 28 of the forthcoming "Handbook on Combinatorics" (editors: R. Graham, M. Grötschel, L. Lovasz) to be published in 1994, by North-Holland.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 33
    Publication Date: 2014-02-26
    Description: An analysis of relaxation oscillations in local Er-doped optically pumped lasers is reported. It is based on a time dependent rate equation model for a quasi-two-level-system with wavelength dependent emission- and absorption cross-sections. For the first time a numerically reliable simulation of the characteristic laser behaviour was possible: the onset and decay of the oscillations, the time-dependent repetition period and the steady state signal output power. The characteristic waveguide parameters, as the erbium-concentration profile, the polarization dependent pump- and signal mode intensity profiles, the scattering losses, the cavity length and the front and rear reflectivities were all taken into account. The basic formulas are general and can also be used for Er-doped fiber lasers. Mathematically the problem can be characterized as a large boundary value problem, which can approximately be replaced by a stiff initial value problem of ordinary differential equations. The used algorithmic replacement procedure is motivated and discussed in detail. Here, pump- and signal evolution versus time are presented for an planar Er-diffused $\rm Ti$:$\rm LiNbO_{3}$ waveguide laser. The numerically obtained results show a nearly quantitative agreement with experimental investigations. Simultanously they supply knowledge about non-measureable (space-dependent population dynamic of the Er-atoms) and till today not measured data (dynamical response of the laser by a sharp peak in the external pump).
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 34
    Publication Date: 2014-02-26
    Description: We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include generating tables with fixed row and column sums and higher dimensional analogs. The algorithms involve finding bases for associated polynomial ideals and so an excursion into computational algebraic geometry.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 35
    Publication Date: 2014-02-26
    Description: Extending well--known linear concepts of successive subspace correction, we arrive at extended relaxation methods for elliptic variational inequalities. Extended underrelaxations are called monotone multigrid methods, if they are quasioptimal in a certain sense. By construction, all monotone multigrid methods are globally convergent. We take a closer look at two natural variants, which are called symmetric and unsymmetric multigrid methods, respectively. While the asymptotic convergence rates of the symmetric method suffer from insufficient coarse--grid transport, it turns out in our numerical experiments that reasonable application of the unsymmetric multigrid method may lead to the same efficiency as in the linear, unconstrained case.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 36
    Publication Date: 2014-02-26
    Description: Elliptic boundary value problems are frequently posed on complicated domains which cannot be covered by a simple coarse initial grid as it is needed for multigrid like iterative methods. In the present article, this problem is resolved for selfadjoint second order problems and Dirichlet boundary conditions. The idea is to construct appropriate subspace decompositions of the corresponding finite element spaces by way of an embedding of the domain under consideration into a simpler domain like a square or a cube. Then the general theory of subspace correction methods can be applied.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 37
    Publication Date: 2014-02-26
    Description: We prove a natural bijection between the polytopal tilings of a zonotope $Z$ by zonotopes, and the one-element-liftings of the oriented matroid ${\cal M}(Z)$ associated with $Z$. This yields a simple proof and a strengthening of the Bohne-Dress Theorem on zonotopal tilings.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 38
    facet.materialart.
    Unknown
    Publication Date: 2015-06-01
    Description: Formal Laurent-Puiseux series of the form \[ f(x)=\sum \limits_{k=k_0}^{\infty}a_{k}x^{k/n} \] are important in many branches of mathematics. Whereas {\sc Mathematica} supports the calculation of truncated series with its {\tt Series} command, and the {\sc Mathematica} package {\tt SymbolicSum} that is shipped with {\sc Mathematica} version 2 is able to convert formal series of the type mentioned above in some instances to their corresponding generating functions, in six publications of the author we developed an algorithmic procedure to do these conversions that is implemented by the author, A.\ Rennoch and G.\ Stölting in the {\sc Mathematica} package {\tt PowerSeries}. The implementation enables the user to reproduce most of the results of the extensive bibliography on series of Hansen, E.\ R.: A table of series and products. Prentice-Hall, 1975. Moreover a subalgorithm of its own significance generates differential equations satisfied by the input function.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 39
    Publication Date: 2015-06-01
    Description: {\newcommand{\C}{{\rm {\mbox{C{\llap{{\vrule height1.52ex}\kern.4em}}}}}} \newcommand{\Z} {{\rm {\mbox{\protect\makebox[.2em][l]{\sf Z}\sf Z}}}} \newcommand{\Maple}{{\sc Maple}} Formal Laurent-Puiseux series of the form \[ f(x)=\sum\limits_{k=k_0}^{\infty}a_{k}x^{k/n} \label{eq:formalLPS} \] with coefficients $a_{k}\in\C\;(k\in\Z)$ are important in many branches of mathematics. \Maple\ supports the computation of {\em truncated\/} series with its {\tt series} command, and through the {\tt powerseries} package infinite series are available. In the latter case, the series is represented as a table of coefficients that have already been determined together with a function for computing additional coefficients. This is known as {\em lazy evaluation\/}. But these tools fail, if one is interested in an explicit formula for the coefficients $a_k$. In this article we will describe the \Maple\ implementation of an algorithm presented in several papers of the second author which computes an {\em exact\/} formal power series of a given function. This procedure will enable the user to reproduce most of the results of the extensive bibliography on series. We will give an overview of the algorithm and then present some parts of it in more detail. This package is available through the \Maple-share library with the name {\tt FPS}. We flavor this procedure with the following example. %\begin{maple} \begin{verbatim}〉 FormalPowerSeries(sin(x), x=0);\end{verbatim} \begin{samepage} \begin{verbatim} infinity ----- k (2 k + 1) \ (-1) x ) ---------------- / (2 k + 1)! ----- k = 0 \end{verbatim} \end{samepage} }
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 40
    Publication Date: 2014-02-26
    Description: One of the challenging problems in the design of electronic circuits is the so-called routing problem. Roughly speaking, the task is to connect so-called terminal sets via wires on a predefined area. In addition, certain design rules are to be taken into account and an objective function such as the wiring length must be minimized. The routing problem in general is too complex to be solved in one step. Depending on the user's choice of decomposing the chip design problem into a hierarchy of stages, on the underlying technology, and on the given design rules, various subproblems arise. We discuss several variants of practically relevant routing problems and give a short overview on the underlying technologies and design rules. Many of the routing problems that come up this way can be formulated as the problem of packing so-called Steiner trees in certain graphs. We consider the Steiner tree packing problem from a polyhedral point of view and present three possibilities to define an appropriate polyhedron. Weighing their pros and cons we decide for one of these polytopes and sketch some of our investigations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 41
    Publication Date: 2014-02-26
    Description: We derive fast solvers for discrete elliptic variational inequalities of the second kind as resulting from the approximation by piecewise linear finite elements. Following the first part of this paper, monotone multigrid methods are considered as extended underrelaxations. Again, the coarse grid corrections are localized by suitable constraints, which in this case are fixed by fine grid smoothing. We consider the standard monotone multigrid method induced by the multilevel nodal basis and a truncated version. Global convergence results and asymptotic estimates for the convergence rates are given. The numerical results indicate a significant improvement in efficiency compared with previous multigrid approaches.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 42
    Publication Date: 2014-02-26
    Description: The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 43
    Publication Date: 2014-02-26
    Description: In this paper, a rather recent algorithmic approac to the numerical simulation of macromolecula processes is surveyed. It avoids the numerical stiff integration o thousands up to millions of ODE's by constructing a scale of discret Hilbert spaces, especially weighted sequence spaces, and establishing corresponding Galerkin method. Examples including polyreactions o industrial relevance and ecological waste management by biochemica recycling illustrate the importance and efficiency of the algorithm.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 44
    Publication Date: 2014-02-26
    Description: We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i.~e.,a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 45
    Publication Date: 2022-07-07
    Description: The paper presents a construction scheme of deriving transparent , i. e. reflection-free, boundary conditions for the numerical solution of Fresnel's equation (being formally equivalent to Schrödinger's equation). These boundary conditions appear to be of a nonlocal Cauchy type. As it turns out, each kind of linear implicit discretization induces its own discrete transparent boundary conditions.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 46
    Publication Date: 2022-07-07
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 47
    Publication Date: 2022-07-19
    Description: Sparse LU factorization offers some potential for parallelism, but at a level of very fine granularity. However, most current distributed memory MIMD architectures have too high communication latencies for exploiting all parallelism available. To cope with this, latencies must be avoided by coarsening the granularity and by message fusion. However, both techniques limit the concurrency, thereby reducing the scalability. In this paper, an implementation of a parallel LU decomposition algorithm for linear programming bases is presented for distributed memory parallel computers with noticable communication latencies. Several design decisions due to latencies, including data distribution and load balancing techniques, are discussed. An approximate performance model is set up for the algorithm, which allows to quantify the impact of latencies on its performance. Finally, experimental results for an Intel iPSC/860 parallel computer are reported and discussed.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 48
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 49
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 50
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 51
    Publication Date: 2022-07-19
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 52
    Publication Date: 2023-08-14
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 53
    Book
    Book
    Sebastopol, Ca. :O'Reilly,
    Title: Understanding DCE /
    Author: Rosenberry, Ward
    Contributer: Kenney, David , Fisher, Gerry
    Edition: 1. ed., minor corr.
    Publisher: Sebastopol, Ca. :O'Reilly,
    Year of publication: 1993
    Pages: XXV, 238 S.
    Series Statement: OSF distributed computing environment
    ISBN: 1-56592-005-8
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 54
    Title: Algebraic specification techniques and tools for software development : the ACT approach; 1
    Author: Claßen, Ingo
    Contributer: Ehrig, Hartmut , Wolz, Dietmar
    Publisher: Singapore u.a. :World Scientific,
    Year of publication: 1993
    Pages: XVI, 237 S. : graph. Darst.
    Series Statement: AMAST series in computing 1
    ISBN: 981-02-1227-5
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 55
    Book
    Book
    Berlin [u.a.] :Springer,
    Title: Constructive approximation /; 303
    Author: DeVore, Ronald A.
    Contributer: Lorentz, George G.
    Publisher: Berlin [u.a.] :Springer,
    Year of publication: 1993
    Pages: X, 449 S. : , graph. Darst.
    Series Statement: ¬Die¬ Grundlehren der mathematischen Wissenschaften 303
    ISBN: 3-540-50627-6 , 0-387-50627-6
    Type of Medium: Book
    Language: English
    URL: 04
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 56
    Book
    Book
    Louvain-la-Neuve :CORE Foundation,
    Title: Lectures on computation of equilibria with equation based methods /
    Author: Harker, Patrick T.
    Publisher: Louvain-la-Neuve :CORE Foundation,
    Year of publication: 1993
    Pages: VII, 181 S.
    Series Statement: CORE lecture series
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 57
    Book
    Book
    New York, NY [u.a.] :Springer,
    Title: ¬The¬ joy of sets /
    Author: Devlin, Keith J.
    Edition: 2. ed., corr. printing.
    Publisher: New York, NY [u.a.] :Springer,
    Year of publication: 1993
    Pages: X, 192 S. : , graph. Darst.
    Series Statement: Undergraduate texts in mathematics
    ISBN: 3-540-94094-4 , 0-387-94094-4
    Type of Medium: Book
    Language: English
    Subsequent Title: Fundamentals of contemporary set theory
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 58
    Title: Netflow93: Network Optimization, Theory and Practice. San Miniato (PI) Italy, October 3-7, 1993 /
    Author: Università degli studi di Pisa Dipartimento di informatica
    Year of publication: 1993
    Pages: 247 S.
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 59
    Publication Date: 2020-12-15
    Description: The present paper contains a generalization of a refinement of the Newton- Mysovskii theorem, recently obtained by the authors, to the case of Gauss-Newton procedures for solving nonlinear least-squares problems with full Jacobians. Invariant sufficient conditions are given that ensure the convergence of the Gauss-Newton iterates towards a solution of the problem, as well as the uniqueness of that solution in an explicitely defined neighborhood. It is shown by a counter- example that the results do not carry over to the rank deficient case.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 60
    Publication Date: 2014-02-26
    Description: The breakdown voltage highly depends on the electric field in the depletion area whose computation is the most time consuming part of the simulation. We present a self adaptive Finite Element Method which reduces dramatically the required computation time compared to usual Finite Difference Methods. A numerical example illustrates the efficiency and reliability of the algorithm.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 61
    Publication Date: 2014-02-26
    Description: Part III of the paper is devoted to the construction of an adaptive FEM solver in two spatial dimensions, which is able to handle the singularly perturbed elliptic problems arising from discretization in time. The problems of error estimation and multilevel iterative solution of the linear systems - both uniformly well behaved with respect to the time step - can be solved simultaneously within the framework of preconditioning. A multilevel nodal basis preconditioner able to handle highly nonuniform meshes is derived. As a numerical example an application of the method to the bioheat-transfer equation is included. {\bf AMS CLASSIFICATION:} 65F10, 65F35, 65M50, 65M60, 65N30.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 62
    Publication Date: 2020-09-24
    Description: Most nonlinear computations require the evaluation of first and higher derivatives of vector functions defined by computer programs. It is shown here how vectors of such partial derivatives can be obtained automatically and efficiently if the computer language allows overloading (as is or will be the case for C++, PASCAL-XSC, FORTRAN90, and other modern languages). Here, overloading facilitates the extension of arithmetic operations and univariate functions from real or complex arguments to truncated Taylor-series (or other user- defined types), and it generates instructions for the subsequent evaluation of adjoints. Similar effects can be achieved by precompilation of FORTRAN77 programs. The proposed differentiation algorithm yields gradients and higher derivatives at a small multiple of the run-time and RAM requirement of the original function evaluation program. {\bf Keywords:} Automatic Differentiation, Chain Rule, Overloading, Taylor Coefficients, Gradients, Hessians, Reverse Accumulation, Adjoint Equations. {\bf Abbreviated title:} Automatic Differentiation by Overloading.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 63
    Publication Date: 2014-02-26
    Description: The description of chain length distributions in macromolecular reaction kinetics leads to so-called countable systems of differential equations. In particular, when the appearing reaction rate coefficients depend on the chain length of the reacting macromolecules itself, an efficient numerical treatment of these systems is very difficult. Then even the evaluation of the right-hand side of the system can become prohibitively expensive with respect to computing time. In this paper we show how the discrete Galerkin method can be applied to such problems. The existing algorithm CODEX is improved by use of a multiplicative error correction scheme for time discretization and a new type of numerical preprocessing by means of a Gauss summation. Both ideas are exemplary for a wide class of approximation types and are described very briefly here. The new numerical techniques are tested on an example from soot formation, where the coagulation of molecules is modeled in terms of reaction coefficients depending on the surface of the particles and their collision frequency.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 64
    Publication Date: 2014-02-26
    Description: The numerical solution of optimal control problems by indirect methods (such as multiple shooting or collocation) requires a considerable amount of analytic calculation to establish a numerically tractable system. These analytic calculations, though being rather tedious in realistic examples, are nowadays mostly still done by hand-and thus prone to calculation errors. The paper aims at automating this analytic processing to a reasonable extent by means of a modern symbolic manipulation language (here: REDUCE). In its present stage of development the package OCCAL (mnemotechnically for \underline{O}ptimal \underline{C}ontrol \underline{CAL}culator) permits an interactive use, covering tasks like automatic determination of control and, in case of a singular control, of its order. In simpler problems, the present version of OCCAL automatically produces the full subroutine input for a MULtiple shooting code (MULCON) with adaptive numerical CONtinuation. In more complicate problems where singular sub-arcs may occur or where the sequence of sub-arcs of the optimal trajectory is unclear OCCAL is a significant help in reducing analytic pre-processing. Numerical examples illustrate the performance of OCCAL/MULCON.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 65
    Publication Date: 2014-02-26
    Description: If $B$ is an arrangement of linear complex Hyperplanes in $C^d$, then the following can be constructed from knowledge of its intersection lattice: (a) the cohomology groups of the complement [Br], (b) the cohomology algebra of the complement [OS], (c) the fundamental group of the complement, if $d\le2$, (d) the singularity link up to homeomorphism, if $d\le3$, (e) the singularity link up to homotopy type [ZZ]. If $B'$ is, more generally, a 2-arrangement in $ R^{2d}$ (an arrangement of real subspaces of codimension 2 with even-dimensional intersections), then the intersection lattice still determines (a) the cohomology groups of the complement [GM] and (e) the homotopy type of the singularity link [ZZ]. We show, however, that for 2-arrangements the data (b), (c) and (d) are not determined by the intersection lattice. They require the knowledge of extra information on sign patterns, which can be computed as determinants of linear relations, or (equivalently) as linking coefficients in the sense of knot theory.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 66
    Publication Date: 2014-02-26
    Description: We prove combinatorial formulas for the homotopy type of the union of the subspaces in an (affine, compactified affine, spherical or projective) subspace arrangement. From these formulas we derive results of Goresky & MacPherson on the homology of the arrangement and the cohomology of its complement. The union of an arrangement can be interpreted as the direct limit of a diagram of spaces over the intersection poset. A closely related space is obtained by taking the homotopy direct limit of this diagram. Our method consists in constructing a combinatorial model diagram over the same poset, whose homotopy limit can be compared to the original one by usual homotopy comparison results for diagrams of spaces.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 67
    Publication Date: 2014-02-26
    Description: A new adaptive multilevel approach for linear partial differential equations is presented, which is able to handle complicated space geometries, discontinuous coefficients, inconsistent initial data. Discretization in time first (Rothe's method) with order and stepsize control is perturbed by an adaptive finite element discretization of the elliptic subproblems, whose errors are controlled independently. Thus the high standards of solving adaptively ordinary differential equations and elliptic boundary value problems are combined. A theory of time discretization in Hilbert space is developed which yields to an optimal variable order method based on a multiplicative error correction. The problem of an efficient solution of the singularly perturbed elliptic subproblems and the problem of error estimation for them can be uniquely solved within the framework of preconditioning. A Multilevel nodal basis preconditioner is derived, which allows the use of highly nonuniform triangulations. Implementation issues are discussed in detail. Numerous numerical examples in one and two space dimensions clearly show the significant perspectives opened by the new algorithmic approach. Finally an application of the method is given in the area of hyperthermia, a recent clinical method for cancer therapy.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 68
    Publication Date: 2020-03-06
    Description: NUMSIM 91 fand vom 6.-08. Mai 1991 im Wissenschaftlichen Kommunikations- & Konferenz- Zentrum der Humboldt-Universität in Gosen bei Berlin statt. Im Mittelpunkt dieses Seminars standen Probleme der numerischen Simulation von Ladungstransport- und Technologieprozessen der Mikro- und Optoelektronik. Es führte Spezialisten der physikalischen Modellierung, der numerischen Mathematik und mathematischen Analysis sowie Nutzer von Simulationsprogrammen aus dem deutschsprachigen Raum zusammen. Ziel war die Vermittlung und der Austausch von Erfahrungen, die Diskussion gemeinsamer Aufgabenstellungen und Projekte und - in Anbetracht der deutschen Vereinigung nicht zuletzt - das gegenseitige Kennen- und Verstehenlernen.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 69
    Publication Date: 2020-03-06
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 70
    Publication Date: 2020-10-02
    Language: English
    Type: book , doc-type:book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 71
    Publication Date: 2021-03-16
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 72
    Publication Date: 2020-08-05
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 73
    Publication Date: 2020-08-05
    Language: English
    Type: bookpart , doc-type:bookPart
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 74
    Publication Date: 2020-08-05
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 75
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 76
    Publication Date: 2020-08-05
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 77
    Publication Date: 2020-08-05
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 78
    Publication Date: 2014-02-26
    Description: In this paper we introduce a discontinuous finite element method. In our approach, it is possible to combine the advantages of finite element and finite difference methods. The main ingredients are numerical flux approximation and local orthogonal basis functions. The scheme is defined on arbitrary triangulations and can be easily extended to nonlinear problems. Two different error indicators are derived. Especially the second one is closely connected to our approach and able to handle arbitrary variing flow directions. Numerical results are given for boundary value problems in two dimensions. They demonstrate the performance of the scheme, combined with the two error indicators. {\bf Key words:} neutron transport equation, discontinuous finite element, adaptive grid refinement. {\bf Subject classifications:} AMS(MOS) 65N30, 65M15.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 79
    Publication Date: 2014-02-26
    Description: In this paper it is shown that for highly nonuniformly refined triangulations the condition number of the BPX preconditioner for elliptic finite element problems grows at most linearly in the depth of refinement. This is achieved by viewing the computational available version of the BPX preconditioner as an abstract additive Schwarz method with exact solvers. {\bf AMS CLASSIFICATION:} 65F10, 65F35, 65N20, 65N30.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 80
    Publication Date: 2014-02-26
    Description: We study the space of all extensions of a real hyperplane arrangement by a new pseudo- hyperplane, and, more generally, of an oriented matroid by a new element. The question whether this space has the homotopy type of a sphere is a special case of the "Generalized Baues Problem" of Billera, Kapranov & Sturmfels, via the Bohne-Dress Theorem on zonotopal tilings. We prove that the extension space is spherical for the class of strongly euclidean oriented matroids. This class includes the alternating matroids and all oriented matroids of rank at most 3 or of corank at most 2. In general it is not even known whether the extension space is connected. We show that the subspace of realizable extensions is always connected but not necessarily spherical.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 81
    Publication Date: 2014-02-26
    Description: We consider such variational inequalities which either describe obstacle problems or result from an implicit time discretization of moving boundary problems of two phase Stefan type. Based on a discretization in space by means of continuous, piecewise linear finite elements with respect to a nested hierarchy of triangulations, in both cases we use iterative processes consisting of inner and outer iterations. The outer iterations are either active set strategies or generalized Newton methods while the inner iterations are preconditioned cg- iterations with multilevel preconditioners.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 82
    Publication Date: 2014-02-26
    Description: One-step discretizations of order $p$ and step size $\varepsilon$ of ordinary differential equations can be viewed as time-$\varepsilon$ maps of \begin{displaymath} \dot{x} (t) = f(\lambda ,x(t)) + \varepsilon^p g(\varepsilon,\lambda,t/\varepsilon,x(t)), x \in R^N,\lambda \in R, \end{displaymath} where $g$ has period $\varepsilon$ in $t$. This is a rapidly forced nonautonomous system. We study the behavior of a homoclinit orbit $\Gamma$ for $\varepsilon = 0, \lambda =0$, under discretization. Under generic assumptions we show that $\Gamma$ becomes transverse for positive $\in$. The transversality effects are estimated from above to be exponentially small in $\in$. For example, the length $l(\varepsilon$) of the parameter interval of $\lambda$ for which $\Gamma$ persists can be estimated by \begin{displaymath} l(\varepsilon)\le Cexp(-2\pi\eta/\varepsilon), \end{displaymath} where $C,\eta$ are positive constants. The coefficient $\eta$ is related to the minimal distance from the real axis of the poles of $\Gamma(t)$ in the complex time domain. Likewise, the region where complicated, "chaotic" dynamics prevail is estimated to be exponentially small, provided $x \in R^2$ and the saddle quantity of the associated equilibrium is nonzero. Our results are visualized by high precision numerical experiments. The experiments show that, due to exponential smallness, homoclinic transversality becomes pratically invisible under normal circumstances, already for only moderately small step size. {\bf Keywords:} Homoclinic orbit, ordinary differential equations, discretization, transversality, averaging, exponential smallness, chaos. {\bf Subject Classifications:} (AMS): 34C15, 34C35, 58F14, 65L60
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 83
    Publication Date: 2014-02-26
    Description: We consider the discretization of obstacle problems for the Laplacian by piecewise linear finite elements. Assuming that the discrete problems are reduced to a sequence of linear problems by suitable active set strategies, the linear problems are solved iteratively by preconditioned c-g iterations. The proposed preconditioners are treated theoretically as abstract additive Schwarz methods and are implemented as truncated hierarchical basis preconditioners. To allow for local mesh refinement we derive semi-local and local a posteriori error estimates, providing lower and upper estimates for the discretization error. The theoretical results are illustrated by numerical computations.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 84
    Publication Date: 2014-02-26
    Description: Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and statistics. They can be considered as ordinary differential equations in sequence spaces. In this work, a fully adaptive algorithm for the computational treatment of such systems is developed. The method is based on a time discretization of an abstract Cauchy problem in Hilbert space and a discrete Galerkin approach for the discretization of the arising stationary subproblems. The Galerkin method uses orthogonal functions of a discrete variable, which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations are solved adaptively either by use of analytical properties of the orthogonal functions or by an appropriate numerical summation. The resulting algorithm CODEX is applied to examples of technological interest, in particular from polymer chemistry.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 85
    Publication Date: 2014-02-26
    Description: The deformation of a hexagonal lattice dome under an external load is an example of a parameter dependent system which is equivariant under the symmetry group of a regular hexagon. In this paper the mixed symbolic-numerical algorithm SYMCON is applied to analyze its steady state solutions automatically showing their different symmetry and stability properties.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 86
    Publication Date: 2014-02-26
    Description: We study the higher Bruhat orders $B(n,k)$ of Manin & Schechtman [MaS] and - characterize them in terms of inversion sets, - identify them with the posets $U(C^{n+1,r},n+1)$ of uniform extensions of the alternating oriented matroids $C^{n,r}$ for $r:=n-k$ (that is, with the extensions of a cyclic hyperplane arrangement by a new oriented pseudoplane), - show that $B(n,k)$ is a lattice for $k =1$ and for $r\le 3$, but not in general, - show that $B(n,k)$ is ordered by inclusion of inversion sets for $k=1$ and for $r\le 4$. However, $B(8,3)$ is not ordered by inclusion. This implies that the partial order $B_\subseteq (n,k)$ defined by inclusion of inversion sets differs from $B(n,k)$ in general. We show that the proper part of $B_\subseteq (n,k)$ is homotopy equivalent to $S^{r-2}$. Consequently, - $B(n,k)\simeq S^{r-2}$ for $k=1$ and for $r\le 4$. In contrast to this, we find that the uniform extension poset of an affine hyperplane arrangement is in general not graded and not a lattice even for $r=3$, and that the proper part is not always homotopy equivalent to $S^{r(M)-2}$.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 87
    Publication Date: 2019-05-10
    Description: The C-implementation of KASKADE, an adaptive solver for linear elliptic differential equations in 2D, is object of a set of numerical experiments to analyze the use of resources (time and memory) with respect to numerical accuracy. We study the dependency of the reliability, robustness, and efficiency of the program from the parameters controlling the algorithm.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 88
    Publication Date: 2014-02-26
    Description: A high resolution Godunov-type method is developed and applied to a two-dimensional version of the Burgers equation. On one-dimensional testproblems the scheme is second order accurate for smooth flow and resolves discontinuities sharply. On two-dimensional problems, however, large numerical oscillations are introduced when discontinuities traveling obliquely to the grid directions are present. These oscillations are caused by a Strang- type operator splitting, and cannot be eliminated using flux limiters or small timesteps. {\bf Keywords:} High resolution methods, Godunovs method, operator splitting, complex Burgers equation. {\bf AMS:} 35: A40, L45, L60, L65, L, 67. 65: M05, M10.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 89
    Publication Date: 2014-02-26
    Description: For adaptive solution of convection- difussion problems with the streamline-diffusion finite element method, an error estimator based on interpolation techniques is developed. It can be shown that for correctness of this error estimator a restriction of the maximum angle is to be sufficient. Compared to usual methods, the adaptive process leads to more accurate solutions at much less computational cost. Numerical tests are enclosed. {\bf Keywords: } Adaptive finite elements, convection- diffusion equation, internal and boundary layers, streamline-diffusion. {\bf Subject Classifications:} AMS(MOS): 65N15, 65N30
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 90
    Publication Date: 2014-02-26
    Description: The success of the German Reunification requires a unique migration from the traditional Eastern Block system to a modern free society. The successful migration must include a shift from a low state of the art in technology to the high level of science and technology present in the Western Community. The role of supercomputing in this transition will include leading the process of organizational change in research and development. The paper contains a short overview on the current state of this evolution, on the currently used political and administrative tools to keep this evolution on track, and on the influence on the Konrad-Zuse-Zentrum, which is, as a Berlin institution, in the geographical and cultural center of this transformation.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 91
    Publication Date: 2014-02-26
    Description: The following report intends to provide a survey over the computational chemistry molecular structure software installed on CRAY X-MP/24 at ZIB. It shows what kind of problems can be tackled with the existing chemistry software, which covers a wide range of ab initio, semiempirical, molecular mechanics, and dynamics applications.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 92
    Publication Date: 2022-07-07
    Description: An adaptive approach to the numerical solution of the wave propagation in integrated optics devices with 1D cross sections is described. First, Fresnel's approximation of the exact wave equation resulting from Maxwell's equations is considered. A criterion to estimate the validity of this approximation is derived. Fresnel's wave equation being formally equivalent to Schroedinger's equation uniquely defines an initial-boundary-value problem, which is solved numerically by a stepwise calculation of the propagating field. Discretization in longitudinal direction first with stepsize control leads to a stationary subproblem for the transversal field distribution, which is then handled by an adaptive finite element method. Thus full adaptivity of the algorithm is realized. The numerical examples are concentrated on taper structures playing an essential role in integrated optics devices for telecommunication systems.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 93
    Publication Date: 2022-07-19
    Language: English
    Type: conferenceobject , doc-type:conferenceObject
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 94
    Title: Singular perturbation methods for ordinary differential equations /; 89
    Author: O'Malley, Robert E.
    Publisher: New York [u.a.] :Springer,
    Year of publication: 1991
    Pages: VIII, 225 S. : , Ill ; , 24 cm
    Series Statement: Applied mathematical sciences 89
    ISBN: 3-540-97556-X , 0-387-97556-X
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 95
    Book
    Book
    Bellingham, Wash., USA :SPIE Optical Engineering Press,
    Title: Aberration theory made simple /; TT 6
    Author: Mahajan, Virendra N.
    Publisher: Bellingham, Wash., USA :SPIE Optical Engineering Press,
    Year of publication: 1991
    Pages: xx, 166 p. : , Ill., graph. Darst.
    Series Statement: Tutorial texts in optical engineering TT 6
    ISBN: 0-8194-0536-1
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 96
    Book
    Book
    Hayward, Calif. :Inst. of Mathematical Statistics,
    Title: Stochastic orders and decision under risk /; 19
    Contributer: Mosler, Karl , International Workshop on Stochastic Orders and Decision under Risk 〈1989, Hamburg〉 , International Workshop on Stochastic Orders and Decision under Risk Hamburg 1989.05.16-20
    Publisher: Hayward, Calif. :Inst. of Mathematical Statistics,
    Year of publication: 1991
    Pages: XIV, 392 S. : , Ill
    Series Statement: Institute of Mathematical Statistics 〈Hayward, Calif.〉: Lecture notes, monograph series 19
    ISBN: ISBN 0-940600-26-9
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 97
    Book
    Book
    New York [u.a.] :Springer,
    Title: Numbers /; 123
    Contributer: Ebbinghaus, Heinz-Dieter , Ewing, John H.
    Uniform Title: Zahlen 〈engl.〉
    Edition: 1st softcover ed.
    Publisher: New York [u.a.] :Springer,
    Year of publication: 1991
    Pages: XVIII, 391 S. : , Ill. und graph. Darst. ; , 24 cm
    Series Statement: Graduate texts in mathematics 123
    ISBN: 3-540-97497-0 , 0-387-97497-0
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...