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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Fast iterative refinement method for mixed systems of integral and fractional integro-differential equations

The authors’ new method of iterative refinement has been successfully applied to the linear fractional Fredholm integro-differential equation. In this work, we adapt our method to obtain approximate analytical solutions for linear Volterra equations of both the first and the second kind of fractional type. A detailed convergence analysis is presented for each kind. The authors also apply their method to the challenging first kind linear Fredholm integral equation. Three different cases are considered to test the efficacy of our method. These include mixed systems of various forms of linear integral and fractional integro-differential equations. We compare our method with six well-established methods: Picard’s successive approximations, an accelerated form of the latter, the Adomian decomposition, the variational iteration, the homotopy perturbation and the homotopy analysis. The results show the versatility of the new method in solving a wide variety of equations, its high convergence speed and accuracy and its capability of directly dealing with equations of the first kind. We also prove that Picard’s method for linear equations is a special case of our method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Error analysis applied to several inversion techniques used for the retrieval of middle atmospheric constituents from limb-scanning MM-wave spectroscopic measurements

The formal retrieval error analysis of Rodgers (1990) allows the quantitative determination of such retrieval properties as measurement error sensitivity, resolution, and inversion bias. This technique was applied to five numerical inversion techniques and two nonlinear iterative techniques used for the retrieval of middle atmospheric constituent concentrations from limb-scanning millimeter-wave spectroscopic measurements. It is found that the iterative methods have better vertical resolution, but are slightly more sensitive to measurement error than constrained matrix methods. The iterative methods converge to the exact solution, whereas two of the matrix methods under consideration have an explicit constraint, the sensitivity of the solution to the a priori profile. Tradeoffs of these retrieval characteristics are presented.

Puliafito, E.↗
DOE OSTI2015

Reducing the effects of acoustic heterogeneity with an iterative reconstruction method from experimental data in microwave induced thermoacoustic tomography

Purpose: An iterative reconstruction method has been previously reported by the authors of this paper. However, the iterative reconstruction method was demonstrated by solely using the numerical simulations. It is essential to apply the iterative reconstruction method to practice conditions. The objective of this work is to validate the capability of the iterative reconstruction method for reducing the effects of acoustic heterogeneity with the experimental data in microwave induced thermoacoustic tomography. Methods: Most existing reconstruction methods need to combine the ultrasonic measurement technology to quantitatively measure the velocity distribution of heterogeneity, which increases the system complexity. Different to existing reconstruction methods, the iterative reconstruction method combines time reversal mirror technique, fast marching method, and simultaneous algebraic reconstruction technique to iteratively estimate the velocity distribution of heterogeneous tissue by solely using the measured data. Then, the estimated velocity distribution is used subsequently to reconstruct the highly accurate image of microwave absorption distribution. Experiments that a target placed in an acoustic heterogeneous environment are performed to validate the iterative reconstruction method. Results: By using the estimated velocity distribution, the target in an acoustic heterogeneous environment can be reconstructed with better shape and higher image contrast than targets that are reconstructed with a homogeneous velocity distribution. Conclusions: The distortions caused by the acoustic heterogeneity can be efficiently corrected by utilizing the velocity distribution estimated by the iterative reconstruction method. The advantage of the iterative reconstruction method over the existing correction methods is that it is successful in improving the quality of the image of microwave absorption distribution without increasing the system complexity.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

SU-D-17A-03: 5D Respiratory Motion Model Based Iterative Reconstruction Method for 4D Cone-Beam CT

Purpose: The purpose of this work is to develop a new iterative reconstruction method for 4D cone-beam CT (CBCT) based on a published time-independent 5D respiratory motion model. The proposed method will offer a single high-resolution image at a user-selected breathing phase and the 5D motion model parameters, which could be used to generate the breathing pattern during the CT acquisition. Methods: 5D respiratory motion model was proposed for accurately modeling the motion of lung and lung tumor tissues. 4D images are then parameterized by a reference image, measured breathing amplitude, breathing rate, two time-independent vector fields that describe the 5D model parameters, and a scalar field that describes the change in HU as a function of breathing amplitude. In contrast with the traditional method of reconstructing multiple temporal image phases to reduce respiratory artifact, 5D model based method simplify the problem into the reconstruction of a single reference image and the 5D motion model parameters. The reconstruction formulation of the reference image and scalar and vector fields is a nonlinear least-square optimization problem that consists of solving the reference image and fields alternately, in which the reference image is regularized with the total variation sparsity transform and the vector fields are solved through linearizations regularized by the H1 norm. 2D lung simulations were performed in this proof-of-concept study. Results: The breathing amplitude, its rate, and the corresponding scalar and vector fields were generated from a patient case. Compared with filtered backprojection method and sparsity regularized iterative method for the phase-by-phase reconstruction, the proposed 5D motion model based method yielded improved image quality. Conclusion: Based on 5D respiratory motion model, we have developed a new iterative reconstruction method for 4D CBCT that has the potential for improving image quality while providing needed on-table motion information.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Application of hat basis functions for solving two-dimensional stochastic fractional integral equations

This article concerns with a computational scheme to solve two-dimensional stochastic fractional integral equations (2DSFIEs), numerically. In these equations, the fractional integral is considered in the Riemann–Liouville sense. The proposed method is essentially based on two-dimensional hat basis functions and its fractional operational matrices. The fractional-order operational matrices of integration are applied to reduce the solution of 2DSFIEs to the solution of a system of linear equations which can be solved using a direct method or iterative method. Some results concerning the convergence analysis associated with the proposed technique are discussed. In addition, we establish the rate of convergence of this approach for solving 2DSFIEs is O(h{sup 2}). Finally, some examples are solved using present method to indicate the pertinent features of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Accurate nonrelativistic ground-state energies of 3d transition metal atoms

We present accurate nonrelativistic ground-state energies of the transition metal atoms of the 3d series calculated with Fixed-Node Diffusion Monte Carlo (FN-DMC). Selected multi-determinantal expansions obtained with the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) method and including the most prominent determinants of the full configuration interaction expansion are used as trial wavefunctions. Using a maximum of a few tens of thousands determinants, fixed-node errors on total DMC energies are found to be greatly reduced for some atoms with respect to those obtained with Hartree-Fock nodes. To the best of our knowledge, the FN-DMC/(CIPSI nodes) ground-state energies presented here are the lowest variational total energies reported so far. They differ from the recently recommended non-variational values of McCarthy and Thakkar [J. Chem. Phys. 136, 054107 (2012)] only by a few percents of the correlation energy. Thanks to the variational property of FN-DMC total energies, our results provide exact lower bounds for the absolute value of all-electron correlation energies, |E{sub c}|.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

MO-DE-207A-07: Filtered Iterative Reconstruction (FIR) Via Proximal Forward-Backward Splitting: A Synergy of Analytical and Iterative Reconstruction Method for CT

Purpose: This work is to develop a general framework, namely filtered iterative reconstruction (FIR) method, to incorporate analytical reconstruction (AR) method into iterative reconstruction (IR) method, for enhanced CT image quality. Methods: FIR is formulated as a combination of filtered data fidelity and sparsity regularization, and then solved by proximal forward-backward splitting (PFBS) algorithm. As a result, the image reconstruction decouples data fidelity and image regularization with a two-step iterative scheme, during which an AR-projection step updates the filtered data fidelity term, while a denoising solver updates the sparsity regularization term. During the AR-projection step, the image is projected to the data domain to form the data residual, and then reconstructed by certain AR to a residual image which is in turn weighted together with previous image iterate to form next image iterate. Since the eigenvalues of AR-projection operator are close to the unity, PFBS based FIR has a fast convergence. Results: The proposed FIR method is validated in the setting of circular cone-beam CT with AR being FDK and total-variation sparsity regularization, and has improved image quality from both AR and IR. For example, AIR has improved visual assessment and quantitative measurement in terms of both contrast and resolution, and reduced axial and half-fan artifacts. Conclusion: FIR is proposed to incorporate AR into IR, with an efficient image reconstruction algorithm based on PFBS. The CBCT results suggest that FIR synergizes AR and IR with improved image quality and reduced axial and half-fan artifacts. The authors was partially supported by the NSFC (#11405105), the 973 Program (#2015CB856000), and the Shanghai Pujiang Talent Program (#14PJ1404500).

60 APPLIED LIFE SCIENCES↗
NASA NTRS1989

Two-measured variable method for wall interference assessment/correction

An iterative method for wall interference assessment and/or correction is presented for transonic flow conditions in wind tunnels equipped with two component velocity measurements on a single interface. The iterative method does not require modeling of the test article and tunnel wall boundary conditions. Analytical proof for the convergence and stability of the iterative method is shown in the subsonic flow regime. The numerical solutions are given for both 2-D and axisymmetrical cases at transonic speeds with the application of global Mach number correction.

Lo, C. F.↗
DOE OSTI2011

Full configuration-interaction calculations with the simplest iterative complement method: Merit of the inverse Hamiltonian

The simplest iterative complement (SIC) calculations starting from Hartree-Fock and giving full configuration interaction (CI) at convergence were performed using regular and inverse Hamiltonians. Each iteration step is variational and involves only one variable. The convergence was slow when we used the regular Hamiltonian, but became very fast when we used the inverse Hamiltonian. This difference is due to the Coulomb singularity problem inherent in the regular Hamiltonian; the inverse Hamiltonian does not have such a problem. For this reason, the merit of the inverse Hamiltonian over the regular one becomes even more dramatic when we use a better-quality basis set. This was seen by comparing the calculations due to the minimal and double-{zeta} basis sets. Similar problematic situations exist in the Krylov sequence and in the Lanczos and Arnoldi methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

An Improved Weighted Least Squares Algorithm for the Analysis of Strain-Gage Balance Calibration Data

An improved version of an algorithm is presented that uses a weighted least squares fit of balance calibration data for the generation of the balance load prediction equations. The weighted least squares fit assigns a weighting factor between zero and one to each calibration data point that depends on a simple count of the number of intentionally loaded balance gages. The greater the number of the loaded gages is, the smaller a data point's weighting factor becomes. This strategy has two advantages. First, single-component loads become more influential during the regression analysis of the calibration data. In addition, the negative influence of load schedule asymmetries on the regression analysis results can more effectively be controlled. The original algorithm of 2017 was improved in 2020. Now, gage output differences relative to the natural zeros are exclusively used as input for the determination of the number of intentionally loaded gages. The improved weighted least squares fit can be applied with both the Non-Iterative Method and the Iterative Method that are used for the balance load prediction in the aerospace testing community. Machine calibration data of a force balance is used to illustrate benefits of the application of the improved weighted least squares fit of balance calibration data.

strain-gage balance↗
NASA NTRSDate not supplied

Analysis and Evaluation of NASA's MK40B Six-Component TASK Balance

The paper discusses the physical characteristics NASA's MK40B TASK balance. It is NASA's newest TASK balance that was optimized for the testing of wind tunnel models in the NASA Ames 11-ft Transonic Wind Tunnel. The calibration data of the MK40B balance was obtained in Calspan's Automatic Balance Calibration System. A machine load schedule design was used for the calibration that was developed at the NASA Ames Balance Calibration Laboratory. The calibration data was analyzed using both the Non-Iterative Method and the Iterative Method. Then, the chosen regression models of the calibration data were assessed and compared using the percent contribution, the variance inflation factor, and the calibration load residuals. Interactions of single-component loads were also quantified. In addition, the bi-directional characteristics of the six gage outputs of the balance were assessed by applying a semi-empirical test that was developed at the Ames Balance Calibration Laboratory. It was concluded that four of the six gages of the balance have bi-directional characteristics. Finally, the accuracy of the load prediction equations of the balance was tested by applying the equations to independent check load data that was obtained at the NASA Ames Balance Calibration Laboratory. The standard deviation of the check load residuals met expectations. The check load data also confirmed that the interactions of the forward and aft normal forces on the axial force gage output are very small. - This paper is to be presented in the invited special session titled: "65 Years of TASK Wind Tunnel Balances - Past, Present, and Future".

wind tunnel balance↗
DOE OSTI2016

SU-D-206-03: Segmentation Assisted Fast Iterative Reconstruction Method for Cone-Beam CT

Purpose: Total Variation (TV) based iterative reconstruction (IR) methods enable accurate CT image reconstruction from low-dose measurements with sparse projection acquisition, due to the sparsifiable feature of most CT images using gradient operator. However, conventional solutions require large amount of iterations to generate a decent reconstructed image. One major reason is that the expected piecewise constant property is not taken into consideration at the optimization starting point. In this work, we propose an iterative reconstruction method for cone-beam CT (CBCT) using image segmentation to guide the optimization path more efficiently on the regularization term at the beginning of the optimization trajectory. Methods: Our method applies general knowledge that one tissue component in the CT image contains relatively uniform distribution of CT number. This general knowledge is incorporated into the proposed reconstruction using image segmentation technique to generate the piecewise constant template on the first-pass low-quality CT image reconstructed using analytical algorithm. The template image is applied as an initial value into the optimization process. Results: The proposed method is evaluated on the Shepp-Logan phantom of low and high noise levels, and a head patient. The number of iterations is reduced by overall 40%. Moreover, our proposed method tends to generate a smoother reconstructed image with the same TV value. Conclusion: We propose a computationally efficient iterative reconstruction method for CBCT imaging. Our method achieves a better optimization trajectory and a faster convergence behavior. It does not rely on prior information and can be readily incorporated into existing iterative reconstruction framework. Our method is thus practical and attractive as a general solution to CBCT iterative reconstruction. This work is supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. LR16F010001), National High-tech R&D Program for Young Scientists by the Ministry of Science and Technology of China (Grant No. 2015AA020917).

60 APPLIED LIFE SCIENCES↗
NASA NTRSDate not supplied

Comparison of Two Load Prediction Methods for Strain-Gage Balances

Data from a high-capacity semi-span balance is used to perform a detailed comparison of the load prediction accuracy of two strain-gage balance load prediction methods. Both methods independently obtain their load prediction equations from multivariate least squares fits of balance calibration data. The first method is called Non-Iterative Method. This approach directly uses regression models of the individual load components of a balance for the load prediction. The second method is called Iterative Method. This alternate approach uses a load iteration equation for the load prediction that is constructed from the regression models of the gage outputs of the balance. Basic characteristics of the two methods are reviewed. Afterwards, both methods are applied to calibration and check load data of the chosen balance. Finally, selected analysis results are compared. These comparisons confirmed that the load prediction accuracy of the two methods is the same for all practical purposes.

wind tunnel test↗
DOE OSTI2019

Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.

42 ENGINEERING↗
DOE OSTI2019

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration, which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every $s$ iterations---where $s$ is a tuning parameter---instead of every iteration for the regularized least-squares problem. We show that the communication-avoiding variants reduce the number of synchronizations by a factor of $s$ on distributed-memory parallel machines without altering the convergence rate and attain strong scaling speedups of up to $6.1\times$ over the “standard algorithm" on a Cray XC30 supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Modeling the asynchronous Jacobi method without communication delays

Asynchronous iterative methods for solving linear systems are gaining renewed interest due to the high cost of synchronization points in massively parallel codes. Historically, theory on asynchronous iterative methods has focused on asymptotic behavior, while the transient behavior remains poorly understood. In this paper, we study a model of the asynchronous Jacobi method without communication delays, which we call simplified asynchronous Jacobi. Simplified asynchronous Jacobi can be used to model asynchronous Jacobi implemented in shared memory or distributed memory with fast communication networks. Our analysis uses the idea of a propagation matrix, which is similar in concept to an iteration matrix. We show that simplified asynchronous Jacobi can continue to reduce the residual when some processes are slower than other processes. We also show that simplified asynchronous Jacobi can converge when synchronous Jacobi does not. We verify our analysis of simplified asynchronous Jacobi using results from asynchronous Jacobi implemented in shared and distributed memory.

97 MATHEMATICS AND COMPUTING↗