Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative linear solution”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗
NASA NTRS1989

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland↗
NASA NTRS1991

A geometric nonlinear degenerated shell element using a mixed formulation with independently assumed strain fields

A mixed formulation is chosen to overcome deficiencies of the standard displacement-based shell model. Element development is traced from the incremental variational principle on through to the final set of equilibrium equations. Particular attention is paid to developing specific guidelines for selecting the optimal set of strain parameters. A discussion of constraint index concepts and their predictive capability related to locking is included. Performance characteristics of the elements are assessed in a wide variety of linear and nonlinear plate/shell problems. Despite limiting the study to geometric nonlinear analysis, a substantial amount of additional insight concerning the finite element modeling of thin plate/shell structures is provided. For example, in nonlinear analysis, given the same mesh and load step size, mixed elements converge in fewer iterations than equivalent displacement-based models. It is also demonstrated that, in mixed formulations, lower order elements are preferred. Additionally, meshes used to obtain accurate linear solutions do not necessarily converge to the correct nonlinear solution. Finally, a new form of locking was identified associated with employing elements designed for biaxial bending in uniaxial bending applications.

Graf, Wiley E.↗
DOE OSTI2015

Experimental tests of linear and nonlinear three-dimensional equilibrium models in DIII-D

DIII-D experiments using new detailed magnetic diagnostics show that linear, ideal magnetohydrodynamics (MHD) theory quantitatively describes the magnetic structure (as measured externally) of three-dimensional (3D) equilibria resulting from applied fields with toroidal mode number n = 1, while a nonlinear solution to ideal MHD force balance, using the VMEC code, requires the inclusion of n ≥ 1 to achieve similar agreement. These tests are carried out near ITER baseline parameters, providing a validated basis on which to exploit 3D fields for plasma control development. Scans of the applied poloidal spectrum and edge safety factor confirm that low-pressure, n = 1 non-axisymmetric tokamak equilibria are determined by a single, dominant, stable eigenmode. However, at higher beta, near the ideal kink mode stability limit in the absence of a conducting wall, the qualitative features of the 3D structure are observed to vary in a way that is not captured by ideal MHD.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations

A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem.

Cooke, C. H.↗
NASA NTRS1967

Launch booster gust alleviation.

Controller design for booster gust alleviation, considering stochastic minimization problem solved by iteration yielding linear finite time controller with time-varying gains

ROCKET BOOSTER↗
DOE OSTI2023

Polarization consistent dielectric screening in polarizable continuum model calculations of solvation energies

A polarization consistent framework, where dielectric screening is affected consistently in polarizable continuum model (PCM) calculations, is employed for the study of solvation energies. The computational framework combines a screened range-separated-hybrid functional (SRSH) with PCM calculations, SRSH-PCM, where dielectric screening is imposed in both PCM self-consistent reaction field (SCRF) iterations and the electronic structure Hamiltonian. We begin by demonstrating the impact of modifying the Hamiltonian to include such dielectric screening in SCRF iterations by considering the solutions of electrostatically embedded Hartree–Fock (HF) exact exchange equations. Long-range screened HF-PCM calculations are shown to capture properly the linear dependence of gap energy of frontier orbitals on the inverse of the dielectric constant, whereas unscreened HF-PCM orbital energies are fallaciously semi-constant with respect to the dielectric constant and, therefore, inconsistent with the ionization energy gaps. Similar trends affect density functional theory (DFT) calculations that aim to achieve predictive quality. Importantly, the dielectric screened calculations are shown to significantly affect DFT- and HF PCM-based solvation energies, where screened solvation energies are smaller compared to the unscreened values. Importantly, SRSH-PCM, therefore, appears to reduce the tendency of DFT-PCM to overestimate solvation energies, where we find the effect to increase with the dielectric constant and the polarity of the molecular solute, trends that enhance the quality of DFT-PCM calculations of solvation energy. Understanding the relationship of dielectric screening in the Hamiltonian and DFT-PCM calculations can ultimately benefit on-going efforts for the design of predictive and parameter free descriptions of solvation energies.

Chemistry↗
NASA NTRS2008

Analytical Model of the Nonlinear Dynamics of Cantilever Tip-Sample Surface Interactions for Various Acoustic-Atomic Force Microscopies

A comprehensive analytical model of the interaction of the cantilever tip of the atomic force microscope (AFM) with the sample surface is developed that accounts for the nonlinearity of the tip-surface interaction force. The interaction is modeled as a nonlinear spring coupled at opposite ends to linear springs representing cantilever and sample surface oscillators. The model leads to a pair of coupled nonlinear differential equations that are solved analytically using a standard iteration procedure. Solutions are obtained for the phase and amplitude signals generated by various acoustic-atomic force microscope (A-AFM) techniques including force modulation microscopy, atomic force acoustic microscopy, ultrasonic force microscopy, heterodyne force microscopy, resonant difference-frequency atomic force ultrasonic microscopy (RDF-AFUM), and the commonly used intermittent contact mode (TappingMode) generally available on AFMs. The solutions are used to obtain a quantitative measure of image contrast resulting from variations in the Young modulus of the sample for the amplitude and phase images generated by the A-AFM techniques. Application of the model to RDF-AFUM and intermittent soft contact phase images of LaRC-cp2 polyimide polymer is discussed. The model predicts variations in the Young modulus of the material of 24 percent from the RDF-AFUM image and 18 percent from the intermittent soft contact image. Both predictions are in good agreement with the literature value of 21 percent obtained from independent, macroscopic measurements of sheet polymer material.

Cantrell, John H., Jr.↗
DOE OSTI2016

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Transition Modeling Based on the Dual N-factor Method for the CRM-NLF Wind Tunnel Configuration

The dual N-factor method is used to model the boundary-layer transition over the common research model with natural laminar flow (CRM-NLF) aircraft configuration. The flow conditions match selected test conditions from a wind tunnel experiment in the National Transonic Facility at the NASA Langley Research Center. The paper presents a systematic methodology for transition prediction in the presence of a dual shock system and extends the prior capability for iteratively coupled computational fluid dynamics (CFD) predictions to incorporate three-dimensional, transonic wings. The method employs stability computations based on the linear parabolized stability equations (PSE), along with a dual N-factor criterion. The iterative process begins with the fully turbulent Reynolds-averaged-Navier-Stokes (RANS) mean flow solution. For the first iteration, a mean flow solution is calculated with an imposed transition front that aligns with the shock front from the fully turbulent solution. Subsequently, stability computations are performed along a set of streamlines across the wing to calculate the amplification of planar Tollmien-Schlichting (TS) and stationary crossflow (CF) modes. The transition criterion based on the dual N-factor method is used to infer the updated transition front and the process is successively repeated until convergence of the solution. Within three iterations, the predicted fronts for angles of attack of 1.45, 1.98, 2.46 and 2.94 degrees and a mean-aerodynamic-chord Reynolds number equal to 15 million, approach visual convergence in most regions of the studied cases, and the resulting predictions are in good agreement with the transition fronts deduced from measurements of temperature-sensitive paint. Even though surface pressure measurements based on fully-turbulent flow agree well with the measured pressure coefficient distributions, strong viscous-inviscid interaction effects cause significant shifts in the shock locations based on the imposed transition front, underscoring the intrusive nature of static pressure measurements using surface mounted ports on the CRM-NLF configuration.

Boundary Layer Transition↗
DOE OSTI2018

A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation

This paper revisits, in a multi-thread context, the so-called multi-parameter or block conjugate gradient (B-CG) methods, first proposed as sequential algorithms by O’Leary and Brezinski, for the solution of the linear system Ax=b, for an n-dimensional symmetric positive definite matrix A. Instead of the scalar parameters of the classical CG algorithm, which minimizes a scalar functional at each iteration, multiple descent and conjugate directions are updated simultaneously. Implementation involves the use of multiple threads and the algorithm is referred to as cooperative CG (CCG) to emphasize that each thread now uses information that comes from the other threads. It is shown that for a sufficiently large matrix dimension n, the use of an optimal number of threads results in a worst case flop count of O(n{sup 7/3}) in exact arithmetic. Numerical experiments on a multi-core, multi-thread computer, for synthetic and real matrices, illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

A genuinely multi-dimensional upwind cell-vertex scheme for the Euler equations

The solution of the two-dimensional Euler equations is based on the two-dimensional linear convection equation and the Euler-equation decomposition developed by Hirsch et al. The scheme is genuinely two-dimensional. At each iteration, the data are locally decomposed into four variables, allowing convection in appropriate directions. This is done via a cell-vertex scheme with a downwind-weighted distribution step. The scheme is conservative, and third-order accurate in space. The derivation and stability analysis of the scheme for the convection equation, and the derivation of the extension to the Euler equations are given. Preconditioning techniques based on local values of the convection speeds are discussed. The scheme for the Euler equations is applied to two channel-flow problems. It is shown to converge rapidly to a solution that agrees well with that of a third-order upwind solver.

Powell, Kenneth G.↗
NASA NTRS1986

Separated flows near the nose of a body of revolution

The solution of the Navier-Stokes equations for the problem of cross-flow separataion about a deforming cylinder was achieved by iteration. It was shown that the separation starts at the rear stagnation point and the point of primary separation moves upstram along the cylinder surface. A general method of linear stability analysis for nonparallel external flows was constructed, which consists of representing the eigenfunctions with complete orthogonal sets and forms characteristic equations with the Galerkin method. The method was applied to the Kovasznay flow which is an exact solution of the Navier-Stokes equation. The results show that when the critical parameter is exceeded, there are only a few isolated unstable eigen-frequencies. Another exact solution is shown to be absolutely and monotonically stable with respect to infinitesimal disturbances of all frequencies. The flow is also globally, asymptotically, and monotonically stable in the mean with respect o three-dimensional disturbances. This result forms the sound foundation of rigorous stability analysis for nonparallel flows, and provides an invaluable test ground for future studies of nonparallel flows in which the basic states do not posses exact solutions. The application of this method to the study of the formation of spiral vorticies near the nose of a rotating body of revolution is underway. The same method will be applied to the stability analysis of reversed flow over a plate with suction.

Lin, S. P.↗
DOE OSTI2014

Generalized Solovev equilibrium with sheared flow of arbitrary direction and stability consideration

A Solovev-like solution describing equilibria with field aligned incompressible flows [G. N. Throumoulopoulos and H. Tasso, Phys. Plasmas 19, 014504 (2012)] is extended to non parallel flows. The solution expressed as a superposition of Bessel functions contains an arbitrary number of free parameters which are exploited to construct a variety of configurations including ITER shaped ones. For parallel flows, application of a sufficient condition for linear stability shows that this condition is satisfied in an appreciable part of the plasma region on the high-field side mostly due to the variation of the magnetic field perpendicular to the magnetic surfaces. Also, the results indicate that depending on the shape of the Mach-function profile and the values of the free parameters the flow and flow shear may have either stabilizing or destabilizing effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

A computationally-efficient method for flamelet calculations

A new open-source code for the simulation of the diffusion flamelet equations is proposed. Emphasis is placed on using an approximate Jacobian to reduce the computational cost of the matrix operations. Performance of the proposed solvers is tested by performing flamelet calculations with kinetic mechanisms of varying sizes. For the unity Lewis number equations, the present iterative Newton solver using an approximate Jacobian greatly outperforms direct Newton solvers using exact Jacobians. The computation cost scales linearly with the number of species, leading to a reduction in solution times by two orders of magnitude for mechanisms containing thousands of species. The applicability of the Jacobian approximations to the solution of the non-unity Lewis number flamelet equations is assessed. The approximations are generally inadequate to solve the full non-unity Lewis number equations but can be used in some applications depending on the balance of terms in the flamelet equations. As an example, the flamelet solver is applied to the study of sooting tendencies in laminar co-flow diffusion flames where modified non-unity Lewis number flamelet equations, previously shown to accurately reproduce experimentally-measured Yield Sooting Indices (YSI), are solved. Here, the accelerated flamelet solver is well suited for sensitivity analysis and uncertainty quantification with large detailed kinetic mechanisms, tasks for which the computational cost was previously prohibitive.

42 ENGINEERING↗
DOE OSTI2014

Control algorithms for dynamic attenuators

Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.

61 RADIATION PROTECTION AND DOSIMETRY↗