Abstract. We consider a nonlinear, moving boundary, fluid-structure interaction problem between a time dependent incompressible, viscous fluid flow, and an elastic structure composed of a cylindrical shell supported by a mesh of elastic rods. The fluid flow is modeled by the time-dependent Navier- Stokes equations in a three-dimensional cylindrical domain, while the lateral wall of the cylinder is modeled by the two-dimensional linearly elastic Koiter shell equations coupled to a one-dimensional system of conservation laws defined on a graph domain, describing a mesh of curved rods. The mesh supported shell allows displacements in all three spatial directions. Two-way coupling based on kinematic and dynamic coupling conditions is assumed between the fluid and composite structure, and between the mesh of curved rods and Koiter shell. Problems of this type arise in many ap- plications, including blood flow through arteries treated with vascular prostheses called stents. We prove the existence of a weak solution to this nonlinear, moving boundary problem by using the time discretization via Lie operator splitting method combined with an Arbitrary Lagrangian-Eulerian approach, and a non-trivial extension of the Aubin-Lions-Simon compactness result to problems on moving domains.
more »
« less
Solving Cosserat Rod Models via Collocation and the Magnus Expansion
Choosing a kinematic model for a continuum robot typically involves making a tradeoff between accuracy and computational complexity. One common modeling approach is to use the Cosserat rod equations, which have been shown to be accurate for many types of continuum robots. This approach, however, still presents significant computational cost, particularly when many Cosserat rods are coupled via kinematic constraints. In this work, we propose a numerical method that combines orthogonal collocation on the local rod curvature and forward integration of the Cosserat rod kinematic equations via the Magnus expansion, allowing the equilibrium shape to be written as a product of matrix exponentials. We provide a bound on the maximum step size to guarantee convergence of the Magnus expansion for the case of Cosserat rods, compare in simulation against other approaches, and demonstrate the tradeoffs between speed and accuracy for the fourth and sixth order Magnus expansions as well as for different numbers of collocation points. Our results show that the proposed method can find accurate solutions to the Cosserat rod equations and can potentially be competitive in computation speed.
more »
« less
- Award ID(s):
- 1734461
- NSF-PAR ID:
- 10281088
- Date Published:
- Journal Name:
- 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
- Page Range / eLocation ID:
- 8653 to 8660
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
more » « less
For many problems in science and engineering, it is necessary to describe the collective behavior of a very large number of grains. Complexity inherent in granular materials, whether due the variability of grain interactions or grain-scale morphological factors, requires modeling approaches that are both representative and tractable. In these cases, continuum modeling remains the most feasible approach; however, for such models to be representative, they must properly account for the granular nature of the material. The granular micromechanics approach has been shown to offer a way forward for linking the grain-scale behavior to the collective behavior of millions and billions of grains while keeping within the continuum framework. In this paper, an extended granular micromechanics approach is developed that leads to a micromorphic theory of degree n. This extended form aims at capturing the detailed grain-scale kinematics in disordered (mechanically or morphologically) granular media. To this end, additional continuum kinematic measures are introduced and related to the grain-pair relative motions. The need for enriched descriptions is justified through experimental measurements as well as results from simulations using discrete models. Stresses conjugate to the kinematic measures are then defined and related, through equivalence of deformation energy density, to forces conjugate to the measures of grain-pair relative motions. The kinetic energy density description for a continuum material point is also correspondingly enriched, and a variational approach is used to derive the governing equations of motion. By specifying a particular choice for degree n, abridged models of degrees 2 and 1 are derived, which are shown to further simplify to micro-polar or Cosserat-type and second-gradient models of granular materials.
-
Lagrangian/Eulerian hybrid strand-based hair simulation techniques have quickly become a popular approach in VFX and real-time graphics applications. With Lagrangian hair dynamics, the inter-hair contacts are resolved in the Eulerian grid using the continuum method, i.e., the MPM scheme with the granular Drucker-Prager rheology, to avoid expensive collision detection and handling. This fuzzy collision handling makes the authoring process significantly easier. However, although current hair grooming tools provide a wide range of strand-based modeling tools for this simulation approach, the crucial sag-free initialization functionality remains often ignored. Thus, when the simulation starts, gravity would cause any artistic hairstyle to sag and deform into unintended and undesirable shapes. This paper proposes a novel four-stage sag-free initialization framework to solve stable quasistatic configurations for hybrid strand-based hair dynamic systems. These four stages are split into two global-local pairs. The first one ensures static equilibrium at every Eulerian grid node with additional inequality constraints to prevent stress from exiting the yielding surface. We then derive several associated closed-form solutions in the local stage to compute segment rest lengths, orientations, and particle deformation gradients in parallel. The second global-local step solves along each hair strand to ensure all the bend and twist constraints produce zero net torque on every hair segment, followed by a local step to adjust the rest Darboux vectors to a unit quaternion. We also introduce an essential modification for the Darboux vector to eliminate the ambiguity of the Cosserat rod rest pose in both initialization and simulation. We evaluate our method on a wide range of hairstyles, and our approach can only take a few seconds to minutes to get the rest quasistatic configurations for hundreds of hair strands. Our results show that our method successfully prevents sagging and has minimal impact on the hair motion during simulation.more » « less
-
The thermal radiative transfer (TRT) equations form an integro-differential system that describes the propagation and collisional interactions of photons. Computing accurate and efficient numerical solutions TRT are challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space that includes the independent variables of time, space, and velocity. In order to reduce the dimensionality of the phase space, classical approaches such as the P$_N$ (spherical harmonics) or the S$_N$ (discrete ordinates) ansatz are often used in the literature. In this work, we introduce a novel approach: the hybrid discrete (H$^T_N$) approximation to the radiative thermal transfer equations. This approach acquires desirable properties of both P$_N$ and S$_N$, and indeed reduces to each of these approximations in various limits: H$^1_N$ $\equiv$ P$_N$ and H$^T_0$ $\equiv$ S$_T$. We prove that H$^T_N$ results in a system of hyperbolic partial differential equations for all $T\ge 1$ and $N\ge 0$. Another challenge in solving the TRT system is the inherent stiffness due to the large timescale separation between propagation and collisions, especially in the diffusive (i.e., highly collisional) regime. This stiffness challenge can be partially overcome via implicit time integration, although fully implicit methods may become computationally expensive due to the strong nonlinearity and system size. On the other hand, explicit time-stepping schemes that are not also asymptotic-preserving in the highly collisional limit require resolving the mean-free path between collisions, making such schemes prohibitively expensive. In this work we develop a numerical method that is based on a nodal discontinuous Galerkin discretization in space, coupled with a semi-implicit discretization in time. In particular, we make use of a second order explicit Runge-Kutta scheme for the streaming term and an implicit Euler scheme for the material coupling term. Furthermore, in order to solve the material energy equation implicitly after each predictor and corrector step, we linearize the temperature term using a Taylor expansion; this avoids the need for an iterative procedure, and therefore improves efficiency. In order to reduce unphysical oscillation, we apply a slope limiter after each time step. Finally, we conduct several numerical experiments to verify the accuracy, efficiency, and robustness of the H$^T_N$ ansatz and the numerical discretizations.more » « less
-
Abstract The method of kinematic synthesis requires finding the solution set of a system of polynomials. Parameter homotopy continuation is used to solve these systems and requires repeatedly solving systems of linear equations. For kinematic synthesis, the associated linear systems become ill-conditioned, resulting in a marked decrease in the number of solutions found due to path tracking failures. This unavoidable ill-conditioning places a premium on accurate function and matrix evaluations. Traditionally, variables are eliminated to reduce the dimension of the problem. However, this greatly increases the computational cost of evaluating the resulting functions and matrices and introduces numerical instability. We propose avoiding the elimination of variables to reduce required computations, increasing the dimension of the linear systems, but resulting in matrices that are quite sparse. We then solve these systems with sparse solvers to save memory and increase speed. We found that this combination resulted in a speedup of up to 250 × over traditional methods while maintaining the same accuracy.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/IROS45743.2020.9340827
