Search NASA⌕ Search

SEARCH · Search NASA

Results for “Fast direct solvers”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel↗
NASA NTRS1981

A stochastic-dynamic model for global atmospheric mass-field statistics

Global atmospheric mass field error correlations based on satellite observations and on numerical forecasts show strong and systematic latitude dependence. A model for the latitude dependent spatial correlation structure of mass field forecast errors is derived from dynamical considerations. Three methods of solution were tested. In the first method, the equation was solved by expansion in spherical harmonics, and the correlation function was computed analytically using the expansion coefficients. In the second method, the finite difference equivalent of the equation was solved using a fast poisson solver. The correlation function was computed using stratified sampling of the individual realizations. In the third method, a higher order equation was derived, and solved directly in finite differences by two successive applications of the fast poisson solver. The three methods were compared for accuracy and efficiency, and the third method was chosen as clearly superior.

Ghil, M.↗
NASA NTRS1981

A stochastic-dynamic model for global atmospheric mass field statistics

A model that yields the spatial correlation structure of atmospheric mass field forecast errors was developed. The model is governed by the potential vorticity equation forced by random noise. Expansion in spherical harmonics and correlation function was computed analytically using the expansion coefficients. The finite difference equivalent was solved using a fast Poisson solver and the correlation function was computed using stratified sampling of the individual realization of F(omega) and hence of phi(omega). A higher order equation for gamma was derived and solved directly in finite differences by two successive applications of the fast Poisson solver. The methods were compared for accuracy and efficiency and the third method was chosen as clearly superior. The results agree well with the latitude dependence of observed atmospheric correlation data. The value of the parameter c sub o which gives the best fit to the data is close to the value expected from dynamical considerations.

Ghil, M.↗
NASA NTRS1993

Application of fast Fourier transforms to the direct solution of a class of two-dimensional separable elliptic equations on the sphere

An efficient, direct, second-order solver for the discrete solution of a class of two-dimensional separable elliptic equations on the sphere (which generally arise in implicit and semi-implicit atmospheric models) is presented. The method involves a Fourier transformation in longitude and a direct solution of the resulting coupled second-order finite-difference equations in latitude. The solver is made efficient by vectorizing over longitudinal wave-number and by using a vectorized fast Fourier transform routine. It is evaluated using a prescribed solution method and compared with a multigrid solver and the standard direct solver from FISHPAK.

Moorthi, Shrinivas↗
NASA NTRS1990

A Numerical Method for Direct Simulation of Turbulence in Complex Geometries

The ultimate goal of this work is to study the flow inside a channel with riblets on one of the two walls. The method has been tested for two dimensional flows in the presence of bodies with a geometrical singularity and for three dimensional flows inside domains described by Cartesian coordinates. The results have been compared with previous numerical simulations and with experimental results. The cases considered are: (1) the growth of Orr-Sommerfield waves in plane Poiseulle flow; (2) the flow over a backward facing step; (3) the flow past a wedge; and (4) the flow inside a narrow channel. Finally, the case of a channel with two large riblets on a wall has been simulated. In this case a limited number of grid points is sufficient, and in spite of the slow convergence for the pressure solver, one is able to obtain solutions with a reasonable amount of computer time. At present solutions with very fine grids in all three directions can not be obtained, due to lack of a fast pressure solver for general curvilinear coordinates.

P Orlandi↗
NASA NTRS1994

Accelerated panel methods using the fast multipole method

Panel methods are commonly used in computational fluid dynamics for the solution of potential flow problems. The methods are a numerical technique based on the surface distribution of singularity elements. The solution is the process of finding the strength of the singularity elements distributed over the body's surface. This process involves the solution of the matrix problem Pq = p' for a set of unknowns q. The Fast Multipole Method is used to directly compute q without using matrix solvers. The algorithm works in O(N) time for N points, a great improvement over standard matrix solvers. In panel methods, the surface of a body is divided into a series of quadrilateral panels. The methods involve the computation of the influence of all other panels on each individual panel. The influence is based on the surface distribution, though this can be approximated by the area for distant panels. An alternative approximation, though with arbitrary accuracy, is to develop a multipole expansion about the center of the panel to describe the effect of a given panel on distant points in space. The expansion is based on the moments of the panel, thus allow the use of various surface distributions without changing the basic algorithm, just the computation of the various moments. The expansions are then manipulated in a tree walk to develop Taylor series expansions about a point in space which describe the effect of all distant panels on any point within a volume of convergence. The effect of near panels then needs to be computed directly, but the effect of all distant panels can be computed by simply evaluating the resulting expansion. The Fast Multipole Method has been applied to panel methods for the solution of source and doublet distributions. A major feature of the algorithm is that the algorithm does not change to derive the potential and velocity for sources and doublets. The same expansions can be used for both sources and doublets. Since the velocity is related to the potential, and the doublet potential is related to the z-component of the source velocity, all values can be derived from the same expansion by taking a series of partial derivatives. This requires more expansion terms to be kept since terms are lost in the process of taking partial derivatives. Thus to maintain accuracy for the doublet computation, more terms are required than if just evaluating for sources. The resulting Fast Multipole code should then parallelize better than classical panel methods due to the locality of data dependencies found in the Fast Multipole Method. Theoretically the parallelized code should execute in O(log N) time with O(N) processors, though this is not practical. Ongoing work includes implementing the parallel accelerated panel method, including methods to improve the load balancing of the problem by taking advantage of the known geometry of panels, and to encorporate sensitivity analysis into the algorithm.

Leathrum, James F., Jr.↗
NASA NTRS1993

Multigrid methods for numerical simulation of laminar diffusion flames

This paper documents the result of a computational study of multigrid methods for numerical simulation of 2D diffusion flames. The focus is on a simplified combustion model, which is assumed to be a single step, infinitely fast and irreversible chemical reaction with five species (C3H8, O2, N2, CO2 and H2O). A fully-implicit second-order hybrid scheme is developed on a staggered grid, which is stretched in the streamwise coordinate direction. A full approximation multigrid scheme (FAS) based on line distributive relaxation is developed as a fast solver for the algebraic equations arising at each time step. Convergence of the process for the simplified model problem is more than two-orders of magnitude faster than other iterative methods, and the computational results show good grid convergence, with second-order accuracy, as well as qualitatively agreement with the results of other researchers.

Liu, C.↗
DOE OSTI2025

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1990

Numerical investigation of laminar-turbulent transition in a flat plate wake

Lamina-turbulent transition of high-deficit flat plate wakes is investigated by direct numerical simulations using the complete Navier Stokes equations. The simulations are based on a spatial model so that both the base flow and the disturbance flow can develop in the downstream direction. The Navier Stokes equations are used in a vorticity-velocity form and are solved using a combination of finite difference and spectral approximations. Fourier series are used in the spanwise direction. Second-order finite-differences are used to approximate the spatial derivatives in the streamwise and transverse directions. For the temporal discretion, a combination of ADI, Crank-Nicolson, and Adams-Bashforth methods is employed. The discretized velocity equations are solved using fast Helmholtz solvers. Code validation is accomplished by comparison of the numerical results to both linear stability and to experiments. Calculations of two- and/or three-dimensional sinuous and mode disturbances in the wake of flat plate are undertaken. For calculations of two-dimensional disturbances, the wake is forced at an amplitude level so that nonlinear disturbance development may be observed. In addition, the forcing amplitude is varied in order to determine its effect on the disturbance behavior. To investigate the onset of three-dimensionality, the wake is forced with a small-amplitude three-dimensional disturbance and a larger amplitude two-dimensional disturbance. The two-dimensional forcing amplitude is varied in order to determine its influence on the three-dimensional flow field.

Fasel, Hermann F.↗
NASA NTRS1992

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗
NASA NTRS1993

Implementing abstract multigrid or multilevel methods

Multigrid methods can be formulated as an algorithm for an abstract problem that is independent of the partial differential equation, domain, and discretization method. In such an abstract setting, problems not arising from partial differential equations can be treated. A general theory exists for linear problems. The general theory was motivated by a series of abstract solvers (Madpack). The latest version was motivated by the theory. Madpack now allows for a wide variety of iterative and direct solvers, preconditioners, and interpolation and projection schemes, including user callback ones. It allows for sparse, dense, and stencil matrices. Mildly nonlinear problems can be handled. Also, there is a fast, multigrid Poisson solver (two and three dimensions). The type of solvers and design decisions (including language, data structures, external library support, and callbacks) are discussed. Based on the author's experiences with two versions of Madpack, a better approach is proposed. This is based on a mixed language formulation (C and FORTRAN + preprocessor). Reasons for not using FORTRAN, C, or C++ (individually) are given. Implementing the proposed strategy is not difficult.

Douglas, Craig C.↗
NASA NTRS1983

Fast Euler solver for steady, 1-dimensional flows

A numerical technique to solve the Euler equations for steady, one dimensional flows is presented. The technique is essentially implicit, but is structured as a sequence of explicit solutions for each Riemann variable separately. Each solution is obtained by integrating in the direction prescribed by the propagation of the Riemann variables. The technique is second-order accurate. It requires very few steps for convergence, and each step requires a minimal number of operations. Therefore, it is three orders of magnitude more efficient than a standard time-dependent technique. The technique works very well for transonic flows and provides shock fitting with errors as small as 0.001. Results are presented for subsonic problems. Errors are evaluated by comparison with exact solutions.

Moretti, G.↗
NASA NTRS1974

Rapid finite-difference computation of subsonic and transonic aerodynamic flows

Rapid iterative (or semidirect) computation methods are developed for the finite-difference solution of the nonlinear equations of subsonic and transonic aerodynamics. At each iteration, a fast, direct elliptic algorithm solves the entire computation field. In an application to subsonic flow over a lifting airfoil, the full nonlinear stream-function equation is solved. Finally, a direct Cauchy-Riemann solver is used for the nonlinear transonic small-disturbance equations for a biconvex airfoil. At M = 0.7, t/c = 0.1 (subcritical), three iterations on a 39 x 32 mesh (totaling 2.45 sec on an IBM 360/67 computer) obtain convergence within 0.1%. A slightly supercritical case requires seven iterations (6.75 sec) for convergence within 1%.

Martin, E. D.↗
NASA NTRS2022

Whistler Waves Generated by Nongyrotropic and Gyrotropic Electron Beams During Asymmetric Guide Field Reconnection

Using a two-dimensional particle-in-cell simulation of asymmetric reconnection with a guide field whose strength is 0.3 times the reconnecting magnetic field, we study electron distribution functions and wave intensities in the diffusion region, focusing on the electron diffusion region (EDR). Wave activities with frequencies below the electron cyclotron frequency are observed, and these are whistler waves propagating almost anti-parallel to the magnetic field. The waves are concentrated near the magnetospheric separatrix away from the X line, but the wave activity also spreads through the EDR near the X line. The reconnection outflows are asymmetric in the outflow direction in the magnetospheric side, and the wave intensity is stronger in the side of the faster electron outflow. We study the whistler waves using the fast Fourier transform, analyses of electron velocity distribution functions, and the dispersion solver calculation. Along the magnetospheric separatrix in the stronger outflow side, highly anisotropic electron beams exist with super-Alfvénic drift speeds. The dispersion analysis shows that there are two modes: a temperature anisotropy mode and a beam mode. Outside the EDR, the whistler wave intensity is highest near the separatrix, but the wave intensity decreases if we move away from the separatrix toward the magnetic neutral line because of the increase in the electron population near zero parallel velocity. In the EDR, in the velocity plane perpendicular to the magnetic field, ring/crescent electron distribution functions are observed. Near the X-line, the wave power is enhanced where nongyrotropic electrons contribute to increase the perpendicular temperature anisotropy.

magnetic reconnection↗
NASA NTRS1979

Multi-level adaptive finite element methods. 1: Variation problems

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

Brandt, A.↗
NASA NTRS2000

LSENS, The NASA Lewis Kinetics and Sensitivity Analysis Code

A general chemical kinetics and sensitivity analysis code for complex, homogeneous, gas-phase reactions is described. The main features of the code, LSENS (the NASA Lewis kinetics and sensitivity analysis code), are its flexibility, efficiency and convenience in treating many different chemical reaction models. The models include: static system; steady, one-dimensional, inviscid flow; incident-shock initiated reaction in a shock tube; and a perfectly stirred reactor. In addition, equilibrium computations can be performed for several assigned states. An implicit numerical integration method (LSODE, the Livermore Solver for Ordinary Differential Equations), which works efficiently for the extremes of very fast and very slow reactions, is used to solve the "stiff" ordinary differential equation systems that arise in chemical kinetics. For static reactions, the code uses the decoupled direct method to calculate sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of dependent variables and/or the rate coefficient parameters. Solution methods for the equilibrium and post-shock conditions and for perfectly stirred reactor problems are either adapted from or based on the procedures built into the NASA code CEA (Chemical Equilibrium and Applications).

Radhakrishnan, K.↗
NASA NTRS1991

Grid adaptation to multiple functions for applied aerodynamic analysis

A fast and robust method of grid adaptation to multiple functions has been developed for flow analysis in 3D space. It is based on the equidistribution principle and the alternate direction adaptation method. The grid adaptation algorithm has been fully integrated with a space marching flow solver as contained within a 3D Navier-Stokes code and PAB3D-v2. The grid adaptation strategy, details of numerical implementation, examples of application, and potential extensions of the current method are presented in this paper.

Pao, S. P.↗
NASA NTRS2011

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗