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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

DIII-D research to address key challenges for ITER and fusion energy

DIII-D has made significant advances in the scientific basis for fusion energy. The physics mechanism of resonant magnetic perturbation (RMP) edge localized mode (ELM) suppression is revealed as field penetration at the pedestal top, and reduced coil set operation was demonstrated. Disruption runaway electrons were effectively quenched by shattered pellets; runaway dissipation is explained by pitch angle scattering. Modest thermal quench radiation asymmetries are well described NIMROD modeling. With good pedestal regulation and error field correction, low torque ITER baselines have been demonstrated and shown to be compatible with an ITER test blanket module simulator. However performance and long wavelength turbulence degrade as low rotation and electron heating are approached. The alternative QH mode scenario is shown to be compatible with high Greenwald density fraction, with an edge harmonic oscillation demonstrating good impurity flushing. Discharge optimization guided by the EPED model has discovered a new super H-mode with doubled pedestal height. Lithium injection also led to wider, higher pedestals. On the path to steady state, 1 MA has been sustained fully non inductively with β N = 4 and RMP ELM suppression, while a peaked current profile scenario provides attractive options for ITER and a β N = 5 future reactor. Energetic particle transport is found to exhibit a critical gradient behavior. Scenarios are shown to be compatible with radiative and snowflake diverter techniques. Physics studies reveal that the transition to H mode is locked in by a rise in ion diamagnetic flows. Intrinsic rotation in the plasma edge is demonstrated to arise from kinetic losses. New 3D magnetic sensors validate linear ideal MHD, but identify issues in nonlinear simulations. Detachment, characterized in 2D with sub-eV resolution, reveals a radiation shortfall in simulations. As a result, future facility development targets burning plasma physics with torque free electron heating, the path to steady state with increased off axis currents, and a new divertor solution for fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Fast and robust all-electron density functional theory calculations in solids using orthogonalized enriched finite elements

Here, we present a computationally efficient approach to perform systematically convergent real-space all-electron Kohn-Sham density functional theory calculations for solids using an enriched finite element (FE) basis. The enriched FE basis is constructed by augmenting the classical FE basis with atom-centered numerical basis functions, comprising of atomic solutions to the Kohn-Sham problem. Notably, to improve the conditioning, we orthogonalize the enrichment functions with respect to the classical FE basis, without sacrificing the locality of the resultant basis. In addition to improved conditioning, this orthogonalization procedure also renders the overlap matrix block diagonal, greatly simplifying its inversion. Subsequently, we use a Chebyshev polynomial based filtering technique to efficiently compute the occupied eigenspace in each self-consistent field iteration. We demonstrate the accuracy and efficiency of the proposed approach on periodic unit cells and supercells. The benchmark studies show a staggering 130× speedup of the orthogonalized enriched FE basis over the classical FE basis. We also present a comparison of the orthogonalized enriched FE basis with the linearized augmented plane-wave + local orbitals basis, both in terms of accuracy and efficiency. Notably, we demonstrate that the orthogonalized enriched FE basis can handle large system sizes of ~10 000 electrons. Finally, we observe good parallel scalability of our implementation with 92% efficiency at 22× speedup for a system with 620 electrons

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2014

Lattice QCD with Domain Decomposition on Intel Xeon Phi Co-Processors

The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale architectures. This problem can be alleviated by alternative algorithms that reduce the amount of data movement. We investigate this in the context of Lattice Quantum Chromodynamics and implement such an alternative solver algorithm, based on domain decomposition, on Intel Xeon Phi co-processor (KNC) clusters. We demonstrate close-to-linear on-chip scaling to all 60 cores of the KNC. With a mix of single- and half-precision the domain-decomposition method sustains 400-500 Gflop/s per chip. Compared to an optimized KNC implementation of a standard solver [1], our full multi-node domain-decomposition solver strong-scales to more nodes and reduces the time-to-solution by a factor of 5.

Heybrock, Simon↗
DOE OSTI2020

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

The Challenges of Plasma Material Interactions in Nuclear Fusion Devices and Potential Solutions

Plasma Material Interactions in future fusion reactors have been identified as a knowledge gap to be dealt with before any next step device past ITER can be built. The challenges are manifold. They are related to power dissipation so that the heat fluxes to the plasma facing components can be kept at technologically feasible levels; maximization of the lifetime of divertor plasma facing components that allow for steady-state operation in a reactor to reach the neutron fluences required; the tritium inventory (storage) in the plasma facing components, which can lead to potential safety concerns and reduction in the fuel efficiency; and it is related to the technology of the plasma facing components itself, which should demonstrate structural integrity under the high temperatures and neutron fluence. This contribution will give an overview and summary of those challenges together with some discussion of potential solutions. New linear plasma devices are needed to investigate the PMI under fusion reactor conditions and test novel plasma facing components. The Material Plasma Exposure eXperiment MPEX will be introduced and a status of the current R&D towards MPEX will be summarized.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1985

Engineering calculations for communications satellite systems planning

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Reilly, C. H.↗
NASA NTRS1996

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗
DOE OSTI2025

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗
NASA NTRS2003

Analytic Solution to the Problem of Aircraft Electric Field Mill Calibration

It is by no means a simple task to retrieve storm electric fields from an aircraft instrumented with electric field mill sensors. The presence of the aircraft distorts the ambient field in a complicated way. Before retrievals of the storm field can be made, the field mill measurement system must be "calibrated". In other words, a relationship between impressed (i.e., ambient) electric field and mill output must be established. If this relationship can be determined, it is mathematically inverted so that ambient field can be inferred from the mill outputs. Previous studies have primarily focused on linear theories where the relationship between ambient field and mill output is described by a "calibration matrix" M. Each element of the matrix describes how a particular component of the ambient field is enhanced by the aircraft. For example the product M(sub ix), E(sub x), is the contribution of the E(sub x) field to the i(th) mill output. Similarly, net aircraft charge (described by a "charge field component" E(sub q)) contributes an amount M(sub iq)E(sub q) to the output of the i(th) sensor. The central difficulty in obtaining M stems from the fact that the impressed field (E(sub x), E(sub y), E(sub z), E(sub q) is not known but is instead estimated. Typically, the aircraft is flown through a series of roll and pitch maneuvers in fair weather, and the values of the fair weather field and aircraft charge are estimated at each point along the aircraft trajectory. These initial estimates are often highly inadequate, but several investigators have improved the estimates by implementing various (ad hoc) iterative methods. Unfortunately, none of the iterative methods guarantee absolute convergence to correct values (i.e., absolute convergence to correct values has not been rigorously proven). In this work, the mathematical problem is solved directly by analytic means. For m mills installed on an arbitrary aircraft, it is shown that it is possible to solve for a single 2m-vector that provides all other needed variables (i.e., the unknown fair weather field, the unknown aircraft charge, and the unknown matrix M). Numerical tests of the solution, effects of measurement errors, and studies of solution non-uniqueness are ongoing as of this writing.

Koshak, William↗
NASA NTRS1994

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A discrete sensitivity analysis algorithm had previously been developed and applied to two-dimensional aerodynamic optimization problems, where the computational domains were discretized by using single grids. The sparse, unsymmetric systems of linear equations resulting from this algorithm were solved by a direct matrix inversion matrix. However, for large two-dimensional problems and, practically, all three-dimensional problems, direct inversion methods become inapplicable, primarily due to the prohibitive computer storage needed. In an attempt to alleviate such hindrances, the sensitivity analysis with domain decomposition (SADD) scheme was developed. This scheme divides the computational domain into smaller and nonoverlapping subdomains (multiblock grids) that are solved separately. Then, the final solution is constructed from the subdomain solutions. As the number of grid points in the interface boundaries of the subdomains becomes large, the computer memory required to store the effective coefficient matrix of these interface points starts to increase. Presented in this Technical Note is a preconditioned iterative procedure to overcome this particular problem.

Eleshaky, Mohamed E.↗
DOE OSTI2014

Orbital-free density functional theory implementation with the projector augmented-wave method

We present a computational scheme for orbital-free density functional theory (OFDFT) that simultaneously provides access to all-electron values and preserves the OFDFT linear scaling as a function of the system size. Using the projector augmented-wave method (PAW) in combination with real-space methods, we overcome some obstacles faced by other available implementation schemes. Specifically, the advantages of using the PAW method are twofold. First, PAW reproduces all-electron values offering freedom in adjusting the convergence parameters and the atomic setups allow tuning the numerical accuracy per element. Second, PAW can provide a solution to some of the convergence problems exhibited in other OFDFT implementations based on Kohn-Sham (KS) codes. Using PAW and real-space methods, our orbital-free results agree with the reference all-electron values with a mean absolute error of 10 meV and the number of iterations required by the self-consistent cycle is comparable to the KS method. The comparison of all-electron and pseudopotential bulk modulus and lattice constant reveal an enormous difference, demonstrating that in order to assess the performance of OFDFT functionals it is necessary to use implementations that obtain all-electron values. The proposed combination of methods is the most promising route currently available. We finally show that a parametrized kinetic energy functional can give lattice constants and bulk moduli comparable in accuracy to those obtained by the KS PBE method, exemplified with the case of diamond.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1984

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces.

Mastin, E. W.↗
NASA NTRS1993

Mechanically fastened composite laminates subjected to combined bearing-bypass and shear loading

Bolts and rivets provide a means of load transfer in the construction of aircraft. However, they give rise to stress concentrations and are often the source and location of static and fatigue failures. Furthermore, fastener holes are prone to cracks during take-off and landing. These cracks present the most common origin of structural failures in aircraft. Therefore, accurate determination of the contact stresses associated with such loaded holes in mechanically fastened joints is essential to reliable strength evaluation and failure prediction. As the laminate is subjected to loading, the contact region, whose extent is not known, develops between the fastener and the hole boundary through this contact region, which consists of slip and no-slip zones due to friction. The presence of the unknown contact stress distribution over the contact region between the pin and the composite laminate, material anisotropy, friction between the pin and the laminate, pin-hole clearance, combined bearing-bypass and shear loading, and finite geometry of the laminate result in a complex non-linear problem. In the case of bearing-bypass loading in compression, this non-linear problem is further complicated by the presence of dual contact regions. Previous research concerning the analysis of mechanical joints subjected to combined bearing-bypass and shear loading is non-existent. In the case of bearing-bypass loading only, except for the study conducted by Naik and Crews (1991), others employed the concept of superposition which is not valid for this non-linear problem. Naik and Crews applied a linear finite element analysis with conditions along the pin-hole contact region specified as displacement constraint equations. The major shortcoming of this method is that the variation of the contract region as a function of the applied load should be known a priori. Also, their analysis is limited to symmetric geometry and material systems, and frictionless boundary conditions. Since the contact stress distribution and the contact region are not known a priori, they did not directly impose the boundary conditions appropriate for modelling the contact and on-contact regions between the fastener and the hole. Furthermore, finite element analysis is not suitable for iterative design calculations for optimizing laminate construction in the presence of fasteners under complex loading conditions. In this study, the solution method developed by Madenci and Ileri (1992a,b) has been extended to determine the contact stresses in mechanical joints under combined bearing-bypass and shear loading, and bearing-bypass loading in compression resulting in dual contact regions.

Madenci, Erdogan↗
NASA NTRS1996

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

Pavarino, Luca F.↗
DOE OSTI2021

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2002

A Bayesian Approach to Estimating Coupling Between Neural Components: Evaluation of the Multiple Component, Event-Related Potential (mcERP) Algorithm

Accurate measurement of single-trial responses is key to a definitive use of complex electromagnetic and hemodynamic measurements in the investigation of brain dynamics. We developed the multiple component, Event-Related Potential (mcERP) approach to single-trial response estimation. To improve our resolution of dynamic interactions between neuronal ensembles located in different layers within a cortical region and/or in different cortical regions. The mcERP model assets that multiple components defined as stereotypic waveforms comprise the stimulus-evoked response and that these components may vary in amplitude and latency from trial to trial. Maximum a posteriori (MAP) solutions for the model are obtained by iterating a set of equations derived from the posterior probability. Our first goal was to use the ANTWERP algorithm to analyze interactions (specifically latency and amplitude correlation) between responses in different layers within a cortical region. Thus, we evaluated the model by applying the algorithm to synthetic data containing two correlated local components and one independent far-field component. Three cases were considered: the local components were correlated by an interaction in their single-trial amplitudes, by an interaction in their single-trial latencies, or by an interaction in both amplitude and latency. We then analyzed the accuracy with which the algorithm estimated the component waveshapes and the single-trial parameters as a function of the linearity of each of these relationships. Extensions of these analyses to real data are discussed as well as ongoing work to incorporate more detailed prior information.

Shah, Ankoor S.↗
NASA NTRS1977

Microscopic Lagrangian description of warm plasmas. I - Linear wave propagation. II - Nonlinear wave interactions

It is pointed out that the conventional iterative analysis of nonlinear plasma wave phenomena, which involves a direct use of Maxwell's equations and the equations describing the particle dynamics, leads to formidable theoretical and algebraic complexities, especially for warm plasmas. As an effective alternative, the Lagrangian method may be applied. It is shown how this method may be used in the microscopic description of small-signal wave propagation and in the study of nonlinear wave interactions. The linear theory is developed for an infinite, homogeneous, collisionless, warm magnetoplasma. A summary is presented of a perturbation expansion scheme described by Galloway and Kim (1971), and Lagrangians to third order in perturbation are considered. Attention is given to the averaged-Lagrangian density, the action-transfer and coupled-mode equations, and the general solution of the coupled-mode equations.

Kim, H.↗