[PDF][PDF] Parallel architectures

MJ Flynn, KW Rudd - ACM computing surveys (CSUR), 1996 - dl.acm.org
Parallel or concurrent operation has many different forms within a computer system. Using a
model based on the different streams used in the computation process, we represent some …

[HTML][HTML] Recent progress in robust and quality Delaunay mesh generation

Q Du, D Wang - Journal of Computational and Applied Mathematics, 2006 - Elsevier
In this paper, some current issues of Delaunay mesh generation and optimization are
addressed, with particular emphasis on the robustness of the meshing procedure and the …

[图书][B] Delaunay mesh generation

SW Cheng, TK Dey, J Shewchuk, S Sahni - 2013 - api.taylorfrancis.com
The study of algorithms for generating unstructured meshes of triangles and tetrahedra
began with mechanical and aeronautical engineers who decompose physical domains into …

[图书][B] Structural analysis with the finite element method. Linear statics: volume 2: beams, plates and shells

E Oñate - 2013 - books.google.com
STRUCTURAL ANALYSIS WITH THE FINITE ELEMENT METHOD Linear Statics Volume 1:
The Basis and Solids Eugenio Oñate The two volumes of this book cover most of the …

A finite point method in computational mechanics. Applications to convective transport and fluid flow

E Oñate, S Idelsohn, OC Zienkiewicz… - … journal for numerical …, 1996 - Wiley Online Library
The paper presents a fully meshless procedure fo solving partial differential equations. The
approach termed generically the 'finite point method'is based on a weighted least square …

[图书][B] Grid generation methods

VD Liseikin - 1999 - Springer
An indispensable tool of the numerical solution of partial differential equations by finite-
element or finite-difference methods on general regions is a grid which represents the …

An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems

J Bonet, J Peraire - International Journal for Numerical Methods …, 1991 - Wiley Online Library
A searching algorithm is presented for determining which members of a set of n points in an
N dimensional space lie inside a prescribed space subregion. The algorithm is then …

Mesh generation and optimal triangulation

M Bern, D Eppstein - Computing in Euclidean geometry, 1995 - World Scientific
We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …

Efficient unstructured mesh generation by means of Delaunay triangulation and Bowyer-Watson algorithm

S Rebay - Journal of computational physics, 1993 - Elsevier
This work is devoted to the description of an efficient unstructured mesh generation method
entirely based on the Delaunay triangulation. The distinctive characteristic of the proposed …

A general algorithm for compressible and incompressible flow—Part I. The split, characteristic‐based scheme

OC Zienkiewicz, R Codina - International journal for numerical …, 1995 - Wiley Online Library
The paper outlines the formulation of a novel algorithm which can be used for the solution of
both compressible and incompressible Navier‐Stokes or Euler equations. Full …