Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical Computing”

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,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Higher-Order Bessel Equations Integrable in Elementary Functions

The eigenfunction problem for a scalar Euler operator leads to an ordinary differential equation, which is an analog of higher-order Bessel equations. Its solutions are expressed through elementary functions in the case where the corresponding Euler operator can be factorized in a certain appropriate way. We obtain a formula describing such solutions. We consider the problem on common eigenfunctions of two Euler operators and present commuting Euler operators of orders 4, 6, and 10 and a formula for their common eigenfunction and also commuting operators of orders 6 and 9.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions

We study an unconstrained minimization approach to the generalized complementarity problem GCP(f, g) based on the generalized Fischer-Burmeister function and its generalizations when the underlying functions are C{sup 1}. Also, we show how, under appropriate regularity conditions, minimizing the merit function corresponding to f and g leads to a solution of the generalized complementarity problem. Moreover, we propose a descent algorithm for GCP(f, g) and show a result on the global convergence of a descent algorithm for solving generalized complementarity problem. Finally, we present some preliminary numerical results. Our results further give a unified/generalization treatment of such results for the nonlinear complementarity problem based on generalized Fischer-Burmeister function and its generalizations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Smoothing by cubic spline modified applied to solve inverse thermal problem

This paper presents an alternative to cubic spline regularization and its weighted form applied in solving inverse thermal problems. The inverse heat transfer problems are classified as ill-posed, that is, the solution may become unstable, mainly because they are sensitive to random errors deriving from the input data, necessitating a regularization method to soften these effects. The smoothing technique proposed by cubic spline regularization ensures that the global data tend to be more stable, with fewer data oscillations and dependent on a single arbitrary parameter input. It also shows that the weighted cubic spline is able to enhance filter action. The methods have been implemented in order for the search engine to optimize the choice of parameters and weight and, thus, the smoothing gains more flexibility and accuracy. The simulated and experimental tests confirm that the techniques are effective in reducing the amplified noise by inverse thermal problem presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

This paper presents a new variant of periodic vehicle routing problem in which the reaching time to the customers affects market share. Thus, there is a competition between distributors to achieve more market share by reaching the customers earlier than others; moreover, travel time between each two pairs of customers is uncertain. This situation is called an uncertain competitive environment. For the given problem, a new bi-objective mathematical model including minimization of total traveled time and maximization of the market share is presented. In order to solve this model, a multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied; and to evaluate the algorithm performance, some samples are generated; and the results of algorithms are compared based on some comparison metrics. The results demonstrate that the proposed LMOPSO algorithm leads to a better performance compared to the MOPSO in most comparison metrics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Dynamics of an epidemic model with delays and stage structure

In this paper, dynamics of a stage-structured epidemic model with delays and nonlinear incidence rate is analyzed. Local stability and existence of Hopf bifurcation is discussed by choosing possible combination of the delays as the bifurcation parameter. It is proved that the unique endemic equilibrium is locally asymptotically stable when the delay is suitably small and a bifurcating periodic solution will be caused once the delay passes through the corresponding critical value of the delay. We make use of the normal form theory and center manifold theorem to obtain the explicit formulas for determining the properties of the Hopf bifurcation. Numerical simulations supporting our obtained findings are carried out in the end.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A family of second-order fully explicit time integration schemes

A new family of fully explicit time integration methods is proposed, which has second-order accuracy for structures with and without damping. Using a diagonal mass matrix, the suggested scheme remains fully explicit not only for structures with a non-diagonal damping matrix, but also when the internal force vector is a nonlinear function of velocity. The present algorithm has an acceptable domain of stability, and it is self-starting. This technique introduces effectively numerical dissipation to suppress the high-frequency spurious modes, while at the same time the lower modes are not affected too much. In addition, numerical dispersion error of the scheme is considerably smaller than that of the central difference method. Solving several linear and nonlinear problems highlights the superior performance of the authors’ approach. Findings demonstrate that solution time for the suggested scheme is much less than that of the central difference technique. The related algorithm can be easily implemented into programs, which already contain the central difference method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Hilfer–Katugampola fractional derivatives

We propose a new fractional derivative, the Hilfer–Katugampola fractional derivative. Motivated by the Hilfer derivative this formulation interpolates the well-known fractional derivatives of Hilfer, Hilfer–Hadamard, Riemann–Liouville, Hadamard, Caputo, Caputo–Hadamard, Liouville, Weyl, generalized and Caputo-type. As an application, we consider a nonlinear fractional differential equation with an initial condition using this new formulation. We show that this equation is equivalent to a Volterra integral equation and demonstrate the existence and uniqueness of solution to the nonlinear initial value problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Biparametric investigation of the general standard map: multistability and global bifurcations

We investigate multistability and global bifurcations in the general standard map, a biparametric two-dimensional map. Departing from the conservative case of the map, we describe the evolution of periodic solutions and their basins of attraction as dissipation builds up, paying special attention on how the biparametric variation affects multistability. We examine general and specific phenomena and behavior for three distinct dynamical regimes, namely small, moderate, and large damping and different forcing amplitudes. Also, we report numerically the mechanism of global bifurcations associated to small chaotic attractors in the multistable system. Several global bifurcations are investigated as dissipation increases. Specifically, through the characterization of an interior, a merging and a boundary crisis, we study the crucial role played by fundamental hyperbolic invariant structures, such as unstable periodic orbits and their stable and unstable invariant manifolds, in the mechanisms by which the phase space is globally transformed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Applying Legendre wavelet method with Tikhonov regularization for one-dimensional time-fractional diffusion equations

In this paper, a new method based on two-dimensional Legendre wavelet basis is proposed to solve time-fractional diffusion equations. This technique is used to convert the problem into a system of linear algebraic equations via expanding the required approximation based on the Legendre wavelet basis. The effectiveness of the proposed method is examined by comparing the numerical results with other methods. When the desired system is large, it is ill-conditioned; in this case, Tikhonov regularization method, with discrepancy principle for finding the regularization parameter, is applied to stabilize the solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On generalized Ri’s contraction mappings and its applications

In this work, we improve the Ri’s fixed point theorem in Ri (Indag Math 27:85–93, 2016) by creating the φ-fixed point version of such result in metric spaces. These results generalize and extend several well-known comparable results in the literature. Several applications and some examples of our theorems are also given.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Block triangular preconditioning for stochastic Galerkin method

Here, in this paper, we develop a new block triangular preconditioner for solving partial differential equations with random coefficients. We prove spectral bounds for the preconditioned system. Several numerical examples are provided to demonstrate the efficiency of this preconditioner, especially for stochastic problems with large variance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Finite spatial-grid effects in energy-conserving particle-in-cell algorithms

Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. We also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length. Finite-grid (or aliasing) instabilities are pervasive in particle-in-cell (PIC) plasma simulation algorithms, and force the modeler to resolve the smallest (Debye) length scale in the problem regardless of dynamical relevance. These instabilities originate in the aliasing of interpolation errors between mesh quantities and particles (which live in the space–time continuum). Recently, strictly energy-conserving PIC (EC-PIC) algorithms have been developed that promise enhanced robustness against aliasing instabilities. In this study, we confirm by analysis that EC-PIC is stable against aliasing instabilities for stationary plasmas. For drifting plasmas, we demonstrate by analysis and numerical experiments that, while EC-PIC algorithms are not free from these instabilities in principle, they feature a benign stability threshold for finite-temperature plasmas that make them usable in practice for a large class of problems (featuring ambipolarity and realistic ion-electron mass ratios) without the need to consider the size of the Debye length. Finally, we also demonstrate that this threshold is absent for the popular momentum-conserving PIC algorithms, which are therefore unstable for both drifting and stationary plasmas beyond a threshold in cell size compared to Debye length.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Reweighted ℓ{sub 1} minimization method for stochastic elliptic differential equations

We consider elliptic stochastic partial differential equations (SPDEs) with random coefficients and solve them by expanding the solution using generalized polynomial chaos (gPC). Under some mild conditions on the coefficients, the solution is “sparse” in the random space, i.e., only a small number of gPC basis makes considerable contribution to the solution. To exploit this sparsity, we employ reweighted l{sub 1} minimization to recover the coefficients of the gPC expansion. We also combine this method with random sampling points based on the Chebyshev probability measure to further increase the accuracy of the recovery of the gPC coefficients. We first present a one-dimensional test to demonstrate the main idea, and then we consider 14 and 40 dimensional elliptic SPDEs to demonstrate the significant improvement of this method over the standard l{sub 1} minimization method. For moderately high dimensional (∼10) problems, the combination of Chebyshev measure with reweighted l{sub 1} minimization performs well while for higher dimensional problems, reweighted l{sub 1} only is sufficient. The proposed approach is especially suitable for problems for which the deterministic solver is very expensive since it reuses the sampling results and exploits all the information available from limited sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A curvilinear, fully implicit, conservative electromagnetic PIC algorithm in multiple dimensions

Here, we extend a recently proposed fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions (Chen and Chacón (2015) [1]) to curvilinear geometry. As in the Cartesian case, the approach is based on a potential formulation (Φ, A), and overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. Conservation theorems for local charge and global energy are derived in curvilinear representation, and then enforced discretely by a careful choice of the discretization of field and particle equations. Additionally, the algorithm conserves canonical-momentum in any ignorable direction, and preserves the Coulomb gauge ∇ • A = 0 exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. We demonstrate the accuracy and efficiency properties of the algorithm with numerical experiments in mapped meshes in 1D-3V and 2D-3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

A scalable, fully implicit algorithm for the reduced two-field low-β extended MHD model

Here, we demonstrate a scalable fully implicit algorithm for the two-field low-β extended MHD model. This reduced model describes plasma behavior in the presence of strong guide fields, and is of significant practical impact both in nature and in laboratory plasmas. The model displays strong hyperbolic behavior, as manifested by the presence of fast dispersive waves, which make a fully implicit treatment very challenging. In this study, we employ a Jacobian-free Newton–Krylov nonlinear solver, for which we propose a physics-based preconditioner that renders the linearized set of equations suitable for inversion with multigrid methods. As a result, the algorithm is shown to scale both algorithmically (i.e., the iteration count is insensitive to grid refinement and timestep size) and in parallel in a weak-scaling sense, with the wall-clock time scaling weakly with the number of cores for up to 4096 cores. For a 4096 × 4096 mesh, we demonstrate a wall-clock-time speedup of ~6700 with respect to explicit algorithms. The model is validated linearly (against linear theory predictions) and nonlinearly (against fully kinetic simulations), demonstrating excellent agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

An asymptotic-preserving 2D-2P relativistic Drift-Kinetic-Equation solver for runaway electron simulations in axisymmetric tokamaks

We propose an asymptotic-preserving (AP), uniformly convergent numerical scheme for the relativistic collisional Drift-Kinetic Equation (rDKE) to simulate runaway electrons in axisymmetric toroidal magnetic field geometries typical of tokamak devices. The approach is derived from an exact Green's function solution with numerical approximations of quantifiable impact, and results in a simple, two-step operator-split algorithm, consisting of a collisional Eulerian step, and a Lagrangian orbit-integration step with analytically prescribed kernels. The AP character of the approach is demonstrated by analysis of the dominant numerical errors, as well as by numerical experiments. We demonstrate the ability of the algorithm to provide accurate answers regardless of plasma collisionality on a circular axisymmetric tokamak geometry.

97 MATHEMATICS AND COMPUTING↗