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 487 records · Page 27

Interpolative Separable Density Fitting Decomposition for Accelerating Hybrid Density Functional Calculations with Applications to Defects in Silicon

We present a new efficient way to perform hybrid density functional theory (DFT)-based electronic structure calculations. The new method uses an interpolative separable density fitting (ISDF) procedure to construct a set of numerical auxiliary basis vectors and a compact approximation of the matrix consisting of products of occupied orbitals represented in a large basis set such as the planewave basis. Such an approximation allows us to reduce the number of Poisson solves from O ($N$ $^{2}_{ϵ}$) to O ( N ϵ ) when we apply the exchange operator to occupied orbitals in an iterative method for solving the Kohn–Sham equations, where Ne is the number of electrons in the system to be studied. We show that the ISDF procedure can be carried out in O ($N$ $^{3}_{ϵ}$) operations, with a much smaller preconstant compared to methods used in existing approaches. When combined with the recently developed adaptively compressed exchange (ACE) operator formalism, which reduces the number of times the exchange operator needs to be updated, the resulting ACE-ISDF method significantly reduces the computational cost associated with the exchange operator by nearly 2 orders of magnitude compared to existing approaches for a large silicon system with 1000 atoms. We demonstrate that the ACE-ISDF method can produce accurate energies and forces for insulating and metallic systems and that it is possible to obtain converged hybrid functional calculation results for a 1000-atom bulk silicon within 10 min on 2000 computational cores. We also show that ACE-ISDF can scale to 8192 computational cores for a 4096-atom bulk silicon system. We use the ACE-ISDF method to geometrically optimize a 1000-atom silicon system with a vacancy defect using the HSE06 functional and computes its electronic structure. Here, we find that that the computed energy gap from the HSE06 functional is much closer to the experimental value compared to that produced by semilocal functionals in the DFT calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Score-based denoising for atomic structure identification

We propose an effective method for removing thermal vibrations that complicate the task of analyzing complex dynamics in atomistic simulation of condensed matter. Our method iteratively subtracts thermal noises or perturbations in atomic positions using a denoising score function trained on synthetically noised but otherwise perfect crystal lattices. The resulting denoised structures clearly reveal underlying crystal order while retaining disorder associated with crystal defects. Purely geometric, agnostic to interatomic potentials, and trained without inputs from explicit simulations, our denoiser can be applied to simulation data generated from vastly different interatomic interactions. The denoiser is shown to improve existing classification methods, such as common neighbor analysis and polyhedral template matching, reaching perfect classification accuracy on a recent benchmark dataset of thermally perturbed structures up to the melting point. Demonstrated here in a wide variety of atomistic simulation contexts, the denoiser is general, robust, and readily extendable to delineate order from disorder in structurally and chemically complex materials.

36 MATERIALS SCIENCE↗

Laplace's equation and the Dirichlet-Neumann map in multiply connected domains

A variety of problems in material science and fluid dynamics require the solution of Laplace's equation in multiply connected domains. Integral equation methods are natural candidates for such problems, since they discretize the boundary alone, require no special effort for free boundaries, and achieve superalgebraic convergence rates on sufficiently smooth domains in two space dimensions, regardless of shape. Current integral equation methods for the Dirichlet problem, however, require the solution of M independent problems of dimension N, where M is the number of boundary components and N is the total number of points in the discretization. In this paper, we present a new boundary integral equation approach, valid for both interior and exterior problems, which requires the solution of a single linear system of dimension N + M. We solve this system by making use of an iterative method (GMRES) combined with the last multipole method for the rapid calculation of the necessary matrix vector products. For a two-dimensional system with 200 components and 100 points on each boundary, we gain a speedup of a factor of 100 from the new analytic formulation and a factor of 50 from the fast multipole method. The resulting scheme brings large scale calculations in extremely complex domains within practical reach.

Greenbaum, A.↗

Integrated numerical methods for hypersonic aircraft cooling systems analysis

Numerical methods have been developed for the analysis of hypersonic aircraft cooling systems. A general purpose finite difference thermal analysis code is used to determine areas which must be cooled. Complex cooling networks of series and parallel flow can be analyzed using a finite difference computer program. Both internal fluid flow and heat transfer are analyzed, because increased heat flow causes a decrease in the flow of the coolant. The steady state solution is a successive point iterative method. The transient analysis uses implicit forward-backward differencing. Several examples of the use of the program in studies of hypersonic aircraft and rockets are provided.

Petley, Dennis H.↗

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Arneson, Heather↗

Application of multigrid methods to the solution of liquid crystal equations on a SIMD computer

We will describe a finite difference code for computing the equilibrium configurations of the order-parameter tensor field for nematic liquid crystals in rectangular regions by minimization of the Landau-de Gennes Free Energy functional. The implementation of the free energy functional described here includes magnetic fields, quadratic gradient terms, and scalar bulk terms through the fourth order. Boundary conditions include the effects of strong surface anchoring. The target architectures for our implementation are SIMD machines, with interconnection networks which can be configured as 2 or 3 dimensional grids, such as the Wavetracer DTC. We also discuss the relative efficiency of a number of iterative methods for the solution of the linear systems arising from this discretization on such architectures.

Farrell, Paul A.↗

Improved mapping of radio sources from VLBI data by least-square fit

A method is described for producing improved mapping of radio sources from Very Long Base Interferometry (VLBI) data. The method described is more direct than existing Fourier methods, is often more accurate, and runs at least as fast. The visibility data is modeled here, as in existing methods, as a function of the unknown brightness distribution and the unknown antenna gains and phases. These unknowns are chosen so that the resulting function values are as near as possible to the observed values. If researchers use the radio mapping source deviation to measure the closeness of this fit to the observed values, they are led to the problem of minimizing a certain function of all the unknown parameters. This minimization problem cannot be solved directly, but it can be attacked by iterative methods which we show converge automatically to the minimum with no user intervention. The resulting brightness distribution will furnish the best fit to the data among all brightness distributions of given resolution.

Rodemich, E. R.↗

An FFT-based approach for Bloch wave analysis: application to polycrystals

A method based on the Fast Fourier Transform is proposed to obtain the dispersion relation of acoustic waves in heterogeneous periodic media with arbitrary microstructures. The microstructure is explicitly considered using a voxelized Representative Volume Element (RVE). The dispersion diagram is obtained solving an eigenvalue problem for Bloch waves in Fourier space. To this aim, two linear operators representing stiffness and mass are defined through the use of differential operators in Fourier space. The smallest eigenvalues are obtained using the implicitly restarted Lanczos and the subspace iteration methods, and the required inverse of the stiffness operator is done using the conjugate gradient with a preconditioner. The method is used to study the propagation of acoustic waves in elastic polycrystals, showing the strong effect of crystal anistropy and polycrystaline texture on the propagation. It is shown that the method combines the simplicity of classical Fourier series analysis with the versatility of Finite Elements to account for complex geometries proving an efficient and general approach which allows the use of large RVEs in 3D.

97 MATHEMATICS AND COMPUTING↗

Microscopic Theory of Nuclear Fission: A Review

This paper reviews how nuclear fission is described within nuclear density functional theory. A distinction should be made between spontaneous fission, where half-lives are the main observables and quantum tunnelling the essential concept, and induced fission, where the focus is on fragment properties and explicitly time-dependent approaches are often invoked. Overall, the cornerstone of the density functional theory approach to fission is the energy density functional formalism. The basic tenets of this method, including some well-known tools such as the Hartree–Fock–Bogoliubov (HFB) theory, effective two-body nuclear potentials such as the Skyrme and Gogny force, finite-temperature extensions and beyond mean-field corrections, are presented succinctly. The energy density functional approach is often combined with the hypothesis that the time-scale of the large amplitude collective motion driving the system to fission is slow compared to typical time-scales of nucleons inside the nucleus. In practice, this hypothesis of adiabaticity is implemented by introducing (a few) collective variables and mapping out the many-body Schrödinger equation into a collective Schrödinger-like equation for the nuclear wave-packet. The region of the collective space where the system transitions from one nucleus to two (or more) fragments defines what are called the scission configurations. The inertia tensor that enters the kinetic energy term of the collective Schrödinger-like equation is one of the most essential ingredients of the theory, since it includes the response of the system to small changes in the collective variables. For this reason, the two main approximations used to compute this inertia tensor, the adiabatic time-dependent HFB and the generator coordinate method, are presented in detail, both in their general formulation and in their most common approximations. The collective inertia tensor enters also the Wentzel–Kramers–Brillouin (WKB) formula used to extract spontaneous fission half-lives from multi-dimensional quantum tunnelling probabilities (For the sake of completeness, other approaches to tunnelling based on functional integrals are also briefly discussed, although there are very few applications.) It is also an important component of some of the time-dependent methods that have been used in fission studies. Concerning the latter, both the semi-classical approaches to time-dependent nuclear dynamics and more microscopic theories involving explicit quantum-many-body methods are presented. One of the hallmarks of the microscopic theory of fission is the tremendous amount of computing needed for practical applications. In particular, the successful implementation of the theories presented in this article requires a very precise numerical resolution of the HFB equations for large values of the collective variables. This aspect is often overlooked, and several sections are devoted to discussing the resolution of the HFB equations, especially in the context of very deformed nuclear shapes. In particular, the numerical precision and iterative methods employed to obtain the HFB solution are documented in detail. Finally, a selection of the most recent and representative results obtained for both spontaneous and induced fission is presented, with the goal of emphasizing the coherence of the microscopic approaches employed. In conclusion, although impressive progress has been achieved over the last two decades to understand fission microscopically, much work remains to be done. Several possible lines of research are outlined in the conclusion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimal application of Morrison's iterative noise removal for deconvolution. Appendices

Morrison's iterative method of noise removal, or Morrison's smoothing, is applied in a simulation to noise-added data sets of various noise levels to determine its optimum use. Morrison's smoothing is applied for noise removal alone, and for noise removal prior to deconvolution. For the latter, an accurate method is analyzed to provide confidence in the optimization. The method consists of convolving the data with an inverse filter calculated by taking the inverse discrete Fourier transform of the reciprocal of the transform of the response of the system. Various length filters are calculated for the narrow and wide Gaussian response functions used. Deconvolution of non-noisy data is performed, and the error in each deconvolution calculated. Plots are produced of error versus filter length; and from these plots the most accurate length filters determined. The statistical methodologies employed in the optimizations of Morrison's method are similar. A typical peak-type input is selected and convolved with the two response functions to produce the data sets to be analyzed. Both constant and ordinate-dependent Gaussian distributed noise is added to the data, where the noise levels of the data are characterized by their signal-to-noise ratios. The error measures employed in the optimizations are the L1 and L2 norms. Results of the optimizations for both Gaussians, both noise types, and both norms include figures of optimum iteration number and error improvement versus signal-to-noise ratio, and tables of results. The statistical variation of all quantities considered is also given.

Ioup, George E.↗

Integrating Matrix Method for Determining the Natural Vibrations of a Rotating, Unsymmetrical Beam with Application to Twisted Propeller Blades

A numerical method is Presented for determining the natural vibration frequencies, and the corresponding mode shapes, of a rotating cantilever beam which has a nonuniform, unsymmetrical cross section. Two coupled fourth-order differential equations of motion with variable coefficients are derived which govern the motion of such a beam having deformations in two directions. Through the development and utilization of the integrating matrix, the solution of the differential equations is obtained in the form of an eigenvalue problem. The solutions to the eigenvalue problem are determined by an iteration method based upon a special orthogonality relationship which is derived. Numerical examples, including an application to a twisted propeller blade, are presented with the results of the integrating matrix solutions being compared to exact solutions and experimental data.

Hunter, William F.↗

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE↗

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells

The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.

97 MATHEMATICS AND COMPUTING↗

Radiative transfer theory for active remote sensing of a layer of nonspherical particles

The radiative transfer theory is applied to calculate the scattering by a layer of randomly positioned and oriented nonspherical particles. The scattering amplitude functions of each individual particle are calculated with Waterman's T matrix method, which utilizes vector spherical wave functions for expansion of incident, scattered, and surface fields. The orientation of the particles is described by a probability density function of the Eulerian angles of rotation. A rotation matrix is used to relate the T matrix of the principal frame to that of the natural frame of the particle. The extinction matrix and phase matrix of the radiative transfer equations are expressed in terms of the T matrix elements. The extinction matrix for nonspherical particles is generally nondiagonal. There are only two attenuation rates in a specified direction of propagation. The radiative transfer equations are solved by an iterative method to first order in albedo. Numerical results are illustrated as functions of incidence angle and frequency with applications to active remote sensing.

Tsang, L.↗

Multigrid methods for numerical simulation of laminar diffusion flames

This paper documents the result of a computational study of multigrid methods for numerical simulation of 2D diffusion flames. The focus is on a simplified combustion model, which is assumed to be a single step, infinitely fast and irreversible chemical reaction with five species (C3H8, O2, N2, CO2 and H2O). A fully-implicit second-order hybrid scheme is developed on a staggered grid, which is stretched in the streamwise coordinate direction. A full approximation multigrid scheme (FAS) based on line distributive relaxation is developed as a fast solver for the algebraic equations arising at each time step. Convergence of the process for the simplified model problem is more than two-orders of magnitude faster than other iterative methods, and the computational results show good grid convergence, with second-order accuracy, as well as qualitatively agreement with the results of other researchers.

Liu, C.↗

Three-dimensional Skyrme Hartree-Fock-Bogoliubov solver in coordinate-space representation

The coordinate-space representation of the Hartree-Fock-Bogoliubov theory is the method of choice to study weakly bound nuclei whose properties are affected by the quasiparticle continuum space. To describe such systems, we developed a three-dimensional Skyrme-Hartree-Fock-Bogoliubov solver HFBFFT based on the existing, highly optimized and parallelized Skyrme-Hartree-Fock code Sky3D. The code does not impose any self-consistent spatial symmetries such as mirror inversions or parity. The underlying equations are solved in HFBFFT directly in the canonical basis using the fast Fourier transform. To remedy the problems with pairing collapse, we implemented the soft energy cutoff and pairing annealing. The convergence of HFB solutions was improved by a sub-iteration method. The Hermiticity violation of differential operators brought by Fourier-transform-based differentiation has also been solved. Furthermore, the accuracy and performance of HFBFFT were tested by benchmarking it against other HFB codes, both spherical and deformed, for a set of nuclei, both well-bound and weakly-bound.

3D coordinate-space representation↗

Synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON): A statistical model based iterative image reconstruction method to eliminate limited-view artifacts and to mitigate the temporal-average artifacts in time-resolved CT

Purpose: In x-ray computed tomography (CT), a violation of the Tuy data sufficiency condition leads to limited-view artifacts. In some applications, it is desirable to use data corresponding to a narrow temporal window to reconstruct images with reduced temporal-average artifacts. However, the need to reduce temporal-average artifacts in practice may result in a violation of the Tuy condition and thus undesirable limited-view artifacts. In this paper, the authors present a new iterative reconstruction method, synchronized multiartifact reduction with tomographic reconstruction (SMART-RECON), to eliminate limited-view artifacts using data acquired within an ultranarrow temporal window that severely violates the Tuy condition. Methods: In time-resolved contrast enhanced CT acquisitions, image contrast dynamically changes during data acquisition. Each image reconstructed from data acquired in a given temporal window represents one time frame and can be denoted as an image vector. Conventionally, each individual time frame is reconstructed independently. In this paper, all image frames are grouped into a spatial–temporal image matrix and are reconstructed together. Rather than the spatial and/or temporal smoothing regularizers commonly used in iterative image reconstruction, the nuclear norm of the spatial–temporal image matrix is used in SMART-RECON to regularize the reconstruction of all image time frames. This regularizer exploits the low-dimensional structure of the spatial–temporal image matrix to mitigate limited-view artifacts when an ultranarrow temporal window is desired in some applications to reduce temporal-average artifacts. Both numerical simulations in two dimensional image slices with known ground truth and in vivo human subject data acquired in a contrast enhanced cone beam CT exam have been used to validate the proposed SMART-RECON algorithm and to demonstrate the initial performance of the algorithm. Reconstruction errors and temporal fidelity of the reconstructed images were quantified using the relative root mean square error (rRMSE) and the universal quality index (UQI) in numerical simulations. The performance of the SMART-RECON algorithm was compared with that of the prior image constrained compressed sensing (PICCS) reconstruction quantitatively in simulations and qualitatively in human subject exam. Results: In numerical simulations, the 240{sup ∘} short scan angular span was divided into four consecutive 60{sup ∘} angular subsectors. SMART-RECON enables four high temporal fidelity images without limited-view artifacts. The average rRMSE is 16% and UQIs are 0.96 and 0.95 for the two local regions of interest, respectively. In contrast, the corresponding average rRMSE and UQIs are 25%, 0.78, and 0.81, respectively, for the PICCS reconstruction. Note that only one filtered backprojection image can be reconstructed from the same data set with an average rRMSE and UQIs are 45%, 0.71, and 0.79, respectively, to benchmark reconstruction accuracies. For in vivo contrast enhanced cone beam CT data acquired from a short scan angular span of 200{sup ∘}, three 66{sup ∘} angular subsectors were used in SMART-RECON. The results demonstrated clear contrast difference in three SMART-RECON reconstructed image volumes without limited-view artifacts. In contrast, for the same angular sectors, PICCS cannot reconstruct images without limited-view artifacts and with clear contrast difference in three reconstructed image volumes. Conclusions: In time-resolved CT, the proposed SMART-RECON method provides a new method to eliminate limited-view artifacts using data acquired in an ultranarrow temporal window, which corresponds to approximately 60{sup ∘} angular subsectors.

60 APPLIED LIFE SCIENCES↗