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.

SourceResearch connectionFrom yearThrough year

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

At least 433 records · Page 24

All sources NASA NTRS DOE OSTI

DOE OSTI2017

Large scale Brownian dynamics of confined suspensions of rigid particles

We introduce methods for large-scale Brownian Dynamics (BD) simulation of many rigid particles of arbitrary shape suspended in a fluctuating fluid. Our method adds Brownian motion to the rigid multiblob method [F. Balboa Usabiaga et al., Commun. Appl. Math. Comput. Sci. 11(2), 217–296 (2016)] at a cost comparable to the cost of deterministic simulations. We demonstrate that we can efficiently generate deterministic and random displacements for many particles using preconditioned Krylov iterative methods, if kernel methods to efficiently compute the action of the Rotne-Prager-Yamakawa (RPY) mobility matrix and its “square” root are available for the given boundary conditions. These kernel operations can be computed with near linear scaling for periodic domains using the positively split Ewald method. Here we study particles partially confined by gravity above a no-slip bottom wall using a graphical processing unit implementation of the mobility matrix-vector product, combined with a preconditioned Lanczos iteration for generating Brownian displacements. We address a major challenge in large-scale BD simulations, capturing the stochastic drift term that arises because of the configuration-dependent mobility. Unlike the widely used Fixman midpoint scheme, our methods utilize random finite differences and do not require the solution of resistance problems or the computation of the action of the inverse square root of the RPY mobility matrix. We construct two temporal schemes which are viable for large-scale simulations, an Euler-Maruyama traction scheme and a trapezoidal slip scheme, which minimize the number of mobility problems to be solved per time step while capturing the required stochastic drift terms. We validate and compare these schemes numerically by modeling suspensions of boomerang-shaped particles sedimented near a bottom wall. Using the trapezoidal scheme, we investigate the steady-state active motion in dense suspensions of confined microrollers, whose height above the wall is set by a combination of thermal noise and active flows. We find the existence of two populations of active particles, slower ones closer to the bottom and faster ones above them, and demonstrate that our method provides quantitative accuracy even with relatively coarse resolutions of the particle geometry.

97 MATHEMATICS AND COMPUTING↗

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↗

DOE OSTI2018

Position reconstruction in LUX

The (x, y) position reconstruction method used in the analysis of the complete exposure of the Large Underground Xenon (LUX) experiment is presented. The algorithm is based on a statistical test that makes use of an iterative method to recover the photomultiplier tube (PMT) light response directly from the calibration data. The light response functions make use of a two dimensional functional form to account for the photons reflected on the inner walls of the detector. To increase the resolution for small pulses, a photon counting technique was employed to describe the response of the PMTs. The reconstruction was assessed with calibration data including 83m Kr (releasing a total energy of 41.5 keV) and 3 H (β - with Q = 18.6 keV) decays, and a deuterium-deuterium (D-D) neutron beam (2.45 MeV). Within the detector's fiducial volume, the reconstruction has achieved an (x, y) position uncertainty of σ = 0.82 cm and σ = 0.17 cm for events of only 200 and 4,000 detected electroluminescence photons respectively. Such signals are associated with electron recoils of energies ~0.25 keV and ~10 keV, respectively. Lastly, the reconstructed position of the smallest events with a single electron emitted from the liquid surface (22 detected photons) has a horizontal (x, y) uncertainty of 2.13 cm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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

DOE OSTI2016

Denoised Wigner distribution deconvolution via low-rank matrix completion

Wigner distribution deconvolution (WDD) is a decades-old method for recovering phase from intensity measurements. Although the technique offers an elegant linear solution to the quadratic phase retrieval problem, it has seen limited adoption due to its high computational/memory requirements and the fact that the technique often exhibits high noise sensitivity. Here, we propose a method for noise suppression in WDD via low-rank noisy matrix completion. Our technique exploits the redundancy of an object’s phase space to denoise its WDD reconstruction. We show in model calculations that our technique outperforms other WDD algorithms as well as modern iterative methods for phase retrieval such as ptychography. Here, our results suggest that a class of phase retrieval techniques relying on regularized direct inversion of ptychographic datasets (instead of iterative reconstruction techniques) can provide accurate quantitative phase information in the presence of high levels of noise.

47 OTHER INSTRUMENTATION↗

DOE OSTI2019

Convergence analysis of Anderson-type acceleration of Richardson's iteration

We consider here Anderson extrapolation to accelerate the (stationary) Richardson iterative method for sparse linear systems. Using an Anderson mixing at periodic intervals, we assess how this benefits convergence to a prescribed accuracy. The method, named alternating Anderson–Richardson, has appealing properties for high-performance computing, such as the potential to reduce communication and storage in comparison to more conventional linear solvers. We establish sufficient conditions for convergence, and we evaluate the performance of this technique in combination with various preconditioners through numerical examples. Furthermore, we propose an augmented version of this technique.

97 MATHEMATICS AND COMPUTING↗

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

NASA NTRS1986

Preconditioning matrices for Chebyshev derivative operators

The problem of preconditioning the matrices arising from pseudo-spectral Chebyshev approximations of first order operators is considered in both one and two dimensions. In one dimension a preconditioner represented by a full matrix which leads to preconditioned eigenvalues that are real, positive, and lie between 1 and pi/2, is already available. Since there are cases in which it is not computationally convenient to work with such a preconditioner, a large number of preconditioners were studied which were more sparse (in particular three and four diagonal matrices). The eigenvalues of such preconditioned matrices are compared. The results were applied to the problem of finding the steady state solution to an equation of the type u sub t = u sub x + f, where the Chebyshev collocation is used for the spatial variable and time discretization is performed by the Richardson method. In two dimensions different preconditioners are proposed for the matrix which arises from the pseudo-spectral discretization of the steady state problem. Results are given for the CPU time and the number of iterations using a Richardson iteration method for the unpreconditioned and preconditioned cases.

Rothman, Ernest E.↗

NASA NTRS1990

Extension of transonic flow computational concepts in the analysis of cavitated bearings

An analogy between the mathematical modeling of transonic potential flow and the flow in a cavitating bearing is described. Based on the similarities, characteristics of the cavitated region and jump conditions across the film reformation and rupture fronts are developed using the method of weak solutions. The mathematical analogy is extended by utilizing a few computational concepts of transonic flow to numerically model the cavitating bearing. Methods of shock fitting and shock capturing are discussed. Various procedures used in transonic flow computations are adapted to bearing cavitation applications, for example, type differencing, grid transformation, an approximate factorization technique, and Newton's iteration method. These concepts have proved to be successful and have vastly improved the efficiency of numerical modeling of cavitated bearings.

Vijayaraghavan, D.↗