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 217 records · Page 12

Computation of three-dimensional viscous flows using a space-marching method

A space-marching method, developed to compute three-dimensional flows for internal geometries, has been utilized to predict viscous flows through a curved duct and over a swept wing. The Navier-Stokes equations have been posed as an initial value problem by neglecting the streamwise viscous diffusion terms and by treating the pressure gradient as a known source term. The resulting equations have been solved by a non-iterative (single pass) algorithm at each streamwise step. The results are compared with earlier computations (based on iterative methods) and the experimental data. The agreement between the present predictions, the experimental data, and the earlier predictions is good for the cases computed. The computation time is only a fraction of the iterative methods.

Murthy, K. N. S.↗

Relativistic solutions for the spin-1 particles in the two-dimensional Smorodinsky–Winternitz potential

In this study, we investigate relativistic spin-1 particles in the V(x,y)=(ω{sub 0}{sup 2}/2)(x{sup 2}+y{sup 2})+k{sub 1}/x{sup 2}+k{sub 2}/y{sup 2} type of Smorodinsky–Winternitz potentials. In the first case, since this Smorodinsky–Winternitz potential has two dimensions, the system was transformed into polar coordinates from Cartesian coordinates. By using Duffin–Kemmer–Petiau formalism with the non-central Smorodinsky–Winternitz potential in two dimensions, the exact bound state energy eigenvalues and corresponding eigenfunctions were determined within the framework of the asymptotic iteration method. Bound state eigenfunctions were obtained in terms of confluent hypergeometric functions. -- Highlights: •We introduce formalism of the DKP equation in two dimensions. •The DKP equation with S–W potential is considered for spin-1 particles. •In order to solve the DKP equation, we explain the asymptotic iteration method (AIM). •Bound state energy eigenvalues and eigenfunctions are obtained by using AIM.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comparison of multiprocessor scheduling methods for iterative data flow architectures

A comparative study is made between the Algorithm to Architecture Mapping Model (ATAMM) and three other related multiprocessing models from the published literature. The primary focus of all four models is the non-preemptive scheduling of large-grain iterative data flow graphs as required in real-time systems, control applications, signal processing, and pipelined computations. Important characteristics of the models such as injection control, dynamic assignment, multiple node instantiations, static optimum unfolding, range-chart guided scheduling, and mathematical optimization are identified. The models from the literature are compared with the ATAMM for performance, scheduling methods, memory requirements, and complexity of scheduling and design procedures.

Storch, Matthew↗

Comparison of a 2D nonlocal transport model to ECRH experiments in LHD

In this work, a recently developed model of nonlocal transport in two dimensions (2D), the “iterative method”, is applied to the published results of ECRH experiments performed in the Large Helical Device. It is found from the temperature profiles obtained from the 2D model that the sharply peaked electron temperature profiles observed in such experiments, and previously associated with local transport and “internal transport barriers” or Core Electron-Root Confinement, are also consistent with nonlocal transport. It is shown that the iterative method is suited to handling both scenarios

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗

An iterative reconstruction of cosmological initial density fields

We present an iterative method to reconstruct the linear-theory initial conditions from the late-time cosmological matter density field, with the intent of improving the recovery of the cosmic distance scale from the baryon acoustic oscillations. We present tests using the dark matter density field in both real and redshift space generated from an N-body simulation. In redshift space at z = 0.5, we find that the reconstructed displacement field using our iterative method are more than 80 percent correlated with the true displacement field of the dark matter particles on scales k < 0.10 h Mpc -1 . Furthermore, we show that the two-point correlation function of our reconstructed density field matches that of the initial density field substantially better, especially on small scales (<40 h -1 Mpc). Our redshift-space results are improved if we use an anisotropic smoothing so as to account for the reduced small-scale information along the line of sight in redshift space.

79 ASTRONOMY AND ASTROPHYSICS↗

The Wave Energy Converter Design Process: Methods Applied in Industry and Shortcomings of Current Practices

Wave energy is among the many renewable energy technologies being researched and developed to address the increasing demand for low-emissions energy. The unique design challenges for wave energy converter design—integrating complex and uncertain technological, economic, and ecological systems, overcoming the structural challenges of ocean deployment, and dealing with complex system dynamics—have lead to a disjointed progression of research and development. There is no common design practice across the wave energy industry and there is no published synthesis of the practices that are used by developers. In this paper, we summarize the methods being employed in WEC design as well as promising methods that have yet to be applied. We contextualize these methods within an overarching design process. We present results from a survey of WEC developers to identify methods that are common in industry. From the review and survey results, we conclude that the most common methods of WEC design are iterative methods in which design parameters are defined, evaluated, and then changed based on evaluation results. This leaves a significant space for improvement of methods that help designers make better-informed decisions prior to sophisticated evaluation, and methods of using the evaluation results to make better design decisions during iteration. Despite the popularity of optimization methods in academic research, they are less common in industry development. We end this paper with a summary of the areas of WEC design in which the testing and development of new methods is necessary, and where more research is required to fully understand the influence of design decisions on WEC performance.

16 TIDAL AND WAVE POWER↗

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗

Hidden Connections between Regression Models of Strain-Gage Balance Calibration Data

Hidden connections between regression models of wind tunnel strain-gage balance calibration data are investigated. These connections become visible whenever balance calibration data is supplied in its design format and both the Iterative and Non-Iterative Method are used to process the data. First, it is shown how the regression coefficients of the fitted balance loads of a force balance can be approximated by using the corresponding regression coefficients of the fitted strain-gage outputs. Then, data from the manual calibration of the Ames MK40 six-component force balance is chosen to illustrate how estimates of the regression coefficients of the fitted balance loads can be obtained from the regression coefficients of the fitted strain-gage outputs. The study illustrates that load predictions obtained by applying the Iterative or the Non-Iterative Method originate from two related regression solutions of the balance calibration data as long as balance loads are given in the design format of the balance, gage outputs behave highly linear, strict statistical quality metrics are used to assess regression models of the data, and regression model term combinations of the fitted loads and gage outputs can be obtained by a simple variable exchange.

Ulbrich, Norbert↗

Stabilization of the 81-channel coherent beam combination using machine learning

We develop a rapidly converging algorithm for stabilizing a large channel-count diffractive optical coherent beam combination. An 81-beam combiner is controlled by a novel, machine-learning based, iterative method to correct the optical phases, operating on an experimentally calibrated numerical model. A neural-network is trained to detect phase errors based on interference pattern recognition of uncombined beams adjacent to the combined one. Due to the non-uniqueness of solutions in the full space of possible phases, the network is trained within a limited phase perturbation/error range. This also reduces the number of samples needed for training. Simulations have proven that the network can converge in one step for small phase perturbations. When the trained neural-network is applied to a realistic case of 360 degree full range, an iterative scheme exploits random walking at the beginning, with the accuracy of prediction on phase feedback direction, to allow the neural-network to step into the training range for fast convergence. This neural-network-based iterative method of phase detection works tens of times faster than the commonly used stochastic parallel gradient descent approach (SPGD) using a single-detector and random dither when both are tested with random phase perturbations.

Wang, Dan↗

Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method

Here we investigate an efficient preconditioning of iterative methods (such as GMRES) for solving dense linear systems Ax = b that follow from a boundary element method (BEM) for the 3D Helmholtz equation, focusing on the low-frequency regime. While matrix–vector products in GMRES can be accelerated through the low-frequency fast multipole method (LFFMM), the BEM often remains computationally expensive due to the large number of GMRES iterations. We propose the application of the inverse fast multipole method (IFMM) as a preconditioner to accelerate the convergence of GMRES. The IFMM is in essence an approximate direct solver that uses a multilevel hierarchical decomposition and low-rank approximations. The proposed IFMM-based preconditioning has a tunable parameter ε that balances the cost to construct a preconditioner M, which is an approximation of A -1 , and the cost to perform the iterative process by means of M. Namely, using a small (respectively, large) value of ε takes a long (respectively, short) time to construct M, while the number of iterations can be small (respectively, large). A comprehensive set of numerical examples involving various boundary value problems with complicated geometries and mixed boundary conditions is presented to validate the efficiency of the proposed method. We show that the IFMM preconditioner (with a nearly optimal ε of 10 -2 ) clearly outperforms some common preconditioners for the BEM, achieving 1.2–10.8 times speed-up of the computations, in particular when the scale of the underlying scatterer is about five wavelengths or more. In addition, the IFMM preconditioner is capable of solving complicated problems (in a reasonable amount of time) that BD preconditioner can not.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An asymptotic-preserving Lagrangian algorithm for the time-dependent anisotropic heat transport equation

We propose a Lagrangian numerical algorithm for a time-dependent, anisotropic temperature transport equation in magnetized plasmas in the large guide field regime. The approach is based on an analytical integral formal solution of the parallel (i.e., along the magnetic field) transport equation with sources, and it is able to accommodate both local and non-local parallel heat flux closures. The numerical implementation is based on an operator-split formulation, with two straightforward steps: a perpendicular transport step (including sources), and a Lagrangian (field-line integral) parallel transport step. Algorithmically, the first step is amenable to the use of modern iterative methods, while the second step has a fixed cost per degree of freedom (and is therefore scalable). Accuracy-wise, the approach is free from the numerical pollution introduced by the discrete parallel transport term when the perpendicular to parallel transport coefficient ratio X ⊥ /X ∥ becomes arbitrarily small, and is shown to capture the correct limiting solution when ε = X⊥L 2 ∥ /X1L 2 ⊥ → 0 (with L∥∙ L⊥ , the parallel and perpendicular diffusion length scales, respectively). Therefore, the approach is asymptotic-preserving. We demonstrate the capabilities of the scheme with several numerical experiments with varying magnetic field complexity in two dimensions, including the case of transport across a magnetic island.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Reducing the small-heart effect in pediatric gated myocardial perfusion single-photon emission computed tomography

Background: We compared two reconstruction algorisms and two cardiac functional evaluation software programs in terms of their accuracy for estimating ejection fraction (EF) of small hearts (SH). Methods: The study group consisted of 66 pediatric patients. Data were reconstructed using a filtered back projection (FBP) method without the resolution correction (RC) and an iterative method based on an ordered subset expectation maximization (OSEM) algorithm with the RC. EF was evaluated using two software programs of quantitative gated single-photon emission computed tomography (SPECT) (QGS) and cardioREPO. We compared the EF of gated myocardial perfusion SPECT to echocardiographic measurement (Echo). Results: Forty-eight of 66 patients had an end-systolic volume < 20 mL which was used as the criterion for being included in the SH group, and the SH effect led to an overestimation of EF. While significant differences were observed between Echo (66.9 ± 5.0%) and QGS-FBP without RC (76.9 ± 8.4%, P < .0001), QGS-OSEM with RC (76.6 ± 8.6%, P < .0001), and cardioREPO-FBP without RC (72.1 ± 10.0%, P = .0011), no significant difference was observed between Echo and cardioREPO-OSEM with RC (67.4 ± 6.1%) in SH group. Conclusions: In pediatric gated myocardial perfusion SPECT, the SH effect can be significantly reduced when an OSEM algorithm is used with RC in combination with the specific cardioREPO algorithm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Rapid analysis of scattering from periodic dielectric structures using accelerated Cartesian expansions

Here, the analysis of fields in periodic dielectric structures arise in numerous applications of recent interest, ranging from photonic bandgap structures and plasmonically active nanostructures to metamaterials. To achieve an accurate representation of the fields in these structures using numerical methods, dense spatial discretization is required. This, in turn, affects the cost of analysis, particularly for integral-equation-based methods, for which traditional iterative methods require Ο(Ν 2 ) operations, Ν being the number of spatial degrees of freedom. In this paper, we introduce a method for the rapid solution of volumetric electric field integral equations used in the analysis of doubly periodic dielectric structures. The crux of our method is the accelerated Cartesian expansion algorithm, which is used to evaluate the requisite potentials in Ο(Ν) cost. Results are provided that corroborate our claims of acceleration without compromising accuracy, as well as the application of our method to a number of compelling photonics applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗