SEARCH · Engineering Papers

Results for “Iteration method”

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

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↗

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

NASA NTRS1971

A contracting-interval program for the Danilewski method

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

Harris, J. D.↗

NASA NTRS1975

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗

NASA NTRS1989

Efficient ICCG on a shared memory multiprocessor

Different approaches are discussed for exploiting parallelism in the ICCG (Incomplete Cholesky Conjugate Gradient) method for solving large sparse symmetric positive definite systems of equations on a shared memory parallel computer. Techniques for efficiently solving triangular systems and computing sparse matrix-vector products are explored. Three methods for scheduling the tasks in solving triangular systems are implemented on the Sequent Balance 21000. Sample problems that are representative of a large class of problems solved using iterative methods are used. We show that a static analysis to determine data dependences in the triangular solve can greatly improve its parallel efficiency. We also show that ignoring symmetry and storing the whole matrix can reduce solution time substantially.

Hammond, Steven W.↗

DOE OSTI2020

Survey of Dynamic Mode Decomposition Methods

Dynamic mode decomposition (DMD) is a data-driven reduced order modeling (ROM) technique used for dynamic systems. The widely adopted algorithm was first introduced and demonstrated on fluid flow data by Schmid. In recent years, various other fields, such as nuclear engineering, have begun to adopt this method. For example, DMD has been used for estimating α-eigenvalues, as an ROM for pulsed neutron problems, for predicting isotopic composition in burnup calculations, as acceleration techniques for iterative methods, and in capturing dynamic behaviors in molten salt reactor transients. This report seeks to demonstrate the capabilities and limits of the standard DMD algorithm, and identify problem spaces where variants may be better suited. The primary variant this report considers is Multi-Resolution DMD (mrDMD). Because this serves as a survey, synthetically produced data is used in lieu of simulation results. The remainder of this report will go into detail on the DMD theory, outline the standard DMD and mrDMD algorithms, present test cases highlighting the applicability of each, and finally present a discussion on how to determine the best suited algorithm for a given problem. All calculations performed in this report are carried out using the open source DMD library, PyDMD.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS1993

Gaussian-Beam/Physical-Optics Design Of Beam Waveguide

In iterative method of designing wideband beam-waveguide feed for paraboloidal-reflector antenna, Gaussian-beam approximation alternated with more nearly exact physical-optics analysis of diffraction. Includes curved and straight reflectors guiding radiation from feed horn to subreflector. For iterative design calculations, curved mirrors mathematically modeled as thin lenses. Each distance Li is combined length of two straight-line segments intersecting at one of flat mirrors. Method useful for designing beam-waveguide reflectors or mirrors required to have diameters approximately less than 30 wavelengths at one or more intended operating frequencies.

Veruttipong, Watt↗

NASA NTRS1943

The flow of a compressible fluid past a curved surface

An iteration method is employed to obtain the flow of a compressible fluid past a curved surface. The first approximation which leads to the Prandtl-Glauert rule, is based on the assumption that the flow differs but little from a pure translation. The iteration process then consists in improving this first approximation in order that it will apply to a flow differing from pure translatory motion to a greater degree. The method fails when the Mach number of the undisturbed stream reaches unity but permits a transition from subsonic to supersonic conditions without the appearance of a compression shock. The limiting value at which potential flow no longer exits is indicated by the apparent divergence of the power series representing the velocity of the fluid at the surface of the solid boundary.

Kaplan, Carl↗

NASA NTRS1982

RAXJET: A computer program for predicting transonic, axisymmetric flow over nozzle afterbodies with supersonic jet exhausts

A viscous-inviscid interaction method to calculate the subsonic and transonic flow over nozzle afterbodies with supersonic jet exhausts was developed. The method iteratively combines a relaxation solution of the full potential equation for the inviscid external flow, a shock capturing-shock fitting inviscid jet solution, an integral boundary layer solution, a control volume method for treating separated flows, and an overlaid mixing layer solution. A computer program called RAXJET which incorporates the method, illustrates the predictive capabilities of the method by comparison with experimental data is described, a user's guide to the computer program is provided. The method accurately predicts afterbody pressures, drag, and flow field properties for attached and separated flows for which no shock induced separation occurs.

Wilmoth, R. G.↗

NASA NTRSDate not supplied

Nonlinear Nonmodal Analysis of Hypersonic Flow over Blunt Cones

The linear amplification of modal disturbances that lead to boundary-layer transition in two-dimensional/axisymmetric hypersonic configurations is strongly reduced by the presence of a blunt nosetip, and the mechanisms underlying the observed onset of transition over the cone frustum are currently unknown. Linear nonmodal analysis has shown that both planar and oblique traveling disturbances that peak within the entropy layer experience appreciable energy amplification for moderate to large nosetip bluntness. The present study extends the previous linear analysis by including the nonlinear effects. Specifically, the perturbation form of the 2D, harmonic Navier-Stokes equations (HNSE) are solved with a fully implicit formulation and the Newton-Raphson method. The increased number of degrees of freedom for the nonlinear system presents difficulties for solution strategies based on direct solution of the linearized system. Such difficulties are overcome by using the GMRES iterative method with a preconditioner corresponding to a simplified Jacobian without the cross derivative terms. The HNSE solver is verified by comparing with nonlinear parabolized stability equation (NPSE) results for the nonlinear evolution of planar waves in an incompressible Blasius boundary layer and in a Mach 6 flow over a blunt cone. Finally, nonlinear nonmodal results are presented for planar traveling disturbances over the blunt cone. The nonmodal analysis demonstrates that entropy-layer disturbances generated close to the nose tip can seed the amplification of higher frequency Mack’s second-mode instabilities further downstream.

boundary layer transition↗

NASA NTRSDate not supplied

Nonlinear Nonmodal Analysis of Hypersonic Flow over Blunt Cones

boundary layer transition↗

NASA NTRS1971

The closure approximation in the hierarchy equations.

The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.

Adomian, G.↗

NASA NTRS1974

Transient cooling of solid bodies of classical form by radiation

An approximate analytic method is presented for analysis of the unsteady process of radiative cooling of solid bodies of classical form. The nonlinear heat transfer problem is solved by the cascade linearization technique with use of the iteration method. Comparison of the results obtained even in the first approximation with the available numerical solutions indicates adequate engineering accuracy of the proposed technique.

Novikov, V. S.↗

NASA NTRS1985

Two locations, two times, and the element set

A robust analytical formulation is developed to apply classical initial orbital determination to artificial satellites whose locations are uncertain to about 1 cu km and separated in time by no more than 30 min. An analytical simplification reduces Gauss's method, iteration on the semilatus rectum, iteration on the true anomaly, and the Lambert-Euler technique, to the solution of a single equation in one unknown, instead of the usual coupled triplet of three equations in three unknowns. The method is demonstrated for all common artificial satellite orbits over a variety of time intervals between the two location vectors, and for a varied set of position and distance errors.

Taff, L. G.↗