Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2005-2009  (51)
  • 1980-1984  (1,224)
  • 1960-1964
  • 1890-1899
  • 2006  (51)
  • 1984  (1,224)
  • General Chemistry  (862)
  • Engineering  (362)
  • ddc:000
Source
Material
Years
  • 2005-2009  (51)
  • 1980-1984  (1,224)
  • 1960-1964
  • 1890-1899
Year
Keywords
Language
  • 1
    facet.materialart.
    Unknown
    Jahresbericht 2005 (2006)
    Details
    Publication Date: 2019-10-24
    Keywords: ddc:000
    Language: German
    Type: annualzib , doc-type:report
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 2
    facet.materialart.
    Unknown
    Convergence of the Control Reduced Interior Point Method for PDE Constrained Optimal Control with State Constraints (2006)
    Details
    Publication Date: 2014-02-26
    Description: We propose a variant of the control reduced interior point method for the solution of state constrained problems. We show convergence of the corresponding interior point pathfollowing algorithm in function space. Morever, we provide error bounds for the iterates.
    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 ...
    OPUS
  • 3
    facet.materialart.
    Unknown
    A Complex Mathematical Model of the Human Menstrual Cycle (2006)
    Details
    Publication Date: 2014-02-26
    Description: This paper aims at presenting the complex coupled network of the human menstrual cycle to the interested community. Beyond the presently popular smaller models, where important network components arise only as extremely simplified source terms, we add: the GnRH pulse generator in the hypothalamus, receptor binding, and the biosynthesis in the ovaries. Simulation and parameter identification are left to a forthcoming paper.
    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 ...
    OPUS
  • 4
    facet.materialart.
    Unknown
    A continuity result for Nemyckii Operators and some applications in PDE constrained optimal control (2006)
    Details
    Publication Date: 2014-02-26
    Description: This work explores two applications of a classical result on the continuity of Nemyckii operators to optimal control with PDEs. First, we present an alternative approach to the analysis of Newton's method for function space problems involving semi-smooth Nemyckii operators. A concise proof for superlinear convergence is presented, and sharpened bounds on the rate of convergence are derived. Second, we derive second order sufficient conditions for problems, where the underlying PDE has poor regularity properties. We point out that the analytical structure in both topics is essentially the same.
    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 ...
    OPUS
  • 5
    facet.materialart.
    Unknown
    Nash Equilibria in Online Sequential Routing Games (2006)
    Details
    Publication Date: 2014-02-26
    Description: In this paper, we study the efficiency of Nash equilibria for a sequence of nonatomic routing games. We assume that the games are played consecutively in time in an online fashion: by the time of playing game $i$, future games $i+1,\dots,n$ are not known, and, once players of game $i$ are in equilibrium, their corresponding strategies and costs remain fixed. Given a sequence of games, the cost for the sequence of Nash equilibria is defined as the sum of the cost of each game. We analyze the efficiency of a sequence of Nash equilibria in terms of competitive analysis arising in the online optimization field. Our main result states that the online algorithm $\sl {SeqNash}$ consisting of the sequence of Nash equilibria is $\frac{4n}{2+n}$-competitive for affine linear latency functions. For $n=1$, this result contains the bound on the price of anarchy of $\frac{4}{3}$ for affine linear latency functions of Roughgarden and Tardos [2002] as a special case. Furthermore, we analyze a problem variant with a modified cost function that reflects the total congestion cost, when all games have been played. In this case, we prove an upper bound of $\frac{4n}{2+n}$ on the competitive ratio of $\sl {SeqNash}$. We further prove a lower bound of $\frac{3n-2}{n}$ of $\sl {SeqNash}$ showing that for $n=2$ our upper bound is tight.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 6
    facet.materialart.
    Unknown
    Adaptive, Fast and Oblivious Convolution in Evolution Equations with Memory (2006)
    Details
    Publication Date: 2016-06-09
    Description: To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing $N$ steps requires only $O(N\log N)$ operations and $O(\log N)$ active memory, in place of $O(N^2)$ operations and $O(N)$ memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a blow-up example originating from a Schrödinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.
    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 ...
    OPUS
  • 7
    facet.materialart.
    Unknown
    Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics (2006)
    Details
    Publication Date: 2020-11-13
    Description: This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, we present three heuristics for solving important subproblems, two of which solve a sub-MIP. On multi-layer planning instances with many parallel logical links, we show the effectiveness of our heuristics in finding good solutions early in the branch-and-cut search tree.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 8
    facet.materialart.
    Unknown
    Adaptive Finite Element Simulation of Ventricular Fibrillation Dynamics (2006)
    Details
    Publication Date: 2019-05-10
    Description: The dynamics of ventricular fibrillation caused by irregular excitation is simulated in the frame of the monodomain model with an action potential model due to Aliev-Panfilov for a human 3D geometry. The numerical solution of this multiscale reaction-diffusion problem is attacked by algorithms which are fully adaptive in both space and time (code library {\sc Kardos}). The obtained results clearly demonstrate an accurate resolution of the cardiac potential during the excitation and the plateau phases (in the regular cycle) as well as after a reentrant excitation (in the irregular cycle).
    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 ...
    OPUS
  • 9
    facet.materialart.
    Unknown
    Orbitopal Fixing (2006)
    Details
    Publication Date: 2020-12-15
    Description: The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the permutation of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up the branch-and-cut tree. We present a general tool, called orbitopal fixing, for enhancing the capabilities of branch-and-cut algorithms in solving this kind of symmetric integer programming models. We devise a linear time algorithm that, applied at each node of the branch-and-cut tree, removes redundant parts of the tree produced by the above mentioned permutations. The method relies on certain polyhedra, called orbitopes, which have been investigated in (Kaibel and Pfetsch (2006)). However, it does not add inequalities to the model, and thus, it does not increase the difficulty of solving the linear programming relaxations. We demonstrate the computational power of orbitopal fixing at the example of a graph partitioning problem motivated from frequency planning in mobile telecommunication networks.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 10
    facet.materialart.
    Unknown
    Approximability of Unsplittable Shortest Path Routing Problems (2006)
    Details
    Publication Date: 2014-11-10
    Description: In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph $D=(V,A)$ and a set $K$ of directed commodities, an USPR is a set of flow paths $\Phi_{(s,t)}$, $(s,t)\in K$, such that there exists a metric $\lambda=(\lambda_a)\in \mathbb{Z}^A_+$ with respect to which each $\Phi_{(s,t)}$ is the unique shortest $(s,t)$-path. In the \textsc{Min-Con-USPR} problem, we seek for an USPR that minimizes the maximum congestion over all arcs. We show that this problem is hard to approximate within a factor of $\mathcal{O}(|V|^{1-\epsilon})$, but easily approximable within min$(|A|,|K|)$ in general and within $\mathcal{O}(1)$ if the underlying graph is an undirected cycle or a bidirected ring. We also construct examples where the minimum congestion that can be obtained by USPR is a factor of $\Omega(|V|^2)$ larger than that achievable by unsplittable flow routing or by shortest multi-path routing, and a factor of $\Omega(|V|)$ larger than by unsplittable source-invariant routing. In the CAP-USPR problem, we seek for a minimum cost installation of integer arc capacities that admit an USPR of the given commodities. We prove that this problem is $\mathcal{NP}$-hard to approximate within $2-\epsilon$ (even in the undirected case), and we devise approximation algorithms for various special cases. The fixed charge network design problem \textsc{Cap-USPR}, where the task is to find a minimum cost subgraph of $D$ whose fixed arc capacities admit an USPR of the commodities, is shown to be $\mathcal{NPO}$-complete. All three problems are of great practical interest in the planning of telecommunication networks that are based on shortest path routing protocols. Our results indicate that they are harder than the corresponding unsplittable flow or shortest multi-path routing problems.
    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 ...
    OPUS
  • 11
    facet.materialart.
    Unknown
    Availability and Cost Based Evaluation of Demand-wise Shared Protection (2006)
    Details
    Publication Date: 2014-11-11
    Description: In this paper, we investigate the connection availabilities for the new protection scheme Demand-wise Shared Protection (DSP) and describe an appropriate approach for their computation. The exemplary case study on two realistic network scenarios shows that in most cases the availabilities for DSP are comparable with that for 1+1 path protection and better than in case of shared path protection.
    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 ...
    OPUS
  • 12
    facet.materialart.
    Unknown
    THESEUS - Protein Structure Prediction at ZIB (2006)
    Details
    Publication Date: 2016-06-30
    Description: THESEUS, the ZIB threading environment, is a parallel implementation of a protein threading based on a multi-queued branch-and-bound optimal search algorithm to find the best sequence-to-structure alignment through a library of template structures. THESEUS uses a template core model based on secondary structure definition and a scoring function based on knowledge-based potentials reflecting pairwise interactions and the chemical environment, as well as pseudo energies for homology detection, loop alignment, and secondary structure matching. The threading core is implemented in C++ as a SPMD parallization architecture using MPI for communication. The environment is designed for generic testing of different scoring functions, e.g. different secondary structure prediction terms, different scoring matrices and information derived from multiple sequence alignments. A validaton of the structure prediction results has been done on the basis of standard threading benchmark sets. THESEUS successfully participated in the 6th Critical Assessment of Techniques for Protein Structure Prediction (CASP) 2004.
    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 ...
    OPUS
  • 13
    facet.materialart.
    Unknown
    On the stability of the multi-queue multi-server processor sharing with limited service (2006)
    Details
    Publication Date: 2014-02-26
    Description: We consider a multi-queue multi-server system with $n$ servers (processors) and $m$ queues. At the system there arrives a stationary and ergodic stream of $m$ different types of requests with service requirements which are served according to the following $k$-limited head of the line processor sharing discipline: The first $k$ requests at the head of the $m$ queues are served in processor sharing by the $n$ processors, where each request may receive at most the capacity of one processor. By means of sample path analysis and Loynes' monotonicity method, a stationary and ergodic state process is constructed, and a necessary as well as a sufficient condition for the stability of the $m$ separate queues are given, which are tight within the class of all stationary ergodic inputs. These conditions lead to tight necessary and sufficient conditions for the whole system, also in case of permanent customers, generalizing an earlier result by the authors for the case of $n$=$k$=1.
    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 ...
    OPUS
  • 14
    facet.materialart.
    Unknown
    ConfJump : a fast biomolecular sampling method which drills tunnels through high mountains (2006)
    Details
    Publication Date: 2014-02-26
    Description: In order to compute the thermodynamic weights of the different metastable conformations of a molecule, we want to approximate the molecule's Boltzmann distribution in a reasonable time. This is an essential issue in computational drug design. The energy landscape of active biomolecules is generally very rough with a lot of high barriers and low regions. Many of the algorithms that perform such samplings (e.g. the hybrid Monte Carlo method) have difficulties with such landscapes. They are trapped in low-energy regions for a very long time and cannot overcome high barriers. Moving from one low-energy region to another is a very rare event. For these reasons, the distribution of the generated sampling points converges very slowly against the thermodynamically correct distribution of the molecule. The idea of ConfJump is to use $a~priori$ knowledge of the localization of low-energy regions to enhance the sampling with artificial jumps between these low-energy regions. The artificial jumps are combined with the hybrid Monte Carlo method. This allows the computation of some dynamical properties of the molecule. In ConfJump, the detailed balance condition is satisfied and the mathematically correct molecular distribution is sampled.
    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 ...
    OPUS
  • 15
    facet.materialart.
    Unknown
    Mathematik für den Volkssport (2006)
    Details
    Publication Date: 2020-02-11
    Description: "`Volkssport Sudoku"' titelt der Stern in seiner Ausgabe vom 24. Mai2006. In der Tat traut sich derzeit kaum noch eine Zeitung, ohne Sudoku zu erscheinen. Die Begeisterung am Lösen dieser Zahlenrätsel offenbart eine unvermutete Freude am algorithmischen Arbeiten. Mathematisch kann man Sudokus als lineare diophantische Gleichungssysteme mit Nichtnegativitätsbedingungen formulieren. Solche ganzzahligen linearen Programme sind die wichtigsten Modellierungswerkzeuge in zahlreichen Anwendungsgebieten wie z.B. der Optimierung von Telekommunikations- und Verkehrsnetzen. Moderne Verfahren zur Lösung dieser Optimierungsprobleme sind durch Sudokus allerdings deutlich weniger zu beeindrucken als Zeitungsleser.
    Keywords: ddc:000
    Language: German
    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 ...
    OPUS
  • 16
    facet.materialart.
    Unknown
    Mathematical Methods for Physical Layout of Printed Circuit Boards: An Overview (2006)
    Details
    Publication Date: 2020-02-11
    Description: This article surveys mathematical models and methods used for physical PCB layout, i.e., component placement and wire routing. The main concepts are briefly described together with relevant references.
    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 ...
    OPUS
  • 17
    facet.materialart.
    Unknown
    Competitive Online Multicommodity Routing (2006)
    Details
    Publication Date: 2020-12-15
    Description: We study online multicommodity minimum cost routing problems in networks, where commodities have to be routed sequentially. Arcs are equipped with load dependent price functions defining the routing weights. We discuss an online algorithm that routes each commodity by minimizing a convex cost function that depends on the demands that are previously routed. We present a competitive analysis of this algorithm showing that for affine linear price functions this algorithm is $4K/2+K$-competitive, where $K$ is the number of commodities. For the parallel arc 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.
    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 ...
    OPUS
  • 18
    facet.materialart.
    Unknown
    The extreme points of QSTAB(G) and its implications (2006)
    Details
    Publication Date: 2021-03-16
    Description: Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations w.r.t different concepts. Perfect graphs are, e.g., characterized as precisely those graphs $G$ where the stable set polytope STAB$(G)$ coincides with the clique constraint stable set polytope QSTAB$(G)$. For all imperfect graphs STAB$(G) \subset$ QSTAB$(G)$ holds and, therefore, it is natural to measure imperfection in terms of the difference between STAB$(G)$ and QSTAB$(G)$. Several concepts have been developed in this direction, for instance the dilation ratio of STAB$(G)$ and QSTAB$(G)$ which is equivalent to the imperfection ratio imp$(G)$ of $G$. To determine imp$(G)$, both knowledge on the facets of STAB$(G)$ and the extreme points of QSTAB$(G)$ is required. The anti-blocking theory of polyhedra yields all {\em dominating} extreme points of QSTAB$(G)$, provided a complete description of the facets of STAB$(\overline G)$ is known. As this is typically not the case, we extend the result on anti-blocking polyhedra to a {\em complete} characterization of the extreme points of QSTAB$(G)$ by establishing a 1-1 correspondence to the facet-defining subgraphs of $\overline G$. We discuss several consequences, in particular, we give alternative proofs of several famous results.
    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 ...
    OPUS
  • 19
    facet.materialart.
    Unknown
    On exact algorithms for treewidth (2006)
    Details
    Publication Date: 2014-11-10
    Description: We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time $O^\ast(2^n)$. This algorithm is based on the old dynamic programming method introduced by Held and Karp for the {\sc Tra veling Salesman} problem. We use some optimizations that do not affect the worst case running time but improve on the running time on actual instances and can be seen to be practical for small instances. However, our experiments show that the space use d by the algorithm is an important factor to what input sizes the algorithm is effective. For this purpose, we settle the problem of computing treewidth under the restriction that the space used is only polynomial. In this direction we give a simple $O^\ast(4^n)$ al gorithm that requires {\em polynomial} space. We also show that with a more complicated algorithm, using balanced separators, {\sc Treewidth} can be computed in $O^\ast(2.9512^n)$ time and polynomial space.
    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 ...
    OPUS
  • 20
    facet.materialart.
    Unknown
    Coarse Grained Molecular Kinetics (2006)
    Details
    Publication Date: 2014-03-10
    Description: The dynamic behavior of molecules can often be described by Markov processes. From computational molecular simulations one can derive transition rates or transition probabilities between subsets of the discretized conformational space. On the basis of this dynamic information, the spatial subsets are combined into a small number of so-called metastable molecular conformations. This is done by clustering methods like the Robust Perron Cluster Analysis (PCCA+). Up to now it is an open question how this coarse graining in space can be transformed to a coarse graining of the Markov chain while preserving the essential dynamic information. In the following article we aim at a consistent coarse graining of transition probabilities or rates on the basis of metastable conformations such that important physical and mathematical relations are preserved. This approach is new because PCCA+ computes molecular conformations as linear combinations of the dominant eigenvectors of the transition matrix which does not hold for other clustering methods.
    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 ...
    OPUS
  • 21
    facet.materialart.
    Unknown
    RSWK/SWD und Faceted Browsing: neue Möglichkeiten einer inhaltlich-intuitiven Navigation (2006)
    Details
    Publication Date: 2014-02-26
    Description: Das deutschsprachige Bibliothekswesen verfügt mit den \glqq Regeln für den Schlagwortkatalog \grqq (RSWK) unter Verwendung der \glqq Schlagwortnormdatei \grqq (SWD) über ein Instrumentarium, welches zusammen mit einem \glqq Faceted Browsing \grqq das bisher bestehende Angebot für ein Information Retrieval optimal ergänzen kann. Die Verbindung zwischen Standardvokabular (SWD) und Kettenbildung (RSWK) einerseits und eine nach Facetten-Eigenschaften gegliederte Navigation andererseits unterstützt bestmöglich eine inhaltlich bezogene Recherche. Die Stärken und Schwächen der RSWK/SWD werden erörtert und auch Klassifikationen (DDC und RVK) als mögliche Facetten diskutiert.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 22
    facet.materialart.
    Unknown
    Accuracy, Stability, Convergence of Rigorous Thermodynamic Sampling Methods (2006)
    Details
    Publication Date: 2016-06-09
    Keywords: ddc:000
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 23
    facet.materialart.
    Unknown
    Primal Heuristics for Mixed Integer Programs (2006)
    Details
    Publication Date: 2022-03-14
    Description: A lot of problems arising in Combinatorial Optimization and Operations Research can be formulated as Mixed Integer Programs (MIP). Although MIP-solving is an NP-hard optimization problem, many practically relevant instances can be solved in reasonable time. In modern MIP-solvers like the branch-cut-and-price-framework SCIP, primal heuristics play a major role in finding and improving feasible solutions at the early steps of the solution process. This helps to reduce the overall computational effort, guides the remaining search process, and proves the feasibility of the MIP model. Furthermore, a heuristic solution with a small gap to optimality often is sufficient in practice. We investigate 16 different heuristics, all of which are available in SCIP. Four of them arise from the literature of the last decade, nine are specific implementations of general heuristic ideas, three have been newly developed. We present an improved version of the feasibility pump heuristic by Fischetti et al., which in experiments produced solutions with only a third of the optimality gap compared to the original version. Furthermore, we introduce two new Large Neighborhood Search (LNS) heuristics. Crossover is an LNS improvement heuristic making use of similarities of diverse MIP solutions to generate new incumbent solutions. RENS is an LNS rounding heuristic which evaluates the space of all possible roundings of a fractional LP-solution. This heuristic makes it possible to determine whether a point can be rounded to an integer solution and which is the best possible rounding. We conclude with a computational comparison of all described heuristics. It points out that a single heuristic on its own has only a slight impact on the overall performance of SCIP, but the combination of all of them reduces the running time by a factor of two compared to a version without any heuristics.
    Keywords: ddc:000
    Language: English
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 24
    facet.materialart.
    Unknown
    A cartesian grid finite volume method for the solution of the Poisson equation with variable coefficients and embedded interfaces (2006)
    Details
    Publication Date: 2014-02-26
    Description: We present a finite volume method for the solution of the two-dimensional Poisson equation $ \nabla\cdot( \beta( {\mbox{\boldmath $x$}}) \nabla u({\mbox{\boldmath $x$}})) = f(\mbox{\boldmath $x$}) $ with variable, discontinuous coefficients and solution discontinuities on irregular domains. The method uses bilinear ansatz functions on Cartesian grids for the solution $u({\mbox{\boldmath $x$})$ resulting in a compact nine-point stencil. The resulting linear problem has been solved with a standard multigrid solver. Singularities associated with vanishing partial volumes of intersected grid cells or the dual bilinear ansatz itself are removed by a two-step asymptotic approach. The method achieves second order of accuracy in the $L^\infty$ and $L^2$ norm.
    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 ...
    OPUS
  • 25
    facet.materialart.
    Unknown
    Efficient Sampling of the Stationary Distribution of Metastable Dynamical Systems (2006)
    Details
    Publication Date: 2014-11-11
    Description: In this article we aim at an efficient sampling of the stationary distribution of dynamical systems in the presence of metastabilities. In the past decade many sophisticated algorithms have been inven ted in this field. We do not want to simply add a further one. We address the problem that one has applied a sampling algorithm for a dynamical system many times. This leads to different samplings which more or less represent the stationary distribution partially very well, but which are still far away from ergodicity or from the global stationary distribution. We will show how these samplings can be joined together in order to get one global sampling of the stationary distribution.
    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 ...
    OPUS
  • 26
    facet.materialart.
    Unknown
    Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (2006)
    Details
    Publication Date: 2014-02-26
    Description: The concept of jump system, introduced by Buchet and Cunningham (1995), is a set of integer points with a certain exchange property. In this paper, we discuss several linear and convex optimization problems on jump systems and show that these problems can be solved in polynomial time under the assumption that a membership oracle for a jump system is available. We firstly present a polynomial-time implementation of the greedy algorithm for the minimization of a linear function. We then consider the minimization of a separable-convex function on a jump system, and propose the first polynomial-time algorithm for this problem. The algorithm is based on the domain reduction approach developed in Shioura (1998). We finally consider the concept of M-convex functions on constant-parity jump systems which has been recently proposed by Murota (2006). It is shown that the minimization of an M-convex function can be solved in polynomial time by the domain reduction approach.
    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 ...
    OPUS
  • 27
    facet.materialart.
    Unknown
    Packing and Partitioning Orbitopes (2006)
    Details
    Publication Date: 2020-12-15
    Description: We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at most or exactly one 1-entry in each row, respectively. The goal of investigating these polytopes is to gain insight into ways of breaking certain symmetries in integer programs by adding constraints, e.g., for a well-known formulation of the graph coloring problem. We provide a thorough polyhedral investigation of packing and partitioning orbitopes for the cases in which the group acting on the columns is the cyclic group or the symmetric group. Our main results are complete linear inequality descriptions of these polytopes by facet-defining inequalities. For the cyclic group case, the descriptions turn out to be totally unimodular, while for the symmetric group case, both the description and the proof are more involved. The associated separation problems can be solved in linear time.
    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 ...
    OPUS
  • 28
    facet.materialart.
    Unknown
    LP-Based Local Approximation for Markov Decision Problems (2006)
    Details
    Publication Date: 2014-11-21
    Description: The standard computational methods for computing the optimal value functions of Markov Decision Problems (MDP) require the exploration of the entire state space. This is practically infeasible for applications with huge numbers of states as they arise, e.\,g., from modeling the decisions in online optimization problems by MDPs. Exploiting column generation techniques, we propose and apply an LP-based method to determine an $\varepsilon$-approximation of the optimal value function at a given state by inspecting only states in a small neighborhood. In the context of online optimization problems, we use these methods in order to evaluate the quality of concrete policies with respect to given initial states. Moreover, the tools can also be used to obtain evidence of the impact of single decisions. This way, they can be utilized in the design of policies.
    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 ...
    OPUS
  • 29
    facet.materialart.
    Unknown
    Ein gemischt-ganzzahliges lineares Optimierungsmodell für ein Laserschweißproblem im Karosseriebau (2006)
    Details
    Publication Date: 2014-11-21
    Description: Wir beschäftigen uns mit dem Problem der Betriebsplanung von Laserschweißrobotern im Karosseriebau. Gegeben ist eine Menge von Schweißnähten, die innerhalb einer Fertigungszelle an einem Karosserieteil gefertigt werden müssen. Die Schweißnähte werden durch mehrere parallel betriebene Roboter bearbeitet. Die Aufgabe besteht darin, für jeden Roboter eine Reihenfolge und eine zeitliche Koordinierung seiner Bewegungen zu finden, so dass alle Schweißnähte innerhalb der Taktzeit der Fertigungszelle bearbeitet werden und so wenig Laserquellen wie möglich eingesetzt werden. Dabei müssen einige Nebenbedingungen berücksichtigt werden. Für dieses spezielle Schweißproblem haben wir eine Formulierung als gemischt-ganzzahliges lineares Programm entwickelt, welches sich für die untersuchten praktischen Fälle sehr schnell lösen lässt.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 30
    facet.materialart.
    Unknown
    Software for Teaching Modeling of Integer Programming Problems (2006)
    Details
    Publication Date: 2021-08-05
    Description: Modern applications of mathematical programming must take into account a multitude of technical details, business demands, and legal requirements. Teaching the mathematical modeling of such issues and their interrelations requires real-world examples that are well beyond the toy sizes that can be tackled with the student editions of most commercial software packages. We present a new tool, which is freely available for academic use including complete source code. It consists of an algebraic modeling language and a linear mixed integer programming solver. The performance and features of the tool are in the range of current state-of-the-art commercial tools, though not in all aspects as good as the best ones. Our tool does allow the execution and analysis of large real-world instances in the classroom and can therefore enhance the teaching of problem solving issues. Teaching experience has been gathered and practical usability was tested in classes at several universities and a two week intensive block course at TU Berlin. The feedback from students and teachers has been very positive.
    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 ...
    OPUS
  • 31
    facet.materialart.
    Unknown
    On the Bottleneck Shortest Path Problem (2006)
    Details
    Publication Date: 2014-11-21
    Description: The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze the complexity of the problem, its relation to the Shortest Path Problem, and the impact of the underlying machine/computation model.
    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 ...
    OPUS
  • 32
    facet.materialart.
    Unknown
    Graph Coloring Manifolds (2006)
    Details
    Publication Date: 2014-02-26
    Description: We introduce a new and rich class of graph coloring manifolds via the Hom complex construction of Lov\´{a}sz. The class comprises examples of Stiefel manifolds, series of spheres and products of spheres, cubical surfaces, as well as examples of Seifert manifolds. Asymptotically, graph coloring manifolds provide examples of highly connected, highly symmetric manifolds.
    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 ...
    OPUS
  • 33
    facet.materialart.
    Unknown
    Polyhedra of Genus 3 with 10 Vertices and Minimal Coordinates (2006)
    Details
    Publication Date: 2014-02-26
    Description: We give coordinate-minimal geometric realizations in general position for 17 of the 20 vertex-minimal triangulations of the orientable surface of genus 3 in the 5x5x5-cube.
    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 ...
    OPUS
  • 34
    facet.materialart.
    Unknown
    ConFlow? A new space-based Application for complete Conformational Analysis of Molecules (2006)
    Details
    Publication Date: 2014-02-26
    Description: Biochemical interactions are determined by the 3D-structure of the involved components - thus the identification of conformations is a key for many applications in rational drug design. {\sf ConFlow} is a new multilevel approach to conformational analysis with main focus on completeness in investigation of conformational space. In contrast to known conformational analysis, the starting point for design is a space-based description of conformational areas. A tight integration of sampling and analysis leads to an identification of conformational areas simultaneously during sampling. An incremental decomposition of high-dimensional conformational space is used to guide the analysis. A new concept for the description of conformations and their path connected components based on convex hulls and {\em Hypercubes}is developed. The first results of the {\sf ConFlow} application constitute a 'proof of concept' and are further more highly encouraging. In comparison to conventional industrial applications, {\sf ConFlow} achieves higher accuracy and a specified degree of completeness with comparable effort.
    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 ...
    OPUS
  • 35
    facet.materialart.
    Unknown
    Iteratively Solving Linear Inverse Problems under General Convex Contraints (2006)
    Details
    Publication Date: 2014-02-26
    Description: We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algorithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively moderate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In certain cases, i.e. for special families of convex constraints, weak convergence implies norm convergence. The presented approach covers a wide range of problems, e.g. Besov- or BV-restoration for which we present also numerical experiments in the context of image processing.
    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 ...
    OPUS
  • 36
    facet.materialart.
    Unknown
    Stable computation of probability densities for metastable dynamical systems (2006)
    Details
    Publication Date: 2014-03-10
    Description: Whenever the invariant stationary density of metastable dynamical systems decomposes into almost invariant partial densities, its computation as eigenvector of some transition probability matrix is an ill-conditioned problem. In order to avoid this computational difficulty, we suggest to apply an aggregation/disaggregation method which only addresses wellconditioned sub-problems and thus results in a stable algorithm. In contrast to existing methods, the aggregation step is done via a sampling algorithm which covers only small patches of the sampling space. Finally, the theoretical analysis is illustrated by two biomolecular examples.
    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 ...
    OPUS
  • 37
    facet.materialart.
    Unknown
    Facets of the (s,t)-p-path polytope (2006)
    Details
    Publication Date: 2016-02-29
    Description: \noindent We give a partial description of the $(s,t)-p$-path polytope of a directed graph $D$ which is the convex hull of the incidence vectors of simple directed $(s,t)$-paths in $D$ of length $p$. First, we point out how the $(s,t)-p$-path polytope is located in the family of path and cycle polyhedra. Next, we give some classes of valid inequalities which are very similar to inequalities which are valid for the $p$-cycle polytope, that is, the convex hull of the incidence vectors of simple cycles of length $p$ in $D$. We give necessary and sufficient conditions for these inequalities to be facet defining. Furthermore, we consider a class of inequalities that has been identifie d to be valid for $(s,t)$-paths of cardinality at most $p$. Finally, we transfer the results to related polytopes, in particular, the undirected counterpart of the $(s,t)-p$-path polytope.
    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 ...
    OPUS
  • 38
    facet.materialart.
    Unknown
    A Contact-Stabilized Newmark Method for Dynamical Contact Problems (2006)
    Details
    Publication Date: 2020-11-13
    Description: The numerical integration of dynamical contact problems often leads to instabilities at contact boundaries caused by the non-penetration condition between bodies in contact. Even a recent energy dissipative modification due to Kane et al. (1999), which discretizes the non-penetration constraints implicitly, is not able to circumvent artificial oscillations. For this reason, the present paper suggests a contact stabilization which avoids artificial oscillations at contact interfaces and is also energy dissipative. The key idea of this contact stabilization is an additional $L^2$-projection at contact interfaces, which can easily be added to any existing time integration scheme. In case of a lumped mass matrix, this projection can be carried out completely locally, thus creating only negligible additional numerical cost. For the new scheme, an elementary analysis is given, which is confirmed by numerical findings in an illustrative test example (Hertzian two body contact).
    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 ...
    OPUS
  • 39
    facet.materialart.
    Unknown
    Implementation eines Resourcebrokers im Kontext eines Grid-Datenmanagement-Systems (2006)
    Details
    Publication Date: 2016-06-30
    Keywords: ddc:000
    Language: German
    Type: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 40
    facet.materialart.
    Unknown
    Enumeration and Random Realization of Triangulated Surfaces (2006)
    Details
    Publication Date: 2014-02-26
    Description: We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can be obtained by choosing coordinates randomly.
    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 ...
    OPUS
  • 41
    facet.materialart.
    Unknown
    Note on L#-convex Function Minimization Algorithms: Comparison of Murota's and Kolmogorov's Algorithms (2006)
    Details
    Publication Date: 2014-02-26
    Description: The concept of L##-convexity is introduced by Fujishige--Murota (2000) as a discrete convexity for functions defined over the integer lattice. The main aim of this note is to understand the difference of the two algorithms for L##-convex function minimization: Murota's steepest descent algorithm (2003) and Kolmogorov's primal algorithm (2005).
    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 ...
    OPUS
  • 42
    facet.materialart.
    Unknown
    Triangulated Manifolds with Few Vertices: Combinatorial Manifolds (2006)
    Details
    Publication Date: 2014-02-26
    Description: In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.
    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 ...
    OPUS
  • 43
    facet.materialart.
    Unknown
    Optimizing the Landside Operation of a Container Terminal (2006)
    Details
    Publication Date: 2020-02-11
    Description: This paper concerns the problem of operating a landside container exchange area that is serviced by multiple semi-automated rail mounted gantry cranes (RMGs) that are moving on a single bi-directional traveling lane. Such a facility is being built by Patrick Corporation at the Port Botany terminal in Sydney. The gantry cranes are a scarce resource and handle the bulk of container movements. Thus, they require a sophisticated analysis to achieve near optimal utilization. We present a three stage algorithm to manage the container exchange facility, including the scheduling of cranes, the control of associated short-term container stacking, and the allocation of delivery locations for trucks and other container transporters. The key components of our approach are a time scale decomposition, whereby an integer program controls decisions across a long time horizon to produce a balanced plan that is fed to a series of short time scale online subproblems, and a highly efficient space-time divisioning of short term storage areas. A computational evaluation shows that our heuristic can find effective solutions for the planning problem; on real-world data it yields a solution at most~8\% above a lower bound on optimal RMG utilization.
    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 ...
    OPUS
  • 44
    facet.materialart.
    Unknown
    Triangulated Manifolds with Few Vertices: Vertex-Transitive Triangulations I (2006)
    Details
    Publication Date: 2014-02-26
    Description: We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of actions of groups of small order, the enumeration is extended to 14 and 15 vertices.
    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 ...
    OPUS
  • 45
    facet.materialart.
    Unknown
    Polyhedra of Genus 2 with 10 Vertices and Minimal Coordinates (2006)
    Details
    Publication Date: 2014-02-26
    Description: We give coordinate-minimal geometric realizations in general position of all 865 vertex-minimal triangulations of the orientable surface of genus 2 in the 4x4x4-cube.
    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 ...
    OPUS
  • 46
    facet.materialart.
    Unknown
    Combinatorial 3-Manifolds with 10 Vertices (2006)
    Details
    Publication Date: 2014-02-26
    Description: We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2 x S^1$ and 615 triangulations of the twisted sphere product $S^2 \underline{x} S^1$. An analysis of the 3-spheres with up to 10 vertices shows that all these spheres are shellable, but that there are 29 vertex-minimal non-shellable 3-balls with 9 vertices.
    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 ...
    OPUS
  • 47
    facet.materialart.
    Unknown
    Adaptive Linearly Implicit Methods for Linear Poroelastic Equations (2006)
    Details
    Publication Date: 2019-05-10
    Description: Adaptive numerical methods in time and space are introduced and studied for linear poroelastic models in two and three space dimensions. We present equivalent models for linear poroelasticity and choose both the {\em displacement--pressure} and the {\em stress--pressure} formulation for our computations. Their discretizations are provided by means of linearly implicit schemes in time and linear finite elements in space. Our concept of adaptivity opens a way to a fast and reliable simulation of different loading cases defined by corresponding boundary conditions. We present some examples using our code {\sf Kardos} and show that the method works efficiently. In particular, it could be used in the simulation of some bone healing models.
    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 ...
    OPUS
  • 48
    facet.materialart.
    Unknown
    A computational approach to microRNA detection (2006)
    Details
    Publication Date: 2016-06-30
    Description: During the last few years more and more functionalities of RNA have been discovered that were previously thought of being carried out by proteins alone. One of the most striking discoveries was the de tection of microRNAs, a class of noncoding RNAs that play an important role in post-transcriptional gene regulation. Large-scale analyses are needed for the still increasingly growing amount of sequen ce data derived from new experimental technologies. In this paper we present a framework for the detection of the distinctive precursor structure of microRNAS that is based on the well-known Smith-Wat erman algorithm and various filtering steps. We conducted experiments on real genomic data and we found several new putative hits for microRNA precursor structures.
    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 ...
    OPUS
  • 49
    facet.materialart.
    Unknown
    Neustart für Bibliotheken ins Informationszeitalter (2006)
    Details
    Publication Date: 2014-02-26
    Description: Wir erleben zu Beginn des aufkommenden Informationszeitalters mit dem Siegeszug von Google und anderen Internet-Technologien einen Wandel im Verhalten von Wissenschaftlern und Studenten, der mit dem Einsatz von {\sl Google Scholar} und {\sl Google Book Search} einen Paradigmenwechsel für Bibliotheken und Informationsversorger gleichkommt. Der Artikel untersucht die technischen Hintergründe für den Erfolg dieser besonderen Art des Information Retrievals: Fulltext Indexing und Citation Ranking als besondere Form des Information Minig. Er diskutiert Stärken und auch Schwächen des Google-Ansatzes. Der Autor stellt sich auch der Frage, unter welchen Bedingungen es möglich ist, ein zu {\sl Google Scholar} und der {\sl Google Book Search} konkurrenzfähiges Retrieval in der Landschaft der Bibliotheken und Bibliotheksverbünde zu entrichten. Die These ist, dass dieses unter Einsatz des {\sl Open Source} Indexierers {\sl Lucene} und des Web-Robots {\sl Nutch} möglich ist. Bibliotheken können durch gezielten Einsatz solcher Internet-Technologien dem Nutzer die Leistungen, welche Google uns mit seinen Tools im {\sl Visible Web} und mit Referenzen auf {\sl Citations} in der Welt der Literatur zur Verfügung stellt, in vergleichbarer Art auch für ihre eigenen durch Lizenzen geschützten digitalen Journale und ihre speziellen lokal verfügbaren Ressourcen, auf die Internet-Suchmaschinen keine Zugriff haben, anbieten. Es besteht die Hoffnung, dass Nutzer dann nicht - wie in einer kürzlichen Studie des OCLC konstatiert - überwiegend im Internet verbleiben, sondern bei ihrer Suche auch den Weg zu den Angeboten der örtlichen Bibliothek attraktiv finden.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 50
    facet.materialart.
    Unknown
    Waiting times for M/M systems under generalized processor sharing (2006)
    Details
    Publication Date: 2014-02-26
    Description: We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. According to the generalized processor sharing discipline, each request in the system receives a fraction of the capacity of one processor which depends on the actual number of requests in the system. We derive systems of ordinary differential equations for the LST and for the moments of the conditional waiting time of a request with given required service time as well as a stable and fast recursive algorithm for the LST of the second moment of the conditional waiting time, which in particular yields the second moment of the unconditional waiting time. Moreover, asymptotically tight upper bounds for the moments of the conditional waiting time are given. The presented numerical results for the first two moments of the sojourn times in the $M/M/m-PS$ system show that the proposed algorithms work well.
    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 ...
    OPUS
  • 51
    facet.materialart.
    Unknown
    Domain Decomposition Method for Maxwell's Equations: Scattering off Periodic Structures (2006)
    Details
    Publication Date: 2022-07-07
    Description: We present a domain decomposition approach for the computation of the electromagnetic field within periodic structures. We use a Schwarz method with transparent boundary conditions at the interfaces of the domains. Transparent boundary conditions are approximated by the perfectly matched layer method (PML). To cope with Wood anomalies appearing in periodic structures an adaptive strategy to determine optimal PML parameters is developed. We focus on the application to typical EUV lithography line masks. Light propagation within the multi-layer stack of the EUV mask is treated analytically. This results in a drastic reduction of the computational costs and allows for the simulation of next generation lithography masks on a standard personal computer.
    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 ...
    OPUS
  • 52
    Electronic Resource
    Electronic Resource
    Masthead (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984) 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200101
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    Numerically efficient procedures for dynamic contact problems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1-14 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The solution of dynamic contact (elastic impact) problems is complicated by the changing nature of the contact area. If a finite element approach is used, the system matrices vary with the contact area. If the problem is properly formulated, such changes are rank one. Rank one changes produce easily determinable changes in the LDLT decompositions of the system matrices. This renders a class of dynamic contact problems soluble with the same accuracy and computational effort as is associated with the solution of any dynamic problem using finite element procedures. Consideration of an example problem involving the impact of spring-mass systems confirms this claim.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200102
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 54
    Electronic Resource
    Electronic Resource
    A Taylor-Galerkin method for convective transport problems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 101-119 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A method is described to derive finite element schemes for the scalar convection equation in one or more space dimensions. To produce accurate temporal differencing, the method employs forward-time Taylor series expansions including time derivatives of second- and third-order which are evaluated from the governing partial differential equation. This yields a generalized time-discretized equation which is successively discretized in space by means of the standard Bubnov-Galerkin finite element method. The technique is illustrated first in one space dimension. With linear elements and Euler, leap-frog and Crank-Nicolson time stepping, several interesting relations with standard Galerkin and recently developed Petrov-Galerkin methods emerge and the new Taylor-Galerkin schemes are found to exhibit particularly high phase-accuracy with minimal numerical damping. The method is successively extended to deal with variable coefficient problems and multi-dimensional situations.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200108
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 55
    Electronic Resource
    Electronic Resource
    A note on symmetry considerations in the transient response of unsymmetrically laminated anisotropic plates (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 175-181 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200113
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    Asymmetric bending of axisymmetric shells (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 169-173 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A two-noded, straight element with one-point quadrature is introduced for the unsymmetrical bending of orthotropic axisymmetric shells. The numerical results indicate that the present simple element performs accurately for both thick and thin shell applications.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200112
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    A comment on the effectiveness of uniform finite element refinements (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 187-194 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Numerical results using uniform h-refinement approaches to the solution of a pair of elasticity problems with singularities are presented and compared to recently published results based on the uniform p-refinement approaches.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200115
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    Numerical solutions to some free surface flows through nonhomogeneous media (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 143-167 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Steady-state, free surface seepage through a heterogeneous porous medium underlain by a drain at a finite depth is solved using a fixed domain solution technique. The problems investigated are axisymmetric seepage from a circular pond and plane seepage from a symmetric channel. These ponds and channels may have variable shaped bottoms. Since the Baiocchi transformation was used to define a new dependent variable, the form of the permeability function was restricted to a product of functions of the independent variables. Herein the permeability was chosen to be a function of the depth only. For certain forms of this function, namely those having negative gradients, part of the flowfield becomes unsaturated and this violates the assumed saturation of the flowfield in the flow theory. The governing differential equation, which holds in the sense of distributions, is derived for a fixed solution domain and a simple algorithm (a finite difference successive over-relaxation scheme with projection) is given to obtain the solution to these free surface problems. Numerous comparisons are made with published results. Rigorous mathematical justification of the methods used herein can be found in the references cited.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200111
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    Announcements (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 195-195 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200116
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    Masthead (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984) 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200201
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    Chebyshev filtering Lanczos' process in the subspace iteration method (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 182-186 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Bathe's basic algorithm of subspace iteration for the solution of the symmetric eigenvalue problem is improved by including a Chebyshev filtering mechanism. To obtain satisfactory convergence for the largest eigenvalues, a shifting strategy is adopted. The shift factor is approximately computed by the Lanczos process.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200114
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    Deflection of thick beams of multimodular materials (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 479-503 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A transfer-matrix analysis is presented for determining the static behaviour of thick beams of ‘multimodular materials’ (i.e. materials which have different elastic behaviour in tension and compression, with nonlinear stress-strain curves approximated as piecewise linear, with four or more segments). To validate the transfer-matrix method results, a closed-form solution is also presented for cases in which the neutral-surface location is constant along the beam axis. Numerical results for axial displacement, transverse deflection, bending slope, bending moment, transverse shear, axial force and location of neutral surface are presented for multimodular and bimodular models of unidirectional aramid cordrubber. The transfer-matrix method results agree very well with the closed-form solutions.
    Additional Material: 18 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200307
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    An 8-node brick finite element (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 523-528 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An 8-node brick element based on the assumed stress hybrid formulation is described. With three additional stress fields, the element stiffness matrix now has the required rank of 18, and the ‘bending’ response is exact with rectangular elements. Surprisingly, the 2 × 2 × 2 Gauss rule suffices for all numerical integrations, to satisfy the constant stress patch test.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200310
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 64
    Electronic Resource
    Electronic Resource
    An assumed stress hybrid curvilinear triangular finite element for plate bending (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 529-548 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An assumed stress hybrid curvilinear triangular finite element is described which is based upon the Kirchhoff theory of plate bending. The derivation extends the assumed stress hybrid technique to curvilinear boundaries where the twelve connectors are related to those of an equilibrium rectilinear element and to Semiloof. The solution process demands only first derivatives of the shape functions.The element is subjected to various patch tests for constant bending, e.g. where the central element is in close approximation to a circle. All tests are passed for stress couples and vertex displacements, but values of the remaining connectors do not resemble exact results. Patch tests for rigid-body movements are passed exactly in every respect.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200311
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 65
    Electronic Resource
    Electronic Resource
    Numerical solution of a parabolic system with coupled nonlinear boundary conditions (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 505-514 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A numerical technique has been developed to solve a system that consists of m linear parabolic differential equations with coupled nonlinear boundary conditions. Such a system may represent chemical reactions, chemical lasers and diffusion problems. An implicit finite difference scheme is adopted to discretize the problem, and the resulting system of equations is solved by a novel technique that is a modification of the cyclic odd-even reduction and factorization (CORF) algorithm. At each time level, the system of equations is first reduced to m nonlinear algebraic equations that involve only the m unknown grid points on the nonlinear boundary. Newton's method is used to determine these m unknowns, and the corresponding Jacobian matrix can be computed and updated easily. After convergence is achieved, the remaining unknowns are solved directly. The efficiency of this technique is illustrated by the numerical computations of two examples previously solved by the cubic spline Galerkin method.
    Additional Material: 3 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200308
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 66
    Electronic Resource
    Electronic Resource
    The maximum principle for bilinear elements (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 549-553 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: It is demonstrated that finite element discretizations may not, in general, satisfy the maximum principle; and sufficient conditions are presented to guarantee that solutions based on bilinear elements do satisfy the maximum principle.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200312
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 67
    Electronic Resource
    Electronic Resource
    On the efficiency and accuracy of the boundary element method and the finite element method (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 515-522 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The efficiency and computational accuracy of the boundary element and finite element methods are compared in this paper. This comparison is carried out by employing different degrees of mesh refinement to solve a specific illustrative problem by the two methods.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200309
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 68
    Electronic Resource
    Electronic Resource
    Economy and convergence of notch stress analysis using boundary and finite element methods (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 565-572 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The BEM is shown to be superior to FEM with respect to economy (man hour and data processing) and convergence (with increasing number of boundary nodes) in the elasic notch stress analysis of compact components.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200314
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 69
    Electronic Resource
    Electronic Resource
    A note on discontinuous numerical solutions of the kinematic wave motion (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 555-563 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This note discusses the numerical solution of the kinematic wave equation under those conditions when the solution contains a discontinuous shock. A finite element solution is described in which shocks are represented by discrete nodal discontinuities. The implementation of the method follows conventional finite element practice over the shockless regions of the solution domain which are coupled by frontal constraints. The basis of the method and examples of its application to the solution of the kinematic wave equation in one and two dimensions are presented.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200313
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 70
    Electronic Resource
    Electronic Resource
    Formulation methods of geometric and material nonlinearity problems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 887-914 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A concise survey of formulation methods of geometric and material nonlinearity problems is given. Differences between existing formulations in the literature are discussed. A consistent Lagrangian and updated Lagrangian formulations are derived from the energy balance equation transformed to the proper reference configuration. Differences between the existing formulations and similar ones in the literature are found to be in specific geometric nonlinear terms in the final incremental equation as well as in the definition of the load increment vector. Specific forms of constitutive equations for elastic and elastoplastic materials are presented. Some of the forms used by other authors in application to elastoplastic materials are shown to be inconsistent. Sample numerical examples intended for checking some particular points in the formulation are presented.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200508
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 71
    Electronic Resource
    Electronic Resource
    Two high-order numerical methods for solving boundary-value nonlinear ordinary differential equations (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 845-849 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Two numerical methods for solving two-point boundary-value problems associated with systems of first-order nonlinear ordinary differential equations are described. The first method, which is based on Lobatto quadrature, requires four internal function evaluations for each subinterval. It does not need derivatives and is of order h7, where h is the space chop. The second method, which is similar to the first but is based on Lobatto-Hermite quadrature, makes the additional use of derivatives to achieve O(h9) accuracy. Results of computational experiments comparing these methods with other known methods are given.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200505
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 72
    Electronic Resource
    Electronic Resource
    Optimization for vibration isolation (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 915-929 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An almost linear optimization problem of importance in vibration isolation has been identified and algorithms were developed to minimize the forced vibrational response of structural systems. The constraints can be either displacements or accelerations. These algorithms have been studied for transient response, frequency response and stationary random using the direct dynamic solution. Multiple response points and loading conditions may be used.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200509
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 73
    Electronic Resource
    Electronic Resource
    A robust incomplete Choleski-conjugate gradient algorithm (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 949-966 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: When applied to large sparse sets of simultaneous equations, classical iterative methods may yield very poor convergence rates. This paper gives an incomplete Choleski-conjugate gradient algorithm (ICCG) which has reliably good convergence rates at the expense of computing and using at each iteration an incomplete Choleski factor of the coefficient matrix. The method is applicable to any problems in which the coefficient matrix is symmetric positive definite and is likely to be advantageous with respect to elimination when it is not possible to represent the equations in a dense band form.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200511
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 74
    Electronic Resource
    Electronic Resource
    Efficient linear and nonlinear heat conduction with a quadrilateral element (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 931-948 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A method is presented for performing efficient and stable finite element calculations of heat conduction with quadrilaterals using one-point quadrature. The stability in space is obtained by using a stabilization matrix which is orthogonal to all linear fields and its magnitude is determined by a stabilization parameter. It is shown that the accuracy is almost independent of the value of the stabilization parameter over a wide range of values; in fact, the values 3, 2 and 1 for the normalized stabilization parameter lead to the 5-point finite difference, 9-point finite difference and fully integrated finite element operators, respectively, for rectangular meshes; numerical experiments reported here show that the three have identical rates of convergence in the L2 norm. Eigenvalues of the element matrices, which are needed for stability limits, are also given. Numerical applications are used to show that the method yields accurate solutions with large increases in efficiency, particularly in nonlinear problems.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200510
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 75
    Electronic Resource
    Electronic Resource
    Implementation of an improved bisection algorithm in buckling problems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 979-979 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200513
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 76
    Electronic Resource
    Electronic Resource
    Physical property algorithms. J. F. Stelzer, Karl Thiemig AG, Publ. 1984. ISBN 3-521-06144-2. (pbk.) No. of pages: 501. Price: 68 D.M. (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 980-980 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200514
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 77
    Electronic Resource
    Electronic Resource
    Double noding technique for mixed mode crack propagation studies (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 967-977 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A simple dynamic finite element algorithm for analysing a propagating mixed mode crack tip is presented. A double noding technique, which can be easily incorporated into existing dynamic finite element codes, is used together with a corrected Ĵ integral to extract modes I and II dynamic stress intensity factors of a propagating crack. The utility of the procedure is demonstrated by analysing test problems involving a mode I central crack propagating in a plate subjected to uniaxial tension, a stationary slanted central crack in a plate subjected to uniaxial inpact loading and an extending slanted-edge crack in plate subjected to uniaxial tension.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200512
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 78
    Electronic Resource
    Electronic Resource
    Conference diary (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1370-1371 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200716
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 79
    Electronic Resource
    Electronic Resource
    Numerical formulation for a higher order plane finite dynamic element (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1407-1414 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The paper describes the development of an eight-node plane rectangular finite dynamic element and presents detailed descriptions of the associated numerical formulation involving the higher order dynamic correction terms pertaining to the related stiffness and inertia matrices. Numerical test results of free vibration analyses are presented in detail for the newly developed eight-node element and also the corresponding four-node element in order to make a clear comparison of the relative efficiencies of the corresponding finite element and dynamic element procedures. Such results indicate a superior pattern of solution convergence of the presently developed dynamic element.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200805
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 80
    Electronic Resource
    Electronic Resource
    An iterative approach for the evaluation of delamination stresses in laminated composites (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1415-1431 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A computational strategy for the evaluation of delamination stresses in multilayered fibre-reinforced composites is presented. The approach uses special inter-laminar shear elements and an iterative procedure in the calculation of out-of-plane stresses. Both regular and singular elements for the free edge are presented. The solutions are carried on by switching between direct matrix solution methods of small systems of equations and an iterative conjugate gradient method. The proposed discretization avoids ill-conditioning problems, modelling difficulties and large computational cost associated with three-dimensional analysis of delamination of holes, cut-outs, joints and areas of complex stress states.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200806
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 81
    Electronic Resource
    Electronic Resource
    A consistent and accurate procedure for obtaining difference equations from differential equations (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1433-1441 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A general, consistent and accurate procedure for obtaining difference equations from differential equations is presented and illustrated by several examples. The procedure is an extension of the integral method and incorporates what is known of the solution to the differential equation in the formation of the corresponding difference equation. For the same accuracy, large increases in grid size over that obtained by standard Taylor's series approximations are possible. Both boundary-value and initial-value problems are treated.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200807
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 82
    Electronic Resource
    Electronic Resource
    An improved isoparametric transformation for finite element analysis (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1443-1459 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The standard isoparametric transformation for finite element analysis is shown to be only a special case of a more general transformation which allows for flexibility in locating side and interior element nodes. Side nodes positioned at the same relative distance from corner nodes in both local and global space, and interior nodes positioned such that they do not affect the Jacobian of the co-ordinate transformation, provide improved accuracy over nodes positioned locally without regard for the global configuration. This concept is demonstrated in the context of two-dimensional quadratic quadrilateral isoparametrics, but is also applicable to higher orders and dimensions. In the test cases examined, the new formulation provides a reduction in error of up to three orders of magnitude and also provides accurate solutions for nodal placements which are not allowed using the standard transformations.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200808
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 83
    Electronic Resource
    Electronic Resource
    An improved explicit finite element method for tidal flow (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1461-1475 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A weighting function by which the mass matrix is made to be diagonal is deduced on the two-dimensional simplex element. Adopting the weighted residual method with the deduced weighting function for spatial domain and the two-step Lax-Wendroff method for time differentiation, the two-dimensinoal tidal flow in a model basin is calculated by means of the explicit finite element method. The water mass transport integrated over one tidal period at some cross-sections of the basin is also estimated, in order to verify the water mass conservation. It is found that the water mass is nearly conserved in the present method, although the usual lumped mass matrix technique fails to conserve.The present explicit finite element method with the conservative form of governing equations is also investigated and the water mass conservation is found to be a little more improved in this case than in the case of non-conservative forms. Application to a real bay indicates that the method with the conservative form of equations could be used for the estimation of tidal residual flow.
    Additional Material: 15 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200809
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 84
    Electronic Resource
    Electronic Resource
    Incremental elastoplastic stiffness matrix for materials obeying the principal stress yield criterion (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1477-1489 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In this work, the plastic stress-strain relation and the incremental elastoplastic stiffness matrix for materials obeying the principal stress yield criterion are derived in the context of the associated theory of plasticity. Particular attention is paid to the treatment of the singularity conditions associated with this yield criterion.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200810
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 85
    Electronic Resource
    Electronic Resource
    The self-equilibration of residuals and complementary a posteriori error estimates in the finite element method (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1491-1506 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: It is demonstrated that the residual in a compatible (displacement) finite element solution can be partitioned into local self-equilibrating systems on each element. An a posteriori error analysis is then based on a complementary approach and examples indicate that the guaranteed upper bound on the energy of the error is preserved.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200811
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 86
    Electronic Resource
    Electronic Resource
    Numerical laplace transformation and inversion in the analysis of physical systems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1507-1519 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The paper develops a new discrete transform pair which economizes on the number of samples of F(s) and f(t) compared with the standard pair. Whereas the standard pair used uniform sampling along the Bromwich contour, the new method allows a progressive increase in the sampling interval, thereby reducing the number of samples required to meet a specified bandwidth requirement. In the case of the computation of transient responses of physical systems, a reduction by a factor of 10 is not unrealistic. The new transform pair is based on the generalization of fundamental sampling principles. In particular, this leads to an integration contour different from the Bromwich contour.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200812
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 87
    Electronic Resource
    Electronic Resource
    A note on ‘a two-step approach to finite element ordering’ (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1553-1554 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200815
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 88
    Electronic Resource
    Electronic Resource
    Partitioned rational Runge Kutta for parabolic systems (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1581-1597 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new family of coupled time integration operators of different orders is developed. It permits different time integration operators to be used simultaneously in various regions of the model. This approach has the advantage of applying a very accurate time integrator, such as Runge Kutta method of order two to four, to the local nonlinear region of interest and a simple time integrator, such as the implicit-explicit or mixed time implicit-explicit method of order one, for the remaining region. The computer implementation aspects, stability analysis as well as the numerical evaluations of these new methods are presented. This is another attractive addition to the repertoire of time integration methods.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200904
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 89
    Electronic Resource
    Electronic Resource
    A finite element analysis of metal-forming problems with an elastic-viscoplastic material model (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1613-1628 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A finite element formulation for elastoviscoplasticity problems in the presence of large strains and deformations is presented in this paper. The formulation is capable of using any of a class of combined creep-plasticity constitutive models with state variables for the description of material behaviour. The specific problem considered is plane strain extrusion using the constitutive model originally proposed by Hart. Numerical results are presented for sample problems and the important effects of extrusion speed and friction (at the die-workpiece interface) on the residual stresses in an extruded sample are investigated. The computer program developed here is quite general and can be modified to solve problems for other manufacturing processes like rolling, sheet forming, etc.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200906
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 90
    Electronic Resource
    Electronic Resource
    A direct search package for unconstrained minimization (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1643-1660 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new direct search package is presented. Typical test functions solved establish the robustness and efficiency of the package. The most significant features of the package are that it works satisfactorily even in single precision and requires much less memory. It needs only the function values and the unidimensional search is totally dispensed with. Methods such as different descent techniques, the RMS procedure, the co-ordinate movement technique and the gallop-canter equalization scheme form the sequence of strategies.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200908
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 91
    Electronic Resource
    Electronic Resource
    Numerical evaluation of the quarter-point crack tip element (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1629-1641 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper attempts to answer two commonly raised questions during the preparation of a finite element mesh, for the linear elastic fracture analysis of cracked structure: how to set up the finite element mesh around the crack tip, and what level of accuracy is to be expected from such a modelling.Two test problems, with known analytical expressions for their stress intensity factors, are analysed by the finite element method using the isoparametric quadratic singular element. The modified parameters were the order of integration, aspect ratio, number of elements surrounding the crack tip, use of transition elements, the singular element length over the total crack length, the symmetry of the mesh around the crack tip. Based on these analyses, a data base is created and various plots produced. The results are interpreted, the accuracy evaluated and recommendations drawn.Contrary to previous reports, it is found that the computed stress intensity factor (SIF) remains within engineering accuracy (10 per cent) throughout a large range of l/a (singular element length over crack length) for problems with a uniform non-singular stress distribution ahead of the crack tip (i.e. double edge notch), and l/a should be less than 0·1 for problems with a non-singular stress gradient (i.e three-point bend). Also, it is found that the best results are achieved by using at least four singular elements around the crack tip, with their internal angles around 45 degrees, and a reduced (2 × 2) numerical integration.
    Additional Material: 28 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200907
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 92
    Electronic Resource
    Electronic Resource
    Structural design sensitivity analysis with general boundary conditions: Static problem (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1661-1670 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents and analyses methods for design sensitivity analysis of static response for structural systems when general boundary conditions are used during the analysis phase. The design sensitivity analysis methods where the boundary conditions are used to reduce the equilibrium equation have been presented earlier. In such procedures, the reduced stiffness matrix is non-singular. This fact is used to show differentiability of the displacement vector. When reduction procedures are not used, the global structural stiffness matrix may be singular. In such a case, differentiability of the displacement vector may be questionable. However, it is shown that the displacement vector is still differentiable. Several forms of the structural design sensitivity equations are presented. Although these equations are derived with Lagrange multiplier treatment of general boundary conditions, it is shown that they are applicable with any treatment of general boundary conditions. For example, they can also be used with co-ordinate reduction schemes. Therefore, design sensitivity analysis can be carried out with any existing finite element analysis computer code. Moreover, the procedures presented can be used to calculate sensitivity of a force of constraint can that is desired. The formulations are kept quite general such that design dependent boundary conditions can be routinely treated. An example is used to illustrate the procedures.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200909
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 93
    Electronic Resource
    Electronic Resource
    An efficient zooming method for finite element analysis (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1671-1683 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In this paper, an efficient, exact zooming technique is developed which employs static condensation and exact structural reanalysis methods. For a multiple level of zooming such that the successive level of zooming is contained within the prior levels of zoom, repeated application of static condensation will reduce the system to one that is associated only with the degrees-of-freedom (dof) of the original model. Then, application of an exact static reanalysis technique permits the displacements at the dof of the original model that are contained in the final zoomed portion of the structure to be obtained first. Next, the response external to the zoom, as well as the response of additional dof within various levels of zooming, can be computed. With the triangular factor of the stiffness matrix of the original system available, this approach involves only the solution of a system of equations of small order. The proposed method is demonstrated by a numerical example.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200910
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 94
    Electronic Resource
    Electronic Resource
    The numerical treatment of laplace transforms: I. The Koizumi inversion method (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1697-1702 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An inversion formula based on expansion in a Fourier sine series, proposed by Koizumi in 1935, is examined. It is found to give results of moderate accuracy with relatively little work.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200912
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 95
    Electronic Resource
    Electronic Resource
    Rational approach for assumed stress finite elements (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1685-1695 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new method for the formulation of hybrid elements by the Hellinger-Reissner principle is established by expanding the essential terms of the assumed stresses as complete polynomials in the natural coordinates of the element. The equilibrium conditions are imposed in a variational sense through the internal displacements which are also expanded in the natural co-ordinates. The resulting element possesses all the ideal qualities, i.e. it is invariant, it is less sensitive to geometric distortion, it contains a minimum number of stress parameters and it provides accurate stress calculations. For the formulation of a 4-node plane stress element, a small perturbation method is used to determine the equilibrium constraint equations. The element has been proved to be always rank sufficient.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200911
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 96
    Electronic Resource
    Electronic Resource
    On the computational significance of the strain space formulation of plasticity theory (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1703-1709 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The strain space and traditional stress space formulations of plasticity theory are compared. We show how plasticity theory has been implemented numerically to solve static and dynamic problems, and conclude that the numerical loading criteria that have been used for two decades are identical to the strain space loading criteria proposed by Naghdi and co-workers.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200913
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 97
    Electronic Resource
    Electronic Resource
    Animating structure plots: Experiments with a PERQ (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1729-1733 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A PERQ single user computer can be used to animate structure plots, which is of great assistance when interpreting the results from finite element programs. Excellent appreciation may be obtained of a structure oscillating in complicated natural modes. The technique is also useful for studying deformations due to static forces.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200915
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 98
    Electronic Resource
    Electronic Resource
    Finite element criteria for some shells (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1711-1728 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Simple solutions are extracted from the exact compatibility equations of inextensional bending for a special class of shell shapes, and it is speculated that these solutions provide useful criteria towards evaluating finite elements for these and closely related shapes. Curved finite elements of a quadratic parametric representation, which do not belong to the special class, are then studied. By using a series of exact inextensional bending displacements, it is concluded from numerical evidence that the criteria apply to finite element shapes in this representation when they are shallow, as is usually the case in practice. Criteria for homogeneous membrane actions follow from Gol'denveizer's static-geometric analogue.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200914
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 99
    Electronic Resource
    Electronic Resource
    A partial-boundary element approach to the elastic torsion problem of a prismatic beam with a cracked rectangular cross-section (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1745-1749 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Using the partial-boundary element approach, in which only a part of the boundary in problem is discretized, the elastic torsion problem of a prismatic beam of a cracked rectangular cross-section has been solved in this brief paper, together with a numerical example to show the accuracy and versatility of the approach.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200916
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 100
    Electronic Resource
    Electronic Resource
    An effective finite element approach for calculation of potential distribution in a multi-dielectric cable (1984)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 20 (1984), S. 1751-1755 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The radial symmetry of the cable results in circular finite elements to evaluate the potential distribution in a multi-dielectric cable. Owing to this, a two dimensional analysis used in conjunction with triangular finite elements is reduced to one-dimensional analysis. This method therefore suggests an alternative proposal to calculate the potential distribution in a multi-dielectric cable with better accuracy.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620200917
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...