Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

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 343 records · Page 19

High-order, linearly stable, partitioned solvers for general multiphysics problems based on implicit–explicit Runge–Kutta schemes

This work introduces a general framework for constructing high-order, linearly stable, partitioned solvers for multiphysics problems from a monolithic implicit–explicit Runge–Kutta (IMEX-RK) discretization of the semi-discrete equations. The generic multiphysics problem is modeled as a system of n systems of partial differential equations where the i th subsystem is coupled to the other subsystems through a coupling term that can depend on the state of all the other subsystems. This coupled system of partial differential equations reduces to a coupled system of ordinary differential equations via the method of lines where an appropriate spatial discretization is applied to each subsystem. The coupled system of ordinary differential equations is taken as a monolithic system and discretized using an IMEX-RK discretization with a specific implicit–explicit decomposition that introduces the concept of a predictor for the coupling term. We propose four coupling predictors that enable the monolithic system to be solved in a partitioned manner, i.e., subsystem-by-subsystem, and preserve the IMEX-RK structure and therefore the design order of accuracy of the monolithic scheme. The four partitioned solvers that result from these predictors are high-order accurate, allow for maximum re-use of existing single-physics software, and two of the four solvers allow the subsystems to be solved in parallel at a given stage and time step. We also analyze the stability of a coupled, linear model problem with a specific coupling structure and show that one of the partitioned solvers achieves unconditional linear stability for this problem, while the others are unconditionally stable only for certain values of the coupling strength. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems including a simple linear system of ODEs, advection–diffusion–reaction systems, fluid–structure interaction problems, and particle-laden flows, where we verify the design order of the IMEX schemes and study various stability properties.

97 MATHEMATICS AND COMPUTING↗

Extended virtual element method for the Laplace problem with singularities and discontinuities

In this paper, we propose the extended virtual element method (X-VEM) to treat singularities and crack discontinuities that arise in the Laplace problem. The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes, wherein the basis functions are implicit (virtual)—they are not known explicitly nor do they need to be computed within the problem domain. In this work, suitable projection operators are used to decompose the bilinear form on each element into two parts: a consistent term that reproduces the first-order polynomial space and a correction term that ensures stability. A similar approach is pursued in the X-VEM with a few notable extensions. To capture singularities and discontinuities in the discrete space, we augment the standard virtual element space with an additional contribution that consists of the product of virtual nodal basis (partition-of-unity) functions with enrichment functions. For discontinuities, basis functions are discontinuous across the crack and for singularities a weakly singular enrichment function that satisfies the Laplace equation is chosen. For the Laplace problem with a singularity, we devise an extended projector that maps functions that lie in the extended virtual element space onto linear polynomials and the enrichment function, whereas for the discontinuous problem, the consistent element stiffness matrix has a block-structure that is readily computed. An adaptive homogeneous numerical integration method is used to accurately and efficiently (no element-partitioning is required) compute integrals with integrands that are weakly singular. Once the element projection matrix is computed, the same steps as in the standard VEM are followed to compute the element stabilization matrix. Numerical experiments are performed on quadrilateral and polygonal (convex and nonconvex elements) meshes for the problem of an $\textit{L}$-shaped domain with a corner singularity and the problem of a cracked membrane under mode III loading, and results are presented that affirm the sound accuracy and demonstrate the optimal rates of convergence in the $\textit{L}^2$ norm and energy of the proposed method.

42 ENGINEERING↗

A conservative discontinuous-Galerkin-in-time (DGiT) multirate time integration framework for interface-coupled problems with applications to solid–solid interaction and air–sea models

In this paper we extend the DGiT multirate framework, developed in Connors and Sockwell (2022) for scalar transmission problems, to a solid–solid interaction (SSI) problem involving two coupled elastic solids and a coupled air–sea model with the rotating, thermal shallow water equations. In so doing we aim to demonstrate the broad applicability of the mathematical theory and governing principles established in Connors and Sockwell (2022) to coupled problems characterized by subproblems evolving at different temporal scales. Further, multirate time integration algorithms employing different time steps, optimized for the dynamics of each subproblem, can significantly improve simulation efficiency for such coupled problems. However, development of multirate algorithms is a highly non-trivial task due to the coupling, which can impact accuracy, stability or other desired properties such as preservation of system invariants. DGiT provides a general template for multirate time integration that can achieve these properties. To elucidate the manner in which DGiT accomplishes this task, we fully detail each step in the application of the framework to the SSI and air–sea coupled problems. Numerical examples illustrate key properties of the resulting multirate schemes for both problems.

42 ENGINEERING↗

Phase field benchmark problems for dendritic growth and linear elasticity

We present the second set of benchmark problems for phase field models that are being jointly developed by the Center for Hierarchical Materials Design (CHiMaD) and the National Institute of Standards and Technology (NIST) along with input from other members in the phase field community. As the integrated computational materials engineering (ICME) approach to materials design has gained traction, there is an increasing need for quantitative phase field results. New algorithms and numerical implementations increase computational capabilities, necessitating standard problems to evaluate their impact on simulated microstructure evolution as well as their computational performance. We propose one benchmark problem for solidifiication and dendritic growth in a single-component system, and one problem for linear elasticity via the shape evolution of an elastically constrained precipitate. We demonstrate the utility and sensitivity of the benchmark problems by comparing the results of 1) dendritic growth simulations performed with different time integrators and 2) elastically constrained precipitate simulations with different precipitate sizes, initial conditions, and elastic moduli. As a result, these numerical benchmark problems will provide a consistent basis for evaluating different algorithms, both existing and those to be developed in the future, for accuracy and computational efficiency when applied to simulate physics often incorporated in phase field models.

36 MATERIALS SCIENCE↗

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗

Computational transport methodology based on decomposition of a problem domain into transport and diffusive subdomains

A large class of radiative transfer and particle transport problems contain highly diffusive regions. It is possible to reduce computational costs by solving a diffusion problem in diffusive subdomains instead of the transport equation. This enables one to decrease the dimensionality of the transport problem. In this paper we present a methodology for decomposition of a spatial domain of a transport problem into transport and diffusion subregions. We develop methods for solving one-group problems in 1D slab geometry. To identify and locate diffusive regions, we develop metrics for measuring transport effects that are based on the quasidiffusion (Eddington) factor. We present the results of test problems that demonstrate the accuracy of the proposed methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deep learning of free boundary and Stefan problems

Free boundary problems appear naturally in numerous areas of mathematics, science and engineering. These problems present a great computational challenge because they necessitate numerical methods that can yield an accurate approximation of free boundaries and complex dynamic interfaces. In this work, we propose a multi-network model based on physics-informed neural networks to tackle a general class of forward and inverse free boundary problems called Stefan problems. Specifically, we approximate the unknown solution as well as any moving boundaries by two deep neural networks. Besides, we formulate a new type of inverse Stefan problems that aim to reconstruct the solution and free boundaries directly from sparse and noisy measurements. We demonstrate the effectiveness of our approach in a series of benchmarks spanning different types of Stefan problems, and illustrate how the proposed framework can accurately recover solutions of partial differential equations with moving boundaries and dynamic interfaces. All code and data accompanying this manuscript are publicly available at https://github.com/PredictiveIntelligenceLab/DeepStefan.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient hybrid explicit-implicit learning for multiscale problems

Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.

97 MATHEMATICS AND COMPUTING↗

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

GPU Based General-Purpose Parallel computing to Solve Nuclear Reactor In-Core fuel Management Design and Operation Problem

In-core fuel management study is a crucial activity in nuclear power plant design and operation. Its common problem is to find an optimum arrangement of fuel assemblies inside the reactor core. Main objective for this activity is to reduce the cost of generating electricity, which can be done by altering several physical properties of the nuclear reactor without violating any of the constraints imposed by operational and safety considerations. This research try to address the problem of nuclear fuel arrangement problem, which is, leads to the multi-objective optimization problem. However, the calculation of the reactor core physical properties itself is a heavy computation, which became obstacle in solving the optimization problem by using genetic algorithm optimization.This research tends to address that problem by using the emerging General Purpose Computation on Graphics Processing Units (GPGPU) techniques implemented by C language for CUDA (Compute Unified Device Architecture) parallel programming. By using this parallel programming technique, we develop parallelized nuclear reactor fitness calculation, which is involving numerical finite difference computation. This paper describes current prototype of the parallel algorithm code we have developed on CUDA, that performs one hundreds finite difference calculation for nuclear reactor fitness evaluation in parallel by using GPU G9 Hardware Series developed by NVIDIA.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Generalized Kepler problems. I. Without magnetic charges

For each simple euclidean Jordan algebra V of rank {rho} and degree {delta}, we introduce a family of classical dynamic problems. These dynamical problems all share the characteristic features of the Kepler problem for planetary motions, such as the existence of Laplace-Runge-Lenz vector and hidden symmetry. After suitable quantizations, a family of quantum dynamic problems, parametrized by the nontrivial Wallach parameter {nu}, is obtained. Here, {nu} Element-Of W(V):={l_brace}k({delta}/2) Double-Vertical-Line k=1,...,({rho}-1){r_brace} Union (({rho}-1)({delta}/2),{infinity}) and was introduced by N. Wallach to parametrize the set of nontrivial scalar-type unitary lowest weight representations of the conformal group of V. For the quantum dynamic problem labelled by {nu}, the bound state spectra is -(1/2/(I+{nu}({rho}/2)){sup 2}), I= 0, 1, Horizontal-Ellipsis and its Hilbert space of bound states gives a new realization for the afore-mentioned representation labelled by {nu}. A few results in the literature about these representations become more explicit and more refined. The Lagrangian for a classical Kepler-type dynamic problem introduced here is still of the simple form: (1/2) parallel x parallel {sup 2}+(1/r). Here, x is the velocity of a unit-mass particle moving on the space consisting of V's semi-positive elements of a fixed rank, and r is the inner product of x with the identity element of V.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The impedance problem of wave diffraction by a strip with higher order boundary conditions

This work is devoted to analyse an impedance boundary-transmission problem for the Helmholtz equation originated by a problem of wave diffraction by an infinite strip with higher order imperfect boundary conditions. A constructive approach of operator relations is built, which allows a transparent interpretation of the problem in an operator theory framework. In particular, different types of operator relations are exhibited for different types of operators acting between Lebesgue and Sobolev spaces on a finite interval and the positive half-line. All this has consequences in the understanding of the structure of this type of problems. In particular, a Fredholm characterization of the problem is obtained in terms of the initial space order parameters. At the request of the author and the Proceedings Editor the above article has been replaced with a corrected version. The original PDF file supplied to AIP Publishing contained an error in the title of the article. The original title appeared as: 'The Impedance Problem of Wave Diffraction by a trip with Higher Order Boundary Conditions.' This article has been replaced and the title now appears correctly online. The corrected article was published on 8 November 2013.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Singular linear-quadratic control problem for systems with linear delay

A singular linear-quadratic optimization problem on the trajectories of non-autonomous linear differential equations with linear delay is considered. The peculiarity of this problem is the fact that this problem has no solution in the class of integrable controls. To ensure the existence of solutions is required to expand the class of controls including controls with impulse components. Dynamical systems with linear delay are used to describe the motion of pantograph from the current collector with electric traction, biology, etc. It should be noted that for practical problems fact singularity criterion of quality is quite commonly occurring, and therefore the study of these problems is surely important. For the problem under discussion optimal programming control contained impulse components at the initial and final moments of time is constructed under certain assumptions on the functional and the right side of the control system.

97 MATHEMATICS AND COMPUTING↗

Capacitated arc routing problem and its extensions in waste collection

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum learning of classical stochastic processes: The completely positive realization problem

Among several tasks in Machine Learning, a specially important one is the problem of inferring the latent variables of a system and their causal relations with the observed behavior. A paradigmatic instance of this is the task of inferring the hidden Markov model underlying a given stochastic process. This is known as the positive realization problem (PRP), [L. Benvenuti and L. Farina, IEEE Trans. Autom. Control 49(5), 651–664 (2004)] and constitutes a central problem in machine learning. The PRP and its solutions have far-reaching consequences in many areas of systems and control theory, and is nowadays an important piece in the broad field of positive systems theory. We consider the scenario where the latent variables are quantum (i.e., quantum states of a finite-dimensional system) and the system dynamics is constrained only by physical transformations on the quantum system. The observable dynamics is then described by a quantum instrument, and the task is to determine which quantum instrument — if any — yields the process at hand by iterative application. We take as a starting point the theory of quasi-realizations, whence a description of the dynamics of the process is given in terms of linear maps on state vectors and probabilities are given by linear functionals on the state vectors. This description, despite its remarkable resemblance with the hidden Markov model, or the iterated quantum instrument, is however devoid of any stochastic or quantum mechanical interpretation, as said maps fail to satisfy any positivity conditions. The completely positive realization problem then consists in determining whether an equivalent quantum mechanical description of the same process exists. We generalize some key results of stochastic realization theory, and show that the problem has deep connections with operator systems theory, giving possible insight to the lifting problem in quotient operator systems. Our results have potential applications in quantum machine learning, device-independent characterization and reverse-engineering of stochastic processes and quantum processors, and more generally, of dynamical processes with quantum memory [M. Guţă, Phys. Rev. A 83(6), 062324 (2011); M. Guţă and N. Yamamoto, e-print http://arxiv.org/abs/1303.3771 (2013)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Students’ conceptions and problem-solving ability on topic chemical thermodynamics

The enthalpy concept and its change were introduced to describe the forms of internal energy transfer in chemical reactions. Likewise, the concepts of exothermic and endothermic reactions introduced as a consequence of heat transfer form. In the heat measurement process at constant pressure, work is often ignored. The exothermic or endothermic reactions, usually only based on the increase or decrease of the reaction temperature, without associated with the internal energy. Depictions of enthalpy and its change assumed closely related to students’ problem-solving ability. Therefore, the study to describe pre-service chemistry teacher student’s conceptions and problem-solving ability on topic chemical thermodynamics has been done. This research was a case study of chemical education course in Provinsi Lampung. The subjects of this study were 42 students who attend the chemical thermodynamics course. Questions about exothermic and endothermic reactions, enthalpy and its change, as well as internal energy and its change were given in the form of an essay exam questions. Answers related to conception qualitatively categorized, while problem solving answers were scored and assessed. The results showed that, in general, students were having problems in enthalpy and describe the changes in the form of heat and work. The highest value of problem solving ability obtained 26.67 from the maximum value of 100. The lowest value was 0, and the average value was 14.73. These results show that the problem-solving ability of pre-service chemistry teacher students was low. The results provide insight to researchers, and educators to develop learning or lab work on this concept.

42 ENGINEERING↗

Variational stability of optimal control problems involving subdifferential operators

This paper is concerned with the problem of minimizing an integral functional with control-nonconvex integrand over the class of solutions of a control system in a Hilbert space subject to a control constraint given by a phase-dependent multivalued map with closed nonconvex values. The integrand, the subdifferential operators, the perturbation term, the initial conditions and the control constraint all depend on a parameter. Along with this problem, the paper considers the problem of minimizing an integral functional with control-convexified integrand over the class of solutions of the original system, but now subject to a convexified control constraint. By a solution of a control system we mean a 'trajectory-control' pair. For each value of the parameter, the convexified problem is shown to have a solution, which is the limit of a minimizing sequence of the original problem, and the minimal value of the functional with the convexified integrand is a continuous function of the parameter. This property is commonly referred to as the variational stability of a minimization problem. An example of a control parabolic system with hysteresis and diffusion effects is considered. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

Space-Dependent Wielandt Shifts for Multigroup Diffusion Eigenvalue Problems

We present a new concept—the space-dependent Wielandt shift (SDWS)—for accelerating the convergence of the power iteration (PI) scheme for multigroup diffusion k-eigenvalue problems. The SDWS improves on standard Wielandt shift (WS) techniques, which are empirical in nature and are typically effective only when the current estimate of the solution is reasonably converged. By accounting for the physics of the problem through SDWS, we are able to improve the acceleration for the initial iterates when the current estimate of the solution is not close to convergence. Numerical results from one-dimensional problems suggest that, compared to standard WS techniques, the new SDWS techniques can provide upward of a 46% reduction in the number of PIs required for convergence and a 40% reduction in the computational time required. This improvement is sensitive to several problem-dependent factors, such as the geometry and energy-dependence of the problem, the spatial discretization, and the initial guess. The reduction in computational time is also dependent on the linear solver in the PI scheme, as it is well known that WSs can significantly worsen the conditioning of the diffusion linear system. In this paper, we provide a detailed study of the impact of WSs on the performance of several iterative linear solvers. Results from our implementation of SDWS in the three-dimensional (3D) code MPACT show that SDWS can provide similar speedups for 3D multigroup diffusion eigenvalue problems. These results also show that moderate speedups can be obtained by applying SDWS to the coarse mesh finite difference (CMFD) solver in a CMFD-accelerated transport scheme. However, the benefit of doing this may be limited because all but the first few CMFD solves are relatively easy to converge, regardless of the WS used.

Nuclear Science & Technology↗