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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

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.↗

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 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 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↗

NASA NTRS2023

A Trajectory Algorithm to Support En Route and Terminal Area Self-Spacing Concepts: Fifth Revision

This document describes an algorithm for the generation of a four dimensional trajectory. Input data for this algorithm are similar to an augmented Standard Terminal Arrival (STAR) with the augmentation in the form of altitude or speed crossing restrictions at waypoints on the route. The algorithm calculates the altitude, speed, along path distance, and along path time for each of these waypoints. Wind data at each of these waypoints are also used for the calculation of ground speed and turn radius. This revision of the algorithm now accommodates linear decelerations between two speed-constrained waypoints. While this modification may appear trivial, the calculation of the deceleration rate cannot be accomplished using a closed-form solution. An iterative solution was developed that allowed for the variability of path distance due to speed influence on turn radii, Mach-CAS transition altitude, and the impact of wind on ground speed in calculating an accurate deceleration value.

Aircraft Operations↗

NASA NTRS2011

Multi-Maneuver Clohessy-Wiltshire Targeting

Orbital rendezvous involves execution of a sequence of maneuvers by a chaser vehicle to bring the chaser to a desired state relative to a target vehicle while meeting intermediate and final relative constraints. Intermediate and final relative constraints are necessary to meet a multitude of requirements such as to control approach direction, ensure relative position is adequate for operation of space-to-space communication systems and relative sensors, provide fail-safe trajectory features, and provide contingency hold points. The effect of maneuvers on constraints is often coupled, so the maneuvers must be solved for as a set. For example, maneuvers that affect orbital energy change both the chaser's height and downrange position relative to the target vehicle. Rendezvous designers use experience and rules-of-thumb to design a sequence of maneuvers and constraints. A non-iterative method is presented for targeting a rendezvous scenario that includes a sequence of maneuvers and relative constraints. This method is referred to as Multi-Maneuver Clohessy-Wiltshire Targeting (MM_CW_TGT). When a single maneuver is targeted to a single relative position, the classic CW targeting solution is obtained. The MM_CW_TGT method involves manipulation of the CW state transition matrix to form a linear system. As a starting point for forming the algorithm, the effects of a series of impulsive maneuvers on the state are derived. Simple and moderately complex examples are used to demonstrate the pattern of the resulting linear system. The general form of the pattern results in an algorithm for formation of the linear system. The resulting linear system relates the effect of maneuver components and initial conditions on relative constraints specified by the rendezvous designer. Solution of the linear system includes the straight-forward inverse of a square matrix. Inversion of the square matrix is assured if the designer poses a controllable scenario - a scenario where the the constraints can be met by the sequence of maneuvers. Matrices in the linear system are dependent on selection of maneuvers and constraints by the designer, but the matrices are independent of the chaser's initial conditions. For scenarios where the sequence of maneuvers and constraints are fixed, the linear system can be formed and the square matrix inverted prior to real-time operations. Example solutions are presented for several rendezvous scenarios to illustrate the utility of the method. The MM_CW_TGT method has been used during the preliminary design of rendezvous scenarios and is expected to be useful for iterative methods in the generation of an initial guess and corrections.

Dannemiller, David P.↗

DOE OSTI2018

Load-Flow in Multiphase Distribution Networks: Existence, Uniqueness, Non-Singularity, and Linear Models

This paper considers unbalanced multiphase distribution systems with generic topology and different load models, and extends the Z-bus iterative load-flow algorithm based on a fixed-point interpretation of the AC load-flow equations. Explicit conditions for existence and uniqueness of load-flow solutions are presented. These conditions also guarantee convergence of the load-flow algorithm to the unique solution. The proposed methodology is applicable to generic systems featuring (i) wye connections; (ii) ungrounded delta connections; (iii) a combination of wye-connected and delta-connected sources/loads; and, (iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. Further, a sufficient condition for the non-singularity of the load-flow Jacobian is proposed. Lastly, linear load-flow models are derived, and their approximation accuracy is analyzed. Theoretical results are corroborated through experiments on IEEE test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1988

Primitive numerical simulation of circular Couette flow - Carrousel wind tunnel nonturbulent solutions

The azimuthal-invariant, three-dimensional cylindrical, incompressible Navier-Stokes equations are solved to steady state for a finite-length, physically realistic model. The numerical method relies on an alternating-direction implicit scheme that is formally second-order accurate in space and first-order accurate in time. The equations are linearized and uncoupled by evaluating variable coefficients at the previous time iteration. Wall grid clustering is provided by a Roberts transformation in radial and axial directions. A vorticity-velocity formulation is found to be preferable to a vorticity-streamfunction approach. Subject to no-slip, Dirichlet boundary conditions, except for the inner cylinder rotation velocity (impulsive start-up) and zero-flow initial conditions, nonturbulent solutions are obtained for sub- and supercritical Reynolds numbers of 100 to 400 for a finite geometry where R(outer)/R(inner) = 1.5, H/R(inner) = 0.73, and H/Delta-R = 1.5. An axially-stretched model solution is shown to asymptotically approach the one-dimensional analytic Couette solution at the cylinder midheight. Flowfield change from laminar to Taylor-vortex flow is discussed as a function of Reynolds number. Three-dimensional velocities, vorticity, and streamfunction are presented via two-dimensional graphs and three-dimensional surface and contour plots.

Hasiuk, Jan↗

DOE OSTI2017

Enhancement of flow measurements using fluid-dynamic constraints

Novel experimental modalities acquire spatially resolved velocity measurements for steady state and transient flows which are of interest for engineering and biological applications. One of the drawbacks of such high resolution velocity data is their susceptibility to measurement errors. In this paper, we propose a novel filtering strategy that allows enhancement of the noisy measurements to obtain reconstruction of smooth divergence free velocity and corresponding pressure fields which together approximately comply to a prescribed flow model. The main step in our approach consists of the appropriate use of the velocity measurements in the design of a linearized flow model which can be shown to be well-posed and consistent with the true velocity and pressure fields up to measurement and modeling errors. The reconstruction procedure is then formulated as an optimal control problem for this linearized flow model. The resulting filter has analyzable smoothing and approximation properties. We briefly discuss the discretization of the approach by finite element methods and comment on the efficient solution by iterative methods. The capability of the proposed filter to significantly reduce data noise is demonstrated by numerical tests including the application to experimental data. In addition, we compare with other methods like smoothing and solenoidal filtering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Optimal-Order Preconditioners for Linear Systems Arising in the Semismooth Newton Solution of a Class of Control-Constrained Problems

We present a new multigrid preconditioner for the linear systems arising in the semismooth Newton method solution of certain control-constrained, quadratic distributed optimal control problems. Using a piecewise constant discretization of the control space, each semismooth Newton iteration essentially requires inverting a principal submatrix of the matrix entering the normal equations of the associated unconstrained optimal control problem, the rows (and columns) of the submatrix representing the constraints deemed inactive at the current iteration. Previously developed multigrid preconditioners for the aforementioned submatrices were based on constructing a sequence of conforming coarser spaces and proved to be of suboptimal quality for the class of problems considered. Instead, the multigrid preconditioner introduced in this work uses nonconforming coarse spaces, and it is shown that, under reasonable geometric assumptions on the constraints that are deemed inactive, the preconditioner approximates the inverse of the desired submatrix to optimal order. The preconditioner is tested numerically on a classical elliptic-constrained optimal control problem and further on a constrained image-deblurring problem.

97 MATHEMATICS AND COMPUTING↗