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 1,729 records · Page 96

Aerodynamic Optimization of Rocket Control Surface Geometry Using Cartesian Methods and CAD Geometry

Aerodynamic design is an iterative process involving geometry manipulation and complex computational analysis subject to physical constraints and aerodynamic objectives. A design cycle consists of first establishing the performance of a baseline design, which is usually created with low-fidelity engineering tools, and then progressively optimizing the design to maximize its performance. Optimization techniques have evolved from relying exclusively on designer intuition and insight in traditional trial and error methods, to sophisticated local and global search methods. Recent attempts at automating the search through a large design space with formal optimization methods include both database driven and direct evaluation schemes. Databases are being used in conjunction with surrogate and neural network models as a basis on which to run optimization algorithms. Optimization algorithms are also being driven by the direct evaluation of objectives and constraints using high-fidelity simulations. Surrogate methods use data points obtained from simulations, and possibly gradients evaluated at the data points, to create mathematical approximations of a database. Neural network models work in a similar fashion, using a number of high-fidelity database calculations as training iterations to create a database model. Optimal designs are obtained by coupling an optimization algorithm to the database model. Evaluation of the current best design then gives either a new local optima and/or increases the fidelity of the approximation model for the next iteration. Surrogate methods have also been developed that iterate on the selection of data points to decrease the uncertainty of the approximation model prior to searching for an optimal design. The database approximation models for each of these cases, however, become computationally expensive with increase in dimensionality. Thus the method of using optimization algorithms to search a database model becomes problematic as the number of design variables is increased.

Nelson, Andrea↗

An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

97 MATHEMATICS AND COMPUTING↗

Iterative stability analysis of spatial domain decomposition based on block Jacobi algorithm for the diamond-difference scheme

Here, we study convergence of the integral transport matrix method (ITMM) based on a parallel block Jacobi (PBJ) iterative strategy for solving particle transport problems. The ITMM is a spatial domain decomposition method proposed for massively parallel computations. AFourier analysis of the PBJ-based iterations applied to SN diamond-difference equations in 1D slab and 2D Cartesian geometries is performed. It is carried out for infinite-medium problems with homogeneous material properties. To analyze the performance of the ITMM with the PBJ algorithm and evaluate its potential in scalability we consider a limiting case of one spatial cell per subdomain. The analysis shows that in such limit the spectral radius of the iteration method is one without regard to values of the scattering ratio and optical thickness of the spatial cells. This implies lack of convergence in infinite medium. Numerical results of finite-medium problems are presented. They demonstrate effects of finite size of spatial domain on the performance of the iteration algorithm as well as its asymptotic behavior when the extent of the spatial domain increases. Finally, these numerical experiments also show that for finite domains iterative convergence to a finite criterion is achievable in a multiple of the sum of number of cells in each dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A dissipation-based method for improving the accuracy of computational fluid dynamics simulations of high level non-Newtonian wastes

Here this paper investigates a new viscosity model for laminar, transitional, and turbulent pipe flow simulations of a non-Newtonian slurry using the Star-CCM+ software. Herschel-Bulkley (HB) rheology equation was used in its original and modified forms to model the fluid viscosity. The realizable k-ε model was used for modeling of turbulence. It was observed that simulations using the HB model predicted inaccurate profiles of U (mean velocity) and U + (mean velocity in wall units). Therefore, we developed alternative values of viscosity obtained directly from non-linearity of stress–strain variation (α) in each iteration. The developed method, “Alpha method”, applied changes in places where dissipation rate of turbulent kinetic energy occurred and was designed based on local or global dissipation rate values. Inverse values of α were used to test effects of more viscosity reduction for all flow regimes. In prediction of the mean velocities, significant improvements were obtained through global adjustment of viscosity in inverse form during simulation of the laminar and turbulent flow cases. For the transitional flow, obtaining improvements in prediction of U and U + from the same model version faced challenges. While the global adjustments in direct form were found significantly effective in improving the prediction of U, they failed to predict the U + accurately. For this purpose, Local viscosity adjustments were found significantly effective.

42 ENGINEERING↗

Density cumulant functional theory from a unitary transformation: N-representability, three-particle correlation effects, and application to O{sub 4}{sup +}

A new approach to density cumulant functional theory is developed that derives density cumulant N-representability conditions from an approximate Fock space unitary transformation. We present explicit equations for the third- and fourth-order two-particle cumulant N-representability, as well as the second-order contributions that depend on the connected three-particle density cumulant. These conditions are used to formulate the ODC-13 method and the non-iterative (λ{sub 3}) correction that employ an incomplete description of the fourth-order two-particle cumulant N-representability and the second-order three-particle correlation effects, respectively. We perform an analysis of the ODC-13 N-representability description for the dissociation of H{sub 2} and apply the ODC-13 method and the (λ{sub 3}) correction to diatomic molecules with multiple bond character and the symmetry-breaking tetraoxygen cation (O{sub 4}{sup +}). For the O{sub 4}{sup +} molecule, the vibrational frequencies of the ODC-13(λ{sub 3}) method do not exhibit spatial symmetry breaking and are in a good agreement with the recent infrared photodissociation experiment. We report the O{sub 4}{sup +} equilibrium structure, harmonic frequencies, and dissociation energy computed using ODC-13(λ{sub 3}) with a diffuse, core-correlated aug-cc-pCVTZ basis set.

74 ATOMIC AND MOLECULAR PHYSICS↗

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↗

Excitation energies with cost-reduced variant of the active-space EOMCCSDT method: the EOMCCSDt-(3) over-bar approach

In this paper we discuss the performance of the several simplified variants of equation-of-motion coupled cluster method (EOMCC) with iterative inclusion of singles, doubles and active-space triples (EOMCCSDt). In particular, we explore simplified EOMCCSDt approaches which enable one to generate the triply excited amplitudes in on-the-fly manner. The original EOMCCSDt formulation has already demonstrated a great success in encapsulating the most important excited-state correlation effects due to triples. In analogy to the original EOMCCSDT formulation, the proposed approach can by-pass the typical bottlenecks associated with the need for storing triply-excited amplitudes. In this paper, we illustrate the performance of several approximate EOMCCSDt methods, named EOMCCSDt-3 and EOMCCSdt-3x, on typical benchmark systems including C2, N2, and the ozone molecules. These new methods yield excitation energies close to the EOMCCSDt ones. The extrapolation of excitation energies for basis sets ranging from cc-pVDZ to cc-pV6Z for N2 and C2 shows very good convergence to the experimental results for states dominated by single excitations.

Coupled cluster↗

Exact exchange potential evaluated from occupied Kohn-Sham and Hartree-Fock solutions

The reported algorithm determines the exact exchange potential v{sub x} in an iterative way using energy shifts (ESs) and orbital shifts (OSs) obtained with finite-difference formulas from the solutions (occupied orbitals and their energies) of the Hartree-Fock-like equation and the Kohn-Sham-like equation, the former used for the initial approximation to v{sub x} and the latter for increments of ES and OS due to subsequent changes of v{sub x}. Thus, the need for solution of the differential equations for OSs, used by Kuemmel and Perdew [Phys. Rev. Lett. 90, 043004 (2003)], is bypassed. The iterated exchange potential, expressed in terms of ESs and OSs, is improved by modifying ESs at odd iteration steps and OSs at even steps. The modification formulas are related to the optimized-effective-potential equation (satisfied at convergence) written as the condition of vanishing density shift (DS). They are obtained, respectively, by enforcing its satisfaction through corrections to approximate OSs and by determining the optimal ESs that minimize the DS norm. The proposed method, successfully tested for several closed-(sub)shell atoms, from Be to Kr, within the density functional theory exchange-only approximation, proves highly efficient. The calculations using the pseudospectral method for representing orbitals give iterative sequences of approximate exchange potentials (starting with the Krieger-Li-Iafrate approximation) that rapidly approach the exact v{sub x} so that, for Ne, Ar, and Zn, the corresponding DS norm becomes less than 10{sup -6} after 13, 13, and 9 iteration steps for a given electron density. In self-consistent density calculations, orbital energies of 10{sup -4} hartree accuracy are obtained for these atoms after, respectively, 9, 12, and 12 density iteration steps, each involving just two steps of v{sub x} iteration, while the accuracy limit of 10{sup -6} to 10{sup -7} hartree is reached after 20 density iterations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Investigation and quantification of nonlinearity using surrogate data in a glow discharge plasma

Detection of nonlinearity has been carried out in periodic and aperiodic floating potential fluctuations of DC glow discharge plasma by generating surrogate data using iterative amplitude adjusted Fourier transform method. We introduce “delay vector variance” analysis (DVV) for the first time, which allows reliable detection of nonlinearity and provides some easy to interpret diagram conveying information about the nature of the experimental floating potential fluctuations (FPF). The method of false nearest neighbourhood is deployed on the FPF's to find a good embedding so as to be acquainted with the precise knowledge of m, which is desirable for carrying out DVV analysis. The emergence of nonlinearity with increase in discharge voltage has been ensured by taking into consideration the total energy present in different band of frequencies excited due to nonlinear processes. Rejection of null hypothesis has been verified by performing the rank test method that confirms the presence of nonlinearity quantitatively.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗

Distributed Link Removal Using Local Estimation of Network Topology

In this paper, we consider the problem of network structure manipulation in the absence of information on the global network topology. In particular, the problem of removing some of links is investigated in order to slow or stop the spread of disease in a network while preserving its connectivity. Existing methods solve this combinatorial problem in a centralized manner and they require the global information of network structure. In this paper, we propose a distributed design algorithm to compute a suboptimal solution to this problem efficiently by mimicking gradient based method, namely by iteratively removing one or multiple links at a time from the network. Specifically, using matrix perturbation analysis we formulate an optimization problem involving the eigenvector associated with the largest eigenvalue of the adjacency matrix and whose solution is equal to a suboptimal solution to the original problem. This strategy also enables us to overcome the combinatorial issue of the problem. Distributed algorithms to estimate the eigenvector and to verify network’s connectivity are then proposed which facilitate us to solve the new optimization problem. In addition, topological insights into the proposed algorithm and optimality of its solution are also discussed. Lastly, the proposed distributed design method is demonstrated and evaluated via several numerical examples.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the Use of Finite Difference Matrix-Vector Products in Newton-Krylov Solvers for Implicit Climate Dynamics with Spectral Elements

Efficient solution of global climate models requires effectively handling disparate length and time scales. Implicit solution approaches allow time integration of the physical system with a time step dictated by accuracy of the processes of interest rather than by stability governed by the fastest of the time scales present. Implicit approaches, however, require the solution of nonlinear systems within each time step. Usually, a Newton s method is applied for these systems. Each iteration of the Newton s method, in turn, requires the solution of a linear model of the nonlinear system. This model employs the Jacobian of the problem-defining nonlinear residual, but this Jacobian can be costly to form. If a Krylov linear solver is used for the solution of the linear system, the action of the Jacobian matrix on a given vector is required. In the case of spectral element methods, the Jacobian is not calculated but only implemented through matrix-vector products. The matrix-vector multiply can also be approximated by a finite-difference which may show a loss of accuracy in the overall nonlinear solver. In this paper, we review the advantages and disadvantages of finite-difference approximations of these matrix-vector products for climate dynamics within the spectral-element based shallow-water dynamical-core of the Community Atmosphere Model (CAM).

climate modeling↗

Tearing Stable Stationary ITER Baseline Operation in DIII-D

We present a tearing stable, stationary and reproducible operating solution for DIII-D plasmas characterized by the ITER Baseline Scenario normalized parameter set and shape. In these plasmas low differential rotation (Δf1,2) between the core and edge is identified as the single root cause of the onset of the primary limiting instability, the 2,1 Neoclassical Tearing Mode (NTM), while a group of other examined parameters have a much weaker impact on the stability. Explanation is offered by drift kinetic simulations, which show a six-fold reduction in the NTM onset threshold due to diminished stabilizing ion polarization currents when the seed island drift frequency ceases in the local plasma frame. Based on the experimental observation and the explanation provided by the theory, a new method is developed to sustain Δf1,2 by modifying the edge neoclassical potential through neutral gas fueling. This method enables stationary ITER baseline operation free of disruptive 2,1 tearing modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SU-E-T-14: A Comparative Study Between Forward and Inverse Planning in Gamma Knife Radiosurgery for Acoustic Neuroma Tumours

Purpose: To evaluate forward and inverse planning methods for acoustic neuroma cases treated in Gamma Knife Perfexion. Methods: Five patients with acoustic neuroma tumour abutting brainstem were planned twice in LGP TPS (Version 10.1) using TMR10 algorithm. First plan was entirely based on forward planning (FP) in which each shot was chosen manually. Second plan was generated using inverse planning (IP) for which planning parameters like coverage, selectivity, gradient index (GI) and beam-on time threshold were set. Number of shots in IP was automatically selected by objective function using iterative process. In both planning methods MRI MPRAGE sequence images were used for tumour localization and planning. A planning dose of 12Gy at 50% isodose level was chosen. Results and Discussion: Number of shots used in FP was greater than IP and beam-on time in FP was in average 1.4 times more than IP. One advantage of FP was that the brainstem volume subjected to 6Gy dose (25% isodose) was less in FP than IP. Our results showed use of more number of shots as in FP results in GI less than or equal to 2.55 which is close to its lower limit. Dose homogeneity index (DHI) analysis of FP and IP showed average values of 0.59 and 0.67 respectively. General trend in GK for planning in acoustic neuroma cases is to use small collimator shots to avoid dose to adjacent critical structures. More number of shots and prolonged treatment time causes inconvenience to the patients. Similarly overuse of automatic shot shaping as in IP results in increased scatter dose. A compromise is required in shot selection for these cases. Conclusion: IP method could be used in acoustic neuroma cases to decrease treatment time provided the source sector openings near brainstem are shielded or adjusted appropriately to reduce brainstem dose.

60 APPLIED LIFE SCIENCES↗

WE-EF-207-07: Dual Energy CT with One Full Scan and a Second Sparse-View Scan Using Structure Preserving Iterative Reconstruction (SPIR)

Purpose: Conventional dual energy CT (DECT) reconstructs CT and basis material images from two full-size projection datasets with different energy spectra. To relax the data requirement, we propose an iterative DECT reconstruction algorithm using one full scan and a second sparse-view scan by utilizing redundant structural information of the same object acquired at two different energies. Methods: We first reconstruct a full-scan CT image using filtered-backprojection (FBP) algorithm. The material similarities of each pixel with other pixels are calculated by an exponential function about pixel value differences. We assume that the material similarities of pixels remains in the second CT scan, although pixel values may vary. An iterative method is designed to reconstruct the second CT image from reduced projections. Under the data fidelity constraint, the algorithm minimizes the L2 norm of the difference between pixel value and its estimation, which is the average of other pixel values weighted by their similarities. The proposed algorithm, referred to as structure preserving iterative reconstruction (SPIR), is evaluated on physical phantoms. Results: On the Catphan600 phantom, SPIR-based DECT method with a second 10-view scan reduces the noise standard deviation of a full-scan FBP CT reconstruction by a factor of 4 with well-maintained spatial resolution, while iterative reconstruction using total-variation regularization (TVR) degrades the spatial resolution at the same noise level. The proposed method achieves less than 1% measurement difference on electron density map compared with the conventional two-full-scan DECT. On an anthropomorphic pediatric phantom, our method successfully reconstructs the complicated vertebra structures and decomposes bone and soft tissue. Conclusion: We develop an effective method to reduce the number of views and therefore data acquisition in DECT. We show that SPIR-based DECT using one full scan and a second 10-view scan can provide high-quality DECT images and accurate electron density maps as conventional two-full-scan DECT.

60 APPLIED LIFE SCIENCES↗

SCALE 6.2 Continuous-Energy TSUNAMI-3D Capabilities

The TSUNAMI (Tools for Sensitivity and UNcertainty Analysis Methodology Implementation) capabilities within the SCALE code system make use of sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different systems, quantifying computational biases, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved ease of use and fidelity and the desire to extend TSUNAMI analysis to advanced applications have motivated the development of a SCALE 6.2 module for calculating sensitivity coefficients using three-dimensional (3D) continuous-energy (CE) Monte Carlo methods: CE TSUNAMI-3D. This paper provides an overview of the theory, implementation, and capabilities of the CE TSUNAMI-3D sensitivity analysis methods. CE TSUNAMI contains two methods for calculating sensitivity coefficients in eigenvalue sensitivity applications: (1) the Iterated Fission Probability (IFP) method and (2) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method. This work also presents the GEneralized Adjoint Response in Monte Carlo method (GEAR-MC), a first-of-its-kind approach for calculating adjoint-weighted, generalized response sensitivity coefficients—such as flux responses or reaction rate ratios—in CE Monte Carlo applications. The accuracy and efficiency of the CE TSUNAMI-3D eigenvalue sensitivity methods are assessed from a user perspective in a companion publication, and the accuracy and features of the CE TSUNAMI-3D GEAR-MC methods are detailed in this paper.

42 ENGINEERING↗