Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence”

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 1,675 records · Page 93

Several versions of the compensated compactness principle

The convergence of the product of a solenoidal vector w{sub {epsilon}} and a gradient {nabla}u{sub {epsilon}} in L{sup 1}({Omega}) (where {Omega} is a region in R{sup d}) is investigated in the case when the factors converge weakly in the spaces L{sup {gamma}({Omega})}{sup d} and L{sup {alpha}({Omega})}{sup d}, respectively, with 1/{gamma}+1/{alpha}>1, which means that the main assumption of the classical div-curl lemma fails. Nevertheless, the same convergence (in the sense of distributions in {Omega}) as in the framework of the div-curl lemma, survives under certain additional assumptions. The new versions of the compensated compactness principle proved in the paper can be used in homogenization and in the theory of G-convergence of monotone operators with non-standard coercivity and growth properties, for instance, some degenerate operators. Bibliography: 20 titles.

97 MATHEMATICS AND COMPUTING↗

The effects of structure anisotropy on lensing observables in an exact general relativistic setting for precision cosmology

The study of relativistic, higher order, and nonlinear effects has become necessary in recent years in the pursuit of precision cosmology. We develop and apply here a framework to study gravitational lensing in exact models in general relativity that are not restricted to homogeneity and isotropy, and where full nonlinearity and relativistic effects are thus naturally included. We apply the framework to a specific, anisotropic galaxy cluster model which is based on a modified NFW halo density profile and described by the Szekeres metric. We examine the effects of increasing levels of anisotropy in the galaxy cluster on lensing observables like the convergence and shear for various lensing geometries, finding a strong nonlinear response in both the convergence and shear for rays passing through anisotropic regions of the cluster. Deviation from the expected values in a spherically symmetric structure are asymmetric with respect to path direction and thus will persist as a statistical effect when averaged over some ensemble of such clusters. The resulting relative difference in various geometries can be as large as approximately 2%, 8%, and 24% in the measure of convergence (1−κ) for levels of anisotropy of 5%, 10%, and 15%, respectively, as a fraction of total cluster mass. For the total magnitude of shear, the relative difference can grow near the center of the structure to be as large as 15%, 32%, and 44% for the same levels of anisotropy, averaged over the two extreme geometries. The convergence is impacted most strongly for rays which pass in directions along the axis of maximum dipole anisotropy in the structure, while the shear is most strongly impacted for rays which pass in directions orthogonal to this axis, as expected. The rich features found in the lensing signal due to anisotropic substructure are nearly entirely lost when one treats the cluster in the traditional FLRW lensing framework. These effects due to anisotropic structures are thus likely to impact lensing measurements and must be fully examined in an era of precision cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗

Lensing as a probe of early universe: from CMB to galaxies

The Cosmic Microwave Background (CMB) radiation lensing is a promising tool to study the physics of early universe. In this work we probe the imprints of deviations from isotropy and scale invariance of primordial curvature perturbation power spectrum on CMB lensing potential and convergence. Specifically, we consider a scale-dependent hemispherical asymmetry in primordial power spectrum. We show that the CMB lensing potential and convergence and also the cross-correlation of the CMB lensing and late time galaxy convergence can probe the amplitude and the scale dependence of the dipole modulation. As another example, we consider a primordial power spectrum with local feature. We show that the CMB lensing and the cross-correlation of the CMB lensing and galaxy lensing can probe the amplitude and the shape of the local feature. We show that the cross correlation of CMB lensing convergence and galaxy lensing is capable to probe the effects of local features in power spectrum on smaller scales than the CMB lensing. Finally we showed that the current data can constrain the amplitude and moment dependence of dipole asymmetry.

79 ASTRONOMY AND ASTROPHYSICS↗

Coincidence studies of He ionized by C{sup 6+}, Au{sup 24+}, and Au{sup 53+}

A recently developed [Phys. Rev. A 79, 042707 (2009)] impact parameter coupled pseudostate approximation (CP) is applied to calculate triple differential cross sections for single ionization of He by C{sup 6+}, Au{sup 24+}, and Au{sup 53+} projectiles at impact energies of 100 and 2 MeV/amu for C{sup 6+} and 3.6 MeV/amu for Au{sup 24+} and Au{sup 53+}. For C{sup 6+}, satisfactory, but not perfect, agreement is found with experimental measurements in coplanar geometry, but there is substantial disagreement with data taken in a perpendicular plane geometry. The CP calculations firmly contradict a projectile-nucleus interaction model which has been used to support the perpendicular plane measurements. For Au{sup 24+} and Au{sup 53+}, there is a complete lack of accord with the available experiments. However, for Au{sup 24+} the theoretical position appears to be quite firm with clear indications of convergence in the CP approximation and very good agreement between CP and the completely different three-distorted-waves eikonal-initial-state (3DW-EIS) approximation. The situation for Au{sup 53+} is different. At the momentum transfers at which the measurements were made, there are doubts about the convergence of the CP approximation and a factor of 2 difference between the CP and 3DW-EIS predictions. The discord between theory and experiment is even greater with the experiment giving cross sections a factor of 10 larger than the theory. A study of the convergence of the CP approximation shows that it improves rapidly with reducing momentum transfer. As a consequence, lower-order cross sections than the triple are quite well converged and present an opportunity for a more reliable test of the experiment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New Effective Interaction for the Trapped Fermi Gas

We apply the configuration-interaction method to calculate the spectra of two-component Fermi systems in a harmonic trap, studying the convergence of energies at the unitary interaction limit. We find that for a fixed regularization of the two-body interaction the convergence is exponential or better in the truncation parameter of the many-body space. However, the conventional regularization is found to have poor convergence in the regularization parameter, with an error that scales as a low negative power of this parameter. We propose a new regularization of the two-body interaction that produces exponential convergence for systems of three and four particles. We estimate the ground-state energy of the four-particle system to be (5.045{+-}0.003)({Dirac_h}/2{pi}){omega}.

74 ATOMIC AND MOLECULAR PHYSICS↗

Dynamics and potentials

A dynamics (i.e. a one-parameter group of automorphisms) of a system described by a C *-algebra with a local structure in terms of C *-subalgebras A (I ) for local domains I of the physical space (a discrete lattice) is normally constructed out of potentials P (I ), each of which is a self-adjoint element of the subalgebra A (I ), such that the the first time derivative of the dynamical change of any local observable A is i times the convergent sum of the commutator [ P (I ), A ] over all finite regions I. We will invert this relation under the assumption (obviously assumed in the usual approach) that local observables all have the first time derivative, i.e. we prove the existence of potentials for any given dynamics satisfying the above-stated condition. Furthermore, by imposing a further condition for the potential P (I ) to be chosen for each I that it does not have a portion which can be shifted to potentials for any proper subset of I, we also show (1) the existence, (2) uniqueness, (3) an automatic convergence property for the sum over I, and (4) a quite convenient property for the chosen potential. The so-obtained properties (3) and (4) are not assumed and are very useful, though they were never noticed nor used before. We consider a system of finite kinds of finite spins and fermions on a discrete lattice, local regions being all finite subsets of the lattice and all local algebras being full matrix algebras of finite dimensions. For all dynamics for which all elements of any local algebra is once time differentiable, we prove that there exist a system of potentials which describe the time derivative of the given dynamics by a convergent sum stated above. The fundamental technique for finding such potentials is a non-commutative expectation which is defined on the basis of a product state of the algebra. For each choice of a product state, we obtain one expectation which produces one set of potentials, all of which satisfy what we call the standardness condition and the convergence condition. We call this family of potentials standard potentials (corresponding to any specific choice of the product state). The standard potentials corresponding to different product states are different but produces the same time derivative, known as equivalent potentials.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking

A hybrid of the Front-Tracking (FT) and the Level-Set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected – instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based re-distancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; in contrast to traditional PDE-based re-initialization algorithms, which tend to slightly relocate the zero Level Set and can be shown to be non-convergent in curvature. The implicit pseudo-time discretization of the re-distancing equation is implemented within the Jacobian-Free Newton Krylov (JFNK) framework combined with ILU(k) preconditioning. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with iterations (CFL ), in contrast to the explicit re-distancing which requires 100s of iterations with CFL . The most cost-effective algorithm is found to be a hybrid of explicit and implicit discretizations, in which we apply first 10-15 iterations with explicit discretization (to bring the initial guess to the ball of convergence for the Newton’s method) and then finishing with 2-3 implicit steps, bringing the re-distancing equation to a complete steady-state. The eigenscopy of the JFNK-ILU(k) demonstrates the efficiency of the ILU(k) preconditioner, which effectively cluster eigenvalues of the otherwise extremely ill-conditioned Jacobian matrices, thereby enabling the Krylov (GMRES) method to converge with iterations, with only a few levels of ILU fill-ins. Importantly, due to the Level Set localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as , which implies efficiency and good scalability of the overall algorithm. The numerical examples include the well-established tests for interface kinematics under translational, rotational and tearing/stretching motion. We have shown that the mass conservation is not an issue anymore, as demonstrated using the Rider&Kothe’s time-reversed tests with extreme deformation. We are able to stretch interface structures to the under-resolved/subgrid (on the chosen Eulerian mesh) scales, and recover them back without any change in shape/loss of mass.

99 GENERAL AND MISCELLANEOUS↗

Probabilistic Cosmological Mass Mapping from Weak Lensing Shear

We infer gravitational lensing shear and convergence fields from galaxy ellipticity catalogs under a spatial process prior for the lensing potential. We demonstrate the performance of our algorithm with simulated Gaussian-distributed cosmological lensing shear maps and a reconstruction of the mass distribution of the merging galaxy cluster Abell 781 using galaxy ellipticities measured with the Deep Lens Survey. Given interim posterior samples of lensing shear or convergence fields on the sky, we describe an algorithm to infer cosmological parameters via lens field marginalization. In the most general formulation of our algorithm we make no assumptions about weak shear or Gaussian-distributed shape noise or shears. Because we require solutions and matrix determinants of a linear system of dimension that scales with the number of galaxies, we expect our algorithm to require parallel high-performance computing resources for application to ongoing wide field lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

The Fragmentation Criteria in Local Vertically Stratified Self-gravitating Disk Simulations

Massive circumstellar disks are prone to gravitational instabilities, which trigger the formation of spiral arms that can fragment into bound clumps under the right conditions. Two-dimensional simulations of self-gravitating disks are useful starting points for studying fragmentation because they allow high-resolution simulations of thin disks. However, convergence issues can arise in 2D from various sources. One of these sources is the 2D approximation of self-gravity, which exaggerates the effect of self-gravity on small scales when the potential is not smoothed to account for the assumed vertical extent of the disk. This effect is enhanced by increased resolution, resulting in fragmentation at longer cooling timescales β . If true, it suggests that the 3D simulations of disk fragmentation may not have the same convergence problem and could be used to examine the nature of fragmentation without smoothing self-gravity on scales similar to the disk scale height. To that end, we have carried out local 3D self-gravitating disk simulations with simple β cooling with fixed background irradiation to determine if 3D is necessary to properly describe disk fragmentation. Above a resolution of ∼40 grid cells per scale height, we find that our simulations converge with respect to the cooling timescale. This result converges in agreement with analytic expectations which place a fragmentation boundary at β {sub crit} = 3.

79 ASTRONOMY AND ASTROPHYSICS↗

Rayleigh Quotient Iteration in 3D, Deterministic Neutron Transport

Today's "grand challenge" neutron transport problems require 3-D meshes with billions of cells, hundreds of energy groups, and accurate quadratures and scattering expansions. Leadership-class computers provide platforms on which high-fidelity fluxes can be calculated. However, appropriate methods are needed that can use these machines effectively. Such methods must be able to use hundreds of thousands of cores and have good convergence properties. Rayleigh quotient iteration (RQI) is an eigenvalue solver that has been added to the Sn code Denovo to address convergence. Rayleigh quotient iteration is an optimal shifted inverse iteration method that should converge in fewer iterations than the more common power method and other shifted inverse iteration methods for many problems of interest. Denovo's RQI uses a new multigroup Krylov solver for the fixed source solutions inside every iteration that allows parallelization in energy in addition to space and angle. This Krylov solver has been shown to scale successfully to 200,000 cores: for example one test problem scaled from 69,120 cores to 190,080 cores with 98% efficiency. This paper shows that RQI works for some small problems. However, the Krylov method upon which it relies does not always converge because RQI creates ill-conditioned systems. This result leads to the conclusion that preconditioning is needed to allow this method to be applicable to a wider variety of problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Results from tight and loose coupled multiphysics in nuclear fuels performance simulations using BISON

The behavior of nuclear fuel in the reactor environment is affected by multiple physics, most notably heat conduction and solid mechanics, which can have a strong influence on each other. To provide credible solutions, a fuel performance simulation code must have the ability to obtain solutions for each of the physics, including coupling between them. Solution strategies for solving systems of coupled equations can be categorized as loosely-coupled, where the individual physics are solved separately, keeping the solutions for the other physics fixed at each iteration, or tightly coupled, where the nonlinear solver simultaneously drives down the residual for each physics, taking into account the coupling between the physics in each nonlinear iteration. In this paper, we compare the performance of loosely and tightly coupled solution algorithms for thermomechanical problems involving coupled thermal and mechanical contact, which is a primary source of interdependence between thermal and mechanical solutions in fuel performance models. The results indicate that loosely-coupled simulations require significantly more nonlinear iterations, and may lead to convergence trouble when the thermal conductivity of the gap is too small. We also apply the tightly coupled solution strategy to a nuclear fuel simulation of an experiment in a test reactor. Studying the results from these simulations indicates that perhaps convergence for either approach may be problem dependent, i.e., there may be problems for which a loose coupled approach converges, where tightly coupled won't converge and vice versa. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Model representations of aerosol layers transported from North America over the Atlantic Ocean during the Two-Column Aerosol Project

The ability of the Weather Research and Forecasting model with chemistry (WRF-Chem) version 3.7 and the Community Atmosphere Model version 5.3 (CAM5) in simulating profiles of aerosol properties is quantified using extensive in situ and remote sensing measurements from the Two Column Aerosol Project (TCAP) conducted during July of 2012. TCAP was supported by the U.S. Department of Energy’s Atmospheric Radiation Measurement program and was designed to obtain observations within two atmospheric columns; one fixed over Cape Cod, Massachusetts and the other several hundred kilometers over the ocean. The performance is quantified using most of the available aircraft and surface measurements during July, and two days are examined in more detail to identify the processes responsible for the observed aerosol layers. The higher resolution WRF-Chem model produced more aerosol mass in the free troposphere than the coarser resolution CAM5 model so that the fraction of aerosol optical thickness above the residual layer from WRF-Chem was more consistent with lidar measurements. We found that the free troposphere layers are likely due to mean vertical motions associated with synoptic-scale convergence that lifts aerosols from the boundary layer. The vertical displacement and the time period associated with upward transport in the troposphere depend on the strength of the synoptic system and whether relatively high boundary layer aerosol concentrations are present where convergence occurs. While a parameterization of subgrid scale convective clouds applied in WRF-Chem modulated the concentrations of aerosols aloft, it did not significantly change the overall altitude and depth of the layers.

Environmental Molecular Sciences Laboratory↗

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Multistage mixed precision iterative refinement

Abstract Low precision arithmetic, in particular half precision (16‐bit) floating point arithmetic, is now available in commercial hardware. Using lower precision can offer significant savings in computation and communication costs with proportional savings in energy. Motivated by this, there has been a renewed interest in mixed precision iterative refinement schemes for solving linear systems , and new variants of GMRES‐based iterative refinement have been developed. Each particular variant with a given combination of precisions leads to different condition number‐based constraints for convergence of the backward and forward errors, and each has different performance costs. The constraints for convergence given in the literature are, as an artifact of the analyses, often overly strict in practice, and thus could lead a user to select a more expensive variant when a less expensive one would have sufficed. In this work, we develop a multistage mixed precision iterative refinement solver which aims to combine existing mixed precision approaches to balance performance and accuracy and improve usability. For a user‐specified initial combination of precisions, the algorithm begins with the least expensive approach and convergence is monitored via inexpensive computations with quantities produced during the iteration. If slow convergence or divergence is detected using particular stopping criteria, the algorithm switches to use a more expensive, but more reliable variant. A novel aspect of our approach is that, unlike existing implementations, our algorithm first attempts to use “stronger” GMRES‐based solvers for the solution update before resorting to increasing the precision(s). In some scenarios, this can avoid the need to refactorize the matrix in higher precision. We perform extensive numerical experiments on a variety of random dense problems and problems from real applications which confirm the benefits of the multistage approach.

Oktay, Eda↗

Weighted relaxation for multigrid reduction in time

Current trends in computer architectures now mean that faster computation speed must come primarily from increased concurrency, not faster clock speeds, which are stagnating. Thus, this situation creates bottlenecks for serial algorithms, including the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. Here, in this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that by choosing appropriate non-unitary relaxation weights, one can achieve faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%–20% saving in iterations, which is significant when using large high-performance computers. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.

97 MATHEMATICS AND COMPUTING↗

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗

Distributions in CFT. Part I. Cross-ratio space

We show that the four-point functions in conformal field theory are defined as distributions on the boundary of the region of convergence of the conformal block expansion. The conformal block expansion converges in the sense of distributions on this boundary, i.e. it can be integrated term by term against appropriate test functions. This can be interpreted as a giving a new class of functionals that satisfy the swapping property when applied to the crossing equation, and we comment on the relation of our construction to other types of functionals. Our language is useful in all considerations involving the boundary of the region of convergence, e.g. for deriving the dispersion relations. We establish our results by elementary methods, relying only on crossing symmetry and the standard convergence properties of the conformal block expansion. This is the first in a series of papers on distributional properties of correlation functions in conformal field theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗