Search NASA⌕ Search

SEARCH · Search NASA

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 37 records · Page 2

Parallel computation of multigroup reactivity coefficient using iterative method

One of the research activities to support the commercial radioisotope production program is a safety research target irradiation FPM (Fission Product Molybdenum). FPM targets form a tube made of stainless steel in which the nuclear degrees of superimposed high-enriched uranium. FPM irradiation tube is intended to obtain fission. The fission material widely used in the form of kits in the world of nuclear medicine. Irradiation FPM tube reactor core would interfere with performance. One of the disorders comes from changes in flux or reactivity. It is necessary to study a method for calculating safety terrace ongoing configuration changes during the life of the reactor, making the code faster became an absolute necessity. Neutron safety margin for the research reactor can be reused without modification to the calculation of the reactivity of the reactor, so that is an advantage of using perturbation method. The criticality and flux in multigroup diffusion model was calculate at various irradiation positions in some uranium content. This model has a complex computation. Several parallel algorithms with iterative method have been developed for the sparse and big matrix solution. The Black-Red Gauss Seidel Iteration and the power iteration parallel method can be used to solve multigroup diffusion equation system and calculated the criticality and reactivity coeficient. This research was developed code for reactivity calculation which used one of safety analysis with parallel processing. It can be done more quickly and efficiently by utilizing the parallel processing in the multicore computer. This code was applied for the safety limits calculation of irradiated targets FPM with increment Uranium.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

We employ Anderson extrapolation to accelerate the classical Jacobi iterative method for large, sparse linear systems. Specifically, we utilize extrapolation at periodic intervals within the Jacobi iteration to develop the Alternating Anderson–Jacobi (AAJ) method. We verify the accuracy and efficacy of AAJ in a range of test cases, including nonsymmetric systems of equations. We demonstrate that AAJ possesses a favorable scaling with system size that is accompanied by a small prefactor, even in the absence of a preconditioner. In particular, we show that AAJ is able to accelerate the classical Jacobi iteration by over four orders of magnitude, with speed-ups that increase as the system gets larger. Moreover, we find that AAJ significantly outperforms the Generalized Minimal Residual (GMRES) method in the range of problems considered here, with the relative performance again improving with size of the system. As a result, the proposed method represents a simple yet efficient technique that is particularly attractive for large-scale parallel solutions of linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

Solitary Waves of the MRLW Equation by Variational Iteration Method

In a recent publication, Soliman solved numerically the modified regularized long wave (MRLW) equation by using the variational iteration method (VIM). In this paper, corrected numerical results have been computed, plotted, tabulated, and compared with not only the exact analytical solutions but also the Adomian decomposition method results. Solitary wave solutions of the MRLW equation are exactly obtained as a convergent series with easily computable components. Propagation of single solitary wave, interaction of two and three waves, and also birth of solitons have been discussed. Three invariants of motion have been evaluated to determine the conservation properties of the problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel iterative methods for a finite family of sequences of nearly nonexpansive mappings in Hilbert spaces

In this paper, we propose some new parallel iterative methods by the hybrid and shrinking projection to find a common fixed point of a finite family of sequences of nearly nonexpansive mappings in Hilbert spaces when the domain C satisfies diam(C) < ∞. We also give some applications of our main results for the problem of finding a common fixed point of nonexpansive mappings, nonexpansive semi-groups, the problem of finding a common zero point of monotone operators, the system of generalized mixed equilibrium problems and the system of variational inequalities without the condition diam(C) < ∞. Three numerical examples also are given to illustrate the effectiveness of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

A modified iterative method for split problem of variational inclusions and fixed point problems

In this paper, we study a new split problem of variational inclusions and fixed point problems. With the help of averaged mappings, we introduce a new iterative method to solve the stated split problem. Strong convergence results are obtained under mild conditions. Also, we present some preliminary numerical examples to demonstrate the convergence and efficiency of our proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

A fast-converging iterative method for X-ray in-line phase contrast tomography

X-ray in-line phase contrast tomography holds great promise for the quantitative analysis of soft materials. However, its applications have been limited, so far, by the fact that direct methods based on the transport-of-intensity equation and the contrast transfer function are sensitive to noise and applicable only to limited types of samples. Here, we propose an iterative method based on the Gerchberg-Saxton algorithm (R. W. Gerchberg and W. O. Saxton, Optik 35, 237 (1972)), but overcoming its slow convergence by an acceleration technique, named random signed feedback, which shows an excellent performance, both in numerical simulation and tomographic experiment, of discriminating various polymers even when using 53 keV synchrotron X-rays.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient iterative method for solving the Dirac-Kohn-Sham density functional theory

We present for the first time an efficient iterative method to directly solve the four-component Dirac-Kohn-Sham (DKS) density functional theory. Due to the existence of the negative energy continuum in the DKS operator, the existing iterative techniques for solving the Kohn-Sham systems cannot be efficiently applied to solve the DKS systems. The key component of our method is a novel filtering step (F) which acts as a preconditioner in the framework of the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The resulting method, dubbed the LOBPCG-F method, is able to compute the desired eigenvalues and eigenvectors in the positive energy band without computing any state in the negative energy band. The LOBPCG-F method introduces mild extra cost compared to the standard LOBPCG method and can be easily implemented. We demonstrate our method in the pseudopotential framework with a planewave basis set which naturally satisfies the kinetic balance prescription. Numerical results for Pt$_{2}$, Au$_{2}$, TlF, and Bi$_{2}$Se$_{3}$ indicate that the LOBPCG-F method is a robust and efficient method for investigating the relativistic effect in systems containing heavy elements.

74 ATOMIC AND MOLECULAR PHYSICS↗

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S{sub 2} synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative Method to Obtain Raman Spectra of Organic Dyes by Their Chaotic Generation in Multiple-Scattering Media

An iterative method is developed to obtain vibrational spectra of laser organic dyes from their secondary radiation spectra in multiple-scattering media, which manifests as a result of coupled process of chaotic generation (CG) and stimulated Raman scattering (SRS). The developed method increases significantly the capability to detect weak Raman lines by using batch processing of a set of experimental SRS-CG spectra, which makes it possible to optimize the deconvolution of these spectra and to average vibrational spectra obtained from the set of experimental SRS-CG spectra. The method is tested on spectra of the SRS-CG laser dye pyrromethene 597 in a vesicular film. The obtained results agree well with Raman spectra calculated by the Hartree–Fock method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluation of Scatter Contribution and Distance Error by Iterative Methods for Strength Determination of HDR {sup 192}Ir Brachytherapy Source

High-dose rate (HDR) {sup 192}Ir brachytherapy sources are commonly used for management of malignancies by brachytherapy applications. Measurement of source strength at the hospital is an important dosimetry requirement. The use of 0.6-cm{sup 3} cylindrical ionization chamber is one of the methods of measuring the source strength at the hospitals because this chamber is readily available for beam calibration and dosimetry. While using the cylindrical chamber for this purpose, it is also required to determine the positioning error of the ionization chamber, with respect to the source, commonly called a distance error (c). The contribution of scatter radiation (M{sub s}) from floor, walls, ceiling, and other materials available in the treatment room also need to be determined accurately so that appropriate correction can be applied while calculating the source strength from the meter reading. Iterative methods of Newton-Raphson and least-squares were used in this work to determine scatter contribution in the experimentally observed meter reading (pC/s) of a cylindrical ionization chamber. Monte Carlo simulation was also used to cross verify the results of the least-squares method. The experimentally observed, least-squares calculated and Monte Carlo estimated values of meter readings from HDR {sup 192}Ir brachytherapy source were in good agreement. Considering procedural simplicity, the method of least-squares is recommended for use at the hospitals to estimate values of f (constant of proportionality), c, and M{sub s} required to determine the strength of HDR {sup 192}Ir brachytherapy sources.

07 ISOTOPE AND RADIATION SOURCES↗

A Fixed-Point Iteration Method with Quadratic Convergence

The fixed-point iteration algorithm is turned into a quadratically convergent scheme for a system of nonlinear equations. Most of the usual methods for obtaining the roots of a system of nonlinear equations rely on expanding the equation system about the roots in a Taylor series, and neglecting the higher order terms. Rearrangement of the resulting truncated system then results in the usual Newton-Raphson and Halley type approximations. In this paper the introduction of unit root functions avoids the direct expansion of the nonlinear system about the root, and relies, instead, on approximations which enable the unit root functions to considerably widen the radius of convergence of the iteration method. Methods for obtaining higher order rates of convergence and larger radii of convergence are discussed.

Walker, Kevin P.↗

Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn–Sham equation

First-principles density functional theory (DFT) calculations for the electronic structure problem require a solution of the Kohn–Sham equation, which requires one to solve a nonlinear eigenvalue problem. Solving the eigenvalue problem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit computation of eigenvectors and results in a significant speedup over iterative diagonalization methods for the DFT self-consistent field (SCF) calculations. However, the original formulation of the CheFSI method utilizes a sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering at latter SCF steps. This diagonalization is expensive for large scale problems. We develop a new initial filtering step to avoid completely this diagonalization, thus making the CheFSI method free of sparse iterative diagonalizations at all SCF steps. Our new approach saves memory usage and can be two to three times faster than the original CheFSI method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Asymptotic iteration method for spheroidal harmonics of higher-dimensional Kerr-(A)dS black holes

In this work we calculate the angular eigenvalues of the (n+4)-dimensional simply rotating Kerr-(A)dS spheroidal harmonics using the asymptotic iteration method. We make some comparisons between this method and that of the continued fraction method and use the latter to check our results. We also present analytic expressions for the small rotation limit up to O(c{sup 3}) with the coefficient of each power up to O({alpha}{sup 2}), where c=a{omega} and {alpha}=a{sup 2}{lambda} (a is the angular velocity, {omega} the frequency, and {lambda} the cosmological constant)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

New-Sum: A Novel Online ABFT Scheme For General Iterative Methods

Emerging high-performance computing platforms, with large component counts and lower power margins, are anticipated to be more susceptible to soft errors in both logic circuits and memory subsystems. We present an online algorithm-based fault tolerance (ABFT) approach to efficiently detect and recover soft errors for general iterative methods. We design a novel checksum-based encoding scheme for matrix-vector multiplication that is resilient to both arithmetic and memory errors. Our design decouples the checksum updating process from the actual computation, and allows adaptive checksum overhead control. Building on this new encoding mechanism, we propose two online ABFT designs that can effectively recover from errors when combined with a checkpoint/rollback scheme.

Instantaneous Footprint↗

Optimal Iterative Method for Network Utility Maximization with Intertemporal Constraints

Network utility maximization (NUM) has been widely used to solve the optimal resource allocation problem in wireless network and power systems. The network planner aims to allocate generation and demand over producers and consumers such that social welfare is maximized while supply and demand are balanced, and network constraints such as branch capacity constraints are satisfied. However, when taking into account dynamics of agents, such as ramp rate constraints on power output for suppliers and impact of cumulative prior consumption on current demand for consumers, a single-period formulation is not sufficient. We propose an iterative method for the multi-period NUM with intertemporal constraints based on dual decomposition. It features a price iteration scheme that achieves optimal social welfare, and the algorithm is guaranteed to converge if proper concavity condition holds. We illustrate the iterative algorithm by power system examples. It is shown that similar to locational marginal price (LMP) in power systems, time-varying congestion prices arise when there exists binding branch constraints. Simulation results also demonstrate that there is increase in social welfare compared to a single-period formulation.

Ma, Ke↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

An iterative method for tomographic x-ray perfusion estimation in a decomposition model-based approach

Purpose: X-ray based tomographic blood perfusion imaging requires recovery of contrast time-attenuation-curves from dynamic projection data. When using slowly rotating imaging systems, this task is challenging due to nonsimultaneous projection acquisition. A dynamic reconstruction method is proposed that aims at compensating the lack of simultaneously acquired information by incorporating prior knowledge about the expected temporal contrast dynamics. Methods: A decomposition model using temporal basis functions to approximate time-attenuation-curves is integrated into an iterative tomographic reconstruction method. The computationally efficient implementation of the proposed approach makes use of standard forward-projections and backprojections, as well as scalar products in image space. The critical issue of projection noise propagation is tackled by the application of regularization which is realized by the early stopping of iteration cycles and by the proper selection of smooth temporal basis functions. The performance of the proposed dynamic reconstruction approach is evaluated in a simulation study concerning various aspects: Noise propagation and regularization, specification of the temporal model, and type of acquisition mode. Results: The evaluation based on dynamic phantom data indicates that tomographic recovery of contrast time-attenuation-curves in tissue can be achieved with an average range of accuracy of {approx}2% (with respect to dynamic peak attenuation) under ideal noise-free conditions. The relative estimation error for arterial time-attenuation-curves is in the range of 8%, which is due to faster contrast dynamics in the artery. In general, performance depends on the level of acquired information contained in the projection data, which is mainly influenced by the type of rotational acquisition mode; restrictions in angular range and speed can lead to limited accuracy. The analysis of propagated projection noise in a statistical bias-variance framework reveals relative noise levels in estimated time-attenuation-curves of 3%-4% in tissue regions and below 1% in vessels when using optimized settings for regularization. Here, the effect of noise suppression depends on the interrelation between the number of iteration cycles and the constraints imposed by the temporal decomposition model. Conclusions: For usage with slowly rotating imaging systems, the presented model-based iterative dynamic reconstruction method is capable of recovering contrast time-attenuation-curves related to tissue perfusion. The proposed regularization framework is an effective means to limit the impact of projection noise, which is a factor dominating estimation accuracy in tissue regions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗