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 1,585 records · Page 88
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

Research study on stabilization and control modern sampled-data control theory

The methods of continuous and discrete describing function analysis were applied to predicting the existence of self-sustained oscillations in the single-axis model of the large space telescope system with nonlinear control moment gyroscope friction characteristics. It is shown that the stability equations may be solved by a numerical-iterative technique using the describing function analysis, instead of the usual graphical methods. The numerical method is found to be effective in leading to a convergent solution rapidly, with an appropriate guess of the initial condition.

Kuo, B. C.↗
NASA NTRS1975

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗
NASA NTRS2009

Rate-Compatible LDPC Codes with Linear Minimum Distance

A recently developed method of constructing protograph-based low-density parity-check (LDPC) codes provides for low iterative decoding thresholds and minimum distances proportional to block sizes, and can be used for various code rates. A code constructed by this method can have either fixed input block size or fixed output block size and, in either case, provides rate compatibility. The method comprises two submethods: one for fixed input block size and one for fixed output block size. The first mentioned submethod is useful for applications in which there are requirements for rate-compatible codes that have fixed input block sizes. These are codes in which only the numbers of parity bits are allowed to vary. The fixed-output-blocksize submethod is useful for applications in which framing constraints are imposed on the physical layers of affected communication systems. An example of such a system is one that conforms to one of many new wireless-communication standards that involve the use of orthogonal frequency-division modulation

Divsalar, Dariush↗
NASA NTRS1988

Iterative finite element solver on transputer networks

The parallelism inherent in the Conjugate Gradient method is described. The initial results of a parallel implementation on a network of twelve transputers are discussed. The high efficiencies obtained indicate that significant speedup can be obtained with larger transputer arrays if communication overhead can be kept low. To this end, a method of communication that allows large, dynamically reconfigurable transputer arrays to exchange data in log sub 4 N steps for N processors is suggested.

Danial, Albert↗
NASA NTRSDate not supplied

Transition Modeling Based on the Dual N-factor Method for the CRM-NLF Wind Tunnel Configuration

The dual N-factor method is used to model the boundary-layer transition over the common research model with natural laminar flow (CRM-NLF) aircraft configuration. The flow conditions match selected test conditions from a wind tunnel experiment in the National Transonic Facility at the NASA Langley Research Center. The paper presents a systematic methodology for transition prediction in the presence of a dual shock system and extends the prior capability for iteratively coupled computational fluid dynamics (CFD) predictions to incorporate three-dimensional, transonic wings. The method employs stability computations based on the linear parabolized stability equations (PSE), along with a dual N-factor criterion. The iterative process begins with the fully turbulent Reynolds-averaged-Navier-Stokes (RANS) mean flow solution. For the first iteration, a mean flow solution is calculated with an imposed transition front that aligns with the shock front from the fully turbulent solution. Subsequently, stability computations are performed along a set of streamlines across the wing to calculate the amplification of planar Tollmien-Schlichting (TS) and stationary crossflow (CF) modes. The transition criterion based on the dual N-factor method is used to infer the updated transition front and the process is successively repeated until convergence of the solution. Within three iterations, the predicted fronts for angles of attack of 1.45, 1.98, 2.46 and 2.94 degrees and a mean-aerodynamic-chord Reynolds number equal to 15 million, approach visual convergence in most regions of the studied cases, and the resulting predictions are in good agreement with the transition fronts deduced from measurements of temperature-sensitive paint. Even though surface pressure measurements based on fully-turbulent flow agree well with the measured pressure coefficient distributions, strong viscous-inviscid interaction effects cause significant shifts in the shock locations based on the imposed transition front, underscoring the intrusive nature of static pressure measurements using surface mounted ports on the CRM-NLF configuration.

Boundary Layer Transition↗
NASA NTRS2004

Model of Atmospheric Links on Optical Communications from High Altitude

Optical communication links have the potential to solve many of the problems of current radio and microwave links to satellites and high-altitude aircraft. The higher frequency involved in optical systems allows for significantly greater signal bandwidth, and thus information transfer rate, in excess of 10 Gbps, and the highly directional nature of laser-based signals eliminates the need for frequency-division multiplexing seen in radio and microwave links today. The atmosphere, however, distorts an optical signal differently than a microwave signal. While the ionosphere is one of the most significant sources of noise and distortion in a microwave or radio signal, the lower atmosphere affects an optical signal more significantly. Refractive index fluctuations, primarily caused by changes in atmospheric temperature and density, distort the incoming signal in both deterministic and nondeterministic ways. Additionally, suspended particles, such as those in haze or rain, further corrupt the transmitted signal. To model many of the atmospheric effects on the propagating beam, we use simulations based on the beam-propagation method. This method, developed both for simulation of signals in waveguides and propagation in atmospheric turbulence, separates the propagation into a diffraction and refraction problem. The diffraction step is an exact solution, within the limits of numerical precision, to the problem of propagation in free space, and the refraction step models the refractive index variances over a segment of the propagation path. By applying refraction for a segment of the propagation path, then diffracting over that same segment, this method forms a good approximation to true propagation through the atmospheric medium. Iterating over small segments of the total propagation path gives a good approximation to the problem of propagation over the entire path. Parameters in this model, such as initial beam profile and atmospheric constants, are easily modified in a simulation such as this, which allows for the rapid analysis of different propagation scenarios. Therefore, this method allows the development of a near-optimal system design for a wide range of situations, typical of what would be seen in different atmospheric conditions over a receiving ground station. A simulation framework based upon this model was developed in FORTRAN, and for moderate grid sizes and propagation distances these simulations are computable in reasonable time on a standard workstation. This presentation will discuss results thus far.

Subich, Christopher↗
DOE OSTI2024

Pressure-stabilized fixed-stress iterative solutions of compositional poromechanics

We consider the numerical behavior of the fixed-stress splitting method for coupled poromechanics as undrained regimes are approached. We explain that pressure stability is related to the splitting error of the scheme, not the fact that the discrete saddle point matrix never appears in the fixed-stress approach. This observation reconciles previous results regarding the pressure stability of the splitting method. Using examples of compositional poromechanics with application to geological CO sequestration, we see that solutions obtained using the fixed-stress scheme with a low order finite element-finite volume discretization which is not inherently inf-sup stable can exhibit the same pressure oscillations obtained with the corresponding fully implicit scheme. Moreover, pressure jump stabilization can effectively remove these spurious oscillations in the fixed-stress setting, while also improving the efficiency of the scheme in terms of the number of iterations required at every time step to reach convergence.

42 ENGINEERING↗
NASA NTRS1995

A deterministic particle method for one-dimensional reaction-diffusion equations

We derive a deterministic particle method for the solution of nonlinear reaction-diffusion equations in one spatial dimension. This deterministic method is an analog of a Monte Carlo method for the solution of these problems that has been previously investigated by the author. The deterministic method leads to the consideration of a system of ordinary differential equations for the positions of suitably defined particles. We then consider the time explicit and implicit methods for this system of ordinary differential equations and we study a Picard and Newton iteration for the solution of the implicit system. Next we solve numerically this system and study the discretization error both analytically and numerically. Numerical computation shows that this deterministic method is automatically adaptive to large gradients in the solution.

Mascagni, Michael↗
DOE OSTI2022

Deblurring galaxy images with Tikhonov regularization on magnitude domain

Abstract We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and is much worse than space-based telescopes. This circumstance has generated considerable research interest in the restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linearly in space. The significant deviation between the assumption and real situations leads to blurring of the images and smoothing out the detailed structures. Clearly, regularization on logarithmic domain, i.e., magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on a magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal–dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noise. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the deblurred images and significantly outperforms the conventional methods. The code is publicly available from the GitHub 〈https://github.com/kzmurata-astro/PSFdeconv_amag〉.

Murata, Kazumi↗
NASA NTRS1994

The Dynamics of Some Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations is analyzed using the theory of dynamical systems. With the aid of parallel Connection Machines (CM-2 and CM-5), the associated bifurcation diagrams as a function of the time step, and the complex behavior of the associated 'numerical basins of attraction' of these iterative implicit schemes are revealed and compared. Studies showed that all of the four implicit LMMs exhibit a drastic distortion and segmentation but less shrinkage of the basin of attraction of the true solution than standard explicit methods. The numerical basins of attraction of a noniterative implicit procedure mimic more closely the basins of attraction of the differential equations than the iterative implicit procedures for the four implicit LMMs.

Yee, H. C.↗
NASA NTRS1981

A Quasi-Parabolic technique for computation of three-dimensional viscous flows

A computational technique is presented for obtaining flowfield solutions to a parabolic form of the Navier-Stokes equations. The point of departure is the General Interpolant Method (GIM) which provides a discretization for partial differential equations on arbitrary three-dimensional geometries. The new scheme, termed Quasi-Parabolic, treats the parabolized equations but with 'time-like' terms appended. Addition of these extra terms, which are relaxed by iteration, avoid many of the singularities inherent in classical parabolic Navier-Stokes methods. Streamwise derivatives are approximated by three-point backward differences and the cross plane operators use an alternating forward-backward sweep. A two-step sequence is used to implement the difference scheme in the spatial dimensions and a time-like relaxation converges the quasi-parabolic procedure at each plane. Solutions are presented for flows in two and three dimensions. Inviscid flows are solved for internal and external applications and viscous flows in boundary layers and free shear layers are also computed with the GIM/Quasi-Parabolic scheme.

Spradley, L. W.↗
DOE OSTI2025

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗
NASA NTRS1971

Methods of obtaining stability derivatives

Various methods of obtaining aerodynamic derivatives are reviewed. These methods include wind-tunnel tests, aerodynamic theory, and extraction from flight tests, with the emphasis being on flight tests. Two techniques for extracting derivatives from flight are covered in sufficient detail to indicate the procedures involved. These methods are a strict least-squares approach and an iteration technique. References are listed for additional background and details of various techniques.

M. J. Queijo↗
NASA NTRS1973

Advanced beaded and tubular structural panels.

A review is presented of an NASA program to develop light-weight beaded and tubular structural panels which can be applied where beaded external surfaces are acceptable aerodynamically or where primary structure is protected by heat shields. The design shapes were obtained with an optimization computer code which iterates geometric parameters to satisfy strength, stability and weight constraints. Methods of fabricating these new configurations are discussed. Nondestructive testing produced extensive combined compression, shear and bending test data on local buckling specimens and large panels. The optimized design concepts offer 25 to 40% weight savings compared to conventional stiffened sheet construction.

Musgrove, M. D.↗