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 217 records · Page 12

Applications of Mesh Adaptive Direct Search Algorithms to Solve Inverse Transport Problem: Unknown Interface Location

Inverse transport problems are problems where radiation signatures are used to identify unknown components of a radioactive source/shield system. We consider a spherical system of some gamma-ray source surrounded by some shield where both source and shield may be multilayered but assume that a material in each layer is homogeneous. The system variables of a multilayered spherical source/shield system include the number of layers, interface locations, material densities and isotopic compositions. The materials may be source or shield materials. If all system variables are unknown, solving inverse transport problems is very difficult due to ill-posedness and complexity of problem models. Typically, inverse transport problems are partially solved by assuming that some system variables are known.

97 MATHEMATICS AND COMPUTING↗

Solving the power flow equations: a monotone operator approach

The AC power flow equations underlie all operational aspects of power systems. They are solved routinely in operational practice using the Newton-Raphson method and its variants. These methods work well given a good initial “guess” for the solution, which is always available in normal system operations. However, with the increase in levels of intermittent generation, the assumption of a good initial guess always being available is no longer valid. In this paper, we solve this problem using the theory of monotone operators. We show that it is possible to compute (using an offline optimization) a “monotonicity domain” in the space of voltage phasors. Given this domain, there is a simple efficient algorithm that will either find a solution in the domain, or provably certify that no solutions exist in it. We validate the approach on several IEEE test cases and demonstrate that the offline optimization can be performed tractably and the computed “monotonicity domain” includes all practically relevant power flow solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Applying Physics-Informed Neural Networks to Solve Navier–Stokes Equations for Laminar Flow around a Particle

In recent years, Physics-Informed Neural Networks (PINNs) have drawn great interest among researchers as a tool to solve computational physics problems. Unlike conventional neural networks, which are black-box models that “blindly” establish a correlation between input and output variables using a large quantity of labeled data, PINNs directly embed physical laws (primarily partial differential equations) within the loss function of neural networks. By minimizing the loss function, this approach allows the output variables to automatically satisfy physical equations without the need for labeled data. The Navier–Stokes equation is one of the most classic governing equations in thermal fluid engineering. This study constructs a PINN to solve the Navier–Stokes equations for a 2D incompressible laminar flow problem. Flows passing around a 2D circular particle are chosen as the benchmark case, and an elliptical particle is also examined to enrich the research. The velocity and pressure fields are predicted by the PINNs, and the results are compared with those derived from Computational Fluid Dynamics (CFD). Additionally, the particle drag force coefficient is calculated to quantify the discrepancy in the results of the PINNs as compared to CFD outcomes. The drag coefficient maintained an error within 10% across all test scenarios.

Hu, Beichao (ORCID:0009000163215151)↗

Comparison of Multi-Objective Evolutionary Algorithms to Solve the Modular Cell Design Problem for Novel Biocatalysis

A large space of chemicals with broad industrial and consumer applications could be synthesized by engineered microbial biocatalysts. However, the current strain optimization process is prohibitively laborious and costly to produce one target chemical and often requires new engineering efforts to produce new molecules. To tackle this challenge, modular cell design based on a chassis strain that can be combined with different product synthesis pathway modules has recently been proposed. This approach seeks to minimize unexpected failure and avoid task repetition, leading to a more robust and faster strain engineering process. In our previous study, we mathematically formulated the modular cell design problem based on the multi-objective optimization framework. In this study, we evaluated a library of state-of-the-art multi-objective evolutionary algorithms (MOEAs) to identify the most effective method to solve the modular cell design problem. Using the best MOEA, we found better solutions for modular cells compatible with many product synthesis modules. Furthermore, the best performing algorithm could provide better and more diverse design options that might help increase the likelihood of successful experimental implementation. We identified key parameter configurations to overcome the difficulty associated with multi-objective optimization problems with many competing design objectives. Interestingly, we found that MOEA performance with a real application problem, e.g., the modular strain design problem, does not always correlate with artificial benchmarks. Overall, MOEAs provide powerful tools to solve the modular cell design problem for novel biocatalysis.

Garcia, Sergio (ORCID:000000023998986X)↗

COMPARISON OF IMPLICIT SCHEMES TO SOLVE EQUATIONS OF RADIATION HYDRODYNAMICS WITH A FLUX-LIMITED DIFFUSION APPROXIMATION: NEWTON–RAPHSON, OPERATOR SPLITTING, AND LINEARIZATION

Radiation is an important process of energy transport, a force, and a basis for synthetic observations, so radiation hydrodynamics (RHD) calculations have occupied an important place in astrophysics. However, although the progress in computational technology is remarkable, their high numerical cost is still a persistent problem. In this work, we compare the following schemes used to solve the nonlinear simultaneous equations of an RHD algorithm with the flux-limited diffusion approximation: the Newton–Raphson (NR) method, operator splitting, and linearization (LIN), from the perspective of the computational cost involved. For operator splitting, in addition to the traditional simple operator splitting (SOS) scheme, we examined the scheme developed by Douglas and Rachford (DROS). We solve three test problems (the thermal relaxation mode, the relaxation and the propagation of linear waves, and radiating shock) using these schemes and then compare their dependence on the time step size. As a result, we find the conditions of the time step size necessary for adopting each scheme. The LIN scheme is superior to other schemes if the ratio of radiation pressure to gas pressure is sufficiently low. On the other hand, DROS can be the most efficient scheme if the ratio is high. Although the NR scheme can be adopted independently of the regime, especially in a problem that involves optically thin regions, the convergence tends to be worse. In all cases, SOS is not practical.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Trends in problem-solving research - Twelve recently described tasks.

Review of descriptions of the 12 problem-solving tasks developed since the last review (Ray, 1955) of this topic, indicating that the newer tasks are more sophisticated in design and provide for better experimental control than those used prior to 1953. Validity, reliability, sensitivity, trainability, problem structure, and problem difficulty are discussed as criteria for the selection of tasks to be used in studies of skilled problem-solving performance.

Coates, G. D.↗

Robot, computer problem solving system

The development of a computer problem solving system is reported that considers physical problems faced by an artificial robot moving around in a complex environment. Fundamental interaction constraints with a real environment are simulated for the robot by visual scan and creation of an internal environmental model. The programming system used in constructing the problem solving system for the simulated robot and its simulated world environment is outlined together with the task that the system is capable of performing. A very general framework for understanding the relationship between an observed behavior and an adequate description of that behavior is included.

Becker, J. D.↗

A numerical scheme to solve unstable boundary value problems

A new iterative scheme for solving boundary value problems is presented. It consists of the introduction of an artificial time dependence into a modified version of the system of equations. Then explicit forward integrations in time are followed by explicit integrations backwards in time. The method converges under much more general conditions than schemes based in forward time integrations (false transient schemes). In particular it can attain a steady state solution of an elliptical system of equations even if the solution is unstable, in which case other iterative schemes fail to converge. The simplicity of its use makes it attractive for solving large systems of nonlinear equations.

Kalnay Derivas, E.↗

A new method for solving problems of sound radiation from a duct for the case of low Mach number

A method for rapidly solving duct end-plane impedance problems is presented which is based on deriving a form of the Helmholtz integral formula expressing the normal derivative of the acoustic pressure at a boundary point. A set of integral expressions is obtained by satisfying the existing boundary conditions and then solved using a general collocation method. The results obtained for the Levine-Schwinger (1948) problem agree well with the exact values. In the case of a duct flow having a temperature mismatch with the surroundings, the results show an increase in the magnitude of the reflection coefficient for the case of a cold core, and a decrease in its value for the case of a hot core, as compared with the case of exhaust into a uniform medium. A phase change of between pi/2 and pi is nearly always achieved, which indicates the tendency towards maintaining a constant pressure at the exit plane. The method can easily be extended to arbitrary duct shapes as long as they are axisymmetric.

Wahbah, M. M.↗

The relative merits of several numerical techniques for solving the compressible Navier-Stokes equations

Four explicit finite difference techniques designed to solve the time-dependent, compressible Navier Stokes equations are compared. These techniques are: (1) MacCormack, (2) modified Du Fort-Frankel, (3) modified hopscotch, and (4) Brailovskaya. The comparison was made numerically by solving the quasi-one dimensional Navier Stokes equations for the flow in a converging-diverging nozzle. Solutions with and without standing normal shock waves were computed for unit Reynolds numbers (based on total conditions) ranging from 45374 to 2269. The results indicate that all four techniques are comparable in accuracy; however, the modified hopscotch scheme is two to three times faster than the Brailovskaya and MacCormack schemes and three to six times faster than the modified Du Fort-Frankel scheme.

Holst, T. L.↗

Some MACSYMA program for solving difference equations

A set of MACSYMA programs are described for finding closed form solutions to linear recurrence relations in equations having either constant or variable coefficients. In the homogenous case, a polymonial equation is obtained and the solution to the recurrence relation can be written as a linear combination of the roots of the polynomial. Exponential generating functions are used to solve variable coefficient relations. Taking successive derivatives and using the recurrence relation, an ordinary differential equation is obtained. Expanding the solution to the differential equation in a Taylor series, shows that the nth term of the series is the solution to the recurrence relation. For second order recurrences, a check is made for those that can be solved in terms of Bessel functions.

Ivie, J.↗

An efficient numerical method for solving the incompressible Navier-Stokes equations

This paper describes an efficient numerical method for solving the steady incompressible Navier-Stokes equations. The method is a fully implicit method based on the generalized Galerkin method, and the resulting system of equations is solved in a sweeping mode by iterative line relaxation. Results of the present method are compared with published results for separating and reattaching flows, and parametric studies showing the effects of step size, boundary locations, and Reynolds number are presented. The present method is substantially faster than previously published methods; typical run times range from 10 sec to 1 min of 7600 CPU time; and, based on results obtained to date, it is stable at any Reynolds number.

Murphy, J. D.↗

Studies in interactive communication. II - The effects of four communication modes on the linguistic performance of teams during cooperative problem solving

Two-man teams solved credible, 'real world' problems for which computer assistance has been or could be useful. Conversations were carried on in one of four modes of communication: typewriting, handwriting, voice, and natural unrestricted communication. Performance was assessed on three classes of dependent measures: time to solution, behavioral measures of activity, and linguistic measures. Significant differences among the communication modes were found in each of the three classes. This paper is concerned mainly with the results of the linguistic analyses. Linguistic performance was assessed with 182 measures, most of which turned out to be redundant and some of which were useless or meaningless. Those that remain show that although problems can be solved faster in the oral modes than in the hard-copy modes, the oral modes are characterized by many more messages, sentences, words, and unique words; much higher communication rates; but lower type-token ratios. Although a number of significant problem and job-role effects were found, there were relatively few significant interactions of modes with thsse variables. It appears, therefore, that the mode effects hold for both problems and for both job roles assigned to the subjects.

Chapanis, A.↗

Modifications to give HOPE/MDC 2.0 the capability to solve for or consider vent forces: Mission planning, mission analysis, and software formulation

The modifications are described as necessary to give the Houston Operations Predictor/Estimator (HOPE) program the capability to solve for or consider vent forces for orbit determination. The model implemented in solving for vent forces is described along with the integrator problems encountered. A summary derivation of the mathematical principles applicable to solve/consider methodology is provided.

Zyla, L. V.↗

A dependency-based modelling mechanism for problem solving

The paper develops a technique of dependency net modeling which relies on an explicit representation of justifications for beliefs held by the problem solver. Using these justifications, the modeling mechanism is able to determine the relevant lines of inference to pursue during problem solving. Three particular problem-solving difficulties which may be handled by the dependency-based technique are discussed: (1) subgoal violation detection, (2) description binding, and (3) maintaining a consistent world model.

London, P.↗