Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Geometry”

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 73 records · Page 4

A Preliminary Assessment of Step Effects on the BOLT Geometry in Mach 6 Flow

An infrared thermography measurement technique has been installed in the Langley Aerothermodynamic Laboratory. The system is calibrated for use with commercially available thermoplastics and ceramic materials, and to the surface temperature ranges when exposed to the facility hypersonic flow. Herein an uncertainty quantification is performed, revealing 5% surface temperature and 20% heat transfer uncertainty bands to two-sigma confidence. As a first application of the test measurement technique, an investigation was conducted to explore the correlation between the height of forward facing (FF) and rearward facing (RF) two-dimensional steps, free stream Reynolds number, and the onset of boundary layer transition from laminar to turbulent in Mach 6 flow on a 50% scale Boundary Layer Transition (BOLT) flight test vehicle geometry. Computational predictions were generated to identify potential x/L locations of transition onset for various flow conditions with a smooth outer mold line geometry and are compared to experimental results. The BOLT Step Test was conducted in the NASA Langley Aerothermodynamic Laboratory 20-inch Mach 6 wind tunnel at Reynolds numbers between 1.4 and 11.3 million conditions for various step heights. Data were collected using a developmental infrared thermography test technique and reduced to heat transfer for comparison with CFD solutions. This is a preliminary assessment of the developmental infrared thermography test technique used to acquire and reduce the experimental data. insight into the ongoing comparative analysis of the effects of FF and RF steps on boundary layer transition for the BOLT geometry in Mach 6 flow.

BOLT↗

GASP- General Aviation Synthesis Program. Volume 2: Geometry

The gross characteristics of an aircraft under study are specified to the subroutines SIZE. The principal quantities specified are both geometric (lengths and areas) and operational (altitude and Mach number). The sequence of computations carried out by SIZE is controlled by the parameter NPC which is passed into SIZE by COMMON. When NPC-0, the computation is initialized. Subsequently, NPC is set to 2 and the program advances through the geometric computations. Geometry models for the fuselage, wing, empennage, cabin pressurization, and nacelle area are examined.

Hague, D.↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.

Memarsadeghi, Nargess↗

Comparison of nested geometry treatments within GPU-based Monte Carlo neutron transport simulations of fission reactors

Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic tracker types with different tracking algorithms to exploit the repeated configurations of reactors, but virtual function calls have high overhead on the GPU. The Shift MC code was modified to support GPU-based tracking with three strategies: dynamic polymorphism with virtual functions, static polymorphism, and a single tracker type with tree-based acceleration. On the Frontier supercomputer these methods achieve 77.8%, 91.2%, and 83.4%, respectively, of the tracking rate obtained using a specialized tracker optimized for rectilinear-grid-based reactors. This indicates that all three methods are suitable for typical reactor problems in which tracking does not dominate runtime. The flexibility of the single tracker method is highlighted with a hexagonal-grid microreactor problem, performed without hexagonal-grid-specific tracking routines, providing a 2.19× speedup over CPU execution.

97 MATHEMATICS AND COMPUTING↗

On the Interaction of CO and NH3 with BH3 and BF3

BH3CO, BF3CO, BH3NH3, and BF3NH3 have been studied using density functional theory (DFT). The computed geometries are in reasonable agreement with experiment. BF3CO is found to be weakly bound. The binding energies of BH3CO, BH3NH3 , and BF3NH3 have also been computed using the coupled cluster singles and doubles level of theory, including a perturbational estimate of the connected triples [CCSD(T)]. These CCSD(T) calculations are performed using correlation consistent polarized-valence triple-zeta basis sets. These are expected to be the most accurate binding energies to date. The DFT binding energies are in good agreement with those obtained at the CCSD(T) level. The bonding is analyzed using the constrained space orbital variation (CSOV) technique. In addition to analyzing the bonding in BH3CO, BH3NH3, and BF3NH3, the CSOV approach is used to study why the bonding in BF3CO is so weak.

Bauschlicher, Charles W., Jr.↗

Kinetics of particles with short-range interactions

Self-assembly is one of the grand challenges of the 21st century – as the devices and materials we would like to build become too complex or small-scale for top-down manufacturing to be efficient, it is increasingly important to find ways to create these through bottom-up, dynamical approaches. Many particles used in self-assembly have very short-ranged attractive interactions, making simulations expensive or impossible. This proposal develops a set of conceptual and computational tools to study the dynamics of self-assembly for particles with short-ranged interactions, harnessing ideas in differential and computational geometry, and stochastic analysis, to accelerate simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Transonic flow analysis for rotors. Part 1: Three-dimensional quasi-steady, full-potential calculation

A new computer program is presented for calculating the quasi-steady transonic flow past a helicopter rotor blade in hover as well as in forward flight. The program is based on the full potential equations in a blade attached frame of reference and is capable of treating a very general class of rotor blade geometries. Computed results show good agreement with available experimental data for both straight and swept tip blade geometries.

Chang, I. C.↗

A tensor train-based isogeometric solver for large-scale 3D poisson problems

We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.

97 MATHEMATICS AND COMPUTING↗

Anytime query-tuned kernel machine classifiers via Cholesky factorization

We recently demonstrated 2 to 64-fold query-time speedups of Support Vector Machine and Kernel Fisher classifiers via a new computational geometry method for anytime output bounds (DeCoste,2002). This new paper refines our approach in two key ways. First, we introduce a simple linear algebra formulation based on Cholesky factorization, yielding simpler equations and lower computational overhead. Second, this new formulation suggests new methods for achieving additional speedups, including tuning on query samples. We demonstrate effectiveness on benchmark datasets.

Kernel Cholesky MNIST↗

Multisource inverse-geometry CT. Part I. System concept and development

Purpose: This paper presents an overview of multisource inverse-geometry computed tomography (IGCT) as well as the development of a gantry-based research prototype system. The development of the distributed x-ray source is covered in a companion paper [V. B. Neculaes et al., “Multisource inverse-geometry CT. Part II. X-ray source design and prototype,” Med. Phys. 43, 4617–4627 (2016)]. While progress updates of this development have been presented at conferences and in journal papers, this paper is the first comprehensive overview of the multisource inverse-geometry CT concept and prototype. The authors also provide a review of all previous IGCT related publications. Methods: The authors designed and implemented a gantry-based 32-source IGCT scanner with 22 cm field-of-view, 16 cm z-coverage, 1 s rotation time, 1.09 × 1.024 mm detector cell size, as low as 0.4 × 0.8 mm focal spot size and 80–140 kVp x-ray source voltage. The system is built using commercially available CT components and a custom made distributed x-ray source. The authors developed dedicated controls, calibrations, and reconstruction algorithms and evaluated the system performance using phantoms and small animals. Results: The authors performed IGCT system experiments and demonstrated tube current up to 125 mA with up to 32 focal spots. The authors measured a spatial resolution of 13 lp/cm at 5% cutoff. The scatter-to-primary ratio is estimated 62% for a 32 cm water phantom at 140 kVp. The authors scanned several phantoms and small animals. The initial images have relatively high noise due to the low x-ray flux levels but minimal artifacts. Conclusions: IGCT has unique benefits in terms of dose-efficiency and cone-beam artifacts, but comes with challenges in terms of scattered radiation and x-ray flux limits. To the authors’ knowledge, their prototype is the first gantry-based IGCT scanner. The authors summarized the design and implementation of the scanner and the authors presented results with phantoms and small animals.

60 APPLIED LIFE SCIENCES↗

Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets

Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.

Memarsadeghi, Nargess↗

Unstructured mesh generation and adaptivity

An overview of current unstructured mesh generation and adaptivity techniques is given. Basic building blocks taken from the field of computational geometry are first described. Various practical mesh generation techniques based on these algorithms are then constructed and illustrated with examples. Issues of adaptive meshing and stretched mesh generation for anisotropic problems are treated in subsequent sections. The presentation is organized in an education manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.

Mavriplis, D. J.↗

Simulations of the effects of proppant placement on the conductivity and mechanical stability of hydraulic fractures

Here, we generate a wide range of models of proppant-packed fractures using discrete element simulations, and measure fracture conductivity using finite element flow simulations. This allows for a controlled computational study of proppant structure and its relationship to fracture conductivity and stress in the proppant pack. For homogeneous multi-layered packings, we observe the expected increase in fracture conductivity with increasing fracture aperture, while the stress on the proppant pack remains nearly constant. This is consistent with the expected behavior in conventional proppant-packed fractures, but the present work offers a novel quantitative analysis with an explicit geometric representation of the proppant particles. In single-layered packings (i.e. proppant monolayers), there is a drastic increase in fracture conductivity as the proppant volume fraction decreases and open flow channels form. However, this also corresponds to a sharp increase in the mechanical stress on the proppant pack, as measured by the maximum normal stress relative to the side crushing strength of typical proppant particles. We also generate a variety of computational geometries that resemble highly heterogeneous proppant packings hypothesized to form during channel fracturing. In some cases, these heterogeneous packings show drastic improvements in conductivity with only moderate increase in the stress on the proppant particles, suggesting that in certain applications these structures are indeed optimal. We also compare our computer-generated structures to micro computed tomography imaging of a manually fractured laboratory-scale shale specimen, and find reasonable agreement in the geometric characteristics.

58 GEOSCIENCES↗

GEODYN system support program, volume 4

The GEODYN Orbit Determination and Geodetic Parameter Estimation System consists of a set of computer programs designed to determine and analyze definitive satellite orbits and their associated geodetic and measurement parameters. This manual describes the Support Programs used by the GEODYN System. The mathematics and programming descriptions are detailed. The operational procedures of each program are presented. GEODYN ancillary analysis programs may be grouped into three different categories: (1) orbit comparison - DELTA (2) data analysis using reference orbits - GEORGE, and (3) pass geometry computations - GROUNDTRACK. All of the above three programs use one or more tapes written by the GEODYN program in either a data reduction or orbit generator run.

Mullins, N. E.↗

SU-F-J-183: Interior Region-Of-Interest Tomography by Using Inverse Geometry System

Purpose: The inverse geometry computed tomography (IGCT) composed of multiple source and small size detector has several merits such as reduction of scatter effect and large volumetric imaging within one rotation without cone-beam artifact, compared to conventional cone-beam computed tomography (CBCT). By using this multi-source characteristics, we intend to present a selective and multiple interior region-of-interest (ROI) imaging method by using a designed source on-off sequence of IGCT. Methods: All of the IGCT sources are operated one by one sequentially, and each projection in the shape of narrow cone-beam covers its own partial volume of full field of view (FOV) determined from system geometry. Thus, through controlling multi source operation, limited irradiation within ROI is possible and selective radon space data for ROI imaging can be acquired without additional X-ray filtration. With this feature, we designed a source on-off sequence for multi ROI-IGCT imaging, and projections of ROI-IGCT were generated by using the on-off sequence. Multi ROI-IGCT images were reconstructed by using filtered back-projection algorithm. All these imaging process of our study has been performed by utilizing digital phantom and patient CT data. ROI-IGCT images of the phantom were compared to CBCT image and the phantom data for the image quality evaluation. Results: Image quality of ROI-IGCT was comparable to that of CBCT. However, the distal axial-plane from the FOV center, large cone-angle region, ROI-IGCT showed uniform image quality without significant cone-beam artifact contrary to CBCT. Conclusion: ROI-IGCT showed comparable image quality and has the capability to provide multi ROI image within a rotation. Projection of ROI-IGCT is performed by selective irradiation, hence unnecessary imaging dose to non-interest region can be reduced. In this regard, it seems to be useful for diagnostic or image guidance purpose in radiotherapy such as low dose target localization and patient alignment. This research was supported by the Mid-career Researcher Program through NRF funded by the Ministry of Science, ICT & Future Planning of Korea (NRF-2014R1A2A1A10050270) and by the Radiation Technology R&D program through the National Research Foundation of Korea funded by the Ministry of Science, ICT & Future Planning (No. 2013M2A2A7038291)

60 APPLIED LIFE SCIENCES↗

Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems

Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Trajectory Analysis via Feature Vectors

The explosion of both sensors and GPS-enabled devices has resulted in position/time data being the next big frontier for data analytics. However, many of the problems associated with large numbers of trajectories do not necessarily have an analog with many of the historic big-data applications such as text and image analysis. Modern trajectory analytics exploits much of the cutting-edge research in machine-learning, statistics, computational geometry and other disciplines. We will show that for doing trajectory analytics at scale, it is necessary to fundamentally change the way the information is represented through a feature-vector approach. We then demonstrate the ability to solve large trajectory analytics problems using this representation.

58 GEOSCIENCES↗

Pattern ANalytics To Support High-performance Exploitation and Reasoning (PANTHER)

Sandia researchers are developing analytic techniques that efficiently detect patterns in high-volume, noisy, remote sensing and other geospatial data, improving an analysts’ ability to detect possibly off-normal events in complex homeland security, nuclear weapons, and emerging threat environments. High-consequence, national security decisions rely on timely, comprehensive answers to complex questions, yet critical gaps in our approach to these questions remain. PANTHER addresses these gaps through fundamental research on: geospatial-temporal feature extraction via image segmentation and classification; geospatial-temporal graph algorithms and computational geometry; and domain-relevant models of human perception and cognition informing the design of analytic systems. PANTHER’s cross-disciplinary R&D approach uses fundamental science and mathematics to understand how to maximize decision systems through rethinking key aspects of geospatial data analysis. New methods in motion and trajectory analysis support both rapid search for known trajectories as well as rapid clustering and anomaly detection. Thus, the perceptual and visual load on users is reduced by providing pattern analytics with elegant visual cues to spatial and temporal characteristics.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗