Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple iterations”

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 217 records · Page 12

Abstract-Reasoning Software for Coordinating Multiple Agents

A computer program for scheduling the activities of multiple agents that share limited resources has been incorporated into the Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been reported in several previous NASA Tech Briefs articles. In the original intended application, the agents would be multiple spacecraft and/or robotic vehicles engaged in scientific exploration of distant planets. The program could also be used on Earth in such diverse settings as production lines and military maneuvers. This program includes a planning/scheduling subprogram of the iterative repair type that reasons about the activities of multiple agents at abstract levels in order to greatly improve the scheduling of their use of shared resources. The program summarizes the information about the constraints on, and resource requirements of, abstract activities on the basis of the constraints and requirements that pertain to their potential refinements (decomposition into less-abstract and ultimately to primitive activities). The advantage of reasoning about summary information is that time needed to find consistent schedules is exponentially smaller than the time that would be needed for reasoning about the same tasks at the primitive level.

Clement, Bradley↗

Multiple scattering from finite inhomogeneous media

Utilizing the characteristic information concerning the apparent phase constant difference between the electric and magnetic fields propagating in an inhomogeneous medium, a theoretical analysis of the multiple scattering of electromagnetic waves in finite inhomogeneous media is presented. The solution is obtained by first approximating the coefficients of a pair of exact coupled first-order differential equations and then solving the equations by first-order iteration. The present first-order approximate solution with multiple scattering considerations is shown to be more accurate than the WKB solution. Methods to improve the accuracy of the first-order solution further are discussed. Application of the solution to slowly varying finite media with periodic properties demonstrates the validity of the solution. The same approach can be extended to frequencies in the optical region by retaining additional terms in the coefficients of the coupled differential equations.

Tang, C. C. H.↗

Performance Analysis of Distributed Object-Oriented Applications

The purpose of this research was to evaluate the efficiency of a distributed simulation architecture which creates individual modules which are made self-scheduling through the use of a message-based communication system used for requesting input data from another module which is the source of that data. To make the architecture as general as possible, the message-based communication architecture was implemented using standard remote object architectures (Common Object Request Broker Architecture (CORBA) and/or Distributed Component Object Model (DCOM)). A series of experiments were run in which different systems are distributed in a variety of ways across multiple computers and the performance evaluated. The experiments were duplicated in each case so that the overhead due to message communication and data transmission can be separated from the time required to actually perform the computational update of a module each iteration. The software used to distribute the modules across multiple computers was developed in the first year of the current grant and was modified considerably to add a message-based communication scheme supported by the DCOM distributed object architecture. The resulting performance was analyzed using a model created during the first year of this grant which predicts the overhead due to CORBA and DCOM remote procedure calls and includes the effects of data passed to and from the remote objects. A report covering the distributed simulation software and the results of the performance experiments has been submitted separately. The above report also discusses possible future work to apply the methodology to dynamically distribute the simulation modules so as to minimize overall computation time.

Schoeffler, James D.↗

Kepler Data Validation II–Transit Model Fitting and Multiple-Planet Search

This paper discusses the transit model-fitting and multiple-planet search algorithms and performance of the Kepler Science Data Processing Pipeline, developed by the Kepler Science Operations Center (SOC). Threshold crossing events (TCEs), which are transit candidate events, are generated by the Transiting Planet Search (TPS) component of the pipeline and subsequently processed in the data validation (DV) component. The transit model is used in DV to fit TCEs to characterize planetary candidates and to derive parameters that are used in various diagnostic tests to classify them. After the signature associated with the TCE is removed from the light curve of the target star, the residual light curve goes through TPS again to search for additional TCEs. The iterative process of transit model fitting and multiple-planet search continues until no TCE is generated from the residual light curve or an upper limit is reached. The transit model-fitting and multiple-planet search performance of the final release (9.3, 2016January) of the pipeline is demonstrated with the results of the processing of four years (17 quarters) of flight data from the primary Kepler Mission. The transit model-fitting results are accessible from the NASA Exoplanet Archive. The final version of the SOC codebase is available through GitHub.

Threshold crossing events (TCEs↗

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CORSICA modelling of ITER hybrid operation scenarios

The hybrid operating mode observed in several tokamaks is characterized by further enhancement over the high plasma confinement (H-mode) associated with reduced magneto-hydro-dynamic (MHD) instabilities linked to a stationary flat safety factor ($q$ ) profile in the core region. The proposed ITER hybrid operation is currently aiming at operating for a long burn duration (>1000 s) with a moderate fusion power multiplication factor, $Q$ , of at least 5. This paper presents here candidate ITER hybrid operation scenarios developed using a free-boundary transport modelling code, CORSICA, taking all relevant physics and engineering constraints into account. The ITER hybrid operation scenarios have been developed by tailoring the 15 MA baseline ITER inductive H-mode scenario. Accessible operation conditions for ITER hybrid operation and achievable range of plasma parameters have been investigated considering uncertainties on the plasma confinement and transport. ITER operation capability for avoiding the poloidal field coil current, field and force limits has been examined by applying different current ramp rates, flat-top plasma currents and densities, and pre-magnetization of the poloidal field coils. Various combinations of heating and current drive (H&CD) schemes have been applied to study several physics issues, such as the plasma current density profile tailoring, enhancement of the plasma energy confinement and fusion power generation. A parameterized edge pedestal model based on EPED1 added to the CORSICA code has been applied to hybrid operation scenarios. Finally, fully self-consistent free-boundary transport simulations have been performed to provide information on the poloidal field coil voltage demands and to study the controllability with the ITER controllers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computation of optimal output-feedback compensators for linear time-invariant systems

The control of linear time-invariant systems with respect to a quadratic performance criterion was considered, subject to the constraint that the control vector be a constant linear transformation of the output vector. The optimal feedback matrix, f*, was selected to optimize the expected performance, given the covariance of the initial state. It is first shown that the expected performance criterion can be expressed as the ratio of two multinomials in the element of f. This expression provides the basis for a feasible method of determining f* in the case of single-input single-output systems. A number of iterative algorithms are then proposed for the calculation of f* for multiple input-output systems. For two of these, monotone convergence is proved, but they involve the solution of nonlinear matrix equations at each iteration. Another is proposed involving the solution of Lyapunov equations at each iteration, and the gradual increase of the magnitude of a penalty function. Experience with this algorithm will be needed to determine whether or not it does, indeed, possess desirable convergence properties, and whether it can be used to determine the globally optimal f*.

Platzman, L. K.↗

Development of a lithium fluoride zinc sulfide based neutron multiplicity counter

Past 3He shortages led to investigations into replacement options for neutron detectors in systems that previously used 3He-based technologies. The goal of this research was to investigate the feasibility of a full-scale lithium fluoride with silver activated zinc sulfide (LiF/ZnS) based neutron multiplicity counter. The LiF/ZnS based neutron multiplicity counter (LiNMC) was developed based on an iterative process between modeling and experimental measurements. Each active region of the LiNMC contains five sheets of LiF/ZnS sandwiched between six sheets of wavelength shifting plastic to form neutron detection stacks. The wavelength shifted scintillation light was collected by photomultiplier tubes located on each end of the stacks. Twelve such detector stacks were placed around a sample chamber in a square arrangement with lithiated high density polyethylene blocks in the corners to reflect high energy neutrons and capture low energy neutrons. Preliminary calibration with a 252Cf neutron source showed that the LiNMC was able to achieve 36% neutron detection efficiency (ε) and an 11.7 μs neutron die-away time (τ) for a doubles Figure-of-merit (ε2/ τ) of 109. This is the highest doubles Figure-of-merit performance measured to-date for a 3He-free neutron multiplicity counter system. By the end of this project, the LiNMC’s basic components were integrated into a single laboratory scale system capable of proof-of-concept measurements.

3He-free↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

CRADA: Data Acquisition and Tomographic Software Development

Dr. Raymond R. Raylman, Professor and Vice Chair for Research, Radiology Department at WVU was the Principal Investigator for the project. The Jefferson Lab partner on this project was the Radiation Detector and Imaging Group in the Physics Division, led by Dr. Drew Weisenberger who was the coordinator of the project execution and the chief contact with WVU. The responsibility of Jefferson Lab was to facilitate optimization of data acquisition software, conversion of JLab Fortran iterative positron emission mammography computer code to C++ and to act as a computer code repository. During the two year project interactions and exchange of information was directed by Dr. Raylman and Dr. Wesienberger. WVU provided the expertise that allowed JLab to continue development of the current JLab data acquisition software referred to as JDAQ. JDAQ is a highly flexible Java language based data acquisition tool that helps to minimize software induced dead-time while maintaining the highest possible data rates from a JLab built FPGA based analog-to-digital convertor (ADC). JDAQ interfaces directly with the FPGA based multi-channel ADCs. Using JDAQ it is possible process data from a number of different detector types such as the PET systems at WVU. Because of the inherent flexibility of our processing software, we are also able adjust detector readout parameters during operation to provide the best possible data presentation and calibration parameters. To accommodate the high rate nature of PET detector systems JDAQ was designed to be scalable across an Ethernet network as well as for multi-cpu computer systems, and it also has the capability to synchronize many ADCs connected to multiple computers. During the project WVU will provided iterative reconstruction algorithm expertise and Fortran programming assistance to facilitate the conversion to C++ of a JLab developed Fortran positron emission mammography (PEM) reconstruction code. Also WVU provided acceptance testing of the new C++ based PEM reconstruction code. The PEM code is a maximization (MLEM) image reconstruction program that created images from the list-mode data acquired from the PET system.

97 MATHEMATICS AND COMPUTING↗

A Proof of the Asymptotic Variance of Path Length Estimators for Single-Collision Monte Carlo Source Iteration in the Thick Diffusion Limit

Here, we prove a theorem relating the variance of path length estimators for single-collision Monte Carlo source iteration to a parameter that becomes infinitesimally small in an important physical regime arising in radiative transfer. In our usage, “single-collision Monte Carlo source iteration” refers to Monte Carlo Boltzmann transport methods in which each Monte Carlo particle history includes no more than a single collision, and the physics of multiple scattering is modeled by lagging the scattering source term and iterating until this term converges. Our theorem can be used to construct variance reduction techniques which improve the order of the estimator variance. This enables calculations that would otherwise require impractically large sample sizes to achieve practical estimator uncertainties. We believe this is the first postulation of a theorem relating estimator variance to a limiting case parameter for single-collision Monte Carlo source iteration, and the first proof of such a theorem. We illustrate the theorem’s value with an example in which the authors of a transport method used the theorem to design a variance reduction technique that improved the uncertainty of their solution by a factor of about 500 for a proxy problem from radiative transfer that contains both optically-thick and optically-thin material.

Mathematics and Computing↗

Compensator improvement for multivariable control systems

A theory and the associated numerical technique are developed for an iterative design improvement of the compensation for linear, time-invariant control systems with multiple inputs and multiple outputs. A strict constraint algorithm is used in obtaining a solution of the specified constraints of the control design. The result of the research effort is the multiple input, multiple output Compensator Improvement Program (CIP). The objective of the Compensator Improvement Program is to modify in an iterative manner the free parameters of the dynamic compensation matrix so that the system satisfies frequency domain specifications. In this exposition, the underlying principles of the multivariable CIP algorithm are presented and the practical utility of the program is illustrated with space vehicle related examples.

Mitchell, J. R.↗

Prediction of human observer performance in a 2-alternative forced choice low-contrast detection task using channelized Hotelling observer: Impact of radiation dose and reconstruction algorithms

Purpose: Efficient optimization of CT protocols demands a quantitative approach to predicting human observer performance on specific tasks at various scan and reconstruction settings. The goal of this work was to investigate how well a channelized Hotelling observer (CHO) can predict human observer performance on 2-alternative forced choice (2AFC) lesion-detection tasks at various dose levels and two different reconstruction algorithms: a filtered-backprojection (FBP) and an iterative reconstruction (IR) method. Methods: A 35 Multiplication-Sign 26 cm{sup 2} torso-shaped phantom filled with water was used to simulate an average-sized patient. Three rods with different diameters (small: 3 mm; medium: 5 mm; large: 9 mm) were placed in the center region of the phantom to simulate small, medium, and large lesions. The contrast relative to background was -15 HU at 120 kV. The phantom was scanned 100 times using automatic exposure control each at 60, 120, 240, 360, and 480 quality reference mAs on a 128-slice scanner. After removing the three rods, the water phantom was again scanned 100 times to provide signal-absent background images at the exact same locations. By extracting regions of interest around the three rods and on the signal-absent images, the authors generated 21 2AFC studies. Each 2AFC study had 100 trials, with each trial consisting of a signal-present image and a signal-absent image side-by-side in randomized order. In total, 2100 trials were presented to both the model and human observers. Four medical physicists acted as human observers. For the model observer, the authors used a CHO with Gabor channels, which involves six channel passbands, five orientations, and two phases, leading to a total of 60 channels. The performance predicted by the CHO was compared with that obtained by four medical physicists at each 2AFC study. Results: The human and model observers were highly correlated at each dose level for each lesion size for both FBP and IR. The Pearson's product-moment correlation coefficients were 0.986 [95% confidence interval (CI): 0.958-0.996] for FBP and 0.985 (95% CI: 0.863-0.998) for IR. Bland-Altman plots showed excellent agreement for all dose levels and lesions sizes with a mean absolute difference of 1.0%{+-} 1.1% for FBP and 2.1%{+-} 3.3% for IR. Conclusions: Human observer performance on a 2AFC lesion detection task in CT with a uniform background can be accurately predicted by a CHO model observer at different radiation dose levels and for both FBP and IR methods.

60 APPLIED LIFE SCIENCES↗

Elliptic symbol calculus: from elliptic polylogarithms to iterated integrals of Eisenstein series

We present a generalization of the symbol calculus from ordinary multiple polylogarithms to their elliptic counterparts. Here, our formalism is based on a special case of a coaction on large classes of periods that is applied in particular to elliptic polylogarithms and iterated integrals of modular forms. We illustrate how to use our formalism to derive relations among elliptic polylogarithms, in complete analogy with the non-elliptic case. We then analyze the symbol alphabet of elliptic polylogarithms evaluated at rational points, and we observe that it is given by Eisenstein series for a certain congruence subgroup. We apply our formalism to hypergeometric functions that can be expressed in terms of elliptic polylogarithms and show that they can equally be written in terms of iterated integrals of Eisenstein series. Finally, we present the symbol of the equal-mass sunrise integral in two space-time dimensions. The symbol alphabet involves Eisenstein series of level six and weight three, and we can easily integrate the symbol in terms of iterated integrals of Eisenstein series.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Clinical Pathways: A Catalyst for the Adoption of Hypofractionation for Early-Stage Breast Cancer

Purpose: Hypofractionated whole-breast irradiation (HF-WBI) remains underutilized in the United States despite support by multiple clinical trials. We evaluated the success of iterative modifications of our breast cancer clinical pathway on the adoption of HF-WBI in a large, integrated radiation oncology network. Methods and Materials: The breast clinical pathway was modified in January 2011 (Amendment 1) to recommend HF-WBI as the first option for women ≥70 of age with stages 0 to IIA, while maintaining conventional fractionation (CF) as a pathway-concordant secondary option. In January 2013 (Amendment 2), the pathway's HF-WBI recommendation was extended to women ≥50 years of age. In January 2014 (Amendment 3), the pathway mandated HF-WBI as the only pathway-concordant option in women ≥50 years of age, and all pathway-discordant plans were subject to peer review and justification. Women ≥50 years of age with ductal carcinoma in situ or invasive breast cancer who underwent breast conserving surgery and adjuvant WBI were included in this analysis. Results: We identified 5112 patients from 2009 to 2014 who met inclusion criteria. From 2009 to 2012, the overall HF-WBI use rate was 8.3%. Following Amendments 2 and 3 (2013 and 2014, respectively), HF-WBI use significantly increased to 21.8% (17.3% in the community, 39.7% at academic sites) and 76.7% (75.5% in the community, 81.4% at academic sites), respectively (P<.001). Compared to 2009 to 2012, the relative risk of using HF-WBI was 7.9 (95% confidence interval: 7.1-8.6, P<.001) and 10.7 (95% CI: 10.3-11.0, P<.001), respectively, after Amendments 2 and 3, respectively. Age ≥70 and treatment at an academic site increased the likelihood of receiving HF-WBI in 2009 to 2012 and following Amendment 2 (P<.001). Conclusions: This study demonstrates the transformative effect of a clinical pathway on patterns of care for breast radiation therapy. Although our initial HF-WBI use rate was low (8%-22%) and consistent with national rates, the clinical pathway approach dramatically increased adoption rate to >75%. In contrast to passive guidelines, clinical pathways serve as active tools to promote current best practices.

62 RADIOLOGY AND NUCLEAR MEDICINE↗