An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Radiation bursts from particles in the field of compact, impenetrable, astrophysical objects

The radiation emitted by charged, scalar particles in a Schwarzschild field with maximal acceleration corrections is calculated classically and in the tree approximation of quantum field theory. In both instances the particles emit radiation that has characteristics similar to those of gamma-ray bursters.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Irregularities of distribution with respect to strips

Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from integral geometry.     

The Kissing Triangles: The Aesthetics of Mathematical Discovery

Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date.     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

不完全信息群体决策专家权重的集结

本文对于属性权重信息和属性效用信息都不完全的群体多属性决策问题，通过构造属性值区间和运用系统聚类分析法，对群体决策中的专家进行分类，并确定每位专家的权重．     

Projective geometry and special relativity

Some concepts of real and complex projective geometry are applied to the fundamental physical notions that relate to Minkowski space and the Lorentz group. In particular, it is shown that the transition from an infinite speed of propagation for light waves to a finite one entails the replacement of a hyperplane at infinity with a light cone and the replacement of an affine hyperplane – or rest space – with a proper time hyperboloid. The transition from the metric theory of electromagnetism to the pre‐metric theory is discussed in the context of complex projective geometry, and ultimately, it is proposed that the geometrical issues are more general than electromagnetism, namely, they pertain to the transition from point mechanics to wave mechanics.     

Simulation of viscous water column collapse using adapting hierarchical grids

An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.