Search NASA⌕ Search

SEARCH · Search NASA

Results for “triangularity”

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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Domain decomposition methods in aerodynamics

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Venkatakrishnan, V.↗
NASA NTRS1989

Efficient ICCG on a shared memory multiprocessor

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

Hammond, Steven W.↗
NASA NTRS1992

Three-dimensional surface grid generation for calculation of thermal radiation shape factors

A technique is described to generate three dimensional surface grids suitable for calculating shape factors for thermal radiative heat transfer. The surface under consideration is approximated by finite triangular elements generated in a special manner. The grid is generated by dividing the surface into a two dimensional array of nodes. Each node is defined by its coordinates. Each set of four adjacent nodes is used to construct two triangular elements. Each triangular element is characterized by the vector representation of its vertices. Vector algebra is used to calculate all desired geometric properties of grid elements. The properties are used to determine the shape factor between the element and an area element in space. The grid generation can be graphically displayed using any software with three dimensional features. DISSPLA was used to view the grids.

Aly, Hany M.↗
NASA NTRS1993

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗
NASA NTRS1993

Nonlinear vibrations of thin arbitrarily laminated composite plates subjected to harmonic excitations using DKT elements

A finite element formulation is presented for determining the large-amplitude free and steady-state forced vibration response of arbitrarily laminated anisotropic composite thin plates using the Discrete Kirchhoff Theory (DKT) triangular elements. The nonlinear stiffness and harmonic force matrices of an arbitrarily laminated composite triangular plate element are developed for nonlinear free and forced vibration analyses. The linearized updated-mode method with nonlinear time function approximation is employed for the solution of the system nonlinear eigenvalue equations. The amplitude-frequency relations for convergence with gridwork refinement, triangular plates, different boundary conditions, lamination angles, number of plies, and uniform versus concentrated loads are presented.

Chiang, C. K.↗
NASA NTRS1958

An Analysis of Pressure Studies and Experimental and Theoretical Downwash and Sidewash Behind Five Pointed-Tip Wings at Supersonic Speeds

Flow-angle and pressure surveys behind five, thin, pointed-tip wings of varying plan form have been made at Mach numbers 1.62 and 2.41. Schlieren studies at a Mach number 1.93 for the same five plan-form wings were made to illustrate the behavior of the vortex sheet. The surveys were conducted at 1.5, 3, and 4 root chords behind three triangular wings of 50 degree, 63 degree, and 72 degree leading-edge sweep angle, and behind the 50 degree triangular wing reversed. The flow behind a pointed-tip wing having a sweptback leading edge and a sweptforward trailing edge (both 50 degrees) was also surveyed. Experiment and one of the theoretical methods are compared for the reversed triangular wing and the pointed-tip wing with the 50 degree sweptback leading edge and sweptforward trailing edge.

Boatright, William B↗
NASA NTRS1993

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme-based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗
NASA NTRS1996

Emittance Measurements for a Thin Liquid Sheet Flow

The Liquid Sheet Radiator (LSR) is an external flow radiator that uses a triangular-shaped flowing liquid sheet as the radiating surface. It has potentially much lower mass than solid wall radiators such as pumped loop and heat pipe radiators, along with being nearly immune to micrometeoroid penetration. The LSR has an added advantage of simplicity. Surface tension causes a thin (100-300 microns) liquid sheet to coalesce to a point, causing the sheet flow to have a triangular shape. Such a triangular sheet is desirable since it allows for simple collection of the flow at a single point. A major problem for all external flow radiators is the requirement that the working fluid be of very low (approx. 10(sup -8) torr) vapor pressure to keep evaporative losses low. As a result, working fluids are limited to certain oils (such as used in diffusion pumps) for low temperatures (300-400 K) and liquid metals for higher temperatures. Previous research on the LSR has been directed at understanding the fluid mechanics of thin sheet flows and assessing the stability of such flows, especially with regard to the formation of holes in the sheet. Taylor studied extensively the stability of thin liquid sheets both theoretically and experimentally. He showed that thin sheets in a vacuum are stable. The latest research has been directed at determining the emittance of thin sheet flows. The emittance was calculated from spectral transmittance data for the Dow Corning 705 silicone oil. By experimentally setting up a sheet flow, the emittance was also determined as a function of measurable quantities, most importantly, the temperature drop between the top of the sheet and the temperature at the coalescence point of the sheet. Temperature fluctuations upstream of the liquid sheet were a potential problem in the analysis and were investigated.

Englehart, Amy N.↗
NASA NTRS1999

Fractal Characterization of Hyperspectral Imagery

Two Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral images selected from the Los Angeles area, one representing urban and the other, rural, were used to examine their spatial complexity across their entire spectrum of the remote sensing data. Using the ICAMS (Image Characterization And Modeling System) software, we computed the fractal dimension values via the isarithm and triangular prism methods for all 224 bands in the two AVIRIS scenes. The resultant fractal dimensions reflect changes in image complexity across the spectral range of the hyperspectral images. Both the isarithm and triangular prism methods detect unusually high D values on the spectral bands that fall within the atmospheric absorption and scattering zones where signature to noise ratios are low. Fractal dimensions for the urban area resulted in higher values than for the rural landscape, and the differences between the resulting D values are more distinct in the visible bands. The triangular prism method is sensitive to a few random speckles in the images, leading to a lower dimensionality. On the contrary, the isarithm method will ignore the speckles and focus on the major variation dominating the surface, thus resulting in a higher dimension. It is seen where the fractal curves plotted for the entire bandwidth range of the hyperspectral images could be used to distinguish landscape types as well as for screening noisy bands.

Qiu, Hon-Iie↗
NASA NTRS2004

Balanced Central Schemes for the Shallow Water Equations on Unstructured Grids

We present a two-dimensional, well-balanced, central-upwind scheme for approximating solutions of the shallow water equations in the presence of a stationary bottom topography on triangular meshes. Our starting point is the recent central scheme of Kurganov and Petrova (KP) for approximating solutions of conservation laws on triangular meshes. In order to extend this scheme from systems of conservation laws to systems of balance laws one has to find an appropriate discretization of the source terms. We first show that for general triangulations there is no discretization of the source terms that corresponds to a well-balanced form of the KP scheme. We then derive a new variant of a central scheme that can be balanced on triangular meshes. We note in passing that it is straightforward to extend the KP scheme to general unstructured conformal meshes. This extension allows us to recover our previous well-balanced scheme on Cartesian grids. We conclude with several simulations, verifying the second-order accuracy of our scheme as well as its well-balanced properties.

Bryson, Steve↗
NASA NTRS1983

At grade optical crossover for monolithic optial circuits

Planar optical circuits may be made to cross through each other, (thus eliminating extra steps required to fabricate elevated, nonintersecting crossovers) by control of the dimensions of the crossing light conductors (10, 12) to be significantly greater than d=0.89.lambda. and the angle of crossing as nearly 90.degree. as conveniently possible. A light trap may be provided just ahead of the intersection to trap any light being reflected in the source conductor at angles greater than about 45.degree.. The light trap may take the form of triangular shaped portions (16a, 16b) on each side of the source conductor with the far side of the triangular portion receiving incident light at an angle so that incident light will be reflected to the other side, or it may take the form of windows (18a, 18b) in place of the triangular portions. Planar optical circuit boards (21-23) may be fabricated and stacked to form a keyboard (20) with intersecting conductors (26-29) and keyholes (0-9) where conductors merge at the broad side of the circuit boards. These keyholes may be prearranged to form an array or matrix of keyholes.

Jamieson, Robert S.↗
NASA NTRS2010

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki↗
NASA NTRS2005

Generating Solid Models from Topographical Data

A method of generating solid models of terrain involves the conversion of topographical data into a form useable by a rapid-prototyping (RP) machine. The method was developed to enable the use of the RP machine to make solid models of Martian terrain from Mars Orbiter laser-altimeter topographical data. The method is equally applicable to the generation of models of the terrains of other astronomical bodies, including other planets, asteroids, and Earth. Topographical data describe a terrain in terms of a set of three-dimensional coordinates [e.g., Cartesian (x,y,z) or polar (latitude, longitude, radius) coordinates] of points or nodes on the terrain surface. The input data for the RP machines are required to provide a three-dimensional description, not of a single surface, but of a volume in this case, a ground volume that underlies the terrain surface. The description is required to be in the form of triangular elements that connect the nodes of all the surfaces and that completely bound the volume, with no open areas, no overlap of triangles, and no extraneous geometric elements. The software used in the present model-generation method was written in IDL - an advanced programming language that affords a number of tools, including subroutines that triangularize surfaces. The software creates a volume from the topographical surface data by adding sides to the edges of the terrain surface and joining the sides with a bottom surface. Each of the sides is triangularized by use of IDL subroutines, and then the software searches for extraneous elements and removes them. Topographical data are usually presented in a grid corresponding to polar coordinates, so that a model generated from such data is equivalent to a topographical map in Mercator projection. However an RP machine is fully capable of including the curvature of a planetary body in a model that it makes. Therefore, the software also offers a capability to transform the topographical data to a projection onto a surface having a curvature corresponding to that of the surface of the modeled planet.

Keller, John W.↗
NASA NTRS2012

Domain decomposition by the advancing-partition method for parallel unstructured grid generation

In a method for domain decomposition for generating unstructured grids, a surface mesh is generated for a spatial domain. A location of a partition plane dividing the domain into two sections is determined. Triangular faces on the surface mesh that intersect the partition plane are identified. A partition grid of tetrahedral cells, dividing the domain into two sub-domains, is generated using a marching process in which a front comprises only faces of new cells which intersect the partition plane. The partition grid is generated until no active faces remain on the front. Triangular faces on each side of the partition plane are collected into two separate subsets. Each subset of triangular faces is renumbered locally and a local/global mapping is created for each sub-domain. A volume grid is generated for each sub-domain. The partition grid and volume grids are then merged using the local-global mapping.

Pirzadeh, Shahyar Z.↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
DOE OSTI2023

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗
DOE OSTI2025

Comprehensive defect evaluation of advanced nuclear fuels using high-resolution acoustic signals and optimized sensor separation

Graphite pebble composite structures based on TRistructural-ISOtropic (TRISO) particles are being developed as core nuclear fuels in advanced power reactors, promising safe operation at increased temperatures. Ensuring the structural integrity of these nuclear fuels requires comprehensive and accurate non-destructive evaluation (NDE) techniques to characterize defects and damage in the pebbles. However, traditional acoustic evaluation methods face limitations in defect characterization due to the highly attenuative, and geometrically and compositionally complex nature of these structures. This study proposes an improved acoustic NDE technique for accurate detection and classification of anticipated relevant defects and damage in graphite pebbles using high-resolution acoustic signals and optimized transmit-receive sensor networks. The proposed approach utilizes a triangular three-sensor network as the base unit, comprising three transmit-receive sensors. The sensor separation distance, as well as acoustic excitation center frequency, pulse-width, and bandwidth are optimized to enhance spatial resolution and improve signal-to-noise ratio, enabling effective characterization of the smallest size and widest range of defects in pebbles. Furthermore, the use of the triangular sensor configuration instead of a more conventional transmit-receive sensor pair expands the inspection region from a one-dimensional linear path to a two-dimensional area, increasing spatial coverage. To mitigate challenges associated with processing of complex acoustic signals arising from high-frequency, high-bandwidth excitation in these structures, a machine-learning-based signal processing algorithm is integrated with the sensor network. In the machine-learning-based algorithm, multi-domain features are extracted from the acoustic signals to capture intricate signal characteristics, significantly improving defect identification and classification compared to traditional approaches. The proposed acoustic NDE technique offers considerable promise for practical and reliable defect/damage diagnostics of advanced nuclear pebble fuels.

42 ENGINEERING↗
DOE OSTI2017

Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

97 MATHEMATICS AND COMPUTING↗