Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 109 records · Page 6

A numerical approach for solving a class of variable-order fractional functional integral equations

This paper proposes new discretization techniques to estimate variable-order fractional integral operators based on the piecewise integro quadratic spline interpolation. The proposed methods are modified to solve a class of variable-order fractional functional integral equations. Moreover, we investigate the performance of the proposed methods by solving the variable-order fractional pantograph and Emden–Fowler functional integral equations.

97 MATHEMATICS AND COMPUTING↗

Solving many-body Schrödinger equations with kinetic energy partition method

We present a general formulation of our previously developed kinetic energy partition (KEP) method for solving many-bodySchrödinger equations. In atomic physics, as well as in general molecular and solid state physics, solving many-electronSchrödinger equations is a very challenging task, often called Dirac’s challenge. The central problem is how to properly handle the electron–electron Coulomb repulsion interactions. Using the KEP solution scheme, in addition to dividing the kinetic energy into partial terms, the electron–electron Coulomb interaction is also separated into parts to be associated with a “negative mass” kinetic energy term. Therefore, the full Hamiltonian can be expressed as a simple sum of subsystem Hamiltonians, each representing an effective one-body problem. Using a Hartree-like product in constructing the wave-function, we achieve fast convergence in the calculations of the ground state energies. First, the model Moshinsky atoms are used to illustrate the solution procedure. We then apply this new KEP method to harmonium atoms and obtain precise energies with an error less than 5% using only two basis functions from each subsystem. It is thus very promising that this methodology, when further extended, can be useful for general many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗

Semi-implicit method to solve compressible multiphase fluid flows without acoustic time step restrictions

A new 3D multiphase numerical capability is presented here for simulating multiphase flow regimes at all Mach numbers (M). The new method is a semi-implicit extension of the finite volume discrete equation method (DEM) of Chinnaya et al. (2004), which originally used explicit time-stepping. The capability is also developed to work with another extension of the DEM to moving grids for arbitrary Lagrangian-Eularian (ALE) methods detailed in Dunn (2011). Rather than solving all phase equations simultaneously, the DEM reduces the equations to a system of single-phase Riemann solves, where each phase has its own velocity and thermodynamic state. Exchanges between the phases are modeled through source terms accounting for the phase interactions. Furthermore, since the original multiphase scheme uses an explicit time-advancement scheme, it has time step restrictions dictated by the speed of sound, which limits the model's ability to simulate weakly compressible flows which typically need to be integrated for longer time periods. Here, we extend the current multiphase formulation by implementing a pressure-correcting step to enable implicit calculations and remove acoustic time step limitations. The new semi-implicit algorithm allows use of relatively large time steps compared to an explicit method. Validation and benefits of the new implicit time-step method are illustrated using several examples including weakly compressible flows and strong shock waves. The scheme presented here is general and may be used for a variety of applications which require capabilities for handling multiphase flow at a wide range of Mach numbers. However, the goal of this research is to simulate all stages of high energy explosions, including the shock formation (high Mach numbers) and evolution of the buoyant cloud (low Mach numbers).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FDTD: Solving 1+1D delay PDE in parallel

We present a proof of concept for solving a 1+1D complex-valued, delay partial differential equation (PDE) that emerges in the study of waveguide quantum electrodynamics (QED) by adapting the finite-difference time-domain (FDTD) method. The delay term is spatially non-local, rendering conventional approaches such as the method of lines inapplicable. Here, we show that by properly designing the grid and by supplying the (partial) exact solution as the boundary condition, the delay PDE can be numerically solved. In addition, we demonstrate that while the delay imposes strong data dependency, multi-thread parallelization can nevertheless be applied to such a problem. Our code provides a numerically exact solution to the time-dependent multi-photon scattering problem in waveguide QED.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Directional finite difference method for directly solving 3D gyrokinetic field equations with enhanced accuracy

The gyrokinetic (GK) field equation is a three-dimensional (3D) elliptic equation, but it is often simplified to a set of two-dimensional (2D) equations by assuming that the field does not vary along a specific direction. However, this simplification can introduce inevitable 0th-order numerical errors, as nonlinear mode coupling in toroidal geometry can produce undesirable harmonic modes that violate the assumption. In this work, we propose a novel directional finite difference method (FDM) with a local coordinate transformation to better resolve the target field of interest. The directional FDM can accurately solve 3D GK field equations without simplifications, which can overcome the limitations of conventional methods. The accuracy and efficiency of different FDMs are analyzed in great detail for a variety of geometries, from simple 2D Cartesian coordinates to realistic 3D curvilinear coordinates. The 0th-order numerical errors of simplified 2D GK equations were found to be more problematic for low-harmonic modes and low aspect ratio geometries such as spherical tokamaks. On the other hand, the directional 3D FDM can accurately resolve a much wider range of harmonic modes aligned to the direction of interest, including the low-harmonic modes. In conclusion, we demonstrate that the directional 3D FDM is a highly effective algorithm for solving the 3D GK field equations, achieving accuracy improvements of 10 to 100 times or more, particularly for low-harmonic modes in spherical tokamaks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An inverse approach to solving zone air infiltration rate and people count using indoor environmental sensor data

Physics-based simulation of energy use in buildings is typically widely used in building design and performance rating, controls design and operations. However, various challenges exist in the modeling process. Model parameters such as people count and air infiltration rate are usually highly uncertain, yet they have significant impacts on the simulation accuracy. With the increasing availability and affordability of sensors and meters in buildings, a large amount of measured data has been collected including indoor environmental parameters, such as room air dry-bulb temperature, humidity ratio, and CO 2 concentration levels. Fusing these sensor data with traditional energy modeling poses new opportunities to improve simulation accuracy. This study develops a set of physics-based inverse algorithms which can solve the highly uncertain and hard-to-measure building parameters such as zone-level people count and air infiltration rate. A simulation-based case study is conducted to verify the inverse algorithms implemented in EnergyPlus covering various sensor measurement scenarios and different modeling use cases. The developed inverse models can solve the zone people count and air infiltration at sub-hourly resolution using the measured zone air temperature, humidity and/or CO 2 concentration given other easy-to-measure model parameters are known.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem

An alternative to the production of fossil transportation fuels is the production of biofuels, particularly, bioethanol. One of the main opportunity areas is the reduction in the overall cost of biofuel. An approach to reduce this cost is to design and implement a supply chain (SC) that considers the quality-related properties of the biomass as well as the economies of scale to minimize the logistics and quality-related costs. This problem is formulated as a hub location problem, which has been classified as an NP-hard problem, thus, meta-heuristics are a suitable approach to solve this problem. We propose a hybrid meta-heuristic solution procedure to solve large-scale instances of a two-stage stochastic biomass-to-biorefinery hub-and-spoke network problem. This solution procedure is proposed to support the large-scale production and distribution of bioethanol by considering the variability in its moisture and ash contents. The hybrid method utilizes a simulated annealing-simplex method to find an initial solution and a tabu search-simplex method to improve the solution. Numerical experimentation was performed on a realistic case study in Texas. The findings demonstrate that the hybrid procedure outperforms the standard L-shaped (LS) method. The meta-heuristic combining simulated annealing and tabu search with the simplex method (SATS-SM) achieved 2.48% lower costs and required 96.57% less time, on average, when compared to the results from using the LS.

09 BIOMASS FUELS↗

Advanced operator splitting-based semi-implicit spectral method to solve the binary phase-field crystal equations with variable coefficients

We present an efficient method to solve numerically the equations of dissipative dynamics of the binary phase-field crystal model proposed by Elder et al. [K.R. Elder, M. Katakowski, M. Haataja, M. Grant, Phys. Rev. B 75 (2007) 064107] characterized by variable coefficients. Using the operator splitting method, the problem has been decomposed into sub-problems that can be solved more efficiently. A combination of non-trivial splitting with spectral semi-implicit solution leads to sets of algebraic equations of diagonal matrix form. Extensive testing of the method has been carried out to find the optimum balance among errors associated with time integration, spatial discretization, and splitting. We show that our method speeds up the computations by orders of magnitude relative to the conventional explicit finite difference scheme, while the costs of the pointwise implicit solution per timestep remains low. Also we show that due to its numerical dissipation, finite differencing can not compete with spectral differencing in terms of accuracy. In addition, we demonstrate that our method can efficiently be parallelized for distributed memory systems, where an excellent scalability with the number of CPUs is observed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel algorithm for solving the 3d Schroedinger equation

We describe a parallel algorithm for solving the time-independent 3d Schroedinger equation using the finite difference time domain (FDTD) method. We introduce an optimized parallelization scheme that reduces communication overhead between computational nodes. We demonstrate that the compute time, t, scales inversely with the number of computational nodes as t {proportional_to} (N{sub nodes}){sup -0.95} {sup {+-} 0.04}. This makes it possible to solve the 3d Schroedinger equation on extremely large spatial lattices using a small computing cluster. In addition, we present a new method for precisely determining the energy eigenvalues and wavefunctions of quantum states based on a symmetry constraint on the FDTD initial condition. Finally, we discuss the usage of multi-resolution techniques in order to speed up convergence on extremely large lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Runge-Kutta discontinuous Galerkin approach to solve reactive flows: The hyperbolic operator

A Runge-Kutta discontinuous Galerkin method to solve the hyperbolic part of reactive Navier-Stokes equations written in conservation form is presented. Complex thermodynamics laws are taken into account. Particular care has been taken to solve the stiff gaseous interfaces correctly with no restrictive hypothesis. 1D and 2D test cases are presented.

97 MATHEMATICS AND COMPUTING↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discontinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materials, as described in Johansen and Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 10{sup 6}, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

97 MATHEMATICS AND COMPUTING↗

A computational method for solving stochastic Itô–Volterra integral equations based on stochastic operational matrix for generalized hat basis functions

In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô–Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0,T] is obtained. By using these basis functions and their stochastic operational matrix, such problems can be transformed into linear lower triangular systems of algebraic equations which can be directly solved by forward substitution. Also, the rate of convergence of the proposed method is considered and it has been shown that it is O(1/(n{sup 2}) ). Further, in order to show the accuracy and reliability of the proposed method, the new approach is compared with the block pulse functions method by some examples. The obtained results reveal that the proposed method is more accurate and efficient in comparison with the block pule functions method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comparison of acceleration methods for solving the neutron transport k-eigenvalue problem

Over the past several years a number of papers have been written describing modern techniques for numerically computing the dominant eigenvalue of the neutron transport criticality problem. These methods fall into two distinct categories. The first category of methods rewrite the multi-group k-eigenvalue problem as a nonlinear system of equations and solve the resulting system using either a Jacobian-Free Newton–Krylov (JFNK) method or Nonlinear Krylov Acceleration (NKA), a variant of Anderson Acceleration. These methods are generally successful in significantly reducing the number of transport sweeps required to compute the dominant eigenvalue. The second category of methods utilize Moment-Based Acceleration (or High-Order/Low-Order (HOLO) Acceleration). These methods solve a sequence of modified diffusion eigenvalue problems whose solutions converge to the solution of the original transport eigenvalue problem. This second class of methods is, in our experience, always superior to the first, as most of the computational work is eliminated by the acceleration from the LO diffusion system. In this paper, we review each of these methods. Our computational results support our claim that the choice of which nonlinear solver to use, JFNK or NKA, should be secondary. The primary computational savings result from the implementation of a HOLO algorithm. We display computational results for a series of challenging multi-dimensional test problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn–Sham equation

First-principles density functional theory (DFT) calculations for the electronic structure problem require a solution of the Kohn–Sham equation, which requires one to solve a nonlinear eigenvalue problem. Solving the eigenvalue problem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit computation of eigenvectors and results in a significant speedup over iterative diagonalization methods for the DFT self-consistent field (SCF) calculations. However, the original formulation of the CheFSI method utilizes a sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering at latter SCF steps. This diagonalization is expensive for large scale problems. We develop a new initial filtering step to avoid completely this diagonalization, thus making the CheFSI method free of sparse iterative diagonalizations at all SCF steps. Our new approach saves memory usage and can be two to three times faster than the original CheFSI method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Error analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A wavelet-based computational method for solving stochastic Itô–Volterra integral equations

This paper presents a computational method based on the Chebyshev wavelets for solving stochastic Itô–Volterra integral equations. First, a stochastic operational matrix for the Chebyshev wavelets is presented and a general procedure for forming this matrix is given. Then, the Chebyshev wavelets basis along with this stochastic operational matrix are applied for solving stochastic Itô–Volterra integral equations. Convergence and error analysis of the Chebyshev wavelets basis are investigated. To reveal the accuracy and efficiency of the proposed method some numerical examples are included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate static condensation algorithm for solving multi-material diffusion problems on meshes non-aligned with material interfaces

In this study, we describe a new algorithm for solving multi-material diffusion problem when material interfaces are not aligned with the mesh. In this case interface reconstruction methods are used to construct approximate representation of interfaces between materials. They produce so-called multi-material cells, in which materials are represented by material polygons that contain only one material. The reconstructed interface is not continuous between cells. Finally, we suggest the new method for solving multi-material diffusion problems on such meshes and compare its performance with known homogenization methods.

36 MATERIALS SCIENCE↗