Two‐dimensional anisotropic Cartesian mesh adaptation for the compressible Euler equations

Simulating transient compressible flows involving shock waves presents challenges to the CFD practitioner in terms of the mesh quality required to resolve discontinuities and prevent smearing. This paper discusses a novel two‐dimensional Cartesian anisotropic mesh adaptation technique implemented for transient compressible flow. This technique, originally developed for laminar incompressible flow, is efficient because it refines and coarsens cells using criteria that consider the solution in each of the cardinal directions separately. In this paper, the method will be applied to compressible flow. The procedure shows promise in its ability to deliver good quality solutions while achieving computational savings. Transient shock wave diffraction over a backward step and shock reflection over a forward step are considered as test cases because they demonstrate that the quality of the solution can be maintained as the mesh is refined and coarsened in time. The data structure is explained in relation to the computational mesh, and the object‐oriented design and implementation of the code is presented. Refinement and coarsening algorithms are outlined. Computational savings over uniform and isotropic mesh approaches are shown to be significant. Copyright © 2004 John Wiley & Sons, Ltd.     

On the geodetic number and related metric sets in Cartesian product graphs

A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geodetic number of G. Upper bounds for the geodetic number of Cartesian product graphs are proved and for several classes exact values are obtained. It is proved that many metrically defined sets in Cartesian products have product structure and that the contour set of a Cartesian product is geodetic if and only if their projections are geodetic sets in factors.     

Fast evaluation of time domain fields in sub-wavelength source/observer distributions using accelerated Cartesian expansions (ACE)

Time domain integral equation solvers for transient scattering from electrically large objects have benefitted significantly from acceleration techniques like the plane wave time domain (PWTD) algorithm; these techniques reduce the asymptotic CPU and memory cost. However, PWTD breaks down when used in the analysis of structures that have subwavelength features or features whose length scales are orders of magnitude smaller than the smallest wavelength in the incident pulse. Instances of these occurring in electromagnetics range from antenna topologies, to feed structures, etc. In this regime, it is the geometric constraints that dictate the computational complexity, as opposed to the wavelength of interest. In this work, we present an approach for efficient analysis of such sub-wavelength source/observer distributions in time domain. The methodology that we seek to exploit is the recently developed algorithm based on Cartesian expansions for accelerating the computation of potentials of the form R^ν. In this paper, we present an efficient methodology for computing these polynomials for two different scenarios; where the size of the domain spans the distance travelled by light in (i) one time step and (ii) multiple time steps. These algorithms are cast within the framework of both uniform and non-uniform distributions. Results that demonstrate the efficiency and convergence of the proposed algorithm are presented.     

Dynamic Modeling of Spatial Cooperation Between Dual-Arm Mobile Manipulators北大核心CSCD

移动机械臂进行空间协作时会产生复杂的非线性耦合,使得采用Lagrange方程或Newton-Euler法直接进行建模极为繁琐。针对双移动机械臂空间协作问题,提出了一种结合Udwadia-Kalaba (U-K)方法与Lagrange方程建立动力学模型的方法。在建模过程中,将负载简化为连杆,选择负载中心断开的方式对系统进行分解,从而避免了机械臂末端关节断开导致的末端关节转角与连杆转角的约束信息缺失问题;将分割形成的两个子系统通过Lagrange方程进行建模,得到了子系统的动力学模型;再将协作系统的固有几何关系通过约束形式引入,应用U-K方法得到了协作系统动力学模型,减少了建立动力学模型所需要的计算量;最后通过数值仿真验证了该方法所得到的动力学模型的准确性。     

An unstructured/structured multi‐layer hybrid grid method and its application

A multi‐layer hybrid grid method is constructed to simulate complex flow field around 2‐D and 3‐D configuration. The method combines Cartesian grids with structured grids and triangular meshes to provide great flexibility in discretizing a domain. We generate the body‐fitted structured grids near the wall surface and the Cartesian grids for the far field. In addition, we regard the triangular meshes as an adhesive to link each grid part. Coupled with a tree data structure, the Cartesian grid is generated automatically through a cell‐cutting algorithm. The grid merging methodology is discussed, which can smooth hybrid grids and improve the quality of the grids. A cell‐centred finite volume flow solver has been developed in combination with a dual‐time stepping scheme. The flow solver supports arbitrary control volume cells. Both inviscid and viscous flows are computed by solving the Euler and Navier–Stokes equations. The above methods and algorithms have been validated on some test cases. Computed results are presented and compared with experimental data. Copyright © 2006 John Wiley & Sons, Ltd.     

Application of hybrid Cartesian grid and gridless approach to moving boundary flow problems

The paper presents a hybrid Cartesian grid and gridless approach to solve unsteady moving boundary flow problems. Unlike the Chimera clouds of points approach, the hybrid approach uses a Cartesian grid to cover most of the computational domain and a gridless method to calculate a relatively small region adjacent to the body surface, making use of the flexibility of the gridless method in handling surface grid with complicated geometry and the computational efficiency of the Cartesian grid. Four cases were conducted to examine the applicability, accuracy and robustness of the hybrid approach. Steady flows over a single NACA0012 airfoil and dual NACA0012 airfoils at different Mach numbers and angles of attack were simulated. Moreover, by implementing a dynamic hole cutting, node identification and information communication between the Cartesian grid and the gridless regions, unsteady flows over a pitching NACA0012 airfoil (small displacement) and two‐dimensional airfoil/store separation (large displacement) were performed. The computational results were found to agree well with earlier experimental data as well as computational results. Shock waves were accurately captured. The computational results show that the hybrid approach is of potential to solve the moving boundary flow problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Hamiltonicity and pancyclicity of cartesian products of graphs

The cartesian product of a graph G with K₂ is called a prism over G. We extend known conditions for hamiltonicity and pancyclicity of the prism over a graph G to the cartesian product of G with paths, cycles, cliques and general graphs. In particular we give results involving cubic graphs and almost claw-free graphs.We also prove the following: Let G and H be two connected graphs. Let both G and H have a 2-factor. If Δ(G)≤g^′(H) and Δ(H)≤g^′(G) (we denote by g^′(F) the length of a shortest cycle in a 2-factor of a graph F taken over all 2-factorization of F), then G□H is hamiltonian.     

Connectivity of Cartesian product graphs

Use v_i,κ_i,λ_i,δ_i to denote order, connectivity, edge-connectivity and minimum degree of a graph G_i for i=1,2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are κ(G₁×G₂)?κ₁+κ₂ and λ(G₁×G₂)?λ₁+λ₂. This paper improves these results by proving that κ(G₁×G₂)?min{κ₁+δ₂,κ₂+δ₁} and λ(G₁×G₂)=min{δ₁+δ₂,λ₁v₂,λ₂v₁} if G₁ and G₂ are connected undirected graphs; κ(G₁×G₂)?min{κ₁+δ₂,κ₂+δ₁,2κ₁+κ₂,2κ₂+κ₁} if G₁ and G₂ are strongly connected digraphs. These results are also generalized to the Cartesian products of connected graphs and n strongly connected digraphs, respectively.     

Wide diameter of Cartesian graph bundles

Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G, k-diameter, is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. Denote by D_c(G) the c-diameter of G and κ(G) the connectivity of G. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a Cartesian graph bundle with fiber F over base B, 0<a≤κ(F), and 0<b≤κ(B). We prove that D_a+b(G)≤D_a(F)+D_b(B)+1. Moreover, if G is a graph bundle with fiber F≠K₂ over base B≠K₂, then D_a+b(G)≤D_a(F)+D_b(B). The bounds are tight.