Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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

A new solution for the 1D neutral particle transport equation in heterogeneous media - Paper 89

The equation of photon transport in directionally discretized 2N streams has been the subject of various numerical algorithms over the past 65 years since Chandrasekhar first explored the concept. The importance of this equation cannot be overemphasized, as it characterizes neutral particles (in this case photons) undergoing collisions as characterized by the scattering phase function in a 1D slab medium. More precisely, particles enter a homogeneous slab medium with the particle intensity distribution to be numerically determined. We find applications in light scattering for graphical rendering as well as deep penetration photon transport in a scattering medium as considered here. Noting the algebraic nature of the solution, numerous numerical attempts at an efficient algorithm have appeared in the literature-- many involving numerical linear algebra. Most notable are the Discrete Ordinates Method [DOM] of Stamnes and the Analytical Discrete Ordinates (ADO) method of Siewert as well as the Laplace Transform (LTSN) method of Vilhena. The methods are all centered on the determination of eigenvalues (or zeros of a polynomial in the case of the LTSN method) of a linear system enabling the solution to be represented as a sum of exponential eigenvectors. Because of the unstable nature of the solution, unless one takes care, such a representation leads to numerical catastrophe. Here, we derive an alternative form of solution to overcome this difficulty for application to deep penetration.

61 RADIATION PROTECTION AND DOSIMETRY↗

Integrated Multiscale Modeling of Molecular Computing Devices

The main bottleneck in modeling transport in molecular devices is to develop the correct formulation of the problem and efficient algorithms for analyzing the electronic structure and dynamics using, for example, the time-dependent density functional theory. We have divided this task into several steps. The first step is to developing the right mathematical formulation and numerical algorithms for analyzing the electronic structure using density functional theory. The second step is to study time-dependent density functional theory, particularly the far-field boundary conditions. The third step is to study electronic transport in molecular devices. We are now at the end of the first step. Under DOE support, we have made subtantial progress in developing linear scaling and sub-linear scaling algorithms for electronic structure analysis. Although there has been a huge amount of effort in the past on developing linear scaling algorithms, most of the algorithms developed suffer from the lack of robustness and controllable accuracy. We have made the following progress: (1) We have analyzed thoroughly the localization properties of the wave-functions. We have developed a clear understanding of the physical as well as mathematical origin of the decay properties. One important conclusion is that even for metals, one can choose wavefunctions that decay faster than any algebraic power. (2) We have developed algorithms that make use of these localization properties. Our algorithms are based on non-orthogonal formulations of the density functional theory. Our key contribution is to add a localization step into the algorithm. The addition of this localization step makes the algorithm quite robust and much more accurate. Moreover, we can control the accuracy of these algorithms by changing the numerical parameters. (3) We have considerably improved the Fermi operator expansion (FOE) approach. Through pole expansion, we have developed the optimal scaling FOE algorithm.

99 GENERAL AND MISCELLANEOUS↗

A finite element formulation for deformation twinning induced strain localization in polycrystal magnesium alloys

Deformation twinning induces shear strain localization in hexagonal close-packed crystals and is critical for the material’s ductility and failure. Cracks often occur at twin-twin or twin-grain boundary intersections and propagate along twin bands. However, most crystal plasticity models for deformation twinning are based on a “pseudo-slip” approach and do not capture the localized deformation associated with the formation of each discrete twin band. The few exceptions are discrete twin models that involve very complex numerical algorithms and are often compromised in accuracy due to the numerical convergence. These factors make the discrete twin models hard to adopt. This paper proposes a modification to the conventional finite element weak form, to fully incorporate a twin-induced heterogeneous deformation that does not depend on the “pseudo-slip” assumption. The model starts by splitting the deformation gradient into elastic-slip-twinning components. The twin-induced deformation gradient component is computed separately by solving a microstructural evolution problem and then implemented into finite element weak form by constructing a global “twin-force” vector. The constitutive update (e.g., in the user-defined material subroutine, or UMAT, for ABAQUS) therefore avoids dealing with the twinning and recovers to the form of a regular slip-based crystal plasticity model. The results presented here indicate that the twin-induced strain localization and the associated stress-reversal phenomena near the twin band were naturally captured in the model, which was validated against an in-situ synchrotron X-ray micro-diffraction experiment.

36 MATERIALS SCIENCE↗

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.

Seal, Sudip K↗

Numerical evaluation of convex-roof entanglement measures with applications to spin rings

We present two ready-to-use numerical algorithms to evaluate convex-roof extensions of arbitrary pure-state entanglement monotones. Their implementation leaves the user merely with the task of calculating derivatives of the respective pure-state measure. We provide numerical tests of the algorithms and demonstrate their good convergence properties. We further employ them in order to investigate the entanglement in particular few-spins systems at finite temperature. Namely, we consider ferromagnetic Heisenberg exchange-coupled spin-(1/2) rings subject to an inhomogeneous in-plane field geometry obeying full rotational symmetry around the axis perpendicular to the ring through its center. We demonstrate that highly entangled states can be obtained in these systems at sufficiently low temperatures and by tuning the strength of a magnetic field configuration to an optimal value which is identified numerically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel domain decomposition-based implicit method for the Cahn–Hilliard–Cook phase-field equation in 3D

We present a numerical algorithm for simulating the spinodal decomposition described by the three dimensional Cahn–Hilliard–Cook (CHC) equation, which is a fourth-order stochastic partial differential equation with a noise term. The equation is discretized in space and time based on a fully implicit, cell-centered finite difference scheme, with an adaptive time-stepping strategy designed to accelerate the progress to equilibrium. At each time step, a parallel Newton–Krylov–Schwarz algorithm is used to solve the nonlinear system. We discuss various numerical and computational challenges associated with the method. The numerical scheme is validated by a comparison with an explicit scheme of high accuracy (and unreasonably high cost). We present steady state solutions of the CHC equation in two and three dimensions. The effect of the thermal fluctuation on the spinodal decomposition process is studied. We show that the existence of the thermal fluctuation accelerates the spinodal decomposition process and that the final steady morphology is sensitive to the stochastic noise. We also show the evolution of the energies and statistical moments. In terms of the parallel performance, it is found that the implicit domain decomposition approach scales well on supercomputers with a large number of processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimum feature size control in level set topology optimization via density fields

A level set topology optimization approach that uses an auxiliary density field to nucleate holes during the optimization process and achieves minimum feature size control in optimized designs is explored. The level set field determines the solid-void interface and the density field describes the distribution of a fictitious porous material using the solid isotropic material with penalization. These fields are governed by two sets of independent optimization variables which are initially coupled using a penalty for hole nucleation. The strength of the density field penalization and projection is gradually increased during the optimization process to promote a 0-1 density distribution. In addition, a second penalty regulates the evolution of the density field in the void phase. The treatment of the density field combined with the second penalty mitigate the appearance of small design features. The minimum feature size of optimized designs is controlled by the radius of the linear filter applied to the density optimization variables. The structural response is predicted by the extended finite element method, the sensitivities by the adjoint method, and the optimization variables are updated by a gradient-based optimization algorithm. Numerical examples investigate the robustness of this approach with respect to algorithmic parameters and mesh refinement. The results show the applicability of the combined density level set topology optimization approach for both optimal hole nucleation and for minimum feature size control in 2D and 3D. This comes, however, at the cost of a more complex problem formulation and additional computational cost due to an increased number of optimization variables.

42 ENGINEERING↗

Chasing the nonlinear evolution of matter power spectrum with a numerical resummation method: Solution of closure equations

We present a new numerical scheme to treat the nonlinear evolution of cosmological power spectra. Governing equations for matter power spectra have been previously derived by a nonperturbative technique with closure approximation. Solutions of the resultant closure equations just correspond to the resummation of an infinite class of perturbation corrections, and they consistently reproduce the one-loop results of standard perturbation theory. We develop a numerical algorithm to solve closure evolutions in both perturbative and nonperturbative regimes. The present numerical scheme is particularly suited for examining nonlinear matter power spectrum in general cosmological models, including modified theory of gravity. As a demonstration, we study weakly nonlinear evolution of power spectrum in a class of modified gravity models, as well as various dark energy models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Semiclassical Monte-Carlo approach for modelling non-adiabatic dynamics in extended molecules

Modelling of non-adiabatic dynamics in extended molecular systems and solids is a next frontier of atomistic electronic structure theory. The underlying numerical algorithms should operate only with a few quantities (that can be efficiently obtained from quantum chemistry), provide a controlled approximation (which can be systematically improved) and capture important phenomena such as branching (multiple products), detailed balance and evolution of electronic coherences. Here we propose a new algorithm based on Monte-Carlo sampling of classical trajectories, which satisfies the above requirements and provides a general framework for existing surface hopping methods for non-adiabatic dynamics simulations. In particular, our algorithm can be viewed as a post-processing technique for analysing numerical results obtained from the conventional surface hopping approaches. Presented numerical tests for several model problems demonstrate efficiency and accuracy of the new method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coupled Electro-Thermal Analysis of Permanent Magnet Synchronous Motor for Electric Vehicles

Permanent magnet synchronous motors (PMSM) are extensively used in electric vehicles. However, high internal heat generation and inefficient heat dissipation often limit the operational reliability, and longevity of the PMSM. Therefore, proper quantification of heat generation in electric motor and advanced embedded motor cooling techniques remain topics of immense interest. In order to accurately predict electro-magnetic performance, i.e., efficiency, component-wise heat losses and the corresponding temperature distribution of a jacket cooled machine, this paper presents a two-way iteratively coupled electro-thermal modeling framework. Finite element based software Motor-CAD has been utilized for electro-magnetic performance calculation of BMW i3 PMSM. Finite volume based computational fluid dynamics/heat transfer (CFD/HT) software ANSYS® FLUENT® has been employed to simulate the temperature distribution of the PMSM, using the electro-magnetic losses as heat input. Computed heat losses, stator, winding, rotor, and magnet temperatures are utilized as coupling parameters between the electro-magnetic and thermal models. A conventional one-way coupling algorithm has also been developed and compared to the newly proposed two-way coupling algorithm. Numerical results confirm that at high current density, one-way coupling algorithm significantly over-predicts the motor temperature compared to the two-way algorithm. A comprehensive analysis has been carried out to characterize the influences of current density, speed, and forced convection heat transfer coefficient on the heat losses, overall efficiency, and maximum temperature of the PMSM. Lastly, an efficiency map has been interpreted from the coupled electro-magnetic simulation.

42 ENGINEERING↗

An Introduction of Numerical Methods for Unconstrained Nonlinear Equations

Many applications in computational physics are nonlinear problems. These nonlinear problems include quantitative object reconstruction problems, inverse transport problems, nuclear weapon design problems, and particle tracking on unstructured meshes. The numerical algorithms used to solve nonlinear equations should be robust, reliable, and efficient. Numerical methods for unconstrained nonlinear equations are introduced in the slides.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Construction of a Code Verification Matrix for Heat Conduction With Finite Element Code Applications

When establishing the pedigree of a simulation tool, code verification is used to ensure that the implemented numerical algorithm is a faithful representation of its underlying mathematical model. During this process, numerical results on various meshes are systematically compared to a reference analytic solution. The selection of analytic solutions can be a laborious process, as it is difficult to establish adequate code confidence without performing redundant work. In this report we address this issue by applying a physics-based process that establishes a set of reference problems. In this process, code simulation options are categorized and systematically tested, which ensures that gaps in testing are easily identified and addressed. The resulting problems are primarily intended for code verification analysis but may also be useful for comparison to other simulation codes, troubleshooting activities, or training exercises. The process is used to select fifteen code verification problems relevant for the one-dimensional steady-state heat conduction equation. These problems are applicable to a wide variety of simulation tools, but, in this work, a demonstration is performed using the finite element-based nuclear fuel performance code BISON. Convergence to the analytic solution at the theoretical rate is quantified for a selection of the problems, which establishes a baseline pedigree for the code. Not only can this standard set of conduction solutions be used for verification of other codes, but also the physics-based process for selecting problems can be utilized to quantify and expand testing for any simulation tool.

42 ENGINEERING↗

Controlled Nonlinear Stochastic Delay Equations: Part II: Approximations and Pipe-Flow Representations

This is the second part of a work dealing with key issues that have not been addressed in the modeling and numerical optimization of nonlinear stochastic delay systems. We consider new classes of models, such as those with nonlinear functions of several controls (such as products), each with is own delay, controlled random Poisson measure driving terms, admissions control with delayed retrials, and others. Part I was concerned with issues concerning the class of admissible controls and their approximations, since the classical definitions are inadequate for our models. This part is concerned with transportation equation representations and their approximations. Such representations of nonlinear stochastic delay models have been crucial in the development of numerical algorithms with much reduced memory and computational requirements. The representations for the new models are not obvious and are developed. They also provide a template for the adaptation of the Markov chain approximation numerical methods.

97 MATHEMATICS AND COMPUTING↗

Efficient Integration of Quantum Mechanical Wave Equations by Unitary Transforms

The integration of time dependent quantum mechanical wave equations is a fundamental problem in computational physics and computational chemistry. The energy and momentum spectrum of a wave function imposes fundamental limits on the performance of numerical algorithms for this problem. We demonstrate how unitary transforms can help to surmount these limitations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A RAY-TRACING ALGORITHM FOR SPINNING COMPACT OBJECT SPACETIMES WITH ARBITRARY QUADRUPOLE MOMENTS. I. QUASI-KERR BLACK HOLES

We describe a new numerical algorithm for ray tracing in the external spacetimes of spinning compact objects characterized by arbitrary quadrupole moments. Such spacetimes describe non-Kerr vacuum solutions that can be used to test the no-hair theorem in conjunction with observations of accreting black holes. They are also appropriate for neutron stars with spin frequencies in the {approx_equal} 300-600 Hz range, which are typical of the bursting sources in low-mass X-ray binaries. We use our algorithm to show that allowing for the quadrupole moment of the spacetime to take arbitrary values leads to observable effects in the profiles of relativistic broadened fluorescent iron lines from geometrically thin accretion disks.

79 ASTRONOMY AND ASTROPHYSICS↗

Terascale High-Fidelity Simulations of Turbulent Combustion with Detailed Chemistry: Spray Simulations

The Terascale High-Fidelity Simulations of Turbulent Combustion (TSTC) project is a multi-university collaborative effort to develop a high-fidelity turbulent reacting flow simulation capability utilizing terascale, massively parallel computer technology. The main paradigm of the approach is direct numerical simulation (DNS) featuring the highest temporal and spatial accuracy, allowing quantitative observations of the fine-scale physics found in turbulent reacting flows as well as providing a useful tool for development of sub-models needed in device-level simulations. Under this component of the TSTC program the simulation code named S3D, developed and shared with coworkers at Sandia National Laboratories, has been enhanced with new numerical algorithms and physical models to provide predictive capabilities for turbulent liquid fuel spray dynamics. Major accomplishments include improved fundamental understanding of mixing and auto-ignition in multi-phase turbulent reactant mixtures and turbulent fuel injection spray jets.

02 PETROLEUM↗

Application of Gauss's law space-charge limited emission model in iterative particle tracking method

The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-Scale Optimization for Bayesian Inference in Complex Systems

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focused on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. The project was a collaborative effort among MIT, the University of Texas at Austin, Georgia Institute of Technology, and Sandia National Laboratories. The research was directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. The MIT₋Sandia component of the SAGUARO Project addressed the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas₋Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to-observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗