Home About us Contact
|
Home About us Contact | ||
|
|
||
Effective Algorithm (effective + algorithm)
Selected AbstractsEffektiver Algorithmus zur Lösung von inversen Aufgabenstellungen , Anwendung in der GeomechanikBAUTECHNIK, Issue 7 2006Jörg Meier Dipl.-Ing. Durch den Einsatz von numerischen Modellen für ingenieurtechnische Problemstellungen, wie z. B. der FEM oder der FDM, können zunehmend komplexere Berechnungen in immer kürzerer Zeit bewältigt werden. Gleichzeitig ergibt sich jedoch bei dem Einsatz dieser Werkzeuge der Bedarf an Werten für die verschiedenen Modellparameter, von rein konstitutiven Kennwerten bis hin zu geometrischen Angaben, für deren Bestimmung zunehmend inverse Verfahren Anwendung finden. Bei der Nutzung dieser Methoden ist jedoch , insbesondere bei komplizierten Simulationen , mit sehr langen Berechnungszeiten zu rechnen. Gegenstand dieses Beitrags ist die Vorstellung einer Verfahrensklasse, die eine Abschätzung der Lösung solcher inverser Aufgaben auf der Basis von relativ wenigen Stützstellen ermöglicht. An die Verteilung der Stützstellen werden geringste Anforderungen gestellt, so daß diese wahlweise aus vorhergehenden Simulationen oder auch aus alternativen Quellen stammen können. Im Rahmen dieses Beitrags soll ausgehend von einer Einführung in den theoretischen Ansatz eine Strategie zur Beschleunigung der Lösung von inversen Problemstellungen und Optimierungsaufgaben an einem Beispiel aus dem Gebiet der Geomechanik vorgestellt werden. Effective algorithm for solving inverse problems , geomechanical application. When working with numerical models, it is essential to determine model parameters which are as realistic as possible. Optimization techniques are being employed more and more frequently for solving this task. However, using these methods may lead to very high time costs , in particular, if rather complicated forward calculations are involved. In this paper, we present a class of methods that allows estimating the solution of this kind of optimization problems based on relatively few sampling points. We put very weak constraints on the sampling point distribution; hence, they may be taken from previous forward calculations as well as from alternative sources. Starting from an introduction into the theoretical approach, a strategy for speeding up inverse optimization problems is introduced which is illustrated by an example geomechanics. [source] Deformation Transfer to Multi-Component ObjectsCOMPUTER GRAPHICS FORUM, Issue 2 2010Kun Zhou Abstract We present a simple and effective algorithm to transfer deformation between surface meshes with multiple components. The algorithm automatically computes spatial relationships between components of the target object, builds correspondences between source and target, and finally transfers deformation of the source onto the target while preserving cohesion between the target's components. We demonstrate the versatility of our approach on various complex models. [source] General Gyrokinetic Equations for Edge PlasmasCONTRIBUTIONS TO PLASMA PHYSICS, Issue 7-9 2006H. Qin Abstract During the pedestal cycle of H-mode edge plasmas in tokamak experiments, large-amplitude pedestal build-up and destruction coexist with small-amplitude drift wave turbulence. The pedestal dynamics simultaneously includes fast time-scale electromagnetic instabilities, long time-scale turbulence-induced transport processes, and more interestingly the interaction between them. To numerically simulate the pedestal dynamics from first principles, it is desirable to develop an effective algorithm based on the gyrokinetic theory. However, existing gyrokinetic theories cannot treat fully nonlinear electromagnetic perturbations with multi-scale-length structures in spacetime, and therefore do not apply to edge plasmas. A set of generalized gyrokinetic equations valid for the edge plasmas has been derived. This formalism allows large-amplitude, time-dependent background electromagnetic fields to be developed fully nonlinearly in addition to small-amplitude, short-wavelength electromagnetic perturbations. It turns out that the most general gyrokinetic theory can be geometrically formulated. The Poincaré-Cartan-Einstein 1-form on the 7D phase space determines particles' worldlines in the phase space, and realizes the momentum integrals in kinetic theory as fiber integrals. The infinitesimal generator of the gyro-symmetry is then asymptotically constructed as the base for the gyrophase coordinate of the gyrocenter coordinate system. This is accomplished by applying the Lie coordinate perturbation method to the Poincaré-Cartan-Einstein 1-form. General gyrokinetic Vlasov-Maxwell equations are then developed as the Vlasov-Maxwell equations in the gyrocenter coordinate system, rather than a set of new equations. Because the general gyrokinetic system developed is geometrically the same as the Vlasov-Maxwell equations, all the coordinate-independent properties of the Vlasov-Maxwell equations, such as energy conservation, momentum conservation, and phase space volume conservation, are automatically carried over to the general gyrokinetic system. The pullback transformation associated with the coordinate transformation is shown to be an indispensable part of the general gyrokinetic Vlasov-Maxwell equations. As an example, the pullback transformation in the gyrokinetic Poisson equation is explicitly expressed in terms of moments of the gyrocenter distribution function, with the important gyro-orbit squeezing effect due to the large electric field shearing in the edge and the full finite Larmour radius effect for short wavelength fluctuations. The familiar "polarization drift density" in the gyrocenter Poisson equation is replaced by a more general expression. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [source] Displacement-controlled method and its applications to material non-linearityINTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS, Issue 3 2005H. Zheng Abstract For the analysis of non-linear problems, the displacement-controlled method (DCM) has a more extensive application scope and more powerful abilities than the load-controlled method (LCM). However, difficulties of the DCM's procedure not amenable to most finite element implementations of the conventional LCM have restricted its applications in geomechanics. By means of Sherman,Morrison's theorem, the solution of DCM is improved. The improved procedure is characterized by high efficiency, good numerical stability and a programme structure similar to LCM. Two aspects of applications of DCM are illustrated. The first application is to compute the response of a structure under a given load level like the conventional finite element analysis. The second application is to trace the equilibrium path of a structure under a given load distribution type. A simple but effective algorithm is presented for automatically adjusting the step length in tracing the equilibrium path. Examples illustrate that the proposed procedures are suited for modelling complicated non-linear problems in geomechanics. Copyright © 2005 John Wiley & Sons, Ltd. [source] State space sampling of feasible motions for high-performance mobile robot navigation in complex environmentsJOURNAL OF FIELD ROBOTICS (FORMERLY JOURNAL OF ROBOTIC SYSTEMS), Issue 6-7 2008Thomas M. Howard Sampling in the space of controls or actions is a well-established method for ensuring feasible local motion plans. However, as mobile robots advance in performance and competence in complex environments, this classical motion-planning technique ceases to be effective. When environmental constraints severely limit the space of acceptable motions or when global motion planning expresses strong preferences, a state space sampling strategy is more effective. Although this has been evident for some time, the practical question is how to achieve it while also satisfying the severe constraints of vehicle dynamic feasibility. The paper presents an effective algorithm for state space sampling utilizing a model-based trajectory generation approach. This method enables high-speed navigation in highly constrained and/or partially known environments such as trails, roadways, and dense off-road obstacle fields. © 2008 Wiley Periodicals, Inc. [source] Patterning by genetic networksMATHEMATICAL METHODS IN THE APPLIED SCIENCES, Issue 2 2006S. Genieys Abstract We consider here the morphogenesis (pattern formation) problem for some genetic network models. First, we show that any given spatio-temporal pattern can be generated by a genetic network involving a sufficiently large number of genes. Moreover, patterning process can be performed by an effective algorithm. We also show that Turing's or Meinhardt's type reaction,diffusion models can be approximated by genetic networks. These results exploit the fundamental fact that the genes form functional units and are organized in blocks. Due to this modular organization, the genes always are capable to construct any new patterns and even any time sequences of new patterns from old patterns. Computer simulations illustrate some analytical results. Copyright © 2005 John Wiley & Sons, Ltd. [source] A single-period inventory placement problem for a serial supply chainNAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 6 2001Chia-Shin Chung Abstract This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506,517, 2001 [source] A systematic approach to the derivation of standard orientation-location parts of symmetry-operation symbolsACTA CRYSTALLOGRAPHICA SECTION A, Issue 6 2007Kazimierz Stró Automatically generated orientation-location parts, or coordinate triplets describing the geometric elements, differ frequently from the corresponding parts of the symmetry-operation symbols listed in International Tables for Crystallography [(1983), Vol. A, Space-Group Symmetry, edited by Th. Hahn. Dordrecht: Reidel]. An effective algorithm enabling the derivation of standard orientation-location parts from any symmetry matrix is described and illustrated. The algorithm is based on a new concept alternative to the `invariant points of reduced operation'. First, the geometric element that corresponds to a given symmetry operation is oriented and located in a nearly convention free manner. The application of the direction indices [uvw] or Miller indices (hkl) gives a unique orientation provided the convention about the positive direction is defined. The location is fixed by the specification of a unique point on the geometric element, i.e. the point closest to the origin. Next, both results are converted into the standard orientation-location form. The standardization step can be incorporated into other existing methods of derivation of the symmetry-operation symbols. A number of standardization examples are given. [source] Singular fiber of the Mumford system and rational solutions to the KdV hierarchyCOMMUNICATIONS ON PURE & APPLIED MATHEMATICS, Issue 4 2010Rei Inoue We study the singular isolevel manifold Mg(0) of the genus g Mumford system associated to the spectral curve y2 = x2g + 1. We show that Mg(0) is stratified by g + 1 open subvarieties of additive algebraic groups of dimension 0, 1, ,, g, and we give an explicit description of Mg(0) in terms of the compactification of the generalized Jacobian. As a consequence, we obtain an effective algorithm to compute rational solutions to the genus g Mumford system, which is closely related to rational solutions of the KdV hierarchy. © 2009 Wiley Periodicals, Inc. [source] | |||||||||||||