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 433 records · Page 24

Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains

Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.

Eleshaky, Mohamed E.↗

Equilibrium core modeling of a pebble bed reactor similar to the Xe-100 with SCALE

As the nuclear industry moves towards licensing and constructing advanced reactors, new attention has been focused on the advanced reactor designs that have past operational experience, such as pebble-bed high-temperature gas-cooled reactors (PB-HTGRs). Pebble-bed reactor designs have many advantages, such as their higher operating temperatures and online refueling capabilities. However, high-fidelity computational modeling of pebble-bed reactor designs, from reactor startup to operation at equilibrium, is more challenging compared to conventionally fueled reactors due to the continuous movement of the fuel pebbles through the reactor during operation. In previous work at Oak Ridge National Laboratory (ORNL), the SCALE Leap-In method for Cores at Equilibrium (SLICE) was developed around tools within the SCALE code system. This iterative method can effectively generate pebble-bed reactor zone-wise fuel inventories at equilibrium core operation within a reasonable computational time. The objective of this work was to further verify the ORNL SLICE method and to investigate the impact of considering temperature profiles during the application of the method. The SLICE method was applied to a modular high-temperature gas-cooled reactor design based upon publicly available design specifications of the Xe-100 pebble-bed reactor. Upon comparing the results from the SLICE method to published literature, the differences in the eigenvalue k effective were on the order of several hundred pcm (percent millirho). To investigate one possible cause of these differences, a study looking at the sensitivity of the full-core equilibrium k effective and discharge nuclide inventory to temperature was performed by developing equilibrium cores of two additional temperature profiles. From this temperature study, differences on the order of hundreds of pcm for the full-core equilibrium k effective , and up to 15% difference for the discharge inventories were found. In conclusion, these results indicated the strong dependence on temperature that needs to be considered for future work in equilibrium modeling of PB-HTGRs.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Implementation of natural frequency analysis and optimality criterion design

A description is presented of an effective optimality criterion computer design approach for member size selection to improve frequency characteristics for moderately large structure models. It is shown that the implementation of the simultaneous iteration method within a natural frequency structural design optimization provides a method which is more efficient in isolating the lowest natural frequency modes than the frequently applied Stodola method. Additional computational advantages are derived by using previously converged eigenvectors at the start of the iterations during the second and the following design cycles. Vectors with random components can be used at the first design cycle, which, in relation to the entire computer time for the design program, results in only a moderate computational penalty.

Levy, R.↗

USM3D-ME Revised SA-neg Implementation and Assessment for Seventh Drag Prediction Workshop Solutions

Simulations performed by an unstructured-grid, cell-centered, finite-volume, mixed-element flow solver USM3D-MEwere presented at the Seventh Drag Prediction Workshop (DPW-7). Reynolds-averaged Navier-Stokes (RANS) solutions for the NASA high-speed common research model wing-body configuration were computed using a new implementation of the negative variant of the Spalart-Allmaras turbulence model (SA-neg) with hierarchical adaptive nonlinear iteration method (HANIM).ThisUSM3D-ME enhancement improved efficiency and robustness of RANS solutions resulting in fast iterative convergence to machine zero residuals on mixed-element unstructured grids provided by the DPW-7 organizing committee. This paper presents theoretical foundations for the new implementation of the SA-neg model and analyzesUSM3D-ME solutions for flow conditions corresponding to the required DPW-7 cases.

Boris Diskin↗

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

An iterative finite difference method for solving the quantum hydrodynamic equations of motion

The quantum hydrodynamic equations of motion associated with the de Broglie-Bohm description of quantum mechanics describe a time evolving probability density whose 'fluid' elements evolve as a correlated ensemble of particle trajectories. These equations are intuitively appealing due to their similarities with classical fluid dynamics and the appearance of a generalized Newton's equation of motion in which the total force contains both a classical and quantum contribution. However, the direct numerical solution of the quantum hydrodynamic equations (QHE) is fraught with challenges: the probability 'fluid' is highly-compressible, it has zero viscosity, the quantum potential ('pressure') is non-linear, and if that weren't enough the quantum potential can also become singular during the course of the calculations. Collectively these properties are responsible for the notorious numerical instabilities associated with a direct numerical solution of the QHE. The most successful and stable numerical approach that has been used to date is based on the Moving Least Squares (MLS) algorithm. The improved stability of this approach is due to the repeated local least squares fitting which effectively filters or reduces the numerical noise which tends to accumulate with time. However, this method is also subject to instabilities if it is pushed too hard. In addition, the stability of the MLS approach often comes at the expense of reduced resolution or fidelity of the calculation (i.e., the MLS filtering eliminates the higher-frequency components of the solution which may be of interest). Recently, a promising new solution method has been developed which is based on an iterative solution of the QHE using finite differences. This method (referred to as the Iterative Finite Difference Method or IFDM) is straightforward to implement, computationally efficient, stable, and its accuracy and convergence properties are well understood. A brief overview of the IFDM will be presented followed by a couple of benchmark applications on one- and two-dimensional Eckart barrier scattering problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fission Matrix Capability for MCNP Monte Carlo

In a Monte Carlo criticality calculation, before the tallying of quantities can begin, a converged fission source (the fundamental eigenvector of the fission kernel) is required. Tallies of interest may include powers, absorption rates, leakage rates, or the multiplication factor (the fundamental eigenvalue of the fission kernel, k eff ). Just as in the power iteration method of linear algebra, if the dominance ratio (the ratio of the first and zeroth eigenvalues) is high, many iterations of neutron history simulations are required to isolate the fundamental mode of the problem. Optically large systems have large dominance ratios, and systems containing poor neutron communication between regions are also slow to converge. The fission matrix method, implemented into MCNP, addresses these problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Time-fractional Gardner equation for ion-acoustic waves in negative-ion-beam plasma with negative ions and nonthermal nonextensive electrons

Nonlinear propagation of ion-acoustic waves is investigated in a one-dimensional, unmagnetized plasma consisting of positive ions, negative ions, and nonthermal electrons featuring Tsallis distribution that is penetrated by a negative-ion-beam. The classical Gardner equation is derived to describe nonlinear behavior of ion-acoustic waves in the considered plasma system via reductive perturbation technique. We convert the classical Gardner equation into the time-fractional Gardner equation by Agrawal's method, where the time-fractional term is under the sense of Riesz fractional derivative. Employing variational iteration method, we construct solitary wave solutions of the time-fractional Gardner equation with initial condition which depends on the nonlinear and dispersion coefficients. The effect of the plasma parameters on the compressive and rarefactive ion-acoustic solitary waves is also discussed in detail.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗

CORSS: Cylinder Optimization of Rings, Skin, and Stringers

Launch vehicle designs typically make extensive use of cylindrical skin stringer construction. Structural analysis methods are well developed for preliminary design of this type of construction. This report describes an automated, iterative method to obtain a minimum weight preliminary design. Structural optimization has been researched extensively, and various programs have been written for this purpose. Their complexity and ease of use depends on their generality, the failure modes considered, the methodology used, and the rigor of the analysis performed. This computer program employs closed-form solutions from a variety of well-known structural analysis references and joins them with a commercially available numerical optimizer called the 'Design Optimization Tool' (DOT). Any ring and stringer stiffened shell structure of isotropic materials that has beam type loading can be analyzed. Plasticity effects are not included. It performs a more limited analysis than programs such as PANDA, but it provides an easy and useful preliminary design tool for a large class of structures. This report briefly describes the optimization theory, outlines the development and use of the program, and describes the analysis techniques that are used. Examples of program input and output, as well as the listing of the analysis routines, are included.

Finckenor, J.↗

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

The straightforward automatic-differentiation and the hand-differentiated incremental iterative methods are interwoven to produce a hybrid scheme that captures some of the strengths of each strategy. With this compromise, discrete aerodynamic sensitivity derivatives are calculated with the efficient incremental iterative solution algorithm of the original flow code. Moreover, the principal advantage of automatic differentiation is retained (i.e., all complicated source code for the derivative calculations is constructed quickly with accuracy). The basic equations for second-order sensitivity derivatives are presented; four methods are compared. Each scheme requires that large systems are solved first for the first-order derivatives and, in all but one method, for the first-order adjoint variables. Of these latter three schemes, two require no solutions of large systems thereafter. For the other two for which additional systems are solved, the equations and solution procedures are analogous to those for the first order derivatives. From a practical viewpoint, implementation of the second-order methods is feasible only with software tools such as automatic differentiation, because of the extreme complexity and large number of terms. First- and second-order sensitivities are calculated accurately for two airfoil problems, including a turbulent flow example; both geometric-shape and flow-condition design variables are considered. Several methods are tested; results are compared on the basis of accuracy, computational time, and computer memory. For first-order derivatives, the hybrid incremental iterative scheme obtained with automatic differentiation is competitive with the best hand-differentiated method; for six independent variables, it is at least two to four times faster than central finite differences and requires only 60 percent more memory than the original code; the performance is expected to improve further in the future.

Taylor, Arthur C., III↗

A Heuristic Fast Method to Solve the Nonlinear Schroedinger Equation in Fiber Bragg Gratings with Arbitrary Shape Input Pulse

Using a combination of Runge-Kutta and Jacobi iterative method, we could solve the nonlinear Schroedinger equation describing the pulse propagation in FBGs. By decomposing the electric field to forward and backward components in fiber Bragg grating and utilizing the Fourier series analysis technique, the boundary value problem of a set of coupled equations governing the pulse propagation in FBG changes to an initial condition coupled equations which can be solved by simple Runge-Kutta method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite element computation of incompressible flows

Among the solution techniques presented for FEM computation of incompressible flows are stabilized formulations designed to prevent the numerical oscillations that may be generated by (1) the presence of dominant advection terms in the governing equations, or (2) the failure to use an acceptable combination of interpolation functions to represent velocity and pressure fields. It is shown that the space-time formulation, in conjunction with the Galerkin-least squares methods, can be used to compute steady incompressible flows involving moving boundaries and interfaces; it is recommended that iteration methods be used to reduce the associated computational costs.

Tezduyar, T. E.↗

Advanced Newton methods for geodynamical models of Stokes flow with viscoplastic rheologies

Strain localization and resulting plasticity and failure play an important role in the evolution of the lithosphere. These phenomena are commonly modeled by Stokes flows with viscoplastic rheologies. The nonlinearities of these rheologies make the numerical solution of the resulting systems challenging, and iterative methods often converge slowly or not at all. Yet accurate solutions are critical for representing the physics. Moreover, for some rheology laws, aspects of solvability are still unknown. We study a basic but representative viscoplastic rheology law. The law involves a yield stress that is independent of the dynamic pressure, referred to as von Mises yield criterion. Two commonly used variants, perfect/ideal and composite viscoplasticity, are compared. We derive both variants from energy minimization principles, and we use this perspective to argue when solutions are unique. We propose a new stress-velocity Newton solution algorithm that treats the stress as an independent variable during the Newton linearization but requires solution only of Stokes systems that are of the usual velocity-pressure form. To study different solution algorithms, we implement 2-D and 3-D finite element discretizations, and we generate Stokes problems with up to 7 orders of magnitude viscosity contrasts, in which compression or tension results in significant nonlinear localization effects. Comparing the performance of the proposed Newton method with the standard Newton method and the Picard fixed-point method, we observe a significant reduction in the number of iterations and improved stability with respect to problem nonlinearity, mesh refinement, and the polynomial order of the discretization.

Rudi, Johann↗

Fourier domain closed-form formulas for estimation of kinetic parameters in reversible multi-compartment models

Background: Compared with static imaging, dynamic emission computed tomographic imaging with compartment modeling can quantify in vivo physiologic processes, providing useful information about molecular disease processes. Dynamic imaging involves estimation of kinetic rate parameters. For multi-compartment models, kinetic parameter estimation can be computationally demanding and problematic with local minima. Methods: This paper offers a new perspective to the compartment model fitting problem where Fourier linear system theory is applied to derive closed-form formulas for estimating kinetic parameters for the two-compartment model. The proposed Fourier domain estimation method provides a unique solution, and offers very different noise response as compared to traditional non-linear chi-squared minimization techniques. Results: The unique feature of the proposed Fourier domain method is that only low frequency components are used for kinetic parameter estimation, where the DC (i.e., the zero frequency) component in the data is treated as the most important information, and high frequency components that tend to be corrupted by statistical noise are discarded. Computer simulations show that the proposed method is robust without having to specify the initial condition. The resultant solution can be fine tuned using the traditional iterative method. Conclusions: The proposed Fourier-domain estimation method has closed-form formulas. The proposed Fourier-domain curve-fitting method does not require an initial condition, it minimizes a quadratic objective function and a closed-form solution can be obtained. The noise is easier to control, simply by discarding the high frequency components, and emphasizing the DC component.

Nuclear medicine imaging↗

Examples Of Synthesis Of Dual-Shaped Reflectors

Report presents examples to demonstrate validity and utility of method of synthesis of offset dual-shape reflectors. Method of synthesis described by the authors in previous journal article. Current report reviews derivation of partial differential equations and iterative method of numerical solution. Discusses significance of starting point of numerical integration on each reflector surface; this point could be at center, on outer rim, or at interior point. Emphasizes that one of notable attributes of partial differential equations is speed with which they can be solved.

Galindo, Victor↗