Search NASA⌕ Search

SEARCH · Search NASA

Results for “Neumann series”

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

Neumann Series in MGS-GMRES and Inner-Outer Iterations: Preprint

A low-synchronization MGS-GMRES Krylov solver employing a truncated Neumann series for the inverse compact WY MGS correction matrix T is presented. A corollary to the backward stability result of Paige et al. [1] establishes that T = I - Lk is sufficient for convergence of GMRES when kLkp F = O("p)_p F (B), where the strictly lower triangular matrix L is defined by the inner products of Krylov vectors V T 1:k-2 vk-1. The preconditioner is the classical Ruge-Stuben AMG algorithm with compatible relaxation and inner-outer Gauss-Seidel smoother. This smoother may also be expressed as a truncated Neumann series. Drop tolerances are applied to the lower triangular matrices arising in the smoother in order to reduce the number of non-zeros and accelerate the time to solution. The number of small matrix elements are found to increase from fine to coarse levels and thus the effciency gains are greater for large problems with many levels in the V -cycle. The solver is applied to the pressure continuity equation for the incompressible Navier-Stokes equations. Unlike the inner-outer iteration, the solver convergence rate with the standard Gauss-Seidel smoother deteriorates with dropping. The solver compute time is reduced by up to 50% without a change in the convergence rate.

Gauss-Seidel smoother↗

Neumann Series Based Voltage Sensitivity Analysis for Three Phase Distribution System

In this letter, a simplified voltage sensitivity analysis technique that can provide accurate estimates of voltage change across the network for a given change in bus power injections in a three-phase unbalanced distribution network is proposed. This technique is derived from the first-order approximation of the Neumann series, which allows maintaining the accuracy of the solution while the computational effort is reduced. Here, the proposed technique is tested on a 559-bus unbalanced distribution system with multiple distributed generation resources. The results show that the average error in the voltage estimates with the proposed method is not more than 0.3% with the execution time of similar order relative to the state-of-the-art sensitivity analysis methods.

42 ENGINEERING↗

On the Development of a Deterministic Three-Dimensional Radiation Transport Code

Since astronauts on future deep space missions will be exposed to dangerous radiations, there is a need to accurately model the transport of radiation through shielding materials and to estimate the received radiation dose. In response to this need a three dimensional deterministic code for space radiation transport is now under development. The new code GRNTRN is based on a Green's function solution of the Boltzmann transport equation that is constructed in the form of a Neumann series. Analytical approximations will be obtained for the first three terms of the Neumann series and the remainder will be estimated by a non-perturbative technique . This work discusses progress made to date and exhibits some computations based on the first two Neumann series terms.

Rockell, Candice↗

A Stochastic Calculus Approach to Boltzmann Transport

Traditional Monte Carlo methods for particle transport utilize source iteration to express the solution, the flux density, of the transport equation as a Neumann series. Our contribution is to show that the particle paths simulated within source iteration are associated with the adjoint flux density and the adjoint particle paths are associated with the flux density. Here, we make our assertion rigorous through the use of stochastic calculus by representing the particle path used in source iteration as a solution to a stochastic differential equation (SDE). The solution to the adjoint Boltzmann equation is then expressed in terms of the same SDE, and the solution to the Boltzmann equation is expressed in terms of the SDE associated with the adjoint particle process. An important consequence is that the particle paths used within source iteration simultaneously provide Monte Carlo samples of the flux density and adjoint flux density in the detector and source regions, respectively. The significant practical implication is that particle trajectories can be reused to obtain both forward and adjoint quantities of interest. To the best our knowledge, the reuse of entire particles paths has not appeared in the literature. Monte Carlo simulations are presented to support the reuse of the particle paths.

Boltzmann transport↗

Approximation of the optimal compensator for a large space structure

This paper considers the approximation of the optimal compensator for a Large Space Structure. The compensator is based upon a solution to the Linear Stochastic Quadratic Regulator problem. Colocation of sensors and actuators is assumed. A small gain analytical solution for the optimal compensator is obtained for a single input/single output system, i.e., certain terms in the compensator can be neglected for sufficiently small gain. The compensator is calculated in terms of the kernel to a Volterra integral operator using a Neumann series. The calculation of the compensator is based upon the C sub 0 semigroup for the infinite dimensional system. A finite dimensional approximation of the compensator is, therefore, obtained through analysis of the infinite dimensional compensator which is a compact operator.

Mackay, M. K.↗

Novel Solver Algorithms for Nearly Singular Linear Systems Arising in Combustion Modelling

Direct Numerical Simulations of realistic combustion devices are extremely challenging due to the wide separation of scales in the simulation, for example an internal combustion (IC) engine chamber, and the flame thickness of a high-pressure flame. The PeleLMeX solver uses adaptive mesh refinement (AMR) to evolve multi-species reacting flows in the low Mach number limit at the Exascale and relies on an embedded boundary (EB) approach to represent complex geometries. In that framework, the EB geometries often give rise to very small cut-cells along the boundary, which translate into extreme ill-conditioning of the pressure-projection, with eigenvalues that span 15-16 orders of magnitude. In this talk, we focus on the case of a typical IC piston bowl geometry for which we present on a novel approach towards solving these nearly singular linear systems with ILU-based, C-AMG smoothers on massively parallel architectures. In particular, we use scaling and equilibration algorithms to handle the non-normality of the upper triangular factors. This enables us to approximate the highly sequential triangular solve algorithm, embedded in the AMG smoothing-solve phase, with Jacobi iterations. This approximation can be written as a convergent Neumann series whose terms are composed of highly parallel sparse matrix vector multiplications. The result is an algorithm that substantially decreases setup and solve time, compared to state-of-the-art, for these challenging linear systems.

combustion modelling↗

Structural and Spectroscopic Trends in Alkali Tris(Acetato)Actinyl(VI) Complexes

A series of alkali tris(acetato)actinyl(VI) compounds M[AnO 2 (CH 3 COO) 3 ] (M=Na, K, Rb, Cs and An=U, Np, Pu) is reported, applying a combination of singlecrystal X-ray diffraction, solid-state Raman spectroscopy, and U(VI) luminescence spectroscopy for their structural and spectroscopic characterization. The results show that complexes formed from the same alkali metal but different actinyl ions are mostly isostructural. The symmetric actinyl stretch (ν 1 (An=O yl )) in these isostructural complexes undergoes a redshift within the actinide series despite the shortening of the actinyl bond due to the actinide contraction. Complexes formed from the same actinyl but co-crystallized with different alkali metals show a progression toward lower space group symmetry. While the actinyl bond length remains unmodulated within the alkali series, a small redshift of ν 1 (An=O yl ) is observed, indicating minor changes in the vibrational properties of the actinyl moiety caused by the structural progression towards lower symmetry. This subtle change is also evidenced by a redshift of the U(VI) luminescence spectra within the M[UO 2 (CH 3 COO) 3 ] series.

Raman↗

Implementation of Perturbation Theory and Sensitivity Capabilities in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor Multiphysics analysis application, jointly developed by Argonne and Idaho National Laboratories under the DOE-NE NEAMS program. This fiscal year, capabilities for reactivity and sensitivity evaluation using perturbation methods were implemented and verified. The First Order Perturbation Method (FOPT) was employed to compute reactivity worth resulting from small perturbations in input parameters, while the Generalized Perturbation Theory (GPT) was used to evaluate sensitivities of a range of response types, including reaction rate ratio, k-eigenvalue, neutron generation time, and effective delayed neutron fraction. These perturbation methods enable users to quantify how response quantities change due to a perturbation in a input parameter without explicitly performing an additional transport simulation for each perturbed state. In particular, the GPT formulation accounts for indirect effects arising from flux changes by solving generalized inhomogeneous equations, for which a Neumann series-based iterative solution method was developed and implemented in Griffin. The implemented reactivity and sensitivity evaluation capabilities were verified using two test problems: an infinite homogeneous system and a two-dimensional hexagonal core. The results showed excellent agreement with reference solutions obtained by a direct method based on finite difference approximation as well as GPT-based results from the PERSENT code, confirming the accuracy of both reactivity and sensitivity evaluations. Additionally, preliminary uncertainty quantification (UQ) results were obtained by combining the sensitivity values computed using GPT and external covariance data, demonstrating that the implemented sensitivity results can be reliably used for uncertainty calculations. To further demonstrate the generality and practical strength of the implementation, the sensitivity evaluation capability was successfully applied to the Empire microreactor with a geometrically complex design that poses significant modeling challenges. The results confirm that Griffin enables sensitivity evaluations even for irregular and highly heterogeneous reactor configurations, thereby establishing a foundation for UQ applications in advanced reactor designs and analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Approximate recoverability and relative entropy II: 2-positive channels of general von Neumann algebras

Abstract We generalize our results in paper I in this series to quantum channels between general von Neumann algebras, proving the approximate recoverability of states which undergo a small change in relative entropy through the channel. To this end, we derive a strengthened form of the quantum data processing inequality for the change in relative entropy of two states under a channel between two von Neumann algebras. Compared to the usual inequality, there is an explicit lower bound involving the fidelity between the original state and a recovery channel.

97 MATHEMATICS AND COMPUTING↗

The expressivity of classical and quantum neural networks on entanglement entropy

Abstract Analytically continuing the von Neumann entropy from Rényi entropies is a challenging task in quantum field theory. While then-th Rényi entropy can be computed using the replica method in the path integral representation of quantum field theory, the analytic continuation can only be achieved for some simple systems on a case-by-case basis. In this work, we propose a general framework to tackle this problem using classical and quantum neural networks with supervised learning. We begin by studying several examples with known von Neumann entropy, where the input data is generated by representing$${\text {Tr}}\rho _A^n$$ Tr ρ A n with a generating function. We adopt KerasTuner to determine the optimal network architecture and hyperparameters with limited data. In addition, we frame a similar problem in terms of quantum machine learning models, where the expressivity of the quantum models for the entanglement entropy as a partial Fourier series is established. Our proposed methods can accurately predict the von Neumann and Rényi entropies numerically, highlighting the potential of deep learning techniques for solving problems in quantum information theory.

Physics↗

On the far-field stream function condition for two-dimensional incompressible flows

The present demonstration of the usefulness of the integral series expansion of the stream function as a far-field computational boundary condition shows the method to require only a 10-percent/time-step increase in computational effort over alternative boundary conditions, in the case of implementation of unsteady problems using a direct elliptic solver. So long as the vorticity was encompassed within the computational domain, the method proved sufficiently accurate to yield virtually identical results for two widely different domains. While the integral-series condition yielded the best results for periodic flow, the Neumann condition gave comparable accuracy with less computation time for the steady-flow case despite its inability to treat periodic flow with vortex shedding.

Sa, Jong-Youb↗

A probabilistic model of a porous heat exchanger

This paper presents a probabilistic one-dimensional finite element model for heat transfer processes in porous heat exchangers. The Galerkin approach is used to develop the finite element matrices. Some of the submatrices are asymmetric due to the presence of the flow term. The Neumann expansion is used to write the temperature distribution as a series of random variables, and the expectation operator is applied to obtain the mean and deviation statistics. To demonstrate the feasibility of the formulation, a one-dimensional model of heat transfer phenomenon in superfluid flow through a porous media is considered. Results of this formulation agree well with the Monte-Carlo simulations and the analytical solutions. Although the numerical experiments are confined to parametric random variables, a formulation is presented to account for the random spatial variations.

Agrawal, O. P.↗

A coupling approach for linear elasticity problems with spatially non-coincident discretized interfaces

Here we present a new method for coupled linear elasticity problems whose finite element discretization may lead to spatially non-coincident discretized interfaces. Our approach combines the classical Dirichlet–Neumann coupling formulation with a new set of discretized interface conditions obtained through Taylor series expansions. We show that these conditions ensure linear consistency of the coupled finite element solution. We then formulate an iterative solution method for the coupled discrete system and apply the new coupling approach to two representative settings for which we also provide several numerical illustrations. The first setting is a mesh-tying problem in which both coupled structures have the same Lamé parameters whereas the second setting is an interface problem for which the Lamé parameters in the two coupled structures are different.

97 MATHEMATICS AND COMPUTING↗

A new approach to the solution of large, full matrix equations: A two-dimensional potential flow feasibility study

An approach to the solution of matrix problems resulting from integral equations of mathematical physics is presented. Based on the inherent smoothness in such equations, the problem is reformulated using a set of orthogonal basis vectors, leading to an equivalent coefficient problem which can be of lower order without significantly impairing the accuracy of the solution. This approach was evaluated using a two-dimensional Neumann problem describing the inviscid, incompressible flow over an airfoil. Two different kinds of mode functions were investigated, namely eigenfunction series and Fourier series. The method using Fourier series was found preferable. It uses all of the coefficients from a Fast Fourier Transform algorithm in an approximate method which exploits the known structure of the transformed coefficient matrix and very promising results for the flow over a realistic airfoil are obtained. On the basis of the results presented here, an order of magnitude reduction in this computer time can be expected for such problems as compared with the time for a direct matrix solution.

James, R. M.↗

Rapid Airplane Parametric Input Design(RAPID)

An efficient methodology is presented for defining a class of airplane configurations. Inclusive in this definition are surface grids, volume grids, and grid sensitivity. A small set of design parameters and grid control parameters govern the process. The general airplane configuration has wing, fuselage, vertical tail, horizontal tail, and canard components. The wing, tail, and canard components are manifested by solving a fourth-order partial differential equation subject to Dirichlet and Neumann boundary conditions. The design variables are incorporated into the boundary conditions, and the solution is expressed as a Fourier series. The fuselage has circular cross section, and the radius is an algebraic function of four design parameters and an independent computational variable. Volume grids are obtained through an application of the Control Point Form method. Grid sensitivity is obtained by applying the automatic differentiation precompiler ADIFOR to software for the grid generation. The computed surface grids, volume grids, and sensitivity derivatives are suitable for a wide range of Computational Fluid Dynamics simulation and configuration optimizations.

Smith, Robert E.↗

Higher order accurate partial implicitization: An unconditionally stable fourth-order-accurate explicit numerical technique

The previously obtained second-order-accurate partial implicitization numerical technique used in the solution of fluid dynamic problems was modified with little complication to achieve fourth-order accuracy. The Von Neumann stability analysis demonstrated the unconditional linear stability of the technique. The order of the truncation error was deduced from the Taylor series expansions of the linearized difference equations and was verified by numerical solutions to Burger's equation. For comparison, results were also obtained for Burger's equation using a second-order-accurate partial-implicitization scheme, as well as the fourth-order scheme of Kreiss.

Graves, R. A., Jr.↗

The modified equation approach to the stability and accuracy analysis of finite-difference methods

The stability and accuracy of finite-difference approximations to simple linear partial differential equations are analyzed by studying the modified partial differential equation. Aside from round-off error, the modified equation represents the actual partial differential equation solved when a numerical solution is computed using a finite-difference equation. The modified equation is derived by first expanding each term of a difference scheme in a Taylor series and then eliminating time derivatives higher than first order by certain algebraic manipulations. The connection between 'heuristic' stability theory based on the modified equation approach and the von Neumann (Fourier) method is established. In addition to the determination of necessary and sufficient conditions for computational stability, a truncated version of the modified equation can be used to gain insight into the nature of both dissipative and dispersive errors.

Warming, R. F.↗