There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

Fast parallel algorithms for short-range molecular dynamics

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Statistics for Spatial Data.

▶ Addresses a wide range of timely environment, economic and energy topics ▶ A forum to review, analyze and stimulate the development, testing and implementation of mitigation and adaptation strategies at regional, national and global scales ▶ Contributes to real-time policy analysis and development as national and international policies and agreements are discussed and promulgated ▶ 94% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again

Mitigation and Adaptation Strategies for Global Change

The Local Point Interpolation Method (LPIM) is a newly developed truly meshless method, based on the idea of Meshless Local Petrov-Galerkin (MLPG) approach. In this paper, a new LPIM formulation is proposed to deal with 4th order boundary-value and initial-value problems for static and dynamic analysis (stability, free vibration and forced vibration) of beams. Local weak forms are developed using weighted residual method locally. In order to introduce the derivatives of the field variable into the interpolation scheme, a technique is proposed to construct polynomial interpolation with Kronecker delta function property, based only on a group of arbitrarily distributed points. Because the shape functions so-obtained possess delta function property, the essential boundary conditions can be implemented with ease as in the conventional Finite Element Method (FEM). The validity and efficiency of the present LPIM formulation are demonstrated through numerical examples of beams under various loads and boundary conditions.

A local point interpolation method (LPIM) for static and dynamic analysis of thin beams

A local radial point interpolation method (LRPIM) based on local residual formulation is presented and applied to solid mechanics in this paper. In LRPIM, the trial function is constructed by the radial point interpolation method (PIM) and establishes discrete equations through a local residual formulation, which can be carried out nodes by nodes. Therefore, element connectivity for trial function and background mesh for integration is not necessary. Radial PIM is used for interpolation so that singularity in polynomial PIM may be avoided. Essential boundary conditions can be imposed by a straightforward and effective manner due to its Delta properties. Moreover, the approximation quality of the radial PIM is evaluated by the surface fitting of given functions. Numerical performance for this LRPIM method is further studied through several numerical examples of solid mechanics.

Point interpolation method based on local residual formulation using radial basis functions

A novel meshfree weak–strong (MWS) form method is proposed based on a combined formulation of both the strong-form and the local weak-form. In the MWS method, the problem domain and its boundary is represented by a set of distributed points or nodes. The strong form or the collocation method is used for all nodes whose local quadrature domains do not intersect with natural (Neumann) boundaries. Therefore, no numerical integration is required for these nodes. The local weak-form, which needs the local numerical integration, is only used for nodes on or near the natural boundaries. The locally supported radial point interpolation method and the moving least squares approximation are used to construct the meshfree shape functions. The final system matrix will be sparse and banded for computational efficiency. Numerical examples of two-dimensional solids are presented to demonstrate the efficiency, stability, accuracy and convergence of the proposed meshfree method.

A meshfree method: meshfree weak–strong (MWS) form method, for 2-D solids

A local point interpolation method (LPIM) is presented for the stress analysis of two-dimensional solids. A local weak form is developed using the weighted residual method locally in two-dimensional solids. The polynomial interpolation, which is based only on a group of arbitrarily distributed nodes, is used to obtain shape functions. The LPIM equations are derived, based on the local weak form and point interpolation. Since the shape functions possess the Kronecker delta function property, the essential boundary condition can be implemented with ease as in the conventional finite element method (FEM). The presented LPIM method is a truly meshless method, as it does not need any element or mesh for both field interpolation and background integration. The implementation procedure is as simple as strong form formulation methods. The LPIM has been coded in FORTRAN. The validity and efficiency of the present LPIM formulation are demonstrated through example problems. It is found that the present LPIM is very easy to implement, and very robust for obtaining displacements and stresses of desired accuracy in solids.

A local point interpolation method for stress analysis of two-dimensional solids

The meshless local Petrov–Galerkin (MLPG) method is an effective truly meshless method for solving partial differential equations using moving least squares (MLS) interpolants. It is, however, computationally expensive for some problems. A coupled MLPG/finite element (FE) method and a coupled MLPG/boundary element (BE) method are proposed in this paper to improve the solution efficiency. A procedure is developed for the coupled MLPG/FE method and the coupled MLPG/BE method so that the continuity and compatibility are preserved on the interface of the two domains where the MLPG and FE or BE methods are applied. The validity and efficiency of the MLPG/FE and MLPG/BE methods are demonstrated through a number of examples.

/pdf/meshless-local-petrov-galerkin-mlpg-method-in-combination-21hftuq70q.pdf

YuanTong Gu

Papers

A local point interpolation method (LPIM) for static and dynamic analysis of thin beams

Point interpolation method based on local residual formulation using radial basis functions

A meshfree method: meshfree weak–strong (MWS) form method, for 2-D solids

A local point interpolation method for stress analysis of two-dimensional solids

Meshless local Petrov-Galerkin (MLPG) method in combination with finite element and boundary element approaches