Engineering Papers⌕ Search

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.

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

At least 955 records · Page 53

Pressure stability in explicitly coupled simulations of poromechanics with application to CO 2 sequestration

We study in detail the pressure stabilizing effects of the non-iterated fixed-stress splitting in poromechanical problems which are nearly undrained and incompressible. When applied in conjunction with a spatial discretization which does not satisfy the discrete inf–sup condition, namely a mixed piecewise linear–piecewise constant spatial discretization, the explicit fixed-stress scheme can have a pressure stabilizing effect in transient problems. This effect disappears, however, upon time step refinement or the attainment of steady state. The interpretation of the scheme as an Augmented Lagrangian method similar to Uzawa iteration for incompressible flow helps explain these results. Moreover, due to the slowly evolving solution within undrained seal regions, we show that the explicit fixed-stress scheme requires very large time steps to reveal its pressure stabilizing effect in examples of geologic CO 2 sequestration. We note that large time steps can result in large errors in drained regions, such as the aquifer or reservoir regions of these examples, and can prevent convergence of nonlinear solvers in the case of multiphase flows, which can make the explicit scheme an unreliable source of pressure stabilization. We conclude by demonstrating that pressure jump stabilization is as effective in the explicit fixed-stress setting as in the fully implicit setting for undrained problems, while maintaining the stability and convergence of the fixed-stress split for drained problems.

58 GEOSCIENCES↗

An empirical method for geometric calibration of a photon counting detector-based cone beam CT system

BACKGROUND: Geometric calibration is essential in developing a reliable computed tomography (CT) system. It involves estimating the geometry under which the angular projections are acquired. Geometric calibration of cone beam CTs employing small area detectors, such as currently available photon counting detectors (PCDs), is challenging when using traditional-based methods due to detectors’ limited areas. OBJECTIVE: This study presented an empirical method for the geometric calibration of small area PCD-based cone beam CT systems. METHODS: Unlike the traditional methods, we developed an iterative optimization procedure to determine geometric parameters using the reconstructed images of small metal ball bearings (BBs) embedded in a custom-built phantom. An objective function incorporating the sphericities and symmetries of the embedded BBs was defined to assess performance of the reconstruction algorithm with the given initial estimated set of geometric parameters. The optimal parameter values were those which minimized the objective function. The TIGRE toolbox was employed for fast tomographic reconstruction. To evaluate the proposed method, computer simulations were carried out using various numbers of spheres placed in various locations. Furthermore, efficacy of the method was experimentally assessed using a custom-made benchtop PCD-based cone beam CT. RESULTS: Computer simulations validated the accuracy and reproducibility of the proposed method. The precise estimation of the geometric parameters of the benchtop revealed high-quality imaging in CT reconstruction of a breast phantom. Within the phantom, the cylindrical holes, fibers, and speck groups were imaged in high fidelity. The CNR analysis further revealed the quantitative improvements of the reconstruction performed with the estimated parameters using the proposed method. CONCLUSION: Apart from the computational cost, we concluded that the method was easy to implement and robust.

Instruments & Instrumentation↗

Dark Energy Survey Year 6 Results: improved mitigation of spatially varying observational systematics with masking

As photometric surveys reach unprecedented statistical precision, systematic uncertainties increasingly dominate large-scale structure probes relying on galaxy number density. Defining the final survey footprint is critical, as it excludes regions affected by artefacts or suboptimal observing conditions. For galaxy clustering, spatially varying observational systematics, such as seeing, are a leading source of bias. Template maps of contaminants are used to derive spatially dependent corrections, but extreme values may fall outside the applicability range of mitigation methods, compromising correction reliability. The complexity and accuracy of systematics modelling depend on footprint conservativeness, with aggressive masking enabling simpler, robust mitigation. We present a unified approach to define the DES Year 6 joint footprint, integrating observational systematics templates and artefact indicators that degrade mitigation performance. This removes extreme values from an initial seed footprint, leading to the final joint footprint. By evaluating the DES Year 6 lens sample MagLim++ plus plus on this footprint, we enhance the Iterative Systematics Decontamination (ISD) method, detecting non-linear systematic contamination and improving correction accuracy. While the mask's impact on clustering is less significant than systematics decontamination, it remains non-negligible, comparable to statistical uncertainties in certain w(theta) scales and redshift bins. Supporting coherent analyses of galaxy clustering and cosmic shear, the final footprint spans 4031.04 deg2, setting the basis for DES Year 6 1x2pt, 2x2pt, and 3x2pt analyses. This work highlights how targeted masking strategies optimise the balance between statistical power and systematic control in Stage-III and -IV surveys.

Rodríguez-Monroy, M. [Madrid, IFT; IJCLab, Orsay]↗

Approximate optimal guidance for the advanced launch system

A real-time guidance scheme for the problem of maximizing the payload into orbit subject to the equations of motion for a rocket over a spherical, non-rotating earth is presented. An approximate optimal launch guidance law is developed based upon an asymptotic expansion of the Hamilton - Jacobi - Bellman or dynamic programming equation. The expansion is performed in terms of a small parameter, which is used to separate the dynamics of the problem into primary and perturbation dynamics. For the zeroth-order problem the small parameter is set to zero and a closed-form solution to the zeroth-order expansion term of Hamilton - Jacobi - Bellman equation is obtained. Higher-order terms of the expansion include the effects of the neglected perturbation dynamics. These higher-order terms are determined from the solution of first-order linear partial differential equations requiring only the evaluation of quadratures. This technique is preferred as a real-time, on-line guidance scheme to alternative numerical iterative optimization schemes because of the unreliable convergence properties of these iterative guidance schemes and because the quadratures needed for the approximate optimal guidance law can be performed rapidly and by parallel processing. Even if the approximate solution is not nearly optimal, when using this technique the zeroth-order solution always provides a path which satisfies the terminal constraints. Results for two-degree-of-freedom simulations are presented for the simplified problem of flight in the equatorial plane and compared to the guidance scheme generated by the shooting method which is an iterative second-order technique.

Feeley, T. S.↗

Mapping of electrical potential distributions with charged particle beams

Methods for measuring electrostatic potentials on and near dielectric surfaces charged to several kilovolts are studied. Secondary emission from those charged dielectrics is measured. Candidates for potential measurement include the induced charge, from which potential is calculated; the trajectory endpoints of either high or low energy particles traversing the region near the surface; trajectory impact on the surface; and creating ions at points of interest near the surface. Some of the methods require computer simulations and iterative calculation if potential maps are to be generated. Several approaches are described and compared. A method using a half-cylinder as a test chamber and low-energy probing beams is adapted for the measurement of seconary emission.

Robinson, J. W.↗

Determination of wind tunnel constraint effects by a unified pressure signature method. Part 1: Applications to winged configurations

A new, fast, non-iterative version of the "Wall Pressure Signature Method" is described and used to determine blockage and angle-of-attack wind tunnel corrections for highly-powered jet-flap models. The correction method is complemented by the application of tangential blowing at the tunnel floor to suppress flow breakdown there, using feedback from measured floor pressures. This tangential blowing technique was substantiated by subsequent flow investigations using an LV. The basic tests on an unswept, knee-blown, jet flapped wing were supplemented to include the effects of slat-removal, sweep and the addition of unflapped tips. C sub mu values were varied from 0 to 10 free-air C sub l's in excess of 18 were measured in some cases. Application of the new methods yielded corrected data which agreed with corresponding large tunnel "free air" resuls to within the limits of experimental accuracy in almost all cases. A program listing is provided, with sample cases.

Hackett, J. E.↗

Solving finite element equations on concurrent computers

This paper discusses the development of a concurrent algorithm for the solution of systems of equations arising in finite element applications. The approach is based on a hybrid of direct elimination method and preconditioned conjugate iteration. Two different preconditioners are used; diagonal scaling and a concurrent implementation of incomplete LU factorization. First, an automatic procedure is used to partition the finite element mesh into sub-structures. The particular mesh partition is chosen to minimize an estimate of the cost for evaluating the solution using this algorithm on a concurrent computer. These procedures are implemented in a finite element program on the JPL/CalTech MARK III hypercube computer. An overview of the structure of this program is presented. The performance of the solution method is demonstrated with the aid of a number of numerical test runs, and its advantages for concurrent implementations are discussed. Efficiency and speed-up factors over sequential machines for the numerical examples are highlighted.

Nour-Omid, B.↗

A Physics-Driven Deep-Learning Network for Solving Nonlinear Inverse Problems

Geosteering inversion, which can be viewed as a nonlinear inverse problem, is an important technique used by directional drilling. Traditional methods that rely on iterative procedures and regularization are sensitive to the selection of initial values and can be slow due to convergence issues. In industrial applications, a lookup table is used to produce fast predictions. However, performance is not guaranteed by this approach due to the limitation of the hardware. In this paper, we propose a novel physics-driven deep-learning framework for providing a fast, accurate surrogate to solve the inverse problem. Particularly, leveraged by the forward physical model and 1D convolutional neural network (1D-CNN), the proposed method provides more reliable solutions to the inverse problem with improved performance. In addition, a new physics-driven loss function is introduced to accommodate both the model misfit and the data misfit. In conclusion, our experiments demonstrate the effectiveness of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗

Constructing tensor network influence functionals for general quantum dynamics

Here, we describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

Numerical determination of the fundamental eigenvalue for the Laplace operator on a spherical domain

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (i.e., the membrane eignevalue problem for the vibration equation) on the unit spherical surface are developed. Two types of spherical surface domains are considered: the interior of a spherical triangle, and the exterior of a great circle arc extending for less than pi radians (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is employed. The fundamental eigenvalue is approximated by iteration utilizing the power method and point successive overrelaxation. Some numerical results are given and compared, in certain special cases, with analytical solutions to the eigenvalue problem. The significance of the numerical eigenvalue results is discussed in terms of the singularities in the solution of three-dimensional boundary-value problems near a polyhedral corner of the domain.

Walden, H.↗

Computer method for identification of boiler transfer functions

Iterative computer aided procedure was developed which provides for identification of boiler transfer functions using frequency response data. Method uses frequency response data to obtain satisfactory transfer function for both high and low vapor exit quality data.

Miles, J. H.↗

A terrain-dependent reference atmosphere determination method for available potential energy calculations

An iterative technique that determines the reference atmosphere which incorporates the effects of uneven surface topography is presented. This method has been successfully applied in several available potential energy studies. An alternative method due to Taylor is also evaluated. While Taylor presented excellent continuous formulations of the available potential energy that include topography, his method for determining the reference atmosphere distributions failed to provide the accuracy needed to produce reliable available potential energy estimates. Since topography has a significant influence on the general circulation, it is important to employ techniques that incorporate its effects in the determination of available potential energy.

Koehler, T. L.↗

Sensitivity Calculations for Systems with Polyethylene Reflector Materials Using CLUTCH

The SCALE 6.2.4 code package contains four sequences for calculating $k_{eff}$ sensitivity coefficients. Two of these sequences use deterministic transport solvers: a one-dimensional (1D) capability based on XSDRN, and a two-dimensional (2D) capability based on NEWT. These sequences are restricted to the multigroup (MG) treatment of neutron energy. The three-dimensional (3D) sequences use the KENO V.a or KENO-VI Monte Carlo transport codes and can be used to calculate sensitivity coefficients with either MG or continuous-energy (CE) transport. The 3D sensitivities are ultimately reported in an MG structure, regardless of the method used in the transport calculations. If desired, the sensitivity coefficients can be reported with very fine energy resolution from a CE calculation, but they are calculated only in the MG library structure in the MG mode. CE TSUNAMI methods are available in SCALE starting in SCALE version 6.2. Sensitivity coefficients were generated using the 3D sequences as part of the generation of the SCALE 6.2.2 Validation Report; difficulties encountered when using the CLUTCH method for thick, fissionable-material reflectors were discussed and investigated as documented in a previous paper. This paper discusses the difficulties encountered in generating accurate sensitivity coefficients using the CLUTCH technique for polyethylene reflectors for two fast spectrum benchmarks. Direct perturbation (DP) calculations were performed to confirm the accuracy of the total sensitivity coefficient for important isotopes with large sensitivities in the system. Discrepancies were detected for CLUTCH-calculated sensitivity coefficients in the reflector of a critical experiment with a radial polyethylene reflector. A simple polyethylene-reflected plutonium sphere was then used to further investigate the discrepancy. Calculations performed using the iterated fission probability (IFP) method generated accurate sensitivity coefficients in both cases. The results of this study emphasize the need to confirm CLUTCH sensitivity results with DP calculations. IFP calculations are generally less efficient but more reliable than CLUTCH calculations. Improvements to the CLUTCH methodology that retain the greater efficiency but address identified difficulties are therefore potentially useful to analysts.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A nonlinear, discrete-vortex-perturbation method for unsteady lifting-surface problems with edge separations

The nonlinear-discrete vortex method is coupled with a perturbation method to solve the problem of a rectangular wing with small oscillation about high angles of attack. The solution of the problem is based on decoupling the steady and unsteady effects. The steady part of the problem is a nonlinear one and is solved by the nonlinear-discrete vortex method. The unsteady part of the problem is a linear one and is solved directly without any iteration. So far, the developed method is restricted to flat rectangular surfaces with pitching oscillations. Total and distributed loads of several rectangular wings are presented as numerical results.

Kandil, O. A.↗

Description and use of LSODE, the Livermore Solver for Ordinary Differential Equations

LSODE, the Livermore Solver for Ordinary Differential Equations, is a package of FORTRAN subroutines designed for the numerical solution of the initial value problem for a system of ordinary differential equations. It is particularly well suited for 'stiff' differential systems, for which the backward differentiation formula method of orders 1 to 5 is provided. The code includes the Adams-Moulton method of orders 1 to 12, so it can be used for nonstiff problems as well. In addition, the user can easily switch methods to increase computational efficiency for problems that change character. For both methods a variety of corrector iteration techniques is included in the code. Also, to minimize computational work, both the step size and method order are varied dynamically. This report presents complete descriptions of the code and integration methods, including their implementation. It also provides a detailed guide to the use of the code, as well as an illustrative example problem.

Radhakrishnan, Krishnan↗

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗