Search NASA⌕ Search

SEARCH · Search NASA

Results for “Power Iteration”

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 19 records

Distributed Data-Driven Power Iteration for Strongly Connected Networks

Here, this paper presents data-driven power iteration to distributively estimate the dominant eigenvalues of an unknown linear time-invariant system. The proposed strategy only requires a single trajectory data or measurements. Furthermore, in order to perform the distributed estimation, the communication network topology can be chosen to be any strongly connected directed graphs. The proposed data-driven power iteration is demonstrated using several numerical examples and is then applied to estimate the generalized algebraic connectivity of cooperative systems and to control the epidemic spreading.

Gusrialdi, Azwirman↗

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗

Is the Standard Monte Carlo Power Iteration Approach the Wrong Approach?

The power iteration method is the standard Monte Carlo approach for obtaining the eigenfunctions of a nuclear system, but the power method sometimes converges very slowly. Most discussions give a mathematical reason for the slow convergence of the Monte Carlo power method using the same concepts and terminology as when the power method is applied to a deterministic problem. This note first looks at why the convergence is slow from an intuitive Monte Carlo neutron perspective. Second, this note proposes building an eigenfunction intuitively in a cumulative (and noniterative) neutron by neutron manner that tends to better direct neutrons to where the neutrons need to be. Third, a very similar method for building the second eigenfunction is speculatively proposed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improved Criticality Convergence via a Modified Monte Carlo Power Iteration Method

Monte Carlo transport codes typically estimate the fundamental mode of a nuclear system via a power iteration method. If the eigenvalues of the system are denoted $k$ 1 , $k$ 2 , $k$ 3 ..." with $k$ 1 > $k$ 2 ≥ $k$ 3 ≥ $k$ 4 ··· > 0, and corresponding eigenfunctions Ψ $m$ , it is well known that the Ψ $m$ mode disappears after $n$ iterations as ($k$ $m$ /$k$ 1 ) $n$ . When the dominance ratio $k$ 2 /$k$ 1 is near unity, the convergence to Ψ 1 can be very slow, even if the convergence to $k$ 1 is fast. The convergence to Ψ 1 sometimes can be dramatically improved by estimating Ψ 1 and Ψ 2 . A Monte Carlo implementation of the modified power iteration method requires the neutrons representing Ψ 2 to have both negative and positive weights because Ψ 2 cannot be of one sign. Thus, Ψ 2 is a sum of negatively and positively weighted neutrons. Instead of summing using point detector methods, a new simple binning procedure accelerates convergence to Ψ 1 .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Diverse Power Iteration Embeddings and Its Applications

Abstract—Spectral Embedding is one of the most effective dimension reduction algorithms in data mining. However, its computation complexity has to be mitigated in order to apply it for real-world large scale data analysis. Many researches have been focusing on developing approximate spectral embeddings which are more efficient, but meanwhile far less effective. This paper proposes Diverse Power Iteration Embeddings (DPIE), which not only retains the similar efficiency of power iteration methods but also produces a series of diverse and more effective embedding vectors. We test this novel method by applying it to various data mining applications (e.g. clustering, anomaly detection and feature selection) and evaluating their performance improvements. The experimental results show our proposed DPIE is more effective than popular spectral approximation methods, and obtains the similar quality of classic spectral embedding derived from eigen-decompositions. Moreover it is extremely fast on big data applications. For example in terms of clustering result, DPIE achieves as good as 95% of classic spectral clustering on the complex datasets but 4000+ times faster in limited memory environment.

97 MATHEMATICS AND COMPUTING↗

Is the Standard Monte Carlo Power Iteration Approach the Wrong Approach? Part 2

The recent work 'Is the Standard Monte Carlo Power Iteration Approach the Wrong Approach?' speculated that the second eigenfunction could be built using essentially the same 'building brick' approach that obtained the first eigenfunction in LA-UR-12-21928. This note shows that the speculation was at least partially correct, but not complete.

97 MATHEMATICS AND COMPUTING↗

Energy Efficient Streaming Time Series Classification with Attentive Power Iteration

Efficiently processing time series data streams in real-time on resource-constrained devices offers significant advantages in terms of enhanced computational energy efficiency and reduced time-related risks. We introduce an innovative streaming time series classification network that utilizes attentive power iteration, enabling real-time processing on resource-constrained devices. Our model continuously updates a compact representation of the entire time series, enhancing classification accuracy while conserving energy and processing time. Notably, it excels in streaming scenarios without requiring complete time series access, enabling swift decisions. Experimental results show that our approach excels in classification accuracy and energy efficiency, with over 70% less consumption and threefold faster task completion than benchmarks. This work advances real-time responsiveness, energy conservation, and operational effectiveness for constrained devices, contributing to optimizing various applications.

97 MATHEMATICS AND COMPUTING↗

Efficient solution of the simplified P N equations

We show new solver strategies for the multigroup SPN equations for nuclear reactor analysis. By forming the complete matrix over space, moments, and energy a robust set of solution strategies may be applied. Moreover, power iteration, shifted power iteration, Rayleigh quotient iteration, Arnoldi's method, and a generalized Davidson method, each using algebraic and physics-based multigrid preconditioners, have been compared on C5G7 MOX test problem as well as an operational PWR model. These results show that the most ecient approach is the generalized Davidson method, that is 30-40 times faster than traditional power iteration and 6-10 times faster than Arnoldi's method.

97 MATHEMATICS AND COMPUTING↗

Impact of gas injection location and divertor surface material on ITER fusion power operation phase divertor performance assessed with SOLPS-ITER *

Abstract The ITER divertor design and performance assessment, primarily based on the SOLPS-4.3 burning plasma database (Pitts R. et al 2019 Nucl. Mater. Energy 20 100696), assumes the use of beryllium (Be) as the divertor surface material and the injection of gas from the main chamber top. However, the current ITER baseline favors gas injection from the more toroidally symmetric sub-divertor region. This paper evaluates the implications of these assumptions for divertor performance in the ITER fusion power operation phase. The impact of the divertor surface material and the gas injection location on the main ions mirrors the hydrogen only low power phase scenario shown in Park J.-S. et al (2020 Nucl. Fusion 61 016021). However, during burning plasma operation, extrinsic impurity seeding will be required. In the case of neon (Ne), studied here, impurity retention is influenced by both the divertor surface material and the fueling location. Neon leakage increases due to more energetic reflection from tungsten than beryllium, but equivalent divertor performance can be achieved by adjusting the neon seeding rate. While the impurity seeding location does not affect the distributions of impurity or radiation, the fueling location does. Top fueling provides local ionization sources mainly in the mid-SOL under detached conditions, enhancing divergences of the flux there (source-driven flow), bringing stagnation points close to the fueling location, and equilibrating flows towards both targets. In contrast, the global flow pattern (in the absence of fluid drifts) in the case of sub-divertor fueling is biased towards the inner target. Impurity flows, driven by force balance, largely mirror those of the main ion flow, including the stagnation point. The case with top fueling enhances Ne retention and corresponding radiation in the outer divertor, effectively reducing the total and peak target heat fluxes by 20%–40%, compared to the case with divertor fueling. Meanwhile, the case with outer target fueling also achieves similar reductions by enhancing plasma-neutral interactions. These results suggest the possibility that the selection of the fueling location and throughput can be used as an actuator to control impurity divertor retention and divertor radiation asymmetry.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Eigenvalue Solvers for Modeling Nuclear Reactors on Leadership Class Machines

In this paper, three complementary methods have been implemented in the code Denovo that accelerate neutral particle transport calculations with methods that use leadership-class computers fully and effectively: a multigroup block (MG) Krylov solver, a Rayleigh quotient iteration (RQI) eigenvalue solver, and a multigrid in energy (MGE) preconditioner. The MG Krylov solver converges more quickly than Gauss Seidel and enables energy decomposition such that Denovo can scale to hundreds of thousands of cores. RQI should converge in fewer iterations than power iteration (PI) for large and challenging problems. RQI creates shifted systems that would not be tractable without the MG Krylov solver. It also creates ill-conditioned matrices. The MGE preconditioner reduces iteration count significantly when used with RQI and takes advantage of the new energy decomposition such that it can scale efficiently. Each individual method has been described before, but this is the first time they have been demonstrated to work together effectively. The combination of solvers enables the RQI eigenvalue solver to work better than the other available solvers for large reactors problems on leadership-class machines. Using these methods together, RQI converged in fewer iterations and in less time than PI for a full pressurized water reactor core. These solvers also performed better than an Arnoldi eigenvalue solver for a reactor benchmark problem when energy decomposition is needed. The MG Krylov, MGE preconditioner, and RQI solver combination also scales well in energy. Finally, this solver set is a strong choice for very large and challenging problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Improved criticality convergence via a modified Monte Carlo iteration method

Nuclear criticality calculations with Monte Carlo codes are normally done using a power iteration method to obtain the dominant eigenfunction and eigenvalue. In the last few years it has been shown that the power iteration method can be modified to obtain the first two eigenfunctions. This modified power iteration method directly subtracts out the second eigenfunction and thus only powers out the third and higher eigenfunctions. The result is a convergence rate to the dominant eigenfunction being |k{sub 3}|/k{sub 1} instead of |k{sub 2}|/k{sub 1}. One difficulty is that the second eigenfunction contains particles of both positive and negative weights that must sum somehow to maintain the second eigenfunction. Summing negative and positive weights can be done using point detector mechanics, but this sometimes can be quite slow. We show that an approximate cancellation scheme is sufficient to accelerate the convergence to the dominant eigenfunction. A second difficulty is that for some problems the Monte Carlo implementation of the modified power method has some stability problems. We also show that a simple method deals with this in an effective, but ad hoc manner.

99 GENERAL AND MISCELLANEOUS↗

Calibration of ITER Instant Power Neutron Monitors: Recommended Scenario of Experiments at the Reactor

Instant power is a key parameter of the ITER. Its monitoring with an accuracy of a few percent is an urgent and challenging aspect of neutron diagnostics. In a series of works published in Problems of Atomic Science and Technology, Series: Thermonuclear Fusion under a common title, the step-by-step neutronics analysis was given to substantiate a calibration technique for the DT and DD modes of the ITER. A Gauss quadrature scheme, optimal for processing “expensive” experiments, is used for numerical integration of {sup 235}U and {sup 238}U detector responses to the point sources of 14-MeV neutrons. This approach allows controlling the integration accuracy in relation to the number of coordinate mesh points and thus minimizing the number of irradiations at the given uncertainty of the full monitor response. In the previous works, responses of the divertor and blanket monitors to the isotropic point sources of DT and DD neutrons in the plasma profile and to the models of real sources were calculated within the ITER model using the MCNP code. The neutronics analyses have allowed formulating the basic principles of calibration that are optimal for having the maximum accuracy at the minimum duration of in situ experiments at the reactor. In this work, scenarios of the preliminary and basic experimental ITER runs are suggested on the basis of those principles. It is proposed to calibrate the monitors only with DT neutrons and use correction factors to the DT mode calibration for the DD mode. It is reasonable to perform full calibration only with {sup 235}U chambers and calibrate {sup 238}U chambers by responses of the {sup 235}U chambers during reactor operation (cross-calibration). The divertor monitor can be calibrated using both direct measurement of responses at the Gauss positions of a point source and simplified techniques based on the concepts of equivalent ring sources and inverse response distributions, which will considerably reduce the amount of measurements. It is shown that the monitor based on the average responses of the horizontal and vertical neutron chambers remains spatially stable as the source moves and can be used in addition to the staff monitor at neutron fluxes in the detectors four orders of magnitude lower than on the first wall, where staff detectors are located. Owing to low background, detectors of neutron chambers do not need calibration in the reactor because it is actually determination of the absolute detector efficiency for 14-MeV neutrons, which is a routine out-of-reactor procedure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗