Search NASA⌕ Search

SEARCH · Search NASA

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 199 records · Page 11

Application of NASTRAN to large deflection supersonic flutter of panels

Flat panel flutter at high supersonic Mach number is analyzed using NASTRAN Level 16.0 by means of modifications to the code. Two-dimensional plate theory and quasi-steady aerodynamic theory are employed. The finite element formulation and solution procedure are presented. Modifications to the NASTRAN code are discussed. Convergence characteristics of the iteration processes are also briefly discussed. Effects of aerodynamic damping, boundary support condition and applied in-plane loading are included. Comparison of nonlinear vibration and linear flutter results with analytical solutions demonstrate that excellent accuracy is obtained with NASTRAN.

Mei, C.↗

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Subsonic panel method for designing wing surfaces from pressure distribution

An iterative method has been developed for designing wing section contours corresponding to a prescribed subcritical distribution of pressure. The calculations are initialized by using a surface panel method to analyze a baseline wing or wing-fuselage configuration. A first-order expansion to the baseline panel method equations is then used to calculate a matrix containing the partial derivative of potential at each control point with respect to each unknown geometry parameter. In every iteration cycle, the matrix is used both to calculate the geometry perturbation and to analyze the perturbed geometry. The distribution of potential on the perturbed geometry is established by simple linear extrapolation from the baseline solution. The extrapolated potential is converted to pressure by Bernoulli's equation. Not only is the accuracy of the approach good for very large perturbations, but the computing cost of each complete iteration cycle is substantially less than one analysis solution by a conventional panel method.

Bristow, D. R.↗

An efficient algorithm for solution of the unsteady transonic small-disturbance equation

A time accurate approximate factorization (AF) algorithm is formulated for solution of the three dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time linearization procedure coupled with a Newton iteration technique. Superior stability characteristics of the new algorithm are demonstrated through applications to steady and oscillatory flows at subsonic and supersonic freestream conditions for an F-5 fighter wing. For steady flow calculations, the size of the time step is cycled to achieve rapid convergence. For unsteady flow calculations, the AF algorithm is sufficiently robust to allow the step size to be selected based on accuracy rather than on stability considerations. Therefore, accurate solutions are obtained in only several hundred time steps yielding a significant computational cost savings when compared to alternative methods.

Batina, John T.↗

Performance Efficient Multiresilience Using Checkpoint Recovery in Iterative Algorithms

In this paper, we address the design challenge of building multiresilient iterative high-performance computing (HPC) applications. Multiresilience in HPC applications is the ability to tolerate and maintain forward progress in the presence of both soft errors and process failures. We address the challenge by proposing performance models which are useful to design performance efficient and resilient iterative applications. The models consider the interaction between soft error and process failure resilience solutions. We experimented with a linear solver application with two distinct kinds of soft error detectors: one detector has high overhead and high accuracy, whereas the second has low overhead and low accuracy. We show how both can be leveraged for verifying the integrity of checkpointed state used to recover from both soft errors and process failures. Our results show the performance efficiency and resiliency benefit of employing the low overhead detector with high frequency within the checkpoint interval, so that timely soft error recovery can take place, resulting in less re-computed work.

Ashraf, Rizwan↗

CMB anisotropies at all orders: the non-linear Sachs-Wolfe formula

We obtain the non-linear generalization of the Sachs-Wolfe + integrated Sachs-Wolfe (ISW) formula describing the CMB temperature anisotropies. Our formula is valid at all orders in perturbation theory, is also valid in all gauges and includes scalar, vector and tensor modes. A direct consequence of our results is that the maps of the logarithmic temperature anisotropies are much cleaner than the usual CMB maps, because they automatically remove many secondary anisotropies. This can for instance, facilitate the search for primordial non-Gaussianity in future works. It also disentangles the non-linear ISW from other effects. Finally, we provide a method which can iteratively be used to obtain the lensing solution at the desired order.

79 ASTRONOMY AND ASTROPHYSICS↗

A modified dodge algorithm for the parabolized Navier-Stokes equations and compressible duct flows

A revised version of a split-velocity method for numerical calculation of compressible duct flow was developed. The revision incorporates balancing of mass flow rates on each marching step in order to maintain front-to-back continuity during the calculation. The (checkerboard) zebra algorithm is applied to solution of the three-dimensional continuity equation in conservative form. A second-order A-stable linear multistep method is employed in effecting a marching solution of the parabolized momentum equations. A checkerboard successive overrelaxation iteration is used to solve the resulting implicit nonlinear systems of finite-difference equations which govern stepwise transition.

Cooke, C. H.↗

Laplace's equation and the Dirichlet-Neumann map in multiply connected domains

A variety of problems in material science and fluid dynamics require the solution of Laplace's equation in multiply connected domains. Integral equation methods are natural candidates for such problems, since they discretize the boundary alone, require no special effort for free boundaries, and achieve superalgebraic convergence rates on sufficiently smooth domains in two space dimensions, regardless of shape. Current integral equation methods for the Dirichlet problem, however, require the solution of M independent problems of dimension N, where M is the number of boundary components and N is the total number of points in the discretization. In this paper, we present a new boundary integral equation approach, valid for both interior and exterior problems, which requires the solution of a single linear system of dimension N + M. We solve this system by making use of an iterative method (GMRES) combined with the last multipole method for the rapid calculation of the necessary matrix vector products. For a two-dimensional system with 200 components and 100 points on each boundary, we gain a speedup of a factor of 100 from the new analytic formulation and a factor of 50 from the fast multipole method. The resulting scheme brings large scale calculations in extremely complex domains within practical reach.

Greenbaum, A.↗

Optimizing the hypre solver for manycore and GPU architectures

The solution of large-scale combustion problems with codes such as Uintah on modern computer architectures requires the use of multithreading and GPUs to achieve performance. Uintah uses a low-Mach number approximation that requires iteratively solving a large system of linear equations. The Hypre iterative solver has solved such systems in a scalable way for Uintah, but the use of OpenMP with Hypre leads to at least slowdown due to OpenMP overheads. The proposed solution uses the MPI Endpoints within Hypre, where each team of threads acts as a different MPI rank. This approach minimizes OpenMP synchronization overhead and performs as fast or (up to 1.44) faster than Hypre's MPI-only version, and allows the rest of Uintah to be optimized using OpenMP. The profiling of the GPU version of Hypre shows the bottleneck to be the launch overhead of thousands of micro-kernels. The GPU performance was improved by fusing these micro-kernels and was further optimized by using Cuda-aware MPI, resulting in an overall speedup of 1.16—1.44 compared to the baseline GPU implementation. The above optimization strategies were published in the International Conference on Computational Science 2020 [1]. This work extends the previously published research by carrying out the second phase of communication-centered optimizations in Hypre to improve its scalability on large-scale supercomputers. Additionally, this includes an efficient non-blocking inter-thread communication scheme, communication-reducing patch assignment, and expression of logical communication parallelism to a new version of the MPICH library that utilizes the underlying network parallelism [2]. The above optimizations avoid communication bottlenecks previously observed during strong scaling and improve performance by up to 2 on 256 nodes of Intel Knight's Landing processor.

97 MATHEMATICS AND COMPUTING↗

Compensator improvement for multivariable control systems

A theory and the associated numerical technique are developed for an iterative design improvement of the compensation for linear, time-invariant control systems with multiple inputs and multiple outputs. A strict constraint algorithm is used in obtaining a solution of the specified constraints of the control design. The result of the research effort is the multiple input, multiple output Compensator Improvement Program (CIP). The objective of the Compensator Improvement Program is to modify in an iterative manner the free parameters of the dynamic compensation matrix so that the system satisfies frequency domain specifications. In this exposition, the underlying principles of the multivariable CIP algorithm are presented and the practical utility of the program is illustrated with space vehicle related examples.

Mitchell, J. R.↗

An efficient algorithm for solution of the unsteady transonic small-disturbance equation

A time accurate approximation factorization (AF) algorithm is formulated for solution of the three-dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time linearization procedure coupled with a Newton iteration technique. Superior stability characteristics of the new algorithm are demonstrated through applications to steady and oscillatory flows at subsonic and supersonic freestream conditions for an F-5 fighter wing. For steady flow calculations, the size of the time step is cycled to achieve rapid convergence. For unsteady flow calculations, the AF algorithm is sufficiently robust to allow the step size to be selected based on accuracy rather than on stability considerations. Therefore, accurate solutions are obtained in only several hundred time steps yielding a significant computational cost savings when compared to alternative methods.

Batina, John T.↗

Full wave modeling of radio-frequency beams in tokamaks in the electron cyclotron frequency range

Simulation of full wave, without paraxial approximation, high-resolution solution of wave equations in frequency domain in the electron cyclotron resonance (ECR) frequency range for realistic Tokamak plasma parameters became possible by using recently formulated hybrid iterative algorithm [Svidzinski et al., Phys. Plasmas 25, 082509 (2018)] for numerically solving discretized wave equations. This approach combines time evolution and iterative relaxation techniques into iteration cycles. This algorithm is implemented in 2D code FullWave, solving wave equations in Tokamaks in cold and hot plasma models, and it has been tested in 3D full wave iterative RF beams simulation tool, which is presently being developed to model 3D ECRH RF beams in fusion devices using dynamic grid adaptation. The results of 2D full wave modeling, assuming specified toroidal mode number, of ECRH RF beams in DIII-D plasma, performed in the cold and hot plasma models for outboard and top launch scenarios using FullWave are presented. Nonlocal hot plasma response model, based on accurate numerical solution of linearized Vlasov equation, is used to model beam propagation and absorption in the 2nd electron cyclotron harmonic region. Demonstration of capability of the hybrid iterative algorithm to model ECRH RF beams in 3D is made by simulating a substantial part of realistic beam in DIII-D, launched from outboard side of the machine. All relevant physics of RF beam propagation, most of which is not captured in paraxial approximation, such as beam's divergence, interference between the X and O modes in the beam, X-O mode conversion, beam splitting into the X and O mode beams, transformation of beam's cross section, and absorption at the 2nd electron cyclotron harmonic, is captured in the simulations. A numerical technique to find an optimal beam polarization at the launcher to launch a nearly pure X or O mode beam in plasma is developed and tested.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Investigation of Conjugate Heat Transfer in Turbine Blades and Vanes

We report on work carried out to develop a 3-D coupled Finite Volume/BEM-based temperature forward/flux back (TFFB) coupling algorithm to solve the conjugate heat transfer (CHT) which arises naturally in analysis of systems exposed to a convective environment. Here, heat conduction within a structure is coupled to heat transfer to the external fluid which is convecting heat into or out of the solid structure. There are two basic approaches to solving coupled fluid structural systems. The first is a direct coupling where the solution of the different fields is solved simultaneously in one large set of equations. The second approach is a loose coupling strategy where each set of field equations is solved to provide boundary conditions for the other. The equations are solved in turn until an iterated convergence criterion is met at the fluid-solid interface. The loose coupling strategy is particularly attractive when coupling auxiliary field equations to computational fluid dynamics codes. We adopt the latter method in which the BEM is used to solve heat conduction inside a structure which is exposed to a convective field which in turn is resolved by solving the NASA Glenn compressible Navier-Stokes finite volume code Glenn-HT. The BEM code features constant and bi-linear discontinuous elements and an ILU-preconditioned GMRES iterative solver for the resulting non-symmetric algebraic set arising in the conduction solution. Interface of flux and temperature is enforced at the solid/fluid interface, and a radial-basis function scheme is used to interpolated information between the CFD and BEM surface grids. Additionally, relaxation is implemented in passing the fluxes from the conduction solution to the fluid solution. Results from a simple test example are reported.

Kassab, A. J.↗

A Hybridizable Discontinuous Galerkin solver for the Grad–Shafranov equation

In axisymmetric fusion reactors, the equilibrium magnetic configuration can be expressed in terms of the solution to a semi-linear elliptic equation known as the Grad–Shafranov equation, the solution of which determines the poloidal component of the magnetic field. When the geometry of the confinement region is known, the problem becomes an interior Dirichlet boundary value problem. We propose a high order solver based on the Hybridizable Discontinuous Galerkin method. The resulting algorithm (1) provides high order of convergence for the flux function and its gradient, (2) incorporates a novel method for handling piecewise smooth geometries by extension from polygonal meshes, (3) can handle geometries with non-smooth boundaries and x-points, and (4) deals with the semi-linearity through an accelerated two-grid fixed-point iteration. The effectiveness of the algorithm is verified with computations for cases where analytic solutions are known on configurations similar to those of actual devices (ITER with single null and double null divertor, NSTX, ASDEX upgrade, and Field Reversed Configurations).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nonlinear random response prediction using MSC/NASTRAN

An equivalent linearization technique was incorporated into MSC/NASTRAN to predict the nonlinear random response of structures by means of Direct Matrix Abstract Programming (DMAP) modifications and inclusion of the nonlinear differential stiffness module inside the iteration loop. An iterative process was used to determine the rms displacements. Numerical results obtained for validation on simple plates and beams are in good agreement with existing solutions in both the linear and linearized regions. The versatility of the implementation will enable the analyst to determine the nonlinear random responses for complex structures under combined loads. The thermo-acoustic response of a hexagonal thermal protection system panel is used to highlight some of the features of the program.

Robinson, J. H.↗

Comparison of pseudo-static limit equilibrium and elastic wave equation analyses of dynamic earth pressures on retaining structures

The seismic earth pressure increment is typically computed using either pseudo-static limit equilibrium methods or elastic wave equation analyses of the interaction between a retaining structure and backfill material, yet current interpretations of the two methods provide conflicting recommendations. The focus of this study is to compare the seismic earth pressure increment computed using the two methods. This approach is demonstrated by subjecting an initially uniform prototype site selected from standard site classifications to harmonic excitation in one-dimensional equivalent linear analyses. Then, the seismic earth pressure resultant for a rigid wall is computed using the two methods. The limit equilibrium approach utilizes the acceleration records from the equivalent linear analysis to compute a seismic coefficient, whereas the elastic solution incorporates the reduced modulus and damping from the final iteration of the analysis, as well as the relative displacement records. The results presented herein corroborate the findings of recent centrifuge experiments and associated analyses.

58 GEOSCIENCES↗

Variants and extensions of a fast direct numerical cauchy-riemann solver, with illustrative applications

Revised and extended versions of a fast, direct (noniterative) numerical Cauchy-Riemann solver are presented for solving finite difference approximations of first order systems of partial differential equations. Although the difference operators treated are linear and elliptic, one significant application of these extended direct Cauchy-Riemann solvers is in the fast, semidirect (iterative) solution of fluid dynamic problems governed by the nonlinear mixed elliptic-hyperbolic equations of transonic flow. Different versions of the algorithms are derived and the corresponding FORTRAN computer programs for a simple example problem are described and listed. The algorithms are demonstrated to be efficient and accurate.

Martin, E. D.↗