SEARCH · Search NASA
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.
Fault-tolerant iterative methods via selective reliability.
Abstract not provided.
Fault-tolerant iterative methods via selective reliability.
Abstract not provided.
Fault-tolerant iterative methods via selective reliability.
Abstract not provided.
Characterization of the Impact of Soft Errors on Iterative Methods
Explore the source record for details and available documents.
Larger Convergence Zones for Newton's Method
Iterative technique applies over wider range of initial guesses. New theorem describes convergence zone of Newton's iterative method for finding zeros of real function. Involves two points, Xp and Xp*, called primary conjugate points. If exact solution lies between these points (Xp is less than Xz is less than Xp*) and no other conjugate points in interval, then according to theorem, subsequent iterations will converge upon exact solution if initial guess lies in interval.
Radiative transfer of visible radiation in turbid atmosphere
Methods are presented for solving radiative transfer problems; they include the doubling method and the closely related matrix method, iterative method, Chandrasekhar's method of discrete ordinates, and Monte Carlo method. To consider radiation transport through turbid atmosphere, an atmospheric model was developed characterizing aerosols by parameters. Intensity and polarization of radiation in turbid atmospheres is discussed, as well as lower atmospheric heating due to solar radiation absorption by aerosols.
Least-squares finite element solution of 3D incompressible Navier-Stokes problems
Although significant progress has been made in the finite element solution of incompressible viscous flow problems. Development of more efficient methods is still needed before large-scale computation of 3D problems becomes feasible. This paper presents such a development. The most popular finite element method for the solution of incompressible Navier-Stokes equations is the classic Galerkin mixed method based on the velocity-pressure formulation. The mixed method requires the use of different elements to interpolate the velocity and the pressure in order to satisfy the Ladyzhenskaya-Babuska-Brezzi (LBB) condition for the existence of the solution. On the other hand, due to the lack of symmetry and positive definiteness of the linear equations arising from the mixed method, iterative methods for the solution of linear systems have been hard to come by. Therefore, direct Gaussian elimination has been considered the only viable method for solving the systems. But, for three-dimensional problems, the computer resources required by a direct method become prohibitively large. In order to overcome these difficulties, a least-squares finite element method (LSFEM) has been developed. This method is based on the first-order velocity-pressure-vorticity formulation. In this paper the LSFEM is extended for the solution of three-dimensional incompressible Navier-Stokes equations written in the following first-order quasi-linear velocity-pressure-vorticity formulation.
A computationally efficient P 1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods
The iterative convergence of the P 1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P 1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P 1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P 1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Additionally, PC provided 50% computational savings compared to employing CG in a standalone mode. The P 1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P 1 model provided good agreement against benchmark data with L 2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.
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.
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.
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.
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.
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.
Coarse Spaces by Algebraic Multigrid: Multigrid Convergence and Upscaled Error Estimates
We give an overview of a number of algebraic multigrid methods targeting finite element discretization problems. The focus is on the properties of the constructed hierarchy of coarse spaces that guarantee (two-grid) convergence. In particular, a necessary condition known as 'weak approximation property', and a sufficient one, referred to as 'strong approximation property' are discussed. Their role in proving convergence of the TG method (as iterative method) and also on the approximation properties of the AMG coarse spaces if used as discretization tool is pointed out. Some preliminary numerical results illustrating the latter aspect are also reported.
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}|.
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).