Semiconductor diamond heater in the Kawai multianvil apparatus: an innovation to generate the lower mantle geotherm

Semiconductor diamond is considered the best heater material to generate ultra-high temperatures in a Kawai cell. In two pioneering studies, a mixture of graphite and amorphous boron (or boron carbide, B₄C) was converted to semiconductor diamond in the diamond stability field and was confirmed to generate 2000°C and 3500°C, respectively. Following these works, we synthesized a homemade boron-doped graphite block with fine machinability. With this technical breakthrough, we developed a semiconductor diamond heater in a smaller Kawai-type cell assembly. Here, we report the procedure for making machinable boron-doped graphite, and the performance of the material as a heater in a Kawai cell at 15?GPa using tungsten carbide anvils and at ～50?GPa using sintered diamond anvils. Furthermore, we present a finite element simulation of the temperature distribution generated by a semiconductor diamond heater, which is much more homogeneous than that generated by a metal heater.     

Effect of finite boundary junction mobility on the growth rate of grains in 3D polycrystals

With decreasing grain size, grain boundary junctions become increasingly important for microstructure evolution. We show that the effect of a limited mobility of triple junctions on the growth rate of polycrystals can be implemented in theories of three-dimensional (3D) grain growth. Respective analytical relations are derived on the basis of the average n-hedra approach introduced by Glicksman to describe the volume rate of change of 3D grains in a polycrystalline aggregate under the impact of a limited triple junction mobility. The theoretical predictions were compared to network-model computer simulations, and good agreement was obtained.     

Fastiterative methods for least squares estimations

Least squares estimations have been used extensively in many applications, e.g. system identification and signal prediction. When the stochastic process is stationary, the least squares estimators can be found by solving a Toeplitz or near-Toeplitz matrix system depending on the knowledge of the data statistics. In this paper, we employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Our proposed circulant preconditioners are derived from the spectral property of the given stationary process. In the case where the spectral density functions() of the process is known, we prove that ifs() is a positive continuous function, then the spectrum of the preconditioned system will be clustered around 1 and the method converges superlinearly. However, if the statistics of the process is unknown, then we prove that with probability 1, the spectrum of the preconditioned system is still clustered around 1 provided that large data samples are taken. For finite impulse response (FIR) system identification problems, our numerical results show that annth order least squares estimator can usually be obtained inO(n logn) operations whenO(n) data samples are used. Finally, we remark that our algorithm can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.Research supported in part by HKRGC grant no. 221600070, ONR contract no. N00014-90-J-1695 and DOE grant no. DE-FG03-87ER25037.     

Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA.     

Mixed methods on quadrilaterals and hexahedra

We describe a new family of discrete spaces suitable for use with mixed methods on certain quadrilateral and hexahedral meshes. The new spaces are natural in the sense of differential geometry, so all the usual mixed method theory, including the hybrid formulation, carries over to these new elements with proofs unchanged. Because transforming general quadrilaterals into squares introduces nonlinearity and because mixed methods involve the divergence operator, the new spaces are more complicated than either the corresponding Raviart-Thomas spaces for rectangles or corresponding finite element spaces for quadrilaterals. The new spaces are also limited to meshes obtained from a rectangular mesh through the application of a single global bilinear transformation. Despite this limitation, the new elements may be useful in certain topologically regular problems, where initially rectangular grids are deformed to match features of the physical region. They also illustrate the difficulties introduced into the theory of mixed methods by nonlinear transformations.     

On the rigidity of sphericalt-designs that are orbits of finite reflection groups

The concept of rigid sphericalt-designs was introduced by Bannai. He conjectured that there is a functionf(t, d) such that ifX is a sphericalt design in thed-dimensional Euclidean space so that |X|>f(t, d), theX is non-rigid. Furthermore, he asked to find examples of rigid but not tight sperical designs. In the present article we shall investigate the case whenX is an orbit of a finite reflection group and prove thatX is rigid iff tight for the groupsA _n ,B _n ,C _n ,D _n ,E ₆,E ₇,F ₄,I ₃.Research was partially supported by Hungarian National Research fund Grant No. 4267.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Partition Lattice q-Analogs Related to q-Stirling Numbers

We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F _q. Another member is constructed so as to mirror the partial order in the subspace lattice.     

带作用的群系的临界结构

在本文中，我们讨论了带作用群的群系的临界结构，给出了处理允许某些作用群的群的问题的一般方法，作为应用，我们特别给出了关于幂零群及ｐ－幂零群的一些结果。     

大型钢结构人行景观天桥的有限元分析

采用有限元方法对大型钢结构人行景观天桥进行了静力学、温度应力、动力学模态和初步的抗震能力分析,并就桥自重作用下的最大竖向位移和实际观测结果进行了比较,两者是一致的.计算结果表明:人行景观天桥在常规、温度极值改变和多遇地震荷载作用等多种工况下,现有的设计方案具有足够的强度、刚度和抗震能力.