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

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↗

ON THE ACCURACY OF WEAK-LENSING CLUSTER MASS RECONSTRUCTIONS

We study the bias and scatter in mass measurements of galaxy clusters resulting from fitting a spherically symmetric Navarro, Frenk, and White model to the reduced tangential shear profile measured in weak-lensing (WL) observations. The reduced shear profiles are generated for {approx}10{sup 4} cluster-sized halos formed in a {Lambda}CDM cosmological N-body simulation of a 1 h{sup -1} Gpc box. In agreement with previous studies, we find that the scatter in the WL masses derived using this fitting method has irreducible contributions from the triaxial shapes of cluster-sized halos and uncorrelated large-scale matter projections along the line of sight. Additionally, we find that correlated large-scale structure within several virial radii of clusters contributes a smaller, but nevertheless significant, amount to the scatter. The intrinsic scatter due to these physical sources is {approx}20% for massive clusters and can be as high as {approx}30% for group-sized systems. For current, ground-based observations, however, the total scatter should be dominated by shape noise from the background galaxies used to measure the shear. Importantly, we find that WL mass measurements can have a small, {approx}5%-10%, but non-negligible amount of bias. Given that WL measurements of cluster masses are a powerful way to calibrate cluster mass-observable relations for precision cosmological constraints, we strongly emphasize that a robust calibration of the bias requires detailed simulations that include more observational effects than we consider here. Such a calibration exercise needs to be carried out for each specific WL mass estimation method, as the details of the method determine in part the expected scatter and bias. We present an iterative method for estimating mass M{sub 500c} that can eliminate the bias for analyses of ground-based data.

79 ASTRONOMY AND ASTROPHYSICS↗

An Efficient High-Order Solver for Diffusion Equations with Strong Anisotropy on Non-Anisotropy-Aligned Meshes

This paper concerns numerical solution of the diffusion equation with strong anisotropy on meshes not aligned with the anisotropic vector field. In order to resolve the numerical pollution for simulations on a non-anisotropy-aligned mesh and reduce the associated high computational cost we propose an effective preconditioner, extending our previous work. Similar to the anisotropy-aligned mesh case, we apply the auxiliary space preconditioning framework to design a preconditioner where a continuous finite element space is used as the auxiliary space for the discontinuous finite element space. The key component is an effective line smoother that can mitigate the high-frequency errors perpendicular to the magnetic field. We design a graph-based approach to find such a line smoother that is approximately perpendicular to the vector fields when the mesh does not align with the anisotropy. Finally, numerical experiments for several benchmark problems are presented, demonstrating the effectiveness and robustness of the proposed preconditioner when applied to Krylov iterative methods.

97 MATHEMATICS AND COMPUTING↗

TH-E-17A-02: High-Pitch and Sparse-View Helical 4D CT Via Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: 4D CT is routinely performed during radiation therapy treatment planning of thoracic and abdominal cancers. Compared with the cine mode, the helical mode is advantageous in temporal resolution. However, a low pitch (∼0.1) for 4D CT imaging is often required instead of the standard pitch (∼1) for static imaging, since standard image reconstruction based on analytic method requires the low-pitch scanning in order to satisfy the data sufficient condition when reconstructing each temporal frame individually. In comparison, the flexible iterative method enables the reconstruction of all temporal frames simultaneously, so that the image similarity among frames can be utilized to possibly perform high-pitch and sparse-view helical 4D CT imaging. The purpose of this work is to investigate such an exciting possibility for faster imaging with lower dose. Methods: A key for highpitch and sparse-view helical 4D CT imaging is the simultaneous reconstruction of all temporal frames using the prior that temporal frames are continuous along the temporal direction. In this work, such a prior is regularized through the sparsity transform based on spatiotemporal tensor framelet (TF) as a multilevel and high-order extension of total variation transform. Moreover, GPU-based fast parallel computing of X-ray transform and its adjoint together with split Bregman method is utilized for solving the 4D image reconstruction problem efficiently and accurately. Results: The simulation studies based on 4D NCAT phantoms were performed with various pitches (i.e., 0.1, 0.2, 0.5, and 1) and sparse views (i.e., 400 views per rotation instead of standard >2000 views per rotation), using 3D iterative individual reconstruction method based on 3D TF and 4D iterative simultaneous reconstruction method based on 4D TF respectively. Conclusion: The proposed TF-based simultaneous 4D image reconstruction method enables high-pitch and sparse-view helical 4D CT with lower dose and faster speed.

60 APPLIED LIFE SCIENCES↗

Generalized Jacobi method for linear bounded operators system

In this paper, we construct a generalization of the Jacobi iterative method adapted to a system of linear bounded operators. This new method is used with product integration method to solve a linear Fredholm integral equation of the second kind with a weakly singular kernel. The convergence analysis is proved. The numerical tests developed show its effectiveness.

97 MATHEMATICS AND COMPUTING↗

Two-Level Transport Methods with Independent Discretization

In this proposal, we introduce two-level nonlinear iteration methods for the transport equation in 1D slab geometry approximated by means of the linear discontinuous finite element method (LDFEM). We develop transport schemes based on the quasidiffusion (QD) method in which the low-order QD (LOQD) equations are discretized by the linear continuous finite element method (LCFEM). This requires a mapping of the LCFEM low-order solution to the LDFEM high-order solution to define the scattering term. Several mappings are proposed and analyzed. Another suggested transport discretization scheme is based on the step characteristics for the transport equation and LCFEM for the LOQD equations. We also develop new nonlinear synthetic acceleration (NSA) methods based on the LCFEM discretization of the QD equation. To gain iterative stability, the NSA algorithms are combined with the nonlinear Krylov acceleration method. We present numerical results that demonstrate performance and basic properties of the proposed discretization schemes and iterative solution methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

GLOBAL OPTIMIZATION METHODS FOR GRAVITATIONAL LENS SYSTEMS WITH REGULARIZED SOURCES

Several approaches exist to model gravitational lens systems. In this study, we apply global optimization methods to find the optimal set of lens parameters using a genetic algorithm. We treat the full optimization procedure as a two-step process: an analytical description of the source plane intensity distribution is used to find an initial approximation to the optimal lens parameters; the second stage of the optimization uses a pixelated source plane with the semilinear method to determine an optimal source. Regularization is handled by means of an iterative method and the generalized cross validation (GCV) and unbiased predictive risk estimator (UPRE) functions that are commonly used in standard image deconvolution problems. This approach simultaneously estimates the optimal regularization parameter and the number of degrees of freedom in the source. Using the GCV and UPRE functions, we are able to justify an estimation of the number of source degrees of freedom found in previous work. We test our approach by applying our code to a subset of the lens systems included in the SLACS survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Flux stabilization in neutron problems with fixed sources

Although critical core calculations are the most common in design and safety analysis, fixed source calculations are needed for specific applications, e.g. to compute ex-core detector response functions, to develop new methodologies for dilution and reload error accidents and more in general for all situations involving sub-critical shut-down states. It is well known that the source problem becomes difficult to be solved with core configuration close to criticality, i.e. with the multiplication factor approaching unity, for the occurrence of numerical ill-conditioning and very high number of iterations, possibly leading to failure in the flux convergence. In this work, the Wielandt Eigen-shift technique used in iterative methods of critical problems is developed for source problems too, in order to stabilize the solution. The mathematical basis and the proof of the convergence are discussed. Compared to the existing methods, this technique allows also more control to avoid singular behavior at inner iterations. Numerical tests with a 1D analytical benchmark are reported to prove the robustness of the technique. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accident analysis of heavy water cooled thorium breeder reactor

Thorium has lately attracted considerable attention because it is accumulating as a by-product of large scale rare earth mining. The objective of research is to analyze transient behavior of a heavy water cooled thorium breeder that is designed by Tokai University and Tokyo Institute of Technology. That is oxide fueled, PWR type reactor with heavy water as primary coolant. An example of the optimized core has relatively small moderator to fuel volume ratio (MFR) of 0.6 and the characteristics of the core are burn-up of 67 GWd/t, breeding ratio of 1.08, burn-up reactivity loss during cycles of < 0.2% dk/k, and negative coolant reactivity coefficient. One of the nuclear reactor accidents types examined here is Unprotected Transient over Power (UTOP) due to withdrawing of the control rod that result in the positive reactivity insertion so that the reactor power will increase rapidly. Another accident type is Unprotected Loss of Flow (ULOF) that caused by failure of coolant pumps. To analyze the reactor accidents, neutron distribution calculation in the nuclear reactor is the most important factor. The best expression for the neutron distribution is the Boltzmann transport equation. However, solving this equation is very difficult so that the space-time diffusion equation is commonly used. Usually, space-time diffusion equation is solved by employing a point kinetics approach. However, this approach is less accurate for a spatially heterogeneous nuclear reactor and the nuclear reactor with quite large reactivity input. Direct method is therefore used to solve space-time diffusion equation which consider spatial factor in detail during nuclear reactor accident simulation. Set of equations that obtained from full implicit finite-difference method is solved by using iterative methods. The indication of UTOP accident is decreasing macroscopic absorption cross-section that results large external reactivity, and ULOF accident is indicated by decreasing coolant flow. The power reactor has a peak value before reactor has new balance condition. The analysis showed that temperatures of fuel and claddings during accident are still below limitations which are in secure condition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

MPACT Performance Improvements in VERA-CS

The report summarizes the initial profile of MPACT representative of the version that was distributed with VERA 3.4. It then describes several activities recently performed to increase the overall performance of the code. For the various improvements described in this report, several have been well known to the development team and reactor physics methods community for some time; while others proved novel in their combination of other existing ideas. Still, other improvements were the result of unanticipated breakthroughs in numerical methods research. These performance improvement activities focused on the following components of MPACT. Method of Characteristics Transport Kernel Iterative Methods for Coarse Mesh Finite Difference Linear System Macroscopic Cross Section and Effective Fission Spectrum Calculation Resonance self-shielding (Subgroup) calculation A summary of the overall improvement from this work as tested on a few representative problems is provided in the table below. The incremental improvements for various changes are shown in the figure below.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

POLARIZED LINE FORMATION IN MULTI-DIMENSIONAL MEDIA. III. HANLE EFFECT WITH PARTIAL FREQUENCY REDISTRIBUTION

In two previous papers, we solved the polarized radiative transfer (RT) equation in multi-dimensional (multi-D) geometries with partial frequency redistribution as the scattering mechanism. We assumed Rayleigh scattering as the only source of linear polarization (Q/I, U/I) in both these papers. In this paper, we extend these previous works to include the effect of weak oriented magnetic fields (Hanle effect) on line scattering. We generalize the technique of Stokes vector decomposition in terms of the irreducible spherical tensors T{sup K}{sub Q}, developed by Anusha and Nagendra, to the case of RT with Hanle effect. A fast iterative method of solution (based on the Stabilized Preconditioned Bi-Conjugate-Gradient technique), developed by Anusha et al., is now generalized to the case of RT in magnetized three-dimensional media. We use the efficient short-characteristics formal solution method for multi-D media, generalized appropriately to the present context. The main results of this paper are the following: (1) a comparison of emergent (I, Q/I, U/I) profiles formed in one-dimensional (1D) media, with the corresponding emergent, spatially averaged profiles formed in multi-D media, shows that in the spatially resolved structures, the assumption of 1D may lead to large errors in linear polarization, especially in the line wings. (2) The multi-D RT in semi-infinite non-magnetic media causes a strong spatial variation of the emergent (Q/I, U/I) profiles, which is more pronounced in the line wings. (3) The presence of a weak magnetic field modifies the spatial variation of the emergent (Q/I, U/I) profiles in the line core, by producing significant changes in their magnitudes.

79 ASTRONOMY AND ASTROPHYSICS↗

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Resonance self-shielding methodology in MPACT

The resonance self-shielding methods of the neutron transport code Michigan Parallel Characteristics based Transport (MPACT) are described in this paper. Two resonance-integral table based methods are utilized to resolve the resonance self-shielding effect. The subgroup method is a mature approach used in MPACT as the basic functionality for the resonance calculation. Another new iterative method, named the embedded self-shielding method is also implemented in MPACT. Comparisons of the two methods as well as their numerical verifications are presented. The results show that MPACT is capable of modeling the resonance self-shielding in a variety of PWR benchmarking cases, including difficult fuel lattice cases with poison, control rods or mixed gadolinia fuel rods. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A generalized Poisson solver for first-principles device simulations

Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗