Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative methods”

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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

THE FORCE-FREE MAGNETOSPHERE OF A ROTATING BLACK HOLE

We revisit the Blandford-Znajek process and solve the fundamental equation that governs the structure of the steady-state force-free magnetosphere around a Kerr black hole. The solution depends on the distributions of the magnetic field angular velocity {omega} and the poloidal electric current I. These are not arbitrary. They are determined self-consistently by requiring that magnetic field lines cross smoothly the two singular surfaces of the problem: the inner ''light surface'' located inside the ergosphere and the outer ''light surface'' which is the generalization of the pulsar light cylinder. We find the solution for the simplest possible magnetic field configuration, the split monopole, through a numerical iterative relaxation method analogous to the one that yields the structure of the steady-state axisymmetric force-free pulsar magnetosphere. We obtain the rate of electromagnetic extraction of energy and confirm the results of Blandford and Znajek and of previous time-dependent simulations. Furthermore, we discuss the physical applicability of magnetic field configurations that do not cross both ''light surfaces''.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

Development of output user interface software to support analysis

Data processing software packages such as VSOP and MCNPX are softwares that has been scientifically proven and complete. The result of VSOP and MCNPX are huge and complex text files. In the analyze process, user need additional processing like Microsoft Excel to show informative result. This research develop an user interface software for output of VSOP and MCNPX. VSOP program output is used to support neutronic analysis and MCNPX program output is used to support burn-up analysis. Software development using iterative development methods which allow for revision and addition of features according to user needs. Processing time with this software 500 times faster than with conventional methods using Microsoft Excel. PYTHON is used as a programming language, because Python is available for all major operating systems: Windows, Linux/Unix, OS/2, Mac, Amiga, among others. Values that support neutronic analysis are k-eff, burn-up and mass Pu{sup 239} and Pu{sup 241}. Burn-up analysis used the mass inventory values of actinide (Thorium, Plutonium, Neptunium and Uranium). Values are visualized in graphical shape to support analysis.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2014

A Least-Squares Transport Equation Compatible with Voids

Standard second-order self-adjoint forms of the transport equation, such as the even-parity, odd-parity, and self-adjoint angular flux equation, cannot be used in voids. Perhaps more important, they experience numerical convergence difficulties in near-voids. Here we present a new form of a second-order self-adjoint transport equation that has an advantage relative to standard forms in that it can be used in voids or near-voids. Our equation is closely related to the standard least-squares form of the transport equation with both equations being applicable in a void and having a nonconservative analytic form. However, unlike the standard least-squares form of the transport equation, our least-squares equation is compatible with source iteration. It has been found that the standard least-squares form of the transport equation with a linear-continuous finite-element spatial discretization has difficulty in the thick diffusion limit. Here we extensively test the 1D slab-geometry version of our scheme with respect to void solutions, spatial convergence rate, and the intermediate and thick diffusion limits. We also define an effective diffusion synthetic acceleration scheme for our discretization. Our conclusion is that our least-squares S n formulation represents an excellent alternative to existing second-order S n transport formulations

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1988

Three parallel computation methods for structural vibration analysis

The Lanczos (1950), multisectioning, and subspace iteration sequential methods for vibration analysis presently used as bases for three parallel algorithms are noted, in the aftermath of three example problems, to maintain reasonable accuracy in the computation of vibration frequencies. Significant computation time reductions are obtained as the number of processors increases. An analysis is made of the performance of each method, in order to characterize relative strengths and weaknesses as well as to identify those parameters that most strongly affect computation efficiency.

Storaasli, Olaf↗
DOE OSTI2013

PLANET HUNTERS. V. A CONFIRMED JUPITER-SIZE PLANET IN THE HABITABLE ZONE AND 42 PLANET CANDIDATES FROM THE KEPLER ARCHIVE DATA

We report the latest Planet Hunter results, including PH2 b, a Jupiter-size (R{sub PL} = 10.12 ± 0.56 R{sub ⊕}) planet orbiting in the habitable zone of a solar-type star. PH2 b was elevated from candidate status when a series of false-positive tests yielded a 99.9% confidence level that transit events detected around the star KIC 12735740 had a planetary origin. Planet Hunter volunteers have also discovered 42 new planet candidates in the Kepler public archive data, of which 33 have at least 3 transits recorded. Most of these transit candidates have orbital periods longer than 100 days and 20 are potentially located in the habitable zones of their host stars. Nine candidates were detected with only two transit events and the prospective periods are longer than 400 days. The photometric models suggest that these objects have radii that range between those of Neptune and Jupiter. These detections nearly double the number of gas-giant planet candidates orbiting at habitable-zone distances. We conducted spectroscopic observations for nine of the brighter targets to improve the stellar parameters and we obtained adaptive optics imaging for four of the stars to search for blended background or foreground stars that could confuse our photometric modeling. We present an iterative analysis method to derive the stellar and planet properties and uncertainties by combining the available spectroscopic parameters, stellar evolution models, and transiting light curve parameters, weighted by the measurement errors. Planet Hunters is a citizen science project that crowd sources the assessment of NASA Kepler light curves. The discovery of these 43 planet candidates demonstrates the success of citizen scientists at identifying planet candidates, even in longer period orbits with only two or three transit events.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Iterative image-domain decomposition for dual-energy CT

Purpose: Dual energy CT (DECT) imaging plays an important role in advanced imaging applications due to its capability of material decomposition. Direct decomposition via matrix inversion suffers from significant degradation of image signal-to-noise ratios, which reduces clinical values of DECT. Existing denoising algorithms achieve suboptimal performance since they suppress image noise either before or after the decomposition and do not fully explore the noise statistical properties of the decomposition process. In this work, the authors propose an iterative image-domain decomposition method for noise suppression in DECT, using the full variance-covariance matrix of the decomposed images. Methods: The proposed algorithm is formulated in the form of least-square estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance-covariance matrix of the decomposed images as the penalty weight in the least-square term. The regularization term enforces the image smoothness by calculating the square sum of neighboring pixel value differences. To retain the boundary sharpness of the decomposed images, the authors detect the edges in the CT images before decomposition. These edge pixels have small weights in the calculation of the regularization term. Distinct from the existing denoising algorithms applied on the images before or after decomposition, the method has an iterative process for noise suppression, with decomposition performed in each iteration. The authors implement the proposed algorithm using a standard conjugate gradient algorithm. The method performance is evaluated using an evaluation phantom (Catphan©600) and an anthropomorphic head phantom. The results are compared with those generated using direct matrix inversion with no noise suppression, a denoising method applied on the decomposed images, and an existing algorithm with similar formulation as the proposed method but with an edge-preserving regularization term. Results: On the Catphan phantom, the method maintains the same spatial resolution on the decomposed images as that of the CT images before decomposition (8 pairs/cm) while significantly reducing their noise standard deviation. Compared to that obtained by the direct matrix inversion, the noise standard deviation in the images decomposed by the proposed algorithm is reduced by over 98%. Without considering the noise correlation properties in the formulation, the denoising scheme degrades the spatial resolution to 6 pairs/cm for the same level of noise suppression. Compared to the edge-preserving algorithm, the method achieves better low-contrast detectability. A quantitative study is performed on the contrast-rod slice of Catphan phantom. The proposed method achieves lower electron density measurement error as compared to that by the direct matrix inversion, and significantly reduces the error variation by over 97%. On the head phantom, the method reduces the noise standard deviation of decomposed images by over 97% without blurring the sinus structures. Conclusions: The authors propose an iterative image-domain decomposition method for DECT. The method combines noise suppression and material decomposition into an iterative process and achieves both goals simultaneously. By exploring the full variance-covariance properties of the decomposed images and utilizing the edge predetection, the proposed algorithm shows superior performance on noise suppression with high image spatial resolution and low-contrast detectability.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

SU-E-T-33: A Feasibility-Seeking Algorithm Applied to Planning of Intensity Modulated Proton Therapy: A Proof of Principle Study

Purpose: To investigate the applicability of feasibility-seeking cyclic orthogonal projections to the field of intensity modulated proton therapy (IMPT) inverse planning. Feasibility of constraints only, as opposed to optimization of a merit function, is less demanding algorithmically and holds a promise of parallel computations capability with non-cyclic orthogonal projections algorithms such as string-averaging or block-iterative strategies. Methods: A virtual 2D geometry was designed containing a C-shaped planning target volume (PTV) surrounding an organ at risk (OAR). The geometry was pixelized into 1 mm pixels. Four beams containing a subset of proton pencil beams were simulated in Geant4 to provide the system matrix A whose elements a-ij correspond to the dose delivered to pixel i by a unit intensity pencil beam j. A cyclic orthogonal projections algorithm was applied with the goal of finding a pencil beam intensity distribution that would meet the following dose requirements: D-OAR < 54 Gy and 57 Gy < D-PTV < 64.2 Gy. The cyclic algorithm was based on the concept of orthogonal projections onto half-spaces according to the Agmon-Motzkin-Schoenberg algorithm, also known as ‘ART for inequalities’. Results: The cyclic orthogonal projections algorithm resulted in less than 5% of the PTV pixels and less than 1% of OAR pixels violating their dose constraints, respectively. Because of the abutting OAR-PTV geometry and the realistic modelling of the pencil beam penumbra, complete satisfaction of the dose objectives was not achieved, although this would be a clinically acceptable plan for a meningioma abutting the brainstem, for example. Conclusion: The cyclic orthogonal projections algorithm was demonstrated to be an effective tool for inverse IMPT planning in the 2D test geometry described. We plan to further develop this linear algorithm to be capable of incorporating dose-volume constraints into the feasibility-seeking algorithm.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Simultaneous Optimization of Nuclear–Electronic Orbitals

Accurate modeling of important nuclear quantum effects, such as nuclear delocalization, zero-point energy, and tunneling, as well as non-Born-Oppenheimer effects, requires treatment of both nuclei and electrons quantum mechanically. The nuclear–electronic orbital (NEO) method provides an elegant framework to treat specified nuclei, typically protons, on the same level as the electrons. In conventional electronic structure theory, finding a converged ground state can be a computationally demanding task; converging NEO wavefunctions, due to their coupled electronic and nuclear nature, is even more demanding. Herein, we present an efficient simultaneous optimization method that uses the direct inversion in the iterative subspace method to simultaneously converge wavefunctions for both the electrons and quantum nuclei. In conclusion, benchmark studies show that the simultaneous optimization method can significantly reduce the computational cost compared to the conventional stepwise method for optimizing NEO wavefunctions for multicomponent systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Three-Dimensional Geometry of Collagenous Tissues by Second Harmonic Polarimetry

Collagen is a biological macromolecule capable of second harmonic generation, allowing label-free detection in tissues; in addition, molecular orientation can be determined from the polarization dependence of the second harmonic signal. Previously we reported that in-plane orientation of collagen fibrils could be determined by modulating the polarization angle of the laser during scanning. We have now extended this method so that out-of-plane orientation angles can be determined at the same time, allowing visualization of the 3-dimensional structure of collagenous tissues. This approach offers advantages compared with other methods for determining out-of-plane orientation. First, the orientation angles are directly calculated from the polarimetry data obtained in a single scan, while other reported methods require data from multiple scans, use of iterative optimization methods, application of fitting algorithms, or extensive post-optical processing. Second, our method does not require highly specialized instrumentation, and thus can be adapted for use in almost any nonlinear optical microscopy setup. It is suitable for both basic and clinical applications. We present three-dimensional images of structurally complex collagenous tissues that illustrate the power of such 3-dimensional analyses to reveal the architecture of biological structures.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1975

A method for the dynamic and thermal stress analysis of space shuttle surface insulation

The thermal protection system of the space shuttle consists of thousands of separate insulation tiles bonded to the orbiter's surface through a soft strain-isolation layer. The individual tiles are relatively thick and possess nonuniform properties. Therefore, each is idealized by finite-element assemblages containing up to 2500 degrees of freedom. Since the tiles affixed to a given structural panel will, in general, interact with one another, application of the standard direct-stiffness method would require equation systems involving excessive numbers of unknowns. This paper presents a method which overcomes this problem through an efficient iterative procedure which requires treatment of only a single tile at any given time. Results of associated static, dynamic, and thermal stress analyses and sufficient conditions for convergence of the iterative solution method are given.

Ojalvo, I. U.↗
NASA NTRS1984

PIAS: A program for an iterative aeroelastic solution

A Program for an Iterative Aeroelastic Solution (PIAS) is discussed. This will be a modular computer program that combines the use of a finite-element structural analysis code with any linear or nonlinear aerodynamic code. At this point in time, PIAS has been designed but the software has not been written. The idea for this development originated with P. J. (Bud) Bobbitt of the NASA Langley Research Center. There was initial interest in an aeroelastic solution for a separation-induced leading-edge vortex. Some examples of the flow patterns for a low aspect ratio wing are shown. The Leading-Edge Vortex Program, which calculates pressure distributions including the effects of a separation-induced leading-edge vortex, uses an iterative solution method. This led to the concept of an iteration cycle on configuration shape external to the aerodynamic code.

Manro, M. E.↗
NASA NTRS2011

MSFC Advanced Concepts Office and the Iterative Launch Vehicle Concept Method

This slide presentation reviews the work of the Advanced Concepts Office (ACO) at Marshall Space Flight Center (MSFC) with particular emphasis on the method used to model launch vehicles using INTegrated ROcket Sizing (INTROS), a modeling system that assists in establishing the launch concept design, and stage sizing, and facilitates the integration of exterior analytic efforts, vehicle architecture studies, and technology and system trades and parameter sensitivities.

Creech, Dennis↗
DOE OSTI2015

Iterative Implicit Monte Carlo

Here, we describe a new Monte Carlo thermal radiation transport method that is fully implicit in the value of matter temperature used to calculate thermal emission. This method involves iterating on the matter temperature until convergence at the end of the time-step value of the matter temperature is obtained. Because the method is fully implicit, it eliminates the violations of the maximum principle that can occur in Implicit Monte Carlo (IMC) simulations on the problems on which we have tested it. The method has the drawback that it is considerably more expensive than IMC for simulations with cold opaque regions. We discuss the reasons for this, and discuss some ways that the number of iterations may be reduced.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗