Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh regularization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Geometrical and topological issues in octree based automatic meshing

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Saxena, Mukul↗
NASA NTRS2003

Accelerating Large Data Analysis By Exploiting Regularities

We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (also known as zones). Multi-zone data are typical to Computational Fluid Dynamics (CFD) simulations. Regularities include axis-aligned rectilinear and cylindrical meshes as well as cases where one zone is equivalent to a rigid-body transformation of another. Our algorithms can also discover rigid-body motion of meshes in time-series data. Next, we describe a data model where we can utilize the results from the discovery process in order to accelerate large data visualizations. Where possible, we replace general curvilinear zones with rectilinear or cylindrical zones. In rigid-body motion cases we replace a time-series of meshes with a transformed mesh object where a reference mesh is dynamically transformed based on a given time value in order to satisfy geometry requests, on demand. The data model enables us to make these substitutions and dynamic transformations transparently with respect to the visualization algorithms. We present results with large data sets where we combine our mesh replacement and transformation techniques with out-of-core paging in order to achieve significant speed-ups in analysis.

Moran, Patrick J.↗
NASA NTRS1994

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗
NASA NTRS1985

Solution adaptivity using a triangular mesh

Solution adaptivity is discussed first from a general perspective and then from the specific viewpoint of triangular meshes. The use of a general connectivity triangular mesh is emphasized. The development of monitor surfaces and their geometric properties is discussed. Mesh point movement is addressed, as is the dynamic restructuring of the connectivity pattern among moving modes. Changes in the number of mesh nodes to obtain suitable refinement for a physical simulation is examined, and the use of locally regular structures to offset the data structure limitation of a general connectivity triangular mesh and thus to obtain an enhanced range of application is considered. To illustrate the basic features of the adaptive triangular mesh strategy, an application to the study of plasma equilibrium is briefly considered.

Eiseman, P. R.↗
DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗
NASA NTRS2014

A Technique for Mapping Characteristic Lengths to Preserve Energy Dissipated via Strain Softening in a Multiscale Analysis

It is often advantageous to account for the microstructure of the material directly using multiscale modeling. For computational tractability, an idealized repeating unit cell (RUC) is used to capture all of the pertinent features of the microstructure. Typically, the RUC is dimensionless and depends only on the relative volume fractions of the different phases in the material. This works well for non-linear and inelastic behavior exhibiting a positive-definite constitutive response. Although, once the material exhibits strain softening, or localization, a mesh objective failure theories, such as smeared fracture theories, nodal and element enrichment theories (XFEM), cohesive elements or virtual crack closure technique (VCCT), can be utilized at the microscale, but the dimensions of the RUC must then be defined. One major challenge in multiscale progressive damage modeling is relating the characteristic lengths across the scales in order to preserve the energy that is dissipated via localization at the microscale. If there is no effort to relate the size of the macroscale element to the microscale RUC, then the energy that is dissipated will remain mesh dependent at the macroscale, even if it is regularized at the microscale. Here, a technique for mapping characteristic lengths across the scales is proposed. The RUC will be modeled using the generalized method of cells (GMC) micromechanics theory, and local failure in the matrix constituent subcells will be modeled using the crack band theory. The subcell characteristic lengths used in the crack band calculations will be mapped to the macroscale finite element in order to regularize the local energy in a manner consistent with the global length scale. Examples will be provided with and without the regularization, and they will be compared to a baseline case where the size and shape of the element and RUC are coincident (ensuring energy is preserved across the scales).

softening↗
NASA NTRS1997

Tools for Analysis and Visualization of Large Time-Varying CFD Data Sets

In the second year, we continued to built upon and improve our scanline-based direct volume renderer that we developed in the first year of this grant. This extremely general rendering approach can handle regular or irregular grids, including overlapping multiple grids, and polygon mesh surfaces. It runs in parallel on multi-processors. It can also be used in conjunction with a k-d tree hierarchy, where approximate models and error terms are stored in the nodes of the tree, and approximate fast renderings can be created. We have extended our software to handle time-varying data where the data changes but the grid does not. We are now working on extending it to handle more general time-varying data. We have also developed a new extension of our direct volume renderer that uses automatic decimation of the 3D grid, as opposed to an explicit hierarchy. We explored this alternative approach as being more appropriate for very large data sets, where the extra expense of a tree may be unacceptable. We also describe a new approach to direct volume rendering using hardware 3D textures and incorporates lighting effects. Volume rendering using hardware 3D textures is extremely fast, and machines capable of using this technique are becoming more moderately priced. While this technique, at present, is limited to use with regular grids, we are pursuing possible algorithms extending the approach to more general grid types. We have also begun to explore a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH '96. In our initial implementation, we automatically image the volume from 32 equi-distant positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation. We are studying whether this will give a quantitative measure of the effects of approximation. We have created new tools for exploring the differences between images produced by various rendering methods. Images created by our software can be stored in the SGI RGB format. Our idtools software reads in pair of images and compares them using various metrics. The differences of the images using the RGB, HSV, and HSL color models can be calculated and shown. We can also calculate the auto-correlation function and the Fourier transform of the image and image differences. We will explore how these image differences compare in order to find useful metrics for quantifying the success of various visualization approaches. In general, progress was consistent with our research plan for the second year of the grant.

Wilhelms, Jane↗
NASA NTRS1998

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗
DOE OSTI2024

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

CHESS 2025: Orthorectified airborne RGB imagery from NEON AOP surveys

This dataset provides Level 1 (L1) and Level 3 (L3) orthorectified Red-Green-Blue (RGB) imagery collected for the 2025 Colorado Headwaters Ecological Spectroscopy Study (CHESS). This high-resolution imagery is a photographic record of red, green, and blue visible light from sunlight reflected off of the Earth’s surface. The data comprise full-color images of the ground surface and are primarily intended to provide context to imaging spectroscopy and light detection and ranging (LiDAR) data. The data were acquired over three study domains in the Upper Gunnison river basin: the upper East River watershed (CRBU); Almont Triangle and Taylor Canyon (ALMO); and Upper Taylor River watershed (UPTA) between 2025-06-13 and 2025-07-15. RGB images were acquired using the PhaseOne IXM-RS150F high-resolution digital camera onboard the National Ecological Observatory Network (NEON) Airborne Observation Platform (AOP). The package data include both an L1 product comprising one camera frame per file and an L3 mosaic aligned to the Universal Transverse Mercator (UTM) Zone 13N grid and the World Geodetic System (WGS) 84 projection. Both products are provided in geotif (.tif) format at 0.1 m ground resolution. The bulk of the imagery was collected during the main CHESS field campaign from June 13 to July 15, 2025. Additional images of a portion of the Upper Taylor (UPTA) domain were collected on September 18, 2025, to fill gaps in imagery identified after the main campaign was complete. RGB camera imagery is not radiometrically calibrated, and therefore pixel values should not be exploited for scientific analysis. Pixel values have undergone a manual adjustment to enhance feature identification. The imagery is rigorously geolocated which does allow for reliable geometric information to be retrieved. To generate the orthorectified imagery, the NEON AOP camera captured visible spectrum in red, green, and blue bands. The raw images were then processed using NEON’s camera orthorectification workflow. A boresight calibration flight was made to build a complete camera, distortion, and alignment model. Color balance/white balance and exposure correction were applied to the raw RGB images. The corrected images were orthorectified by ray-tracing image pixels to a lidar-derived digital surface model (DSM) mesh using the refined camera model, outputting orthorectified raster pixels on a regular grid. Flightline-level data were mosaicked by selecting per-pixel contributions from overlapping orthorectified images using line-of-sight (LOS) zenith angle minimization to reduce edge distortions. CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgement: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗
NASA NTRS1998

Self-Avoiding Walks over Adaptive Triangular Grids

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗
NASA NTRS2015

Impact and Penetration of Thin Aluminum 2024 Flat Panels at Oblique Angles of Incidence

The U.S. Federal Aviation Administration (FAA) and the National Aeronautics and Space Administration (NASA) are actively involved in improving the predictive capabilities of transient finite element computational methods for application to safety issues involving unintended impacts on aircraft and aircraft engine structures. One aspect of this work involves the development of an improved deformation and failure model for metallic materials, known as the Tabulated Johnson-Cook model, or MAT224, which has been implemented in the LS-DYNA commercial transient finite element analysis code (LSTC Corp., Livermore, CA) (Ref. 1). In this model the yield stress is a function of strain, strain rate and temperature and the plastic failure strain is a function of the state of stress, temperature and strain rate. The failure criterion is based on the accumulation of plastic strain in an element. The model also incorporates a regularization scheme to account for the dependency of plastic failure strain on mesh size. For a given material the model requires a significant amount of testing to determine the yield stress and failure strain as a function of the three-dimensional state of stress, strain rate and temperature. In addition, experiments are required to validate the model. Currently the model has been developed for Aluminum 2024 and validated against a series of ballistic impact tests on flat plates of various thicknesses (Refs. 1 to 3). Full development of the model for Titanium 6Al-4V is being completed, and mechanical testing for Inconel 718 has begun. The validation testing for the models involves ballistic impact tests using cylindrical projectiles impacting flat plates at a normal incidence (Ref. 2). By varying the thickness of the plates, different stress states and resulting failure modes are induced, providing a range of conditions over which the model can be validated. The objective of the study reported here was to provide experimental data to evaluate the model under more extreme conditions, using a projectile with a more complex shape and sharp contacts, impacting flat panels at oblique angles of incidence.

Ruggeri, Charles R.↗
DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗
DOE OSTI2025

A framework for discrete optimization of stellarator coils

Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Fast, Nondestructive and Precise Biomass Measurements Are Possible Using Lidar-Based Convex Hull and Voxelization Algorithms

Light detection and ranging (lidar) scanning tools are available that can make rapid digital estimations of biomass. Voxelization and convex hull are two algorithms used to calculate the volume of the scanned plant canopy, which is correlated with biomass, often the primary trait of interest. Voxelization splits the scans into regular-sized cubes, or voxels, whereas the convex hull algorithm creates a polygon mesh around the outermost points of the point cloud and calculates the volume within that mesh. In this study, digital estimates of biomass were correlated against hand-harvested biomass for field-grown corn, broom corn, and energy sorghum. Voxelization (r = 0.92) and convex hull (r = 0.95) both correlated well with plant dry biomass. Lidar data were also collected in a large breeding trial with nearly 900 genotypes of energy sorghum. In contrast to the manual harvest studies, digital biomass estimations correlated poorly with yield collected from a forage harvester for both voxel count (r = 0.32) and convex hull volume (r = 0.39). However, further analysis showed that the coefficient of variation (CV, a measure of variability) for harvester-based estimates of biomass was greater than the CV of the voxel and convex-hull-based biomass estimates, indicating that poor correlation was due to harvester imprecision, not digital estimations. Overall, results indicate that the lidar-based digital biomass estimates presented here are comparable or more precise than current approaches.

Environmental Sciences & Ecology↗
NASA NTRS1988

Generation of a crowned pinion tooth surface by a plane

The topology of a crowned spur pinion tooth surface that reduces the level of transmission errors due to misalignment is described. The geometry of the modified pinion tooth surface and of the regular involute gear tooth surface is discussed. The tooth contact analysis between the meshing surfaces is also described. Generating a modified pinion tooth surface by a plane whose motion is controlled by a 5-degree-of-freedom system is investigated. The numerical results included indicate that the transmission error remains low as the gears are misaligned.

Litvin, F. L.↗
NASA NTRS1994

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗