Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast solver”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

Shock-free configurations in two-and three-dimensional transonic flow

Efforts to replace Sobieczky's complicated analog computations of solutions to the hodograph equations by a fast elliptic solver in order to generate shock-free airfoil designs more effectively are described. The indirect design of airfoil and wing shapes that are free from shock waves even though the local flow velocity exceeds the speed of sound is described. The problem of finding an airfoil in two dimensional, irrotational flow that has a prescribed pressure distribution is as addressed. Sobieczky's suggestion to use a fictitious gas for finding shock-free airfoils directly in the physical plane was the basis for a more efficient procedure for achieving the same end.

Seebass, A. R.↗
NASA NTRS1981

Rapid, high-order accurate calculation of flows due to free source or vortex distributions

Fast Fourier transform (FFT) techniques are applied to the problem of finding the flow due to source or vortex distributions in the field outside an airfoil or other two-dimensional body. Either the complex potential or the complex velocity may be obtained to a high order of accuracy, with computational effort similar to that required by second-order fast Poisson solvers. These techniques are applicable to general flow problems with compressibility and rotation. An example is given of their use for inviscid compressible flow.

Halsey, D.↗
NASA NTRS1987

Multigrid solution of inviscid transonic flow through rotating blade passages

A fast Euler solver for three dimensional inviscid transonic flow in rotating domains is described. The time dependent Euler equations are discretized spatially with finite volumes, and are advanced temporally with a multiple stage time stepping scheme. A dramatic increase in the rate of convergence for steady solutions is achieved with a multigrid algorithm that employs the multistage scheme as its smoothing procedure. The effectiveness of the multistage scheme as a multigrid driver is enhanced by the utilization of analytically determined combinations of the governing parameters.

Smith, Wayne A.↗
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 NTRS2004

Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations

A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.

Swanson, R. C.↗
NASA NTRS2001

Towards Optimal Multigrid Efficiency for the Navier-Stokes Equations

A fast multigrid solver for the steady incompressible Navier-Stokes equations is presented. Unlike time-marching schemes, this approach uses relaxation of the steady equations. Application of this method results in a discretization that correctly distinguishes between the advection and elliptic parts of the operator, allowing efficient smoothers to be constructed. Numerical solutions are shown for flow over a flat plate and a Karman-Trefftz airfoil. Using collective Gauss-Seidel line relaxation in both the vertical and horizontal directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of a Runge-Kutta based multigrid method.

Swanson, R. C.↗
NASA NTRS2004

Textbook Multigrid Efficiency for the Steady Euler Equations

A fast multigrid solver for the steady incompressible Euler equations is presented. Unlike time-marching schemes, this approach uses relaxation of the steady equations. Application of this method results in a discretization that correctly distinguishes between the advection and elliptic parts of the operator, allowing efficient smoothers to be constructed. Solvers for both unstructured triangular grids and structured quadrilateral grids have been written. Computations for channel flow and flow over a nonlifting airfoil have computed. Using Gauss-Seidel relaxation ordered in the flow direction, textbook multigrid convergence rates of nearly one order-of-magnitude residual reduction per multigrid cycle are achieved, independent of the grid spacing. This approach also may be applied to the compressible Euler equations and the incompressible Navier-Stokes equations.

Roberts, Thomas W.↗
NASA NTRS2008

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗
NASA NTRS1994

Massively Parallel Algorithms for Real-Time Wavefront Control of a Dense Adaptive Optics System

In this paper massively parallel algorithms and architectures for real-time wavefront control of a dense adaptive optic system (SELENE) are presented. We have already shown that the computation of a near optimal control algorithm for SELENE can be reduced to the solution of a discrete Poisson equation on a regular domain. Although this represents an optimal computation, due the large size of the system and the high sampling rate requirement, the implementation of this control algorithm poses a computationally challenging problem since it demands a sustained computational throughput of the order of 10 GFlops. We develop a novel algorithm, designated as Fast Invariant Imbedding algorithm, which offers a massive degree of parallelism with simple communication and synchronization requirements. Due to these features, our algorithm is significantly more efficient than other Fast Poisson Solvers for implementation on massively parallel architectures.

massively↗
DOE OSTI2025

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗
DOE OSTI2025

A two-and-a-half dimensional symplectic space-charge solver

The nonlinear space-charge effect plays a significant role in high-intensity accelerators and has been extensively studied using multi-particle tracking methods. In this paper, we present a novel 2.5- dimensional symplectic space-charge solver specifically designed for long beam bunches. We begin by detailing its application to a transverse Gaussian density distribution under open boundary conditions in a straight system, where a semi-analytical expression is derived. We then demonstrate the solver’s adaptation to arbitrary distributions in open space, as well as within rectangular and round conducting pipes. Finally, we discuss the extension of this solver to circular accelerator systems. This study shows that the fast 2.5-dimensional solver can be a good approximation to the fully three-dimensional solver for long bunches in large circular accelerators.

Beam code development & simulation techniques↗
DOE OSTI2026

Precise 2D electric field density simulations for superconducting quantum devices

Dielectric loss due to two-level systems is a limiting factor for superconducting qubit relaxation times. These losses arise mostly from nanometer-scale interfacial defect regions in superconducting devices with planar dimensions of microns to millimeters, thus making it resource intensive to accurately simulate the electric field density in these regions with traditional electromagnetic solvers. In this work, we demonstrate a fast boundary integral equation solver that allows precise simulation of electric field density in these thin regions, showing a speedup of around two orders of magnitude over traditional solvers, with relative errors around $10^{-7}$ for a ten-minute solution runtime. By computing participation ratios through Green's first identity without squaring the electric field, our approach is less susceptible to the field singularities near conductor corners. We apply this solver to a basic untrenched coplanar waveguide cross-section, showing that the common assumption of participation ratio linearity with dielectric constant holds well for some interfaces and not others; in particular, while the metal-air (MA) top and corner follow this linear relationship strongly, the MA sidewall does not. We then compare isotropic and anisotropic etching, showing that the MA sidewall and the metal-air-substrate triple junction are the most strongly affected. We are currently leveraging this solver to explore geometries that will uniquely isolate the participation ratios of the different dielectrics. Finally, we are working to combine this solver framework with a full 3D microwave solver to accurately calculate participation ratios for the thin dielectrics that are known sources of loss in superconducting qubits.

Gimbutas, Z. [NIST, Boulder] (ORCID:00000003320982↗
NASA NTRSDate not supplied

NASA/ONERA Collaboration on Small Hovering Rotor Broadband Noise Prediction using Lattice-Boltzmann and Structured Navier-Stokes Solvers

This work compares two lattice-Boltzmann method solvers, PowerFLOW and ProLB, and two structured Navier-Stokes solvers, OVERFLOW2 and FAST, used by NASA and ONERA, respectively, for the broadband noise prediction of an ideally twisted rotor as part of Implementing Arrangement number FR-0685-0, ‘Comparing Computational Fluid Dynamics Solvers for Broadband Noise Prediction.’ Predicted results are evaluated against measured data from both smooth and rough blade sets acquired in the Small Hover Anechoic Chamber at the NASA Langley Research Center. Aerodynamic thrust predictions are seen to agree more favorably with the rough-blade measurements, whereas torque predictions agree better with the smooth-blade measurements. A tonal noise comparison shows better agreement to the measured data with the two structured Navier-Stokes solvers than with the two lattice-Boltzmann solvers, which is thought to be caused by the different geometric discretization associated with each solver paradigm. Broadband noise comparisons show that both lattice-Boltzmann method solvers trend well with the smooth-blade measurements, with the exception of an overprediction by ProLB between 4 kHz and 15 kHz. OVERFLOW2 is seen to capture the measured nondeterministic tonal content between 3 kHz and 8 kHz on a narrowband spectral basis and FAST agrees well with the rough blades on a one-third octave band basis.

Christopher S. Thurman↗
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.↗
DOE OSTI2026

Validation of the GFS model for gyrokinetic stability of NSTX pedestal data

This study presents a large database validation of the gyro fluid system (GFS) model for linear gyrokinetic stability for high-mode (H-mode) edge transport barrier conditions in the national spherical torus experiment (NSTX) tokamak. The database of linear stability calculations with the CGYRO gyrokinetic code was produced using plasma profile measurements from NSTX discharges to identify kinetic ballooning modes (KBM), trapped electron modes (TEM), and micro-tearing modes (MTM) that limit the pressure profile gradient in the H-mode barrier. A novel Bayesian optimization approach determines optimal resolution parameters for GFS specifically for spherical tokamak pedestal conditions. Our results demonstrate that GFS, with optimized resolution, can achieve accurate linear stability analysis in NSTX pedestal conditions for reduced resolution compared to CGYRO. GFS can accurately find the KBM, TEM, and MTM instability branches. Parametric analysis reveals that GFS accuracy in this extreme pedestal parameter range is degraded for low magnetic shear and near the separatrix conditions. These findings establish GFS as a fast linear eigenmode solver for spherical tokamak pedestal gyrokinetic stability and demonstrate a systematic methodology for determining the optimum resolution settings.

Yang, Minglei [Oak Ridge National Laboratory (ORNL↗
NASA NTRS1976

Advances in the application of fast semidirect computational methods in transonic flow

The paper uses finite-difference algorithms called 'fast direct elliptic solvers' within an iteration scheme for the rapid solution of the equations of inviscid transonic aerodynamics. The methods are called 'direct' (or semidirect) because the entire computational field is solved at once rather than in successive traverses over the field. These semidirect iterative methods have been limited here to the investigation of two-dimensional steady inviscid flow over airfoils in subsonic free stream.

Martin, E. D.↗
NASA NTRS1978

A split-recoupled-semidirect computational technique applied to transonic flow over lifting airfoils

A new version of the semidirect iterative method eliminates significant restrictions of previous versions of the method. A semidirect method solves finite-difference equations by a rapid globally implicit iterative process driven by a fast direct elliptic solver. The new approach can treat complex systems of equations in an efficient 'correction form', and allows the use of general, nonorthogonal, boundary-fitted coordinate transformations. These features are expected to lead to significant practical applications with conservation-equation systems in either two or three dimensions. The present application to the full potential equations for steady transonic flow over an airfoil at angle of attack illustrates the utility of the technique.

Martin, E. D.↗
NASA NTRS1985

Developement of an Optimum Interpolation Analysis Method for the CYBER 205

A state-of-the-art technique to assimilate the diverse observational database obtained during FGGE, and thus create initial conditions for numerical forecasts is described. The GLA optimum interpolation (OI) analysis method analyzes pressure, winds, and temperature at sea level, mixing ratio at six mandatory pressure levels up to 300 mb, and heights and winds at twelve levels up to 50 mb. Conversion to the CYBER 205 required a major re-write of the Amdahl OI code to take advantage of the CYBER vector processing capabilities. Structured programming methods were used to write the programs and this has resulted in a modular, understandable code. Among the contributors to the increased speed of the CYBER code are a vectorized covariance-calculation routine, an extremely fast matrix equation solver, and an innovative data search and sort technique.

Nestler, M. S.↗