Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,711 records · Page 95

Stability of solution mappings for parametric bilevel vector equilibrium problems

In this paper, we first revisit the parametric bilevel vector equilibrium problems in Hausdorff topological vector spaces. Then we study the stability conditions such as (Hausdorff) upper semicontinuity, (Hausdorff) lower semicontinuity, outer-continuity and outer-openness of solutions for such problems. Many examples are provided to illustrate the essentialness of the imposed assumptions. For the applications, we obtain the stability results for the parametric vector variational inequality problems with equilibrium constraints and parametric vector optimization problems with equilibrium constraints.

97 MATHEMATICS AND COMPUTING↗

Evolutionary computation algorithms to coordinating order acceptance and batch delivery for an integrated supply chain scheduling

This paper proposes a novel approach of coordinating decisions in an integrated supply chain (ISC): coordinating order acceptance (OA) and batch delivery (BD) due to round trip transportation (RTT) and using third-party logistics (3PL) vehicles. The paper aims at trading off among accepted orders revenue, delivery costs as well as any penalties incurred in the ISC to maximize the total benefit. A novel mixed-integer programming is proposed for the problem. In addition, the paper provides a heuristic to form batches and develops a hybrid evolutionary computation algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA) to solve the problem. An information sharing mechanism is improved and applied. To explore and to locate the proposed PSO in a better neighborhood, a local search is proposed. Taguchi experimental design is utilized to set the appropriate values of the algorithms’ parameters and random instances are generated to evaluate the performance of the algorithms. The paper investigates the profitability sensitivity of the problem to parameters and analyzes the effect of the changes in the parameters on the performance of our proposed algorithms. The attained results show the appropriate performance of our algorithms.

97 MATHEMATICS AND COMPUTING↗

Model selection and parameter estimation in tumor growth models using approximate Bayesian computation-ABC

Cancer is one of the most fatal diseases in the world. Governments and researchers from various areas have continuously concentrated efforts to better understand the disease and propose diagnostic and treatment techniques. The use of mathematical models of tumor growth is of great importance for the development of such techniques. Due to the variety of models nowadays available in the literature, the problems of model selection and parameter estimation come into picture, aiming at suitably predicting the patient’s status of the disease. As the available data on dependent variables of existing models might not justify the use of common likelihood functions, approximate Bayesian computation (ABC) becomes a very attractive tool for model selection and model calibration (parameter estimation) in tumor growth models. In the present study, a Monte Carlo approximate Bayesian computation (ABC) algorithm is applied to select among competing models of tumor growth, with and without chemotherapy treatment. Simulated measurements are used in this work. The results obtained show that the algorithm correctly selects the model and estimates the parameters used to generate the simulated measurements.

60 APPLIED LIFE SCIENCES↗

Weak and strong orders of linear recurring sequences

The concept of the strong order of linear recurring sequence (LRS) is introduced in this paper. Necessary and sufficient conditions for the existence of the strong LRS order are derived. The strong LRS order is exploited for the formalization of the problem of the extension of a sequence from the available fragment (fragments) of that sequence. The definition of the strong LRS order opens new possibilities for formal sequence analysis whenever the weak LRS order of that sequence exists. Computational experiments with discrete iterative maps are used to illustrate the applicability of the strong LRS order in nonlinear system analysis.

97 MATHEMATICS AND COMPUTING↗

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

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

97 MATHEMATICS AND COMPUTING↗

Modeling the shape of boundary using NURBS curves directly in modified boundary integral equations for Laplace’s equation

The main purpose of this study is the modification of the parametric integral equations systems (PIES) method, to include the NURBS curves into its mathematical formulas. We want to create an opportunity for defining the boundary shape using NURBS curves without the classical discretization process. We present an inclusion of the NURBS curves into PIES, and its application in process of modeling and solving the boundary value problems, on Laplace’s equation example. The correctness and accuracy of such modeling is confirmed by the examples. Obtained solutions are compared with these obtained using linear segments and B-spline curves. Additionally, we verify the correctness of modeling and modifying the shape using analytical solutions. The NURBS curves significantly expand the possibilities and increase the accuracy of the boundary shape modeling which is an important aspect of the numerical solving of boundary value problems.

97 MATHEMATICS AND COMPUTING↗

Nekrasov tensors and nonsingular H-tensors

Nekrasov matrices and nonsingular H-matrices are closely related. In this paper, Nekrasov tensors and S-Nekrasov tensors are proved to be nonsingular H-tensors. And tensors are generalized Nekrasov tensors if and only if they are nonsingular H-tensors. Furthermore, an iterative criterion for identifying nonsingular H-tensors is provided.

97 MATHEMATICS AND COMPUTING↗

Solution to the sign problem in a frustrated quantum impurity model

In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive Hubbard model of spin-half fermions hopping on three independent one dimensional chains that interact through a triangular hopping at one end. We then convert the fermion model into an inhomogeneous one dimensional model and express the partition function as a weighted sum over fermion worldline configurations. By imposing a pairing of fermion worldlines in half the space we show that all negative weight configurations can be eliminated. This pairing naturally leads to the original frustrated quantum spin model at half filling and thus solves its sign problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of exponential integrators and traditional time integration schemes for the shallow water equations

We report the time integration scheme is probably one of the most fundamental choices in the development of an ocean model. In this paper, we investigate several time integration schemes when applied to the shallow water equations. This set of equations is accurate enough for the modeling of a shallow ocean and is also relevant to study as it is the one solved for the barotropic (i.e. vertically averaged) component of a three dimensional ocean model. We analyze different time stepping algorithms for the linearized shallow water equations. High order explicit schemes are accurate but the time step is constrained by the Courant-Friedrichs-Lewy stability condition. Implicit schemes can be unconditionally stable but, in practice lack accuracy when used with large time steps. In this paper we propose a detailed comparison of such classical schemes with exponential integrators. The accuracy and the computational costs are analyzed in different configurations.

97 MATHEMATICS AND COMPUTING↗

Effects of operator splitting and low Mach-number correction in turbulent mixing transition simulations

In this paper, transition and turbulence decay with the Taylor–Green vortex have been effectively used to demonstrate emulation of high Reynolds-number ( R e ) physical dissipation through numerical convective effects of various non-oscillatory finite-volume algorithms for implicit large eddy simulation (ILES), e.g. using the Godunov-based Eulerian adaptive mesh refinement code xRAGE. The inverse-chevron shock tube experiment simulations have been also used to assess xRAGE based ILES for shock driven turbulent mixing, compared with available simulation and laboratory data. The previous assessments are extended to evaluate new directionally-unsplit high-order algorithms in xRAGE, including a correction to address the well-known issue of excessive numerical diffusion of shock-capturing (e.g., Godunov-type) schemes for low Mach numbers. The unsplit options for hydrodynamics in xRAGE are discussed in detail, followed by fundamental tests with representative shock problems. Basic issues of transition to turbulence and turbulent mixing are discussed, and results of simulations of high- R e turbulent flow and mixing in canonical test cases are reported. Finally, compared to the directional-split cases, and for each grid resolution considered, unsplit results exhibit transition to turbulence with much higher effective R e —and significantly more so with the low Mach number correction.

97 MATHEMATICS AND COMPUTING↗

On the consistency between nearest-neighbor peridynamic discretizations and discretized classical elasticity models

The peridynamic theory of solid mechanics is a nonlocal reformulation of the classical continuum mechanics theory. At the continuum level, it has been demonstrated that classical (local) elasticity is a special case of peridynamics. Such a connection between these theories has not been extensively explored at the discrete level. This paper investigates the consistency between nearest-neighbor discretizations of linear elastic peridynamic models and finite difference discretizations of the Navier–Cauchy equation of classical elasticity. While nearest-neighbor discretizations in peridynamics have been numerically observed to present grid-dependent crack paths or spurious microcracks, this paper focuses on a different, analytical aspect of such discretizations. We demonstrate that, even in the absence of cracks, such discretizations may be problematic unless a proper selection of weights is used. Specifically, we demonstrate that using the standard meshfree approach in peridynamics, nearest-neighbor discretizations do not reduce, in general, to discretizations of corresponding classical models. We study nodal-based quadratures for the discretization of peridynamic models, and we derive quadrature weights that result in consistency between nearest-neighbor discretizations of peridynamic models and discretized classical models. The quadrature weights that lead to such consistency are, however, model-/discretization-dependent. We motivate the choice of those quadrature weights through a quadratic approximation of displacement fields. The stability of nearest-neighbor peridynamic schemes is demonstrated through a Fourier mode analysis. Finally, an approach based on a normalization of peridynamic constitutive constants at the discrete level is explored. This approach results in the desired consistency for one-dimensional models, but does not work in higher dimensions. The results of the work presented in this paper suggest that even though nearest-neighbor discretizations should be avoided in peridynamic simulations involving cracks, such discretizations are viable, for example for verification or validation purposes, in problems characterized by smooth deformations. Furthermore, we demonstrate that better quadrature rules in peridynamics can be obtained based on the functional form of solutions.

42 ENGINEERING↗

Reduced order models for Lagrangian hydrodynamics

It is reported, as a mathematical model of high-speed flow and shock wave propagation in a complex multimaterial setting, Lagrangian hydrodynamics is characterized by moving meshes, advection-dominated solutions, and moving shock fronts with sharp gradients. These challenges hinder the existing projection-based model reduction schemes from being practical. We develop several variations of projection-based reduced order model techniques for Lagrangian hydrodynamics by introducing three different reduced bases for position, velocity, and energy fields. A time-windowing approach is also developed to address the challenge imposed by the advection-dominated solutions. Lagrangian hydrodynamics is formulated as a nonlinear problem, which requires a proper hyper-reduction technique. Therefore, we apply the over-sampling DEIM and SNS approaches to reduce the complexity due to the nonlinear terms. Finally, we also present both a posteriori and a priori error bounds associated with our reduced order model. We compare the performance of the spatial and time-windowing reduced order modeling approaches in terms of accuracy and speed-up with respect to the corresponding full order model for several numerical examples, namely Sedov blast, Gresho vortices, Taylor-Green vortices, and triple-point problems.

97 MATHEMATICS AND COMPUTING↗

Limitations of polynomial chaos expansions in the Bayesian solution of inverse problems

Polynomial chaos expansions are used to reduce the computational cost in the Bayesian solutions of inverse problems by creating a surrogate posterior that can be evaluated inexpensively. We show, by analysis and example, that when the data contain significant information beyond what is assumed in the prior, the surrogate posterior can be very different from the posterior, and the resulting estimates become inaccurate. One can improve the accuracy by adaptively increasing the order of the polynomial chaos, but the cost may increase too fast for this to be cost effective compared to Monte Carlo sampling without a surrogate posterior.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-element least square HDMR methods and their applications for stochastic multiscale model reduction

Stochastic multiscale modeling has become a necessary approach to quantify uncertainty and characterize multiscale phenomena for many practical problems such as flows in stochastic porous media. The numerical treatment of the stochastic multiscale models can be very challengeable as the existence of complex uncertainty and multiple physical scales in the models. To efficiently take care of the difficulty, we construct a computational reduced model. To this end, we propose a multi-element least square high-dimensional model representation (HDMR) method, through which the random domain is adaptively decomposed into a few subdomains, and a local least square HDMR is constructed in each subdomain. These local HDMRs are represented by a finite number of orthogonal basis functions defined in low-dimensional random spaces. The coefficients in the local HDMRs are determined using least square methods. We paste all the local HDMR approximations together to form a global HDMR approximation. To further reduce computational cost, we present a multi-element reduced least-square HDMR, which improves both efficiency and approximation accuracy in certain conditions. To effectively treat heterogeneity properties and multiscale features in the models, we integrate multiscale finite element methods with multi-element least-square HDMR for stochastic multiscale model reduction. This approach significantly reduces the original model's complexity in both the resolution of the physical space and the high-dimensional stochastic space. We analyze the proposed approach, and provide a set of numerical experiments to demonstrate the performance of the presented model reduction techniques. - Highlights: • Multi-element least square HDMR is proposed to treat stochastic models. • Random domain is adaptively decomposed into some subdomains to obtain adaptive multi-element HDMR. • Least-square reduced HDMR is proposed to enhance computation efficiency and approximation accuracy in certain conditions. • Integrating MsFEM and multi-element least square HDMR can significantly reduce computation complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A space–angle DGFEM approach for the Boltzmann radiation transport equation with local angular refinement

In this paper a new method for the discretization of the radiation transport equation is presented, based on a discontinuous Galerkin method in space and angle that allows for local refinement in angle where any spatial element can support its own angular discretization. To cope with the discontinuous spatial nature of the solution, a generalized Riemann procedure is required to distinguish between incoming and outgoing contributions of the numerical fluxes. A new consistent framework is introduced that is based on the solution of a generalized eigenvalue problem. The resulting numerical fluxes for the various possible cases where neighboring elements have an equal, higher or lower level of refinement in angle are derived based on tensor algebra and the resulting expressions have a very clear physical interpretation. The choice of discontinuous trial functions not only has the advantage of easing local refinement, it also facilitates the use of efficient sweep-based solvers due to decoupling of unknowns on a large scale thereby approaching the efficiency of discrete ordinates methods with local angular resolution. The approach is illustrated by a series of numerical experiments. Results show high orders of convergence for the scalar flux on angular refinement. The generalized Riemann upwinding procedure leads to stable and consistent solutions. Further the sweep-based solver performs well when used as a preconditioner for a Krylov method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗