Variational time integrators are derived in the context of discrete mechanical systems. In this area, the governing equations for the motion of the mechanical system are built following two steps: (a) Postulating a discrete action; (b) Computing the stationary value for the discrete action. The former is formulated by considering Lagrangian (or Hamiltonian) systems with the discrete action being constructed through numerical approximations of the action integral. The latter derives the discrete Euler-Lagrange equations whose solutions give the variational time integrator. In this paper, we build variational time integrators in the context of smoothed particle hydrodynamics (SPH). So, we start with a variational formulation of SPH for fluids. Then, we apply the generalized midpoint rule, which depends on a parameter @math , in order to generate the discrete action. Then, the step (b) yields a variational time integration scheme that reduces to a known explicit one if @math but it is implicit otherwise. Hence, we design a fixed point iterative method to approximate the solution and prove its convergence condition. Besides, we show that the obtained discrete Euler-Lagrange equations preserve linear momentum. In the experimental results, we consider artificial viscous as well as boundary interaction effects and simulate a dam breaking set up. We compare the explicit and implicit SPH solutions and analyze momentum conservation of the dam breaking simulations.
Variational integrators in mechanical systems start by considering mechanics from a variational point of view, following remarkable works of Lagrange and Hamilton @cite_24 . The Hamilton's principle or the least action principle allows to cast the Newton's framework into a geometric viewpoint in which the path followed by the physical system in the configuration space has optimal geometric properties analogously to the notion of geodesics on curved surfaces @cite_20 . Therefore, we can design numerical integrators that exploit the geometric structure behind mechanical systems, which are named geometric integrators @cite_11 @cite_20 . A special class of geometric integrators, called variational integrators, discretized the variational formulation of mechanics generating iterative schemes to compute an approximation for the path of the physical system with any order of accuracy. Besides, this discrete geometric framework can handle constraints, external and dissipative forces making variational integrators both versatile and powerful @cite_16 @cite_23 @cite_14 .
@cite_14 @cite_24 @cite_23 @cite_16 @cite_20 @cite_11
2116910902 2124969394 2041166905 1544770838
The purpose of this work is twofold. First, we demonstrate analytically that the classical Newmark family as well as related integration algorithms are variational in the sense of the Veselov formulation of discrete mechanics. Such variational algorithms are well known to be symplectic and momentum preserving and to often have excellent global energy behavior. This analytical result is veried through numerical examples and is believed to be one of the primary reasons that this class of algorithms performs so well. Second, we develop algorithms for mechanical systems with forcing, and in particular, for dissipative systems. In this case, we develop integrators that are based on a discretization of the Lagrange d'Alembert principle as well as on a variational formulation of dissipation. It is demonstrated that these types of structured integrators have good numerical behavior in terms of obtaining the correct amounts by which the energy changes over the integration run. This study derives geometric, variational discretization of continuum theories arising in fluid dynamics, magnetohydrodynamics (MHD), and the dynamics of complex fluids. A central role in these discretizations is played by the geometric formulation of fluid dynamics, which views solutions to the governing equations for perfect fluid flow as geodesics on the group of volume-preserving diffeomorphisms of the fluid domain. Inspired by this framework, we construct a finite-dimensional approximation to the diffeomorphism group and its Lie algebra, thereby permitting a variational temporal discretization of geodesics on the spatially discretized diffeomorphism group. The extension to MHD and complex fluid flow is then made through an appeal to the theory of Euler–Poincare systems with advection, which provides a generalization of the variational formulation of ideal fluid flow to fluids with one or more advected parameters. Upon deriving a family of structured integrators for these systems, we test their performance via a numerical implementation of the update schemes on a cartesian grid. Among the hallmarks of these new numerical methods are exact preservation of momenta arising from symmetries, automatic satisfaction of solenoidal constraints on vector fields, good long-term energy behavior, robustness with respect to the spatial and temporal resolution of the discretization, and applicability to irregular meshes. This paper gives a review of integration algorithms for finite dimensional mechanical systems that are based on discrete variational principles. The variational technique gives a unified treatment of many symplectic schemes, including those of higher order, as well as a natural treatment of the discrete Noether theorem. The approach also allows us to include forces, dissipation and constraints in a natural way. Amongst the many specific schemes treated as examples, the Verlet, SHAKE, RATTLE, Newmark, and the symplectic partitioned Runge–Kutta schemes are presented. The purpose of this paper is to review and further develop the subject of variational integration algorithms as it applies to mechanical systems of engineering interest. In particular, the conservation properties of both synchronous and asynchronous variational integrators (AVIs) are discussed in detail. We present selected numerical examples which demonstrate the excellent accuracy, conservation and convergence characteristics of AVIs. In these tests, AVIs are found to result in substantial speed-ups, at equal accuracy, relative to explicit Newmark. A mathematical proof of convergence of the AVIs is also presented in this paper. Finally, we develop the subject of horizontal variations and configurational forces in discrete dynamics. This theory leads to exact path-independent characterizations of the configurational forces acting on discrete systems. Notable examples are the configurational forces acting on material nodes in a finite element discretisation; and the J-integral at the tip of a crack in a finite element mesh. We present a technique to implement scalable variational integrators for generic mechanical systems in generalized coordinates. Systems are represented by a tree-based structure that provides efficient means to algorithmically calculate values (position, velocities, and derivatives) needed for variational integration without the need to resort to explicit equations of motion. The variational integrator handles closed kinematic chains, holonomic constraints, dissipation, and external forcing without modification. To avoid the full equations of motion, this method uses recursive equations, and caches calculated values, to scale to large systems by the use of generalized coordinates. An example of a closed-kinematic-chain system is included along with a comparison with the open-dynamics engine (ODE) to illustrate the scalability and desirable energetic properties of the technique. A second example demonstrates an application to an actuated mechanical system. Abstract Documents in computer-readable form can be used to provide information about other documents, i.e. those they cite. To do this efficiently requires procedures for computer recognition of citing statements. This is not easy, especially for multi-sentence citing statements. Computer recognition procedures have been developed which are accurate to the following extent: 73 of the words in statements selected by computer procedures as being citing statements are words which are correctly attributable to the corresponding documents. The retrieval effectiveness of computer-recognized citing statements was tested in the following way. First, for eight retrieval requests in inorganiic chemistry, average recall by search of Chemical Abstracts Service indexing and Chemical Abstracts abstract text words was found to be 50 . Words from citing statements referring to the papers to be retrieved were then added to the index terms and abstract words as additional access points, and searching was repeated. Average recall increased to 70 . Only words from citing statements published within a year of the cited papers were used. The retrieval effect of citing statement words alone (published within a year) without index or abstract terms was the following: average recall was 40 . When just the words of the titles of the cited papers were added to those citing statement words, average recall increased to 50 . This article is concerned with the animation and control of vehicles with complex dynamics such as helicopters, boats, and cars. Motivated by recent developments in discrete geometric mechanics, we develop a general framework for integrating the dynamics of holonomic and nonholonomic vehicles by preserving their state-space geometry and motion invariants. We demonstrate that the resulting integration schemes are superior to standard methods in numerical robustness and efficiency, and can be applied to many types of vehicles. In addition, we show how to use this framework in an optimal control setting to automatically compute accurate and realistic motions for arbitrary user-specified constraints. A new form of document coupling called co-citation is defined as the frequency with which two documents are cited together. The co-citation frequency of two scientific papers can be determined by comparing lists of citing documents in the Science Citation Index and counting identical entries. Networks of co-cited papers can be generated for specific scientific specialties, and an example is drawn from the literature of particle physics. Co-citation patterns are found to differ significantly from bibliographic coupling patterns, but to agree generally with patterns of direct citation. Clusters of co-cited papers provide a new way to study the specialty structure of science. They may provide a new approach to indexing and to the creation of SDI profiles. Few computational models have addressed the spatiotemporal features of unconstrained three-dimensional (3D) arm motion. Empirical observations made on hand paths, speed profiles, and arm postures during point-to-point movements led to the assumption that hand path and arm posture are independent of movement speed, suggesting that the geometric and temporal properties of movements are decoupled. In this study, we present a computational model of 3D movements for an arm with four degrees of freedom based on the assumption that optimization principles are separately applied at the geometric and temporal levels of control. Geometric properties (path and posture) are defined in terms of geodesic paths with respect to the kinetic energy metric in the Riemannian configuration space. Accordingly, a geodesic path can be generated with less muscular effort than on any other, nongeodesic path, because the sum of all configuration-speed-dependent torques vanishes. The temporal properties of the movement (speed) are determined in task space by minimizing the squared jerk along the selected end-effector path. The integration of both planning levels into a single spatiotemporal representation simplifies the control of arm dynamics along geodesic paths and results in movements with near minimal torque change and minimal peak value of kinetic energy. Thus, the application of Riemannian geometry allows for a reconciliation of computational models previously proposed for the description of arm movements. We suggest that geodesics are an emergent property of the motor system through the exploration of dynamical space. Our data validated the predictions for joint trajectories, hand paths, final postures, speed profiles, and driving torques. Introduction 1. Formulations of interface propagation Part I. Theory and Algorithms: 2. Theory of curve and surface evolution 3. Hamilton-Jacobi equations and associated theory 4. Numerical approximations: first attempt 5. Numerical schemes for hyperbolic conservation laws 6. Algorithms for the initial and boundary value formulations 7. Efficient schemes: adaptivity 8. Triangulated versions of level set and fast marching method: extensions and variations 9. Tests of basic methods Part II. Applications: 10. Geometry 11. Grid generation 12 Image denoising 13. Computer vision: shape detection and recognition 14. Fluid mechanics and materials sciences: adding physics 15. Computational geometry and computer-aided-design 16. First arrivals, optimizations, and control 17. Applications to semi-conductor manufacturing 18. Comments, conclusions, future directions References Index. Abstract By using a very simple remark on the moment equations of stochastic Markov processes, one can use the Euler-Lagrange variational approach (with Hamiltonian) to solve some stochastic optimal control problems. As an example one considers a linear-quadratic-Gaussian problem with small state dependent noise, which is solved by a perturbation technique (expansions with respect the small parameter). Another application example is provided by the tracking control of mechanical systems with noisy sliding equations which works via the stochastic Hamilton's principle of mechanical systems. Finally, an economic example shows that the approach also works with moments of fractional order. We present a new discretization for the physics-based animation of developable surfaces. Constrained to not deform at all in-plane but free to bend out-of-plane, these are an excellent approximation for many materials, including most cloth, paper, and stiffer materials. Unfortunately the conforming (geometrically continuous) discretizations used in graphics break down in this limit. Our nonconforming approach solves this problem, allowing us to simulate surfaces with zero in-plane deformation as a hard constraint. However, it produces discontinuous meshes, so we further couple this with a "ghost" conforming mesh for collision processing and rendering. We also propose a new second order accurate constrained mechanics time integration method that greatly reduces the numerical damping present in the usual first order methods used in graphics, for virtually no extra cost and sometimes significant speed-up. In a document network such as a citation network of scientific documents, web-logs, etc., the content produced by authors exhibits their interest in certain topics. In addition some authors influence other authors' interests. In this work, we propose to model the influence of cited authors along with the interests of citing authors. Moreover, we hypothesize that apart from the citations present in documents, the context surrounding the citation mention provides extra topical information about the cited authors. However, associating terms in the context to the cited authors remains an open problem. We propose novel document generation schemes that incorporate the context while simultaneously modeling the interests of citing authors and influence of the cited authors. Our experiments show significant improvements over baseline models for various evaluation criteria such as link prediction between document and cited author, and quantitatively explaining unseen text. Since most current scene understanding approaches operate either on the 2D image or using a surface-based representation, they do not allow reasoning about the physical constraints within the 3D scene. Inspired by the "Blocks World" work in the 1960's, we present a qualitative physical representation of an outdoor scene where objects have volume and mass, and relationships describe 3D structure and mechanical configurations. Our representation allows us to apply powerful global geometric constraints between 3D volumes as well as the laws of statics in a qualitative manner. We also present a novel iterative "interpretation-by-synthesis" approach where, starting from an empty ground plane, we progressively "build up" a physically-plausible 3D interpretation of the image. For surface layout estimation, our method demonstrates an improvement in performance over the state-of-the-art [9]. But more importantly, our approach automatically generates 3D parse graphs which describe qualitative geometric and mechanical properties of objects and relationships between objects within an image. Historically, papers have been physically bound to the journal in which they were published; but in the digital age papers are available individually, no longer tied to their respective journals. Hence, papers now can be read and cited based on their own merits, independently of the journal's physical availability, reputation, or impact factor (IF). We compare the strength of the relationship between journals' IFs and the actual citations received by their respective papers from 1902 to 2009. Throughout most of the 20th century, papers' citation rates were increasingly linked to their respective journals' IFs. However, since 1990, the advent of the digital age, the relation between IFs and paper citations has been weakening. This began first in physics, a field that was quick to make the transition into the electronic domain. Furthermore, since 1990 the overall proportion of highly cited papers coming from highly cited journals has been decreasing and, of these highly cited papers, the proportion not coming from highly cited journals has been increasing. Should this pattern continue, it might bring an end to the use of the IF as a way to evaluate the quality of journals, papers, and researchers. © 2012 Wiley Periodicals, Inc. In the work of the authors (2003), we showed that graph cuts can find hypersurfaces of globally minimal length (or area) under any Riemannian metric. Here we show that graph cuts on directed regular grids can approximate a significantly more general class of continuous non-symmetric metrics. Using submodularity condition (Boros and Hammer, 2002 and Kolmogorov and Zabih, 2004), we obtain a tight characterization of graph-representable metrics. Such "submodular" metrics have an elegant geometric interpretation via hypersurface functionals combining length area and flux. Practically speaking, we attend 'geo-cuts' algorithm to a wider class of geometrically motivated hypersurface functionals and show how to globally optimize any combination of length area and flux of a given vector field. The concept of flux was recently introduced into computer vision by Vasilevskiy and Siddiqi (2002) but it was mainly studied within variational framework so far. We are first to show that flux can be integrated into graph cuts as well. Combining geometric concepts of flux and length area within the global optimization framework of graph cuts allows principled discrete segmentation models and advances the slate of the art for the graph cuts methods in vision. In particular we address the "shrinking" problem of graph cuts, improve segmentation of long thin objects, and introduce useful shape constraints. A citing sentence is one that appears in a scientific article and cites previous work. Citing sentences have been studied and used in many applications. For example, they have been used in scientific paper summarization, automatic survey generation, paraphrase identification, and citation function classification. Citing sentences that cite multiple papers are common in scientific writing. This observation should be taken into consideration when using citing sentences in applications. For instance, when a citing sentence is used in a summary of a scientific paper, only the fragments of the sentence that are relevant to the summarized paper should be included in the summary. In this paper, we present and compare three different approaches for identifying the fragments of a citing sentence that are related to a given target reference. Our methods are: word classification, sequence labeling, and segment classification. Our experiments show that segment classification achieves the best results. A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geometry of a surface remains a tedious task. In this paper, we present both theoretical and practical contributions that result in a novel and versatile framework for geometric approximation of surfaces. We depart from the usual strategy by casting shape approximation as a variational geometric partitioning problem. Using the concept of geometric proxies, we drive the distortion error down through repeated clustering of faces into best-fitting regions. Our approach is entirely discrete and error-driven, and does not require parameterization or local estimations of differential quantities. We also introduce a new metric based on normal deviation, and demonstrate its superior behavior at capturing anisotropy. Curvature-based energy and forces are used in a broad variety of contexts, ranging from modeling of thin plates and shells to surface fairing and variational surface design. The approaches to discretization preferred in different areas often have little in common: engineering shell analysis is dominated by finite elements, while spring-particle models are often preferred for animation and qualitative simulation due to their simplicity and low computational cost. Both types of approaches have found applications in geometric modeling. While there is a well-established theory for finite element methods, alternative discretizations are less well understood: many questions about mesh dependence, convergence and accuracy remain unanswered. We discuss the general principles for defining curvature-based energy on discrete surfaces based on geometric invariance and convergence considerations. We show how these principles can be used to understand the behavior of some commonly used discretizations, to establish relations between some well-known discrete geometry and finite element formulations and to derive new simple and efficient discretizations. This talk will outline a comprehensive set of modeling, analysis and design techniques for a class of mechanical systems. We concern ourselves with simple mechanical control systems, that is, systems whose Lagrangian is kinetic energy minus potential energy. Example devices include robotic manipulators, aerospace and underwater vehicles, and mechanisms that locomote exploiting nonholonomic constraints. Borrowing techniques from nonlinear control and geometric mechanics, we propose a coordinateinvariant control theory for this class of systems. First, we take a Riemannian geometric approach to modeling systems dened on smooth manifolds, subject to nonholonomic constraints, external forces and control forces. We also model mechanical systems on groups and symmetries. Second, we analyze some control-theoretic properties of this class of systems, including controllability, averaged response to oscillatory controls, and kinematic reductions. Finally, we exploit the modeling and analysis results to tackle control design problems. Starting from controllability and kinematic reduction assumptions we propose some algorithms for generating and tracking trajectories.