Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative methods”

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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Spectral methods for inviscid, compressible flows

Report developments in the application of spectral methods to two dimensional compressible flows are reviewed. A brief introduction to spectral methods - their history and especially their implementation - is provided. The stress is on those techniques relevant to transonic flow computation. The spectral multigrid iterative methods are discussed with application to the transonic full potential equation. Discontinuous solutions of the Euler equations are considered. The key element is the shock fitting technique which is briefly explained.

Hussaini, M. Y.↗
NASA NTRS1993

Two-level Schwartz methods for nonconforming finite elements and discontinuous coefficients

Two-level domain decomposition methods are developed for a simple nonconforming approximation of second order elliptic problems. A bound is established for the condition number of these iterative methods, which grows only logarithmically with the number of degrees of freedom in each subregion. This bound holds for two and three dimensions and is independent of jumps in the value of the coefficients.

Sarkis, Marcus↗
NASA NTRSDate not supplied

Improvements in Iterative Convergence of FUN3D Solutions

This paper presents a hierarchical adaptive nonlinear iteration method (HANIM) implemented in NASA computational fluid dynamics code, FUN3D, to improve robustness and computational efficiency of FUN3Dsolutions. In contrast to the baseline iterative solver that relies on an approximate Jacobian, a simple multicolor Gauss-Seidel point-implicit iteration scheme, and linear CFL ramping, HANIM is based upon a hierarchy of modules including pre conditioner, generalized conjugate residual, realizability check, nonlinear control,and CFL adaption modules. HANIM performance is systematically compared with the performance of the baseline solver. The iterative solutions are compared for three aerodynamic benchmark cases: a subsonic separated flow around a hemisphere cylinder, a supersonic flow through a long duct, and a subsonic flow over the NASA wing-body juncture model. Two Reynolds-averaged Navier-Stokes turbulence models are used in these computations, namely, the negative variant of the linear one-equation Spalart-Allmar as model and its nonlinear extension based on quadratic constitutive relations.

Li Wang↗
NASA NTRSDate not supplied

Improvements in Iterative Convergence of FUN3D Solutions

This paper presents a hierarchical adaptive nonlinear iteration method (HANIM) implemented in the NASA computational fluid dynamics code, FUN3D, to improve robustness and computational efficiency. In contrast to the legacy FUN3D iterative solver that relies on an approximate Jacobian, a simple multicolor Gauss-Seidel point-implicit iteration scheme, and linear Courant-Friedrichs-Lewy number (CFL) ramping, HANIM is based upon a hierarchy of modules including preconditioner, generalized conjugate residual, realizability check, nonlinear control, and CFL adaption modules. HANIM performance is systematically compared with the performance of the legacy solver of FUN3D and a baseline solver based on a preconditioner alone. Iterative solutions are compared for three benchmark cases: a subsonic separated flow around a hemisphere cylinder, a supersonic flow through a long duct, and a subsonic flow over the NASA wing-fuselage juncture model. Two Reynolds-averaged Navier-Stokes turbulence models are used in these computations, namely, the negative variant of the linear one-equation Spalart-Allmaras model and its nonlinear extension based on quadratic constitutive relations.

CFD↗
DOE OSTI2026

Lyapunov-Based Iterative Learning of the Region of Attraction for Autonomous Systems

This presentation introduces a novel algorithm for estimating the region of attraction of equilibrium points for nonlinear discrete-time autonomous systems. The method iteratively expands an initial estimate of the region of attraction by constructing unions of sublevel sets of learned functions parametrized as neural networks. Unlike conventional techniques that rely on a single global Lyapunov function, the proposed approach provides a collection of local Lyapunov-like functions, enabling richer representations and potentially larger region of attraction estimates. These functions are trained using sampled state-space data, and their Lipschitz continuity ensures that desirable properties extend beyond the training samples. The devised strategy is tested via numerical simulations, demonstrating the effectiveness of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Global convergence of inexact Newton methods for transonic flow

In computational fluid dynamics, nonlinear differential equations are essential to represent important effects such as shock waves in transonic flow. Discretized versions of these nonlinear equations are solved using iterative methods. In this paper an inexact Newton method using the GMRES algorithm of Saad and Schultz is examined in the context of the full potential equation of aerodynamics. In this setting, reliable and efficient convergence of Newton methods is difficult to achieve. A poor initial solution guess often leads to divergence or very slow convergence. This paper examines several possible solutions to these problems, including a standard local damping strategy for Newton's method and two continuation methods, one of which utilizes interpolation from a coarse grid solution to obtain the initial guess on a finer grid. It is shown that the continuation methods can be used to augment the local damping strategy to achieve convergence for difficult transonic flow problems. These include simple wings with shock waves as well as problems involving engine power effects. These latter cases are modeled using the assumption that each exhaust plume is isentropic but has a different total pressure and/or temperature than the freestream.

Young, David P.↗
DOE OSTI2023

How to detect lensing rotation

Gravitational lensing rotation of images is predicted to be negligible at linear order in density perturbations, but can be produced by the post-Born lens-lens coupling at second order. This rotation is somewhat enhanced for Cosmic Microwave Background (CMB) lensing due to the large source path length, but remains small and very challenging to detect directly by CMB lensing reconstruction alone. We show the rotation may be detectable at high significance as a cross-correlation signal between the curl reconstructed with Simons Observatory (SO) or CMB-S4 data, and a template constructed from quadratic combinations of large-scale structure (LSS) tracers. Equivalently, the lensing rotation-tracer-tracer bispectrum can also be detected, where LSS tracers considered include the CMB lensing convergence, galaxy density, and the Cosmic Infrared Background (CIB), or optimal combinations thereof. We forecast that an optimal combination of these tracers can probe post-Born rotation at the level of 5.7σ–6.1σ with SO and 13.6σ–14.7σ for CMB-S4, depending on whether standard quadratic estimators or maximum a posteriori iterative methods are deployed. We also show possible improvement up to 21.3σ using a CMB-S4 deep patch observation with polarization-only iterative lensing reconstruction. However, these cross-correlation signals have non-zero bias because the rotation template is quadratic in the tracers, and exists even if the lensing is rotation free. We estimate this bias analytically, and test it using simple null-hypothesis simulations to confirm that the bias remains subdominant to the rotation signal of interest. Detection and then measurement of the lensing rotation cross-spectrum is therefore a realistic target for future observations.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗
NASA NTRS1989

Projection methods for the numerical solution of Markov chain models

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Saad, Youcef↗
NASA NTRS2010

Comparison of Iterative and Non-Iterative Strain-Gage Balance Load Calculation Methods

The accuracy of iterative and non-iterative strain-gage balance load calculation methods was compared using data from the calibration of a force balance. Two iterative and one non-iterative method were investigated. In addition, transformations were applied to balance loads in order to process the calibration data in both direct read and force balance format. NASA's regression model optimization tool BALFIT was used to generate optimized regression models of the calibration data for each of the three load calculation methods. This approach made sure that the selected regression models met strict statistical quality requirements. The comparison of the standard deviation of the load residuals showed that the first iterative method may be applied to data in both the direct read and force balance format. The second iterative method, on the other hand, implicitly assumes that the primary gage sensitivities of all balance gages exist. Therefore, the second iterative method only works if the given balance data is processed in force balance format. The calibration data set was also processed using the non-iterative method. Standard deviations of the load residuals for the three load calculation methods were compared. Overall, the standard deviations show very good agreement. The load prediction accuracies of the three methods appear to be compatible as long as regression models used to analyze the calibration data meet strict statistical quality requirements. Recent improvements of the regression model optimization tool BALFIT are also discussed in the paper.

Ulbrich, N.↗
DOE OSTI2023

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗
DOE OSTI2023

An implicit particle code with exact energy and charge conservation for electromagnetic studies of dense plasmas

A collisional particle code based on implicit energy- and charge-conserving methods is presented. A modified version of the particle-suppressed Jacobian-Free Newton-Krylov method that can enhance the solver efficiency is introduced. Mathematically, it is shown that this new approach can be viewed as a fixed-point iteration method for the particle positions. The model can exactly conserve global energy and local charge and can efficiently use time steps larger than the plasma period. In conclusion, the algorithm's ability to simulate dense plasmas accurately and efficiently is quantified by simulating the dynamic compression of a plasma slab via a magnetic piston in 1D planar geometry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Joint state-parameter estimation for the reduced fracture model via the united filter

Here, in this paper, we introduce an effective United Filter method for jointly estimating the solution state and physical parameters in flow and transport problems within fractured porous media. Fluid flow and transport in fractured porous media are critical in subsurface hydrology, geophysics, and reservoir geomechanics. Reduced fracture models, which represent fractures as lower-dimensional interfaces, enable efficient multi-scale simulations. However, reduced fracture models also face accuracy challenges due to modeling errors and uncertainties in physical parameters such as permeability and fracture geometry. To address these challenges, we propose a United Filter method, which integrates the Ensemble Score Filter (EnSF) for state estimation with the Direct Filter for parameter estimation. EnSF, based on a score-based diffusion model framework, produces ensemble representations of the state distribution without deep learning. Meanwhile, the Direct Filter, a recursive Bayesian inference method, estimates parameters directly from state observations. The United Filter combines these methods iteratively: EnSF estimates are used to refine parameter values, which are then fed back to improve state estimation. Numerical experiments demonstrate that the United Filter method surpasses the state-of-the-art Augmented Ensemble Kalman Filter, delivering more accurate state and parameter estimation for reduced fracture models. This framework also provides a robust and efficient solution for PDE-constrained inverse problems with uncertainties and sparse observations.

Bayesian inference↗
NASA NTRS1992

Intelligent process mapping through systematic improvement of heuristics

The present system for automatic learning/evaluation of novel heuristic methods applicable to the mapping of communication-process sets on a computer network has its basis in the testing of a population of competing heuristic methods within a fixed time-constraint. The TEACHER 4.1 prototype learning system implemented or learning new postgame analysis heuristic methods iteratively generates and refines the mappings of a set of communicating processes on a computer network. A systematic exploration of the space of possible heuristic methods is shown to promise significant improvement.

Ieumwananonthachai, Arthur↗
DOE OSTI2016

Application of Gauss's law space-charge limited emission model in iterative particle tracking method

The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

SU-E-T-270: Diffusion Synthetic Acceleration for Linear Boltzmann Transport Equation

Purpose: Linear Boltzmann transport equation (LBTE) is as accurate as the Monte Carlo method (MC) for dose calculation in photon/particle therapy (LBTE is a deterministic and Eulerian formulation and MC is a statistical and Lagrangian description). An advantage of LBTE is that numerous acceleration techniques can be utilized for acceleration. This work is to explore the acceleration of LBTE via diffusion synthetic acceleration (DSA). Methods: For simplicity, two-dimensional, steady-state, and within-group LBTE is considered with two angular dimensions and two spatial dimensions. The discrete ordinate method is developed for solving this integro-differential equation. The angular variables are discretized using a level-symmetric quadrature set on the unit sphere. The spatial variables are discretized on the structured grid based on the diamond scheme. The source-iteration method (SI) is used to solve the discretized system.Since SI is slow in optically thick and highly scattering regime. DSA is developed to accelerate SI. The motivation for DSA is that diffusion equation (DE) is a good approximation of LBTE in the above regime. However, DE is much cheaper than LBTE computationally since DE only involves spatial variables. Thus, in each DSA iteration, DSA adds to the SI step a computationally-negligible DE step, i.e., to first solve DE with the SI residual as source term, and then compensate the SI solution with DE solution. Results: DSA was benchmarked and compared with SI. The difference between two methods was within 0.12% which verifies the accuracy of DSA, while DSA demonstrated the great advantage in speed, e.g., the reduction of iteration number to 6% and 4% respectively for cases with 100 and 1,000 scattering-absorption ratio that commonly occur in clinical dose calculation. Conclusion: DSA has been developed as one of many possible means for accelerating the numerical solver of LBTE for dose calculation. The authors were partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000) and the Shanghai Pujiang Talent Program (#14PJ1404500)

60 APPLIED LIFE SCIENCES↗
NASA NTRS1971

Computation of solar wind parameters from the OGO-5 plasma spectrometer data using Hermite polynomials

The method used to calculate the velocity, temperature, and density of the solar wind plasma is presented from spectra obtained by attitude-stabilized plasma detectors on the earth satellite OGO 5. The method, which used expansions in terms of Hermite polynomials, is very inexpensive to implement on an electronic computer compared to the least-squares and other iterative methods often used for similar problems.

Neugebauer, M.↗
NASA NTRS1977

Cold plasma diagnostics using satellite measurements of VLF signals from ground transmitters

A diagnostic technique to obtain the cold-plasma density profile in the magnetosphere is introduced. This method uses satellite measurements of group delay and pulse duration of VLF signals from ground transmitters in conjunction with a detailed ray-tracing analysis. An iterative method is involved which starts with an approximate density profile, computes the ray paths for that profile, and then compares the properties of the rays that reach the satellite location with the actual satellite measurements. The density profile is then modified to account for any discrepancies between the two results. The same process is repeated with the new profile until one has reasonable agreement between the data and ray-tracing results. This method is applied to the case of an Imp 6 pass, where strong signals from the Siple VLF transmitter were observed for over 25 min. Good agreement is found between the results of the proposed technique and the well-known ground whistler techniques of cold-plasma diagnostics. The results also serve to illustrate the wide diversity of propagation paths from ground transmitters to high-altitude satellites during VLF wave-injection experiments.

Inan, U. S.↗