Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative solvers”

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 487 records · Page 27

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

History and Status of the CDISC Aerodynamic Design Method

This paper will review the development and application of the CDISC aerodynamic design method that began in the early 1980s and continues in active use today. The method uses an iterative, knowledge-based approach that has been coupled with numerous flow solvers utilizing a variety of grid types and levels of flow physics. It has been applied to configurations varying in complexity from 2-D airfoils to full 3-D aircraft at flow conditions ranging from low-speed, high-lift to supersonic cruise. The knowledge-based approach provides a very rapid design process, with designs typically completed in approximately 1-2x the time required for an initial converged analysis of the baseline. The evolution of the method as it tracked the expansive growth of grid and flow solver technology, along with some major applications over 5 decades, are given, followed by a description of the philosophy and process used in design. Finally, an example of its use in a preliminary design environment is given.

CDISC↗

History and Status of the CDISC Aerodynamic Design Method

This paper will review the development and application of the CDISC aerodynamic design method that began in the early 1980s and continues in active use today. The method uses an iterative, knowledge-based approach that has been coupled with numerous flow solvers utilizing a variety of grid types and levels of flow physics. It has been applied to configurations varying in complexity from 2-D airfoils to full 3-D aircraft at flow conditions ranging from low-speed, high-lift to supersonic cruise. The knowledge-based approach provides a very rapid design process, with designs typically completed in approximately 1-2x the time required for an initial converged analysis of the baseline. The evolution of the method as it tracked the expansive growth of grid and flow solver technology, along with some major applications over 5 decades, are given, followed by a description of the philosophy and process used in design. Finally, an example of its use in a preliminary design environment is given.

CDISC↗

Efficient convolutional sparse coding

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

97 MATHEMATICS AND COMPUTING↗

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

97 MATHEMATICS AND COMPUTING↗

Efficient coupling of dynamic electro-optical and heat-transport models for high-power broad-area semiconductor lasers

In this work, we discuss the modeling of edge-emitting high-power broad-area semiconductor lasers. We demonstrate an efficient iterative coupling of a slow heat transport (HT) model defined on multiple vertical–lateral laser cross-sections with a fast dynamic electro-optical (EO) model determined on the longitudinal–lateral domain that is a projection of the device to the active region of the laser. Whereas the HT-solver calculates temperature and thermally-induced refractive index changes, the EO-solver exploits these distributions and provides time-averaged field intensities, quasi-Fermi potentials, and carrier densities. All these time-averaged distributions are used repetitively by the HT-solver for the generation of the heat sources entering the HT problem solved in the next iteration step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗

MO-DE-207A-07: Filtered Iterative Reconstruction (FIR) Via Proximal Forward-Backward Splitting: A Synergy of Analytical and Iterative Reconstruction Method for CT

Purpose: This work is to develop a general framework, namely filtered iterative reconstruction (FIR) method, to incorporate analytical reconstruction (AR) method into iterative reconstruction (IR) method, for enhanced CT image quality. Methods: FIR is formulated as a combination of filtered data fidelity and sparsity regularization, and then solved by proximal forward-backward splitting (PFBS) algorithm. As a result, the image reconstruction decouples data fidelity and image regularization with a two-step iterative scheme, during which an AR-projection step updates the filtered data fidelity term, while a denoising solver updates the sparsity regularization term. During the AR-projection step, the image is projected to the data domain to form the data residual, and then reconstructed by certain AR to a residual image which is in turn weighted together with previous image iterate to form next image iterate. Since the eigenvalues of AR-projection operator are close to the unity, PFBS based FIR has a fast convergence. Results: The proposed FIR method is validated in the setting of circular cone-beam CT with AR being FDK and total-variation sparsity regularization, and has improved image quality from both AR and IR. For example, AIR has improved visual assessment and quantitative measurement in terms of both contrast and resolution, and reduced axial and half-fan artifacts. Conclusion: FIR is proposed to incorporate AR into IR, with an efficient image reconstruction algorithm based on PFBS. The CBCT results suggest that FIR synergizes AR and IR with improved image quality and reduced axial and half-fan artifacts. The authors was partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000), and the Shanghai Pujiang Talent Program (#14PJ1404500).

60 APPLIED LIFE SCIENCES↗

A generalized Poisson solver for first-principles device simulations

Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SOLEDGE3X full vessel plasma boundary simulations of ITER non-active phase plasmas

The onset of detachment in the ITER machine is analyzed in this work through the help of 2D-axisymmetric boundary plasma simulations with the SOLEDGE3X-EIRENE code, which features a numerical domain for the plasma solver extending up to the first wall. The plasma boundary is computed in scenarios from the first non-active phase of ITER, in pure H and at 20 MW. This set of simulations is used in two aspects: first, to study the plasma detachment in the divertor, and second, the plasma conditions, fluxes, and beryllium erosion at the first wall. Here, the code results are also compared to those obtained with the well-established SOLPS-ITER code, which includes a plasma numerical domain only covering the main SOL. Results show an increase in the SOL width λ q with increasing density, and a detailed analysis is carried out, for the first time, on each of the different plasma-neutral interactions in the code’s physics model in EIRENE. The gross beryllium erosion rates of first wall panels are estimated from 2D simulations, with the aim of assessing their sensitivity to two parameters: the divertor density regime, and the presence of density shoulders in the far-SOL formed by enhanced perpendicular transport at this location. The erosion contributions from neutrals and ions are considered in each case, and the charge-exchange atoms fluxes and energy distributions are provided, highlighting the two atom populations (cold and charge-exchange).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

On a physics-based model equation for shock-position evolution in PMMA

A governing differential equation for shock position in PMMA was derived from momentum conservation and an experimentally determined decay law for shock pressure. A new multi-diagnostic characterization method for measuring detonator pressure and wave shape output in PMMA witness blocks provided temporally resolved, 1-D, shock-position data that was iteratively fit by solutions to the governing equation via a unique genetic algorithm solver. The goal was to calculate a solution that describes the temporal evolution of shock pressure in PMMA starting at the detonator interface. The empirical decay law was investigated using experimental data, where different regimes were considered for the decay coefficients. A successful solution provides extensive performance information that is directly relevant to the understanding and characterization of detonator function.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

MENT-Flow: maximum-entropy phase space tomography using normalizing flows

Generative models can be trained to reproduce low-dimensional projections of high-dimensional phase space distributions. Normalizing flows are generative models that parameterize invertible transformations, allowing exact probability density evaluation and sampling. Consequently, flows are unbiased entropy estimators and could be used to solve the high-dimensional maximum-entropy tomography (MENT) problem. In this work, we evaluate a flow-based MENT solver (MENT-Flow) against exact maximum-entropy solutions and Minerbo's iterative MENT algorithm in two dimensions.

Hoover, Austin↗

Review of Bison Usage in VERA

Bison is being used in VERA in a variety of ways; this milestone will document an independent review of the current usage of Bison and provide guidance that will improve the accuracy, performance, and consistency in the ways that Bison is used. This task will entail running a suite of small, single and multi-cycle problems with VERA-CS, followed by Bison, and Tiamat (inline) and evaluating the usage. It will also entail performing several detailed ramp to full power solutions to compare the one-way coupled solver with the fully-coupled Tiamat. This will include at least one iteration with the PHI team to incorporate some of the feedback and improve the usage. This work will also be completed in conjunction with an FMC task to evaluate the ability of Bison to model load-follow in a PWR

97 MATHEMATICS AND COMPUTING↗

Time-accurate Navier-Stokes calculations with multigrid acceleration

A numerical scheme to solve the unsteady Navier-Stokes equations is described. The scheme is implemented by modifying the multigrid-multiblock version of the steady Navier-Stokes equations solver, TLNS3D. The scheme is fully implicit in time and uses TLNS3D to iteratively invert the equations at each physical time step. The design objective of the scheme is unconditional stability (at least for first- and second-order discretizations of the physical time derivatives). With unconditional stability, the choice of the time step is based on the physical phenomena to be resolved rather than limited by numerical stability which is especially important for high Reynolds number viscous flows, where the spatial variation of grid cell size can be as much as six orders of magnitude. An analysis of the iterative procedure and the implementation of this procedure in TLNS3D are discussed. Numerical results are presented to show both the capabilities of the scheme and its speed up relative to the use of global minimum time stepping. Reductions in computational times of an order of magnitude are demonstrated.

Melson, N. Duane↗

Structural/aerodynamic Blade Analyzer (SAB) User's Guide, Version 1.0

The structural/aerodynamic blade (SAB) analyzer provides an automated tool for the static-deflection analysis of turbomachinery blades with aerodynamic and rotational loads. A structural code calculates a deflected blade shape using aerodynamic loads input. An aerodynamic solver computes aerodynamic loads using deflected blade shape input. The two programs are iterated automatically until deflections converge. Currently, SAB version 1.0 is interfaced with MSC/NASTRAN to perform the structural analysis and PROP3D to perform the aerodynamic analysis. This document serves as a guide for the operation of the SAB system with specific emphasis on its use at NASA Lewis Research Center (LeRC). This guide consists of six chapters: an introduction which gives a summary of SAB; SAB's methodology, component files, links, and interfaces; input/output file structure; setup and execution of the SAB files on the Cray computers; hints and tips to advise the user; and an example problem demonstrating the SAB process. In addition, four appendices are presented to define the different computer programs used within the SAB analyzer and describe the required input decks.

Morel, M. R.↗

Coupling CFD and Material Response for Analysis of Mars Entry

In computing the response of an ablating thermal protection system during atmospheric entry, the aerothermal environment and material response are generally computed separately with a blowing correction term in the material response model to account for the blowing of char and pyrolysis gases [1]. In this work, we apply a coupled approach in which pyrolysis blowing gases, computed in the PATO material response code [2], are used with a blowing boundary condition in the DPLR hypersonic CFD code [3]. This leads to an iterative method in which blowing products from PATO are input into DPLR to update surface heating estimates. The full iterative method, with the addition of radiative heating estimates using the NEQAIR radiation solver [4], is shown in Fig. 1. The method is demonstrated on a sphere case with the environment and material properties based on the Mars Science Laboratory entry. Future work includes utilizing this method in computing full 3D material response during the Mars 2020 entry.

Heat Transfer↗

Coupling CFD and Material Response for Analysis of Mars Entry

In computing the response of an ablating thermal protection system during atmospheric entry, the aerothermal environment and material response are generally computed separately with a blowing correction term in the material response model to account for the blowing of char and pyrolysis gases. In this work, we apply a coupled approach in which pyrolysis blowing gases, computed in the PATO material response code, are used with a blowing boundary condition in the DPLR hypersonic CFD code. This leads to an iterative method in which blowing products from PATO are input into DPLR to update surface heating estimates. The full iterative method, with the addition of radiative heating estimates using the NEQAIR radiation solver, is shown in Fig. 1. The method is demonstrated on a sphere case with the environment and material properties based on the Mars Science Laboratory entry. Future work includes utilizing this method in computing full 3D material response during the Mars 2020 entry.

Ablation↗