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  (31)
  • 1985-1989
  • 1965-1969  (32)
  • 2009  (31)
  • 1969  (32)
  • 1966
  • Engineering General  (32)
  • ddc:510  (31)
  • 1
    facet.materialart.
    Unknown
    Barrier methods for a control problem from hyperthermia treatment planning (2009)
    Details
    Publication Date: 2019-01-29
    Description: We consider an optimal control problem from hyperthermia treatment planning and its barrier regularization. We derive basic results, which lay the groundwork for the computation of optimal solutions via an interior point path-following method. Further, we report on a numerical implementation of such a method and its performance at an example problem.
    Keywords: ddc:510
    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
  • 2
    facet.materialart.
    Unknown
    Transparent boundary conditions for Maxwell's equations: Numerical concepts beyond the PML method (2009)
    Details
    Publication Date: 2016-06-09
    Description: Optical technologies are ubiquitously used in hi-tech devices. As a common feature of such devices one finds structures with dimensions in the order of the wavelength of the used light. To design and produce such devices, the wave nature of light must be taken into account. Accordingly, robust simulation tools are required which are based on rigorously solving Maxwell's equations, the governing equations of light propagation within macroscopic media. This thesis contributes to the modeling and the numerical computation of light scattering problems: Light scattering problems are typically posed on the entire space. The Perfectly-Matched -Layer method (PML) is widely used to restrict the simulation problem onto a bounded computational domain. We propose an adaptive PML method which exhibits a good convergence even for critical problems where standard PML implementations fail. Besides the computation of the near field, that is the electromagnetic field within the computational domain, it is of major interest to evaluate the electromagnetic field in the exterior domain and to compute the far field. So far, this was numerically only possible for simple geometries such as homogeneous exterior domains or layered media. To deal with more complicated devices, for example with waveguide inhomogeneities, we develop an evaluation formula based on the PML solution which allows for an exterior domain field evaluation in a half space above the device. Finally, we generalize the PML method to problems with multiply structured exterior domains. The term “multiply structured exterior domain” is defined in this thesis and means that the exterior domain exhibits several half-infinite structures. Mathematically, this gives rise to various complications. For example, no analytical solutions to Maxwell's equations for standard light sources are available in the exterior domain, which are needed to describe the incoming field in a light scattering problem. To tackle this we propose a new light scattering problem formulation which fits well into the PML method framework and which may be regarded as an extension of classical contributions by Sommerfeld, Wiener and Hopf. An exterior domain evaluation formula for multiply structured exterior domains with an extended illumination is derived as well.
    Keywords: ddc:510
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 3
    facet.materialart.
    Unknown
    The Coolest Path Problem (2009)
    Details
    Publication Date: 2020-08-05
    Description: We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial optimization. The other is the heat conduction problem from the field of partial differential equations. Together, they make up a control problem, where some geometrical object traverses a digraph in an optimal way, with constraints on intermediate or the final state. We discuss some properties of the problem and present numerical solution techniques. We demonstrate that the problem can be formulated as a linear mixed-integer program. Numerical solutions can thus be achieved within one hour for instances with up to 70 nodes in the graph.
    Keywords: ddc:510
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/zip
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 4
    facet.materialart.
    Unknown
    The MCF-Separator -- Detecting and Exploiting Multi-Commodity Flow Structures in MIPs (2009)
    Details
    Publication Date: 2021-08-05
    Description: Given a general mixed integer program (MIP), we automatically detect block structures in the constraint matrix together with the coupling by capacity constraints arising from multi-commodity-flow formulations. We identify the underlying graph and generate cutting planes based on cuts in the detected network. Our implementation adds a separator to the branch-and-cut libraries of SCIP and CPLEX. We make use of the complemented mixed integer rounding framework (cMIR) but provide a special purpose aggregation heuristic that exploits the network structure. Our separation scheme speeds-up the computation for a large set of MIPs coming from network design problems by a factor of two on average.
    Keywords: ddc:510
    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
    Nonlinear pseudo-Boolean optimization: relaxation or propagation? (2009)
    Details
    Publication Date: 2022-03-14
    Description: Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver.
    Keywords: ddc:510
    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
  • 6
    facet.materialart.
    Unknown
    Planning Problems in Public Transit (2009)
    Details
    Publication Date: 2020-08-05
    Description: Every day, millions of people are transported by buses, trains, and airplanes in Germany. Public transit (PT) is of major importance for the quality of life of individuals as well as the productivity of entire regions. Quality and efficiency of PT systems depend on the political framework (state-run, market oriented) and the suitability of the infrastructure (railway tracks, airport locations), the existing level of service (timetable, flight schedule), the use of adequate technologies (information, control, and booking systems), and the best possible deployment of equipment and resources (energy, vehicles, crews). The decision, planning, and optimization problems arising in this context are often gigantic and “scream” for mathematical support because of their complexity. This article sketches the state and the relevance of mathematics in planning and operating public transit, describes today’s challenges, and suggests a number of innovative actions. The current contribution of mathematics to public transit is — depending on the transportation mode — of varying depth. Air traffic is already well supported by mathematics. Bus traffic made significant advances in recent years, while rail traffic still bears significant opportunities for improvements. In all areas of public transit, the existing potentials are far from being exhausted. For some PT problems, such as vehicle and crew scheduling in bus and air traffic, excellent mathematical tools are not only available, but used in many places. In other areas, such as rolling stock rostering in rail traffic, the performance of the existing mathematical algorithms is not yet sufficient. Some topics are essentially untouched from a mathematical point of view; e.g., there are (except for air traffic) no network design or fare planning models of practical relevance. PT infrastructure construction is essentially devoid of mathematics, even though enormous capital investments are made in this area. These problems lead to questions that can only be tackled by engineers, economists, politicians, and mathematicians in a joint effort. Among other things, the authors propose to investigate two specific topics, which can be addressed at short notice, are of fundamental importance not only for the area of traffic planning, should lead to a significant improvement in the collaboration of all involved parties, and, if successful, will be of real value for companies and customers: • discrete optimal control: real-time re-planning of traffic systems in case of disruptions, • model integration: service design in bus and rail traffic. Work on these topics in interdisciplinary research projects could be funded by the German ministry of research and education (BMBF), the German ministry of economics (BMWi), or the German science foundation (DFG).
    Keywords: ddc:510
    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
    Solving Steel Mill Slab Problems with Branch and Price (2009)
    Details
    Publication Date: 2020-08-05
    Description: The steel mill slab design problem from the CSPLib is a binpacking problem that is motivated by an application of the steel industry and that has been widely studied in the constraint programming community. Recently, several people proposed new models and methods to solve this problem. A steel mill slab library was created which contains 380 instances. A closely related binpacking problem called multiple knapsack problem with color constraints, originated from the same industrial problem, were discussed in the integer programming community. In particular, a simple integer programming for this problem has been given by Forrest et al. [3]. The aim of this paper is to bring these different studies together. Moreover, we adopt the model of [3] for the steel mill slab problem. Using a state of the art integer program solver, this model is capable to solve all instances of the steel mill slab library, mostly in less than one second, to optimality. We improved, thereby, the solution value of 76 instances.
    Keywords: ddc:510
    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
  • 8
    facet.materialart.
    Unknown
    On the Hardness of Finding Small Shortest Path Routing Conflicts (2009)
    Details
    Publication Date: 2020-08-05
    Description: Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing paths forms a valid routing and, if this is not the case, to find a small subset of the given paths that cannot be shortest paths simultaneously for any routing lengths. In this paper we show that it is NP-hard to approximate the size of the smallest shortest path conflict by a factor less than 7/6.
    Keywords: ddc:510
    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
    A Binary Quadratic Programming Approach to the Vehicle Positioning Problem (2009)
    Details
    Publication Date: 2020-08-05
    Description: The Vehicle Positioning Problem (VPP) consists of the assignment of vehicles (buses, trams or trains) of a public transport or railway company to parking positions in a depot and to timetabled trips. Such companies have many different types of vehicles, and each trip can be performed only by vehicles of some of these types. These assignments are non-trivial due to the topology of depots. The parking positions are organized in tracks, which work as one- or two-sided stacks or queues. If a required type of vehicle is not available in the front of any track, shunting movements must be performed in order to change vehicles' positions, which is undesirable and should be avoided. In this text we present integer linear and non-linear programming formulations for some versions of the problem and compare them from a theoretical and a computational point of view.
    Keywords: ddc:510
    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
    Statistical Error Estimation and Grid-free Hierarchical Refinement in Conformation Dynamics (2009)
    Details
    Publication Date: 2020-03-11
    Description: The understanding of geometric structures and dynamical properties of molecular conformations gives insight into molecular long-term behavior. The identification of metastable conformations together with their life times and transition patterns is the intention of conformation dynamics. Conformation dynamics is a multi-scale approach that leads to a reduced description of the dynamical system in terms of a stochastic transition probability matrix. The present thesis deals with the error analysis of computed matrices and the resulting matrix functions. Since conformational membership vectors, as they are computed by the Robust Perron Cluster Analysis (PCCA+), form an invariant subspace of the transition matrix, subspace-based error estimators are of particular interest. The decomposition of the state space into basis functions and the approximation of integrals by Monte-Carlo quadrature give rise to row-wise correlated random matrices, for which stochastic norms are computed. Together with an appropriate statistical model for the distribution of matrix rows, this allows for the calculation of error bounds and error distributions of the invariant subspace and other variables of interest. Equilibration of errors among the basis functions can be achieved by enhanced sampling in regions where the trajectories are mixing slowly. Hierarchical refinement of such basis functions systematically improves the clustering into metastable conformations by reducing the error in the corresponding invariant subspace. These techniques allow for an evaluation of simulation results and pave the way for the analysis of larger molecules. Moreover, the extension of PCCA+ to non-reversible Markov chains, verified by the corresponding perturbation theory, and the modification of the objective function for the case of soft membership vectors represent a further generalization of the clustering method, thus continuing the development from PCCA over PCCA+ to PCCA++. The methods developed in this thesis are useful for but not limited to conformation dynamics. In fact, they are applicable to a broader class of problems which combine domain decomposition with Monte-Carlo quadrature. Possible application areas may include the chemical master equation or quantum dynamical systems.
    Description: Das Verständnis von geometrischen Strukturen und dynamischen Eigenschaften molekularer Konformationen ist essentiell für die Vorhersage des Langzeitverhaltens von Molekülen. Die Identifikation metastabiler Konformationen sowie die Bestimmung von Übergangswahrscheinlichkeiten und Haltezeiten sind Bestandteil der Konformationdynamik. Dabei handelt es sich um eine Mehrskalenmethode, die auf eine reduzierte Beschreibung des Systems mittels einer stochastischen Übergangsmatrix führt. In der vorliegenden Dissertation wurde untersucht, wie man die Genauigkeit der Matrizen sowie der daraus berechneten Größen quantifizieren kann. Im Mittelpunkt stehen dabei Fehlerschätzer für den invarianten Unterraum, da die rechten Eigenvektoren als Grundlage der Robusten Perron Cluster Analyse (PCCA+) zur Identifizierung der metastabilen Konformationen dienen. Die Zerlegung des Zustandsraumes in Basisfunktionen sowie die Approximation der Matrixeinträge mittels Monte-Carlo-Quadratur führen zu zeilenweise korrelierten Zufallsmatrizen. Mit Hilfe einer stochastischen Norm sowie einem geeigneten statistischen Modell für die Verteilung der Matrixzeilen können u.a. Fehlerschranken und -verteilungen für den invarianten Unterraum brechnet werden. Eine Equilibrierung des Fehlers zwischen den Basisfunktionen kann durch erweitertes Sampling in solchen Regionen erreicht werden, in denen die Trajektorien nur langsam mischen.Eine hierarchische Zerlegung dieser Basisfunktionen verbessert systematisch die Zerlegung in metastabile Konformationen, indem sie den Fehler im invarianten Unterraum reduziert. Diese Techniken gestatten eine Evaluierung der Simulationsergebnisse und ebnen den Weg zur Behandlung komplexerer Moleküle. Desweiteren wurden Verallgemeinerungen der PCCA+ untersucht. Die Erweiterung der PCCA+ auf nicht-reversible Markov-Ketten sowie die Modifizierung der Zielfunktion für den Fall der weichen Clusterung setzen die Entwicklung von der PCCA über PCCA+ zu PCCA++ fort. Somit können neue Anwendungsfelder für dieses Cluster-Verfahren erschlossen werden. Die Methoden wurden zwar in Rahmen der Konformationsdynamik entwickelt, jedoch lassen sie sich auf eine weite Problemklasse anwenden, in der Gebietszerlegungsverfahren mit Monte-Carlo-Quadratur kombiniert werden. Mögliche Anwendungsgebiete umfassen die chemische Master-Gleichung oder quantenchemische Systeme.
    Keywords: ddc:510
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 11
    facet.materialart.
    Unknown
    A Set Partitioning Approach to Shunting (2009)
    Details
    Publication Date: 2020-08-05
    Description: The Vehicle Positioning Problem (VPP) is a classical combinatorial optimization problem in public transport planning. A number of models and approaches have been suggested in the literature, which work for small problems, but not for large ones. We propose in this article a novel set partitioning model and an associated column generation solution approach for the VPP. The model provides a tight linear description of the problem. The pricing problem, and hence the LP relaxation itself, can be solved in polynomial resp. pseudo-polynomial time for some versions of the problems.
    Keywords: ddc:510
    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
  • 12
    facet.materialart.
    Unknown
    Solving Large-scale Open Pit Mining Production Scheduling Problems by Integer Programming (2009)
    Details
    Publication Date: 2020-08-05
    Description: Since the initial application of mathematical optimisation methods to mine planning in 1965, the Lerchs-Grossmann algorithm for computing the ultimate pit limit, operations researchers have worked on a variety of challenging problems in the area of open pit mining. This thesis focuses on the open pit mining production scheduling problem: Given the discretisation of an orebody as a block model, determine the sequence in which the blocks should be removed from the pit, over the lifespan of the mine, such that the net present value of the mining operation is maximised. In practise, when some material has been removed from the pit, it must be processed further in order to extract the valuable elements contained therein. If the concentration of valuable elements is not sufficiently high, the material is discarded as waste or stockpiled. Realistically-sized block models can contain hundreds of thousands of blocks. A common approach to render these problem instances computationally tractable is the aggregation of blocks to larger scheduling units. The thrust of this thesis is the investigation of a new mixed-integer programming formulation for the open pit mining production scheduling problem, which allows for processing decisions to be made at block level, while the actual mining schedule is still computed at aggregate level. A drawback of this model in its full form is the large number of additional variables needed to model the processing decisions. One main result of this thesis shows how these processing variables can be aggregated efficiently to reduce the problem size significantly, while practically incurring no loss in net present value. The second focus is on the application of lagrangean relaxation to the resource constraints. Using a result of Möhring et al. (2003) for project scheduling, the lagrangean relaxation can be solved efficiently via minimum cut computations in a weighted digraph. Experiments with a bundle algorithm implementation by Helmberg showed how the lagrangean dual can be solved within a small fraction of the time required by standard linear programming algorithms, while yielding practically the same dual bound. Finally, several problem-specific heuristics are presented together with computational results: two greedy sub-MIP start heuristics and a large neighbourhood search heuristic. A combination of a lagrangean-based start heuristic followed by a large neighbourhood search proved to be effective in generating solutions with objective values within a 0.05% gap of the optimum.
    Keywords: ddc:510
    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
  • 13
    facet.materialart.
    Unknown
    1D-Reduktion thermal signifikanter Aderstränge in der Hyperthermie-Modellierung (2009)
    Details
    Publication Date: 2019-01-29
    Description: In dieser Arbeit wird ein neuer Ansatz zur Modellierung von thermal signifikanten Gefäßsträngen im Hyperthermie-Kontext betrachtet. Ausgehend von einer Konvektions-Diffusions-Gleichung wird durch Reskalierung des Massenflussterms eine Reduktion des Adergebietes auf eine 1D-Struktur erreicht. Nach numerischen Vorbetrachtungen wird die Grenzgleichung innerhalb einer verallgemeinerten Sobolev-Algebra formuliert. Die Untersuchung der Lösungsfamilie in klassischen Funktionenräumen zeigt, dass deren schwacher Grenzwert die Lösung der korrespondierenden Diffusions-Gleichung ist. Die Diskretisierung einer formalen Grenzgleichung mit Linienstromanteil stellt jedoch eine gute Approximation an die Diskretisierung des ursprünglichen Problems dar, wenn man die lokale Maschenweite an die Gefäßradien koppelt und bei erhöhtem Genauigkeitsbedarf auf ein vollständiges 3D-Modell umschaltet.
    Keywords: ddc:510
    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
  • 14
    facet.materialart.
    Unknown
    Undercover – a primal heuristic for MINLP based on sub-MIPs generated by set covering (2009)
    Details
    Publication Date: 2022-03-14
    Description: We present Undercover, a primal heuristic for mixed-integer nonlinear programming (MINLP). The heuristic constructs a mixed-integer linear subproblem (sub-MIP) of a given MINLP by fixing a subset of the variables. We solve a set covering problem to identify a minimal set of variables which need to be fixed in order to linearise each constraint. Subsequently, these variables are fixed to approximate values, e.g. obtained from a linear outer approximation. The resulting sub-MIP is solved by a mixed-integer linear programming solver. Each feasible solution of the sub-MIP corresponds to a feasible solution of the original problem. Although general in nature, the heuristic seems most promising for mixed-integer quadratically constrained programmes (MIQCPs). We present computational results on a general test set of MIQCPs selected from the MINLPLib.
    Keywords: ddc:510
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Format: application/postscript
    Format: application/postscript
    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
    On sojourn times in M/GI systems under state-dependent processor sharing (2009)
    Details
    Publication Date: 2020-08-05
    Description: We consider a system with Poisson arrivals and i.i.d. service times. The requests are served according to the state-dependent processor sharing discipline, where each request receives a service capacity which depends on the actual number of requests in the system. The linear systems of PDEs describing the residual and attained sojourn times coincide for this system, which provides time reversibility including sojourn times for this system, and their minimal non negative solution gives the LST of the sojourn time $V(\tau)$ of a request with required service time $\tau$. For the case that the service time distribution is exponential in a neighborhood of zero, we derive a linear system of ODEs, whose minimal non negative solution gives the LST of $V(\tau)$, and which yields linear systems of ODEs for the moments of $V(\tau)$ in the considered neighborhood of zero. Numerical results are presented for the variance of $V(\tau)$. In case of an M/GI/2-PS system, the LST of $V(\tau)$ is given in terms of the solution of a convolution equation in the considered neighborhood of zero. For bounded from below service times, surprisingly simple expressions for the LST and variance of $V(\tau)$ in this neighborhood of zero are derived, which yield in particular the LST and variance of $V(\tau)$ in M/D/2-PS.
    Keywords: ddc:510
    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
  • 16
    facet.materialart.
    Unknown
    E-Learning and the Working Mathematician (2009)
    Details
    Publication Date: 2020-12-11
    Description: Eigentlich war der erste Autor nur zu einem Grußwort zur Tagung „GML² 2009 - Grundfragen Multi¬medialen Lehrens und Lernens“ eingeladen. Daraus wurde ein E-Learning-bezogener Vortrag, der – basierend auf Erfahrungen im Fach Mathematik – einen kritischen Blick auf die E-Learning-Szene in Deutschland wirft und diese mit entsprechenden Aktivitäten weltweit vergleicht. Dies ist die in seinen mathematischen Teilen gekürzte, in den E-Learning-Anteilen ein wenig erweiterte schriftliche Fassung des Vortrags. Der Artikel stammt nicht von E-Learning-Spezialisten sondern von Personen, die sich seit fast zwanzig Jahren mit elektronischer Information und Kommunikation (kurz: IuK) – insbesondere in der Mathematik – beschäftigen. Nach einer Definition von Michael Kerres kennzeichnet der Begriff E-Learning (electronic learning – elektronisch unterstütztes Lernen) alle Formen von Lernen, bei denen digitale Medien für die Präsentation und Distribution von Lernmaterialien und/oder zur Unterstützung zwischenmenschlicher Kommunikation zum Einsatz kommen, siehe z.B. http://de.wikipedia.org/wiki/E-Learning. IuK und E-Learning haben nach dieser Begriffsbildung viele Berührungspunkte. Deswegen wagen wir es, unsere positiven und negativen Erfahrungen im Bereich IuK in diesem Eröffnungsvortrag zu berichten, einige Entwicklungslinien zu vergleichen und eine eigene Kurzversion der Definition von E-Learning (besser E-Teaching and -Learning) voranzustellen: „Lehren und Lernen mit Unterstützung elektronischer Hilfsmittel“.
    Keywords: ddc:510
    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
  • 17
    facet.materialart.
    Unknown
    Optimal Design of Survivable Multi-layer Telecommunication Networks (2009)
    Details
    Publication Date: 2020-08-05
    Description: Telecommunication transport networks consist of a stack of technologically different subnetworks, so-called layers, which are strongly interdependent. For example, one layer may correspond to an Internet (IP) backbone network whose links are realized by lightpath connections in an underlying optical fiber layer. To ensure that the network can fulfill its task of routing all communication requests, the inter-layer dependencies have to be taken into account already in the planning phase of the network. This is particularly important with survivability constraints, where connections in one layer have to be protected against cable cuts or equipment failures in another layer. The traditional sequential planning approach where one layer is optimized after the other cannot properly take care of the inter-layer dependencies; this can only be achieved with an integrated planning of several network layers at the same time. This thesis provides mathematical models and algorithmic techniques for the integrated optimization of two network layers with survivability constraints. We describe a multi-layer network design problem which occurs in various technologies, and model it mathematically using mixed-integer programming (MIP) formulations. The presented models cover many important practical side constraints from different technological contexts. In contrast to previous models from the literature, they can be used to design large two-layer networks with survivability requirements. We discuss modeling alternatives for various aspects of a multi-layer network and compare different routing formulations under multi-layer survivability constraints. We solve our models using a branch-and-cut-and-price approach with various problemspecific enhancements. This includes a presolving technique based on linear programming to reduce the problem size, combinatorial and sub-MIP-based primal heuristics to compute feasible network configurations, cutting planes which take the multi-layer survivability constraints into account to improve the lower bound on the optimal network cost, and column generation to generate flow variables dynamically during the algorithm. We develop techniques to speed up computations in a Benders decomposition approach and compare this approach to the standard formulation with a single MIP. We use the developed techniques to design large survivable two-layer networks by means of linear and integer programming methods. On realistic test instances with up to 67 network nodes and survivability constraints, we investigate the algorithmic impact of our techniques and show how to use them to compute good network configurations with quality guarantees. Most of the smaller test instances with up to 17 nodes can be solved to near-optimality. Moreover, we can compute feasible solutions and dual bounds even for large networks with survivability constraints, which has not been possible before.
    Keywords: ddc:510
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 18
    facet.materialart.
    Unknown
    On the Factorization of Simplex Basis Matrices (2009)
    Details
    Publication Date: 2020-08-05
    Description: In the simplex algorithm, solving linear systems with the basis matrix and its transpose accounts for a large part of the total computation time. We investigate various methods from modern numerical linear algebra to improve the computation speed of the basis updates arising in LPs. The experiments are executed on a large real-world test set. The most widely used solution technique is sparse LU factorization, paired with an updating scheme that allows to use the factors over several iterations. Clearly, small number of fill-in elements in the LU factors is critical for the overall performance. Using a wide range of LPs we show numerically that after a simple permutation the non-triangular part of the basis matrix is so small, that the whole matrix can be factorized with (relative) fill-in close to the optimum. This permutation has been exploited by simplex practitioners for many years. But to our knowledge no systematic numerical study has been published that demonstrates the effective reduction to a surprisingly small non-triangular problem, even for large scale LPs. For the factorization of the non-triangular part most existing simplex codes use some variant of dynamic Markowitz pivoting, which originated in the late 1950s. We also show numerically that, in terms of fill-in and in the simplex context, dynamic Markowitz is quite consistently superior to other, more recently developed techniques.
    Keywords: ddc:510
    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
  • 19
    facet.materialart.
    Unknown
    Computing expectation values for molecular quantum dynamics (2009)
    Details
    Publication Date: 2020-03-11
    Description: We compute expectation values for the solution of the nuclear Schrödinger equation. The proposed particle method consists of three steps: sampling of the initial Wigner function, classical transport of the sampling points, weighted phase space summation for the final computation of the expectation values. The Egorov theorem guarantees that the algorithm is second order accurate with respect to the semiclassical parameter. We present numerical experiments for a two-dimensional torsional potential with three different sets of initial data and for a six-dimensional Henon-Heiles potential. By construction, the computing times scale linearly with the number of initial sampling points and range between three seconds and one hour.
    Keywords: ddc:510
    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
  • 20
    facet.materialart.
    Unknown
    Extending a CIP framework to solve MIQCPs (2009)
    Details
    Publication Date: 2022-03-14
    Description: This paper discusses how to build a solver for mixed integer quadratically constrained programs (MIQCPs) by extending a framework for constraint integer programming (CIP). The advantage of this approach is that we can utilize the full power of advanced MIP and CP technologies. In particular, this addresses the linear relaxation and the discrete components of the problem. For relaxation, we use an outer approximation generated by linearization of convex constraints and linear underestimation of nonconvex constraints. Further, we give an overview of the reformulation, separation, and propagation techniques that are used to handle the quadratic constraints efficiently. We implemented these methods in the branch-cut-and-price framework SCIP. Computational experiments indicates the potential of the approach.
    Keywords: ddc:510
    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
  • 21
    facet.materialart.
    Unknown
    A Subspace Approach to Molecular Markov State Models via an Infinitesimal Generator (2009)
    Details
    Publication Date: 2016-06-09
    Description: Supercomputers can simulate complex molecular systems. However, there is a very large gap between the fastest oscillations of covalent bonds of a molecule and the time-scale of the dominant processes. In order to extract the dominant time-scales and to identify the dominant processes, a clustering of information is needed. This thesis shows that only the subspace-based Robust Perron Cluster Analysis (PCCA+) can solve this problem correctly by the construction of a Markov State Model. PCCA+ allows for time-extrapolation in molecular kinetics. This thesis shows the difference between molecular dynamics and molecular kinetics. Only in the molecular kinetics framework a definition of transition rates is possible. In this context, the existence of an infinitesimal generator of the dynamical processes is discussed. If the existence is assumed, the Theorem of Gauß can be applied in order to compute transition rates efficiently. Molecular dynamics, however, is not able to provide a suitable statistical basis for the determination of the transition pattern.
    Keywords: ddc:510
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 22
    facet.materialart.
    Unknown
    Approximations for the second moments of sojourn times in M/GI systems under state-dependent processor sharing (2009)
    Details
    Publication Date: 2020-08-05
    Description: We consider a system with Poisson arrivals and general service times, where the requests are served according to the State-Dependent Processor Sharing (SDPS) discipline (Cohen's generalized processor sharing discipline), where each request receives a service capacity which depends on the actual number of requests in the system. For this system, denoted by $M/GI/SDPS$, we derive approximations for the squared coefficients of variation of the conditional sojourn time of a request given its service time and of the unconditional sojourn time by means of two-moment fittings of the service times. The approximations are given in terms of the squared coefficients of variation of the conditional and unconditional sojourn time in related $M/D/SDPS$ and $M/M/SDPS$ systems, respectively. The numerical results presented for $M/GI/m-PS$ systems illustrate that the proposed approximations work well.
    Keywords: ddc:510
    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
  • 23
    facet.materialart.
    Unknown
    Insensitivity bounds for the moments of the sojourn times in M/GI systems under state-dependent processor sharing (2009)
    Details
    Publication Date: 2020-08-05
    Description: We consider a system with Poisson arrivals and i.i.d. service times and where the requests are served according to the state-dependent (Cohen's generalized) processor sharing discipline, where each request in the system receives a service capacity which depends on the actual number of requests in the system. For this system we derive asymptotically tight upper bounds for the moments of the conditional sojourn time of a request with given required service time. The bounds generalize corresponding results, recently given for the single-server processor sharing system by Cheung et al. and for the state-dependent processor sharing system with exponential service times by the authors. Analogous results hold for the waiting times.
    Keywords: ddc:510
    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
  • 24
    facet.materialart.
    Unknown
    Randomized Online Algorithms for Dynamic Multi-Period Routing Problems (2009)
    Details
    Publication Date: 2020-11-13
    Description: The Dynamic Multi-Period Routing Problem DMPRP introduced by Angelelli et al. gives a model for a two-stage online-offline routing problem. At the beginning of each time period a set of customers becomes known. The customers need to be served either in the current time period or in the following. Postponed customers have to be served in the next time period. The decision whether to postpone a customer has to be done online. At the end of each time period, an optimal tour for the customers assigned to this period has to be computed and this computation can be done offline. The objective of the problem is to minimize the distance traveled over all planning periods assuming optimal routes for the customers selected in each period. We provide the first randomized online algorithms for the DMPRP which beat the known lower bounds for deterministic algorithms. For the special case of two planning periods we provide lower bounds on the competitive ratio of any randomized online algorithm against the oblivious adversary. We identify a randomized algorithm that achieves the optimal competitive ratio of $\frac{1+\sqrt{2}}{2}$ for two time periods on the real line. For three time periods, we give a randomized algorithm that is strictly better than any deterministic algorithm.
    Keywords: ddc:510
    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
  • 25
    facet.materialart.
    Unknown
    Constraint Integer Programming (2009)
    Details
    Publication Date: 2021-08-05
    Description: This thesis introduces the novel paradigm of "constraint integer programming" (CIP), which integrates constraint programming (CP) and mixed integer programming (MIP) modeling and solving techniques. It is supplemented by the software SCIP, which is a solver and framework for constraint integer programming that also features SAT solving techniques. SCIP is freely available in source code for academic and non-commercial purposes. Our constraint integer programming approach is a generalization of MIP that allows for the inclusion of arbitrary constraints, as long as they turn into linear constraints on the continuous variables after all integer variables have been fixed. The constraints, may they be linear or more complex, are treated by any combination of CP and MIP techniques: the propagation of the domains by constraint specific algorithms, the generation of a linear relaxation and its solving by LP methods, and the strengthening of the LP by cutting plane separation. The current version of SCIP comes with all of the necessary components to solve mixed integer programs. In the thesis, we cover most of these ingredients and present extensive computational results to compare different variants for the individual building blocks of a MIP solver. We focus on the algorithms and their impact on the overall performance of the solver. In addition to mixed integer programming, the thesis deals with chip design verification, which is an important topic of electronic design automation. Chip manufacturers have to make sure that the logic design of a circuit conforms to the specification of the chip. Otherwise, the chip would show an erroneous behavior that may cause failures in the device where it is employed. An important subproblem of chip design verification is the property checking problem, which is to verify whether a circuit satisfies a specified property. We show how this problem can be modeled as constraint integer program and provide a number of problem-specific algorithms that exploit the structure of the individual constraints and the circuit as a whole. Another set of extensive computational benchmarks compares our CIP approach to the current state-of-the-art SAT methodology and documents the success of our method.
    Description: Diese Arbeit stellt einen integrierten Ansatz aus "Constraint Programming" (CP) und Gemischt-Ganzzahliger Programmierung ("Mixed Integer Programming", MIP) vor, den wir "Constraint Integer Programming" (CIP) nennen. Sowohl Modellierungs- als auch Lösungstechniken beider Felder fließen in den neuen integrierten Ansatz ein, um die unterschiedlichen Stärken der beiden Gebiete zu kombinieren. Als weiteren Beitrag stellen wir der wissenschaftlichen Gemeinschaft die Software SCIP zur Verfügung, die ein Framework für Constraint Integer Programming darstellt und zusätzlich Techniken des SAT-Lösens beinhaltet. SCIP ist im Source Code für akademische und nicht-kommerzielle Zwecke frei erhältlich. Unser Ansatz des Constraint Integer Programming ist eine Verallgemeinerung von MIP, die zusätzlich die Verwendung beliebiger Constraints erlaubt, solange sich diese durch lineare Bedingungen ausdrücken lassen falls alle ganzzahligen Variablen auf feste Werte eingestellt sind. Die Constraints werden von einer beliebigen Kombination aus CP- und MIP-Techniken behandelt. Dies beinhaltet insbesondere die "Domain Propagation", die Relaxierung der Constraints durch lineare Ungleichungen, sowie die Verstärkung der Relaxierung durch dynamisch generierte Schnittebenen. Die derzeitige Version von SCIP enthält alle Komponenten, die für das effiziente Lösen von Gemischt-Ganzzahligen Programmen benötigt werden. Die vorliegende Arbeit liefert eine ausführliche Beschreibung dieser Komponenten und bewertet verschiedene Varianten in Hinblick auf ihren Einfluß auf das Gesamt-Lösungsverhalten anhand von aufwendigen praktischen Experimenten. Dabei wird besonders auf die algorithmischen Aspekte eingegangen. Ein weiterer Hauptteil der Arbeit befasst sich mit der Chip-Design-Verifikation, die ein wichtiges Thema innerhalb des Fachgebiets der "Electronic Design Automation" darstellt. Chip-Hersteller müssen sicherstellen, dass der logische Entwurf einer Schaltung der gegebenen Spezifikation entspricht. Andernfalls würde der Chip fehlerhaftes Verhalten aufweisen, dass zu Fehlfunktionen innerhalb des Gerätes führen kann, in dem der Chip verwendet wird. Ein wichtiges Teilproblem in diesem Feld ist das Eigenschafts-Verifikations-Problem, bei dem geprüft wird, ob der gegebene Schaltkreisentwurf eine gewünschte Eigenschaft aufweist. Wir zeigen, wie dieses Problem als Constraint Integer Program modelliert werden kann und geben eine Reihe von problemspezifischen Algorithmen an, die die Struktur der einzelnen Constraints und der Gesamtschaltung ausnutzen. Testrechnungen auf Industrie-Beispielen vergleichen unseren Ansatz mit den bisher verwendeten SAT-Techniken und belegen den Erfolg unserer Methode.
    Keywords: ddc:510
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 26
    facet.materialart.
    Unknown
    Fare Planning for Public Transport (2009)
    Details
    Publication Date: 2020-08-05
    Description: In this paper we investigate the fare planning model for public transport, which consists in designing a system of fares maximizing the revenue. We discuss a discrete choice model in which passengers choose between different travel alternatives to express the demand as a function of fares. Furthermore, we give a computational example for the city of Potsdam and discuss some theoretical aspects.
    Keywords: ddc:510
    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
    Improving the performance of elevator systems using exact reoptimization algorithms (2009)
    Details
    Publication Date: 2020-08-05
    Description: This extended abstract is about algorithms for controlling elevator systems employing destination hall calls, i.e. the passenger provides his destination floor when calling an elevator. We present the first exact algorithm for controlling a group of elevators and report on simulation results indicating that destination hall call systems outperform conventional systems.
    Keywords: ddc:510
    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
    On goal-oriented adaptivity for elliptic optimal control problems (2009)
    Details
    Publication Date: 2019-01-29
    Description: The paper proposes goal-oriented error estimation and mesh refinement for optimal control problems with elliptic PDE constraints using the value of the reduced cost functional as quantity of interest. Error representation, hierarchical error estimators, and greedy-style error indicators are derived and compared to their counterparts when using the all-at-once cost functional as quantity of interest. Finally, the efficiency of the error estimator and generated meshes are demonstrated on numerical examples.
    Keywords: ddc:510
    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
  • 29
    facet.materialart.
    Unknown
    Consistency Results for the Contact-Stabilized Newmark Method (2009)
    Details
    Publication Date: 2016-06-09
    Description: The paper considers the time integration of frictionless dynamical contact problems between viscoelastic bodies in the frame of the Signorini condition. Among the numerical integrators, interest focuses on the contact-stabilized Newmark method recently suggested by Deuflhard et al., which is compared to the classical Newmark method and an improved energy dissipative version due to Kane et al. In the absence of contact, any such variant is equivalent to the Störmer-Verlet scheme, which is well-known to have consistency order 2. In the presence of contact, however, the classical approach to discretization errors would not show consistency at all because of the discontinuity at the contact. Surprisingly, the question of consistency in the constrained situation has not been solved yet. The present paper fills this gap by means of a novel proof technique using specific norms based on earlier perturbation results due to the authors. The corresponding estimation of the local discretization error requires the bounded total variation of the solution. The results have consequences for the construction of an adaptive timestep control, which will be worked out subsequently in a forthcoming paper.
    Keywords: ddc:510
    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
  • 30
    facet.materialart.
    Unknown
    Discrete Optimization in Public Transportation (2009)
    Details
    Publication Date: 2020-08-05
    Description: The mathematical treatment of planning problems in public transit has made significant advances in the last decade. Among others, the classical problems of vehicle and crew scheduling can nowadays be solved on a routine basis using combinatorial optimization methods. This is not yet the case for problems that pertain to the design of public transit networks, and for the problems of operations control that address the implementation of a schedule in the presence of disturbances. The article gives a sketch of the state and important developments in these areas, and it addresses important challenges. The vision is that mathematical tools of computer aided scheduling (CAS) will soon play a similar role in the design and operation of public transport systems as CAD systems in manufacturing.
    Description: Die mathematische Behandlung von Planungsproblemen im öffentlichen Verkehr hat im letzten Jahrzehnt große Fortschritte gemacht. Klassische Probleme wie die Umlauf- und die Dienstplanung können heutzutage routinemäßig mit kombinatorischen Optimierungsmethoden gelöst werden. Die Behandlung von Problemen der Angebotsplanung und der Betriebssteuerung sind dagegen noch nicht ganz auf diesem Stand. Dieser Artikel gibt einen Überblick über den Stand der Forschung, über wichtige Entwicklungen und einige Herausforderungen in diesem Gebiet. Die Vision ist, dass mathematische Planungswerkzeuge im öffentlichen Verkehr (Computer Aided Scheduling, CAS) in Zukunft eine ähnliche Rolle spielen werden wie CAD-Systeme in der industriellen Fertigung.
    Keywords: ddc:510
    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
    Variational and statistical shape modeling for 3D geometry reconstruction (2009)
    Details
    Publication Date: 2022-07-19
    Description: The reconstruction of geometric shapes plays an important role in many biomedical applications. One example is the patient-specific, computer-aided planning of complex interventions, which requires the generation of explicitly represented geometric models of anatomical structures from medical image data. Only solutions that require minimal interaction by medical personnel are likely to enter clinical routine. Another example is the planning of surgical corrections of deformities where the target shape is unknown. Surgeons are often forced to resort to subjective criteria. These applications still pose highly challenging reconstruction problems, which are addressed in this thesis. The fundamental hypothesis, pursued in this thesis, is that the problems can be solved by incorporating a-priori knowledge about shape and other application-specific characteristics. Here, we focus mainly on the aspect of geometric shape analysis. The basic idea is to capture the most essential variations of a certain class of geometric objects via statistical shape models, which model typical features contained in a given population, and restrict the outcome of a reconstruction algorithm (more or less) to the space spanned by such models. A fundamental prerequisite for performing statistical shape analysis on a set of different objects is the identification of corresponding points on their associated surfaces. This problem is particularly difficult to solve if the shapes stem from different individuals. The reason lies in the basic difficulty of defining suitable measures of similarity. In this thesis, we divide the correspondence problem into feature and non-feature matching. The feature part depends on the application, while the non-feature part can be characterized by a purely geometric description. We propose two different approaches. The first approach has proved useful in many applications. Yet, it suffers from some practical limitations and does not yield a measure of similarity. Our second, variational, approach is designed to overcome these limitations. In it, we propose to minimize an invariant stretching measure, constrained by previously computed features. An important property, which sets our method apart from previous work, is that it does not require the computation of a global surface parameterization.
    Keywords: ddc:510
    Language: English
    Type: doctoralthesis , doc-type:doctoralThesis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 32
    Electronic Resource
    Electronic Resource
    Masthead (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969) 
    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.1620010101
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 33
    Electronic Resource
    Electronic Resource
    Basis of finite element methods for solid continua (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 3-28 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Finite element methods can be formulated from the variational principles in solid mechanics by relaxing the continuity requirements along the interelement boundaries. The combination of different variational principles and different boundary continuity conditions yields numerous types of approximate methods. This paper reviews and reinterprets the existing finite element methods and indicates other alternative schemes. Plate bending problems are used to compare the relative merits of the various methods.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010103
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 34
    Electronic Resource
    Electronic Resource
    Editorial (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 1-2 
    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.1620010102
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 35
    Electronic Resource
    Electronic Resource
    Transmission of vibration in beam systems (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 47-66 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Three methods for finding natural frequencies and modes of complex structures composed of beam elements are described and compared. The analysis is extended to include hysteretic damping for the determination of response and transmissibility without a modal analysis. Experimental comparison is given for the response of a simple engineering structure.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010105
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 36
    Electronic Resource
    Electronic Resource
    A refined triangular plate bending finite element (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 101-122 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The derivation of the stiffness matrix for a refined, fully compatible triangular plate bending finite element is presented. The Kirchhoff plate bending theory is assumed. Six parameters or degrees of freedom are introduced at each of the three corner nodes resulting in an 18 degree of freedom element. This refined element is found to give better results for displacements and particularly for internal moments than any plate bending element, regardless of shape, previously reported in the literature.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010108
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 37
    Electronic Resource
    Electronic Resource
    Numerical treatment of mixed boundary value problems in two-dimensional elastostatics (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 67-73 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Finite difference treatment of two-dimensional problems in elastostatics is usually based on the differential equations for the displacement vector or the Airy stress function, depending on whether boundary conditions are on displacement or stress. In either case, determination of stresses requires numerical differentiation and therefore use of a rather fine grid. Moreover, neither method is suited to the treatment of mixed boundary conditions. The alternative method developed in this paper uses the first derivatives of the displacement components at the grid points as basic variables and hence does not require numerical differentiation in the evaluation of stresses. Appropriate finite difference equations are established, and their use is discussed in connection with a specific example with known explicit solution.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010106
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 38
    Electronic Resource
    Electronic Resource
    A conforming quartic triangular element for plate bending (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 29-45 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The theory, function generator routine and testing procedures are given for a six-node 18 degree of freedom triangular element. At corner nodes the variables are the displacement and the two slopes. At midside nodes the variables are the displacement, the slope normal to the side, and the rate of change of this along the side - i.e., the rate of torsion. Of two options, one divides the triangle into three and takes different quartic displacements in the three regions, and the other uses displacement functions with singularities at the vertices. According to a test which compares the energies of the two formulations by eigenvalues, the second is the better if the integration is accurate. The same test, together with others based on finite differences and on nodal values, etc. checks the correctness of the routine decisively.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010104
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 39
    Electronic Resource
    Electronic Resource
    Analysis of large deflection of plates by the finite element method (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 123-133 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The large deflection problem of a rectangular plate is analysed by using the finite element method and employing the iteration technique. In the present study, the stiffness matrix of a rectangular plate element for bending proposed by Greene is employed, and results of numerical examples duly justifies applicability of the present method.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010109
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 40
    Electronic Resource
    Electronic Resource
    Elasto-plastic solutions of engineering problems ‘initial stress’, finite element approach (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 75-100 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The paper presents first a general formulation of the elasto-plastic matrix for evaluating stress increments from those of stresses for any yield surface with an associated flow rule. A new ‘initial stress’ computational process is proposed which is shown (1) to yield more rapid convergence than alternative approaches (2) to permit large load increments without violating the yield criteria and thus simply to establish lower bound solutions. Several solutions showing stress distribution, strain development and growth of plastic enclaves are given both for the von Mises and for Coulomb (Drucker) type yield surfaces. Load reversal and thermoplastic behaviour are dealt with.
    Additional Material: 18 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010107
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 41
    Electronic Resource
    Electronic Resource
    Masthead (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969) 
    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.1620010201
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 42
    Electronic Resource
    Electronic Resource
    The damped transient behaviour of finite beams and plates (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 151-162 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The direct Finite Element Analysis which was successfully employed in the solution of dynamic flexural traveling wave problems is extended herein to provide the transient behaviour of finite beams and plates in which shear deformation and rotatory inertia are considered. The particle and angular velocities are exponentially damped so that the static solutions for these problems are obtained with the same analysis which provided the dynamic and transient cases. Three special cases are chosen as examples. In the first, a sinusoidally varying shear force is applied at the tip of a cantilever beam. The resonant characteristics of this beam for both the undamped and damped cases are studied. In the second, a step shear loading is applied to a cantilever beam and its damped dynamic history is studied. Finally, a circular plate whose outer edge is simply supported is impacted at its inner edge by a step moment and its damped transient behaviour is determined. The idea of the methods is potentially applicable to dynamic problems in general.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010203
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 43
    Electronic Resource
    Electronic Resource
    A polygonal finite element for plate bending problems using the assumed stress approach (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 135-149 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The assumed stress distribution approach is used to derive the stiffness matrix of a plate-bending element of general polygonal shape having any number of nodes. The effect of assuming various numbers of unknown coefficients in the stress distributions is examined and the convergence properties of the resulting elements compared with others derived form assumed displacements.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010202
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 44
    Electronic Resource
    Electronic Resource
    Numerical solution and utilization of Green's functions (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 169-175 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A numerical method for obtaining the Green's functions for Laplace's, Poisson's, and the transient heat diffusion equations is presented. The Green's functions thus obtained are then employed to rapidly obtain numerical solutions of the above equations by matrix multiplication, with subsequent considerable savings in machine time.
    Additional Material: 3 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010205
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 45
    Electronic Resource
    Electronic Resource
    A method of solution for non-linear simultaneous algebraic equations (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 177-180 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The solution of the large numbers of non-linear algebraic equations occurring in analyses of non-linear structural systems using finite differences or finite elements is time consuming even for the fastest computers. This paper presents a method of solution based on a Taylor's expansion technique which is an aid in the solution of such systems of equations.Examples presented show that in the finite element analysis of moderately non-linear structural systems the technique provides sufficiently accurate solutions. For more non-linear systems the technique provides excellent starting values for the Newton-Raphson method.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010206
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 46
    Electronic Resource
    Electronic Resource
    Improved deformation functions for the finite element anlysis of beam systems (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 163-167 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Deformation functions which, in addition to satisfying the continuity conditions at nodes. Also satisfy. Approximately, the governing differential equation within the element allow system eigenvalues to be found more accurately, with a given number of elements, than is possible with previously published deformation functions. This is illustrated for the case of beams.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010204
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 47
    Electronic Resource
    Electronic Resource
    Economical computer techniques for numerically integrated finite elements (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 201-203 
    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.1620010208
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 48
    Electronic Resource
    Electronic Resource
    A general theory of finite elements. I. Topological considerations (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 205-221 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents a general theory of finite elements. The concept of finite elements is cast in a general topological framework valid for spaces of finite dimension. It is shown that the idea of finite element models can be developed in higher-dimensional spaces, independent of specific co-ordinate systems, for any type of continuous abstract function defined on the space. Generalizations of the familiar Lagrange and Hermite interpolation functions are presented as well as a general statement of the notion of generalized variables and conjugate fields. It is also shown that admissible finite elements can be developed for non-Euclidean spaces of finite dimension. Topological properties of finite element models are examined in Part I of the paper. Part II is devoted to certain applications.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010209
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 49
    Electronic Resource
    Electronic Resource
    Announcement (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 224-224 
    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.1620010302
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 50
    Electronic Resource
    Electronic Resource
    Masthead (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969) 
    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.1620010301
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 51
    Electronic Resource
    Electronic Resource
    A matrix for the solution of mixed rotating and non-rotating vibration systems (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 225-245 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A method is presented based on matrix algebra for the dynamic analysis of a mixed rotating and non-rotating vibration system. Such systems occur in practice when turbo-alternator sets are mounted on flexible steel foundations.The mathematical model considered consists of a rotating non-uniform, bi-symmetric shaft connected via three or more flexible-film bearings to a flexible structure throughout which mass is distributed. The shaft, which is assumed to rotate at constant speed, is heavy, flexible and carries several rigid axi-symmetric discs. Viscous damping is assumed to act in all parts of the system and gravitational effects are ignored.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010303
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 52
    Electronic Resource
    Electronic Resource
    End displacements of semi-infinite cylinders due to annular loadings (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 181-200 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Surface displacements at the end of a semi-infinite, circular cylinder due to an axisymmetric ring of forces on the end are examined. The solution which has been found may then be used to find surface displacements for general axisymmetric loadings by convolution. The solution, in tabular form, is given as corrections to the counter-part half-space solution.The method of solution involves a three step superposition process. First, the displacement due to a ring of forces on a half-space is found by using the Boussinesq solution. Then, the excess tractions on the half-space, over that of the cylinder, are removed. This is done in two parts. The problem of an infinite cylinder with linearly varying pressure and shear over a short length of the lateral surface is solved by using Fourier integrals. This is used for the removal of the pressure and shear on the lateral surface of the cylinder by convolution. Next, the stresses at the mid-section of the infinite cylinder are removed. This is done by finding a set of boundary conditions for the end which yields zero tractions on the lateral surface. Then a series of these boundary conditions is used to approximate the tractions which must be removed.With the solution thus obtained, two sample problems are shown: 1. an elastic cylinder in contact with a half-space; 2. a rigid punch in contact with an elastic cylinder.
    Additional Material: 10 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010207
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    A general theory of finite elements. II. Applications (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 247-259 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In Part I of the this paper, topological properties of finite element models of functions defined on spaces of finite dimension were examined. In this part, a number of applications of the general theory are presented. These include the generation of finite element models in the time domain and certain problems in wave propagation, kinetic theory of gases, non-linear partial differential equations, non-linear continuum mechanics, and fluid dynamics.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010304
    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 version of the Aitken accelerator for computer iteration (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 275-277 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010306
    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 rectangular plate bending element the use of which is equivalent to the use of the finite difference method (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 261-274 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A presentation is made of a rectangular plate bending element, the use of which corresponds to the finite difference method. The element stiffness matrix is arrived at by approximation of the strain energy of the element by suitably selected finite difference expressions which contain not only values in respect of the deflection, but also values of its first derivatives. On the basis of the connection found between the two methods, some changes are suggested in the finite difference method, which involve a more realistic way of considering the detailed distribution of the loading. The effect of these modifications is illustrated in two applications.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010305
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    A theory of the solution of steady state network problems with special reference to mine ventilation networks (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 279-299 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: When calculating complex interconnected systems (electrical, power, water supply, gas systems, etc.) by digital computer, a number of common problems arise, connected both with the mathematically correct formulation of the problem under investigation, and with the algorithms of the solution, the programming of which makes it possible to reduce the computing time, the store capacity and the volume of input data required. The present article is devoted to the solution of these problems. The procedure is illustrated by formulating and manipulating the equations relating to complex interconnected mine ventilation networks.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010307
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    Masthead (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969) 
    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.1620010401
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    Derivation of stiffness matrices for problems in plane elasticity by Galerkin's method (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 301-310 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Solution of plane elastic problems by piecewise linear approximation is outlined. This method is based upon Galerkin error distribution technique, which leads to simultaneous algebraic equations identical to those associated with the Finite Element Method. In addition, this method permits definition of the discretization error, which can be computed once the displacement components are known. Properties of the interpolation functions are discussed, and a sequence of internally compatible plane elastic elements is defined.
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010308
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    Minimum weight design of structures with application to elastic grillages (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 311-331 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A review is given of some mathematical programming methods suitable for optimization of structures needing matrix methods for analysis. An application is presented for elastic flat grillages made of straight orthogonal beams normally loaded. Empirical relationships are used to relate beam section properties so that each beam element has only one design variable. Optimization results are obtained by methods of stress-ratio, linear programming-cutting plane and usable-feasible gradient directions. A comparison of the efficiency of these methods is given for the grillage designs which are shown to have non-convex stress constraints and numerous relative optima. Instances are given of non-fully stressed global optima and fully stressed designs which are not local optima for cases with only stress constraints. Discussions include locating the global optima for grillage designs and extensions of the methods presented to other structural design problems.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010402
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    Mass condensation : A semi-automatic method for reducing the size of vibration problems (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 333-349 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The paper presents a method for reducing the size of a vibration analysis by generating an inertia matrix referred to a limited set of ‘master’ vibrational freedoms. In designing a computer program to perform this mass condensation process, the emphasis has been on providing a two way interface between structural analysis and vibration analysis programs. The transformation from the full set of degrees of freedom to the master set makes extensive vibration calculations economically feasible giving solutions in terms of the amplitudes of the master freedoms. However, by reversing the transformation after completion of a vibration analysis, it is possible to restore the full set of freedoms, allowing automatic plotting of mode shapes in full detail, and re-entry to the structural analysis program for the purpose of computing dynamic stresses.A worked example is given. This is a realistic machine tool structure rather than the simple plates or beams which are usually used for illustration purposes. Natural frequencies and mode shapes, calculated with various degrees of condensation, are compared with those obtained by using all possible freedoms. A comparison is also made with an intuitive selection of ‘lumped masses’.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010403
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    Application of non-linear programming to optimum grillage design with non-convex sets of variables (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 351-378 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The application of non-linear programming methods for the optimum design of statically indeterminate structures is discussed, with special emphasis on the design of elastic grillages loaded laterally and in plane. Some features of SUMT (sequential unconstrained minimization technique) are demonstrated by means of numerous examples of varying complexity. The Variable Metric method of search is discussed and compared to Powell's Direct Method. It is shown that non-convex sets of design variables are often encountered in structural problems of the grillage type. SUMT may still be used, but the choice of starting value and initial response factor decisively influences the chance of finding the global optimum.It is demonstrated that a fully stressed design may not necessarily correspond to the minimum weight design. Optimum design of grillages which are simultaneously subjected to lateral and in-plane loads may be performed efficiently by means of non-linear programming.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010404
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    A finite element method of viscoelastic stress analysis with application to rolling contact problems (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 379-394 
    Details
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A completely numerical method for steady state linear viscoelastic stress analysis is presented by means of the finite element approach. Numerical representations of the measured viscoelastic constitutive relations are used. This method is developed to obtain steady state solutions to mixed boundary value problems in which the character of the boundary conditions at a point changes with time. Such problems cannot be handled by direct application of the correspondence theorem. A numerical example of viscoelastic sheet rolling is presented along with an experimental verification of the solution by photo-viscoelastic observations.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620010405
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    Letters to editor (1969)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 1 (1969), S. 395-395 
    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.1620010406
    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...