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 811 records · Page 45

A Case Study to Test Mozaik for Different Optimization Problems

We present four different shape optimization problems based on the existing beam port facility of the Penn State Breazeale Reactor and their results obtained by the modular optimization code package, MOZAIK. Each model problem has a different beam tube configuration with the same optimization goal: to determine an optimal D2O moderator tank shape for the given beam tube arrangement that maximizes the thermal neutron beam intensity at the beam tube exit end. In this study, the power of the automated search process was demonstrated and its capabilities were tested. In addition, the performance of the beam port was analyzed using alternative beam tube arrangements. All alternative arrangements indicate that higher thermal neutron beam intensity can be obtained at the beam tube exit end using a smaller volume of D2O in the system than is used in the existing beam port configuration. Moreover, the results show that MOZAIK is ready for deployment to address shape optimization problems involving radiation transport in nuclear engineering applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Levermore-Pomraning Model Results for an Interior Source Binary Stochastic Medium Benchmark Problem

The accuracy of the Levermore-Pomraning model for particle transport through a binary stochastic medium is investigated using an interior source benchmark problem. As in previous comparisons of the model for incident angular flux benchmark problems, the model accurately computes the leakage and the scalar flux distributions for optically thin slabs. The model is less accurate for more optically thick slabs but has a maximum relative error in the leakage of approximately 10% for the problems examined. The maximum root-mean-squared relative errors for the total and material scalar flux distributions approach 65% for the more optically thick slabs. Consistent with previous benchmark comparisons, the results of these interior source benchmark comparisons demonstrate that the Levermore-Pomraning model produces qualitatively correct and semi-quantitatively correct results for both leakage values and scalar flux distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Van Benthem, Mark H↗

Nonlinear eigenvalue problems in Density Functional Theory calculations

Developed in the 1960's by W. Kohn and coauthors, Density Functional Theory (DFT) is a very popular quantum model for First-Principles simulations in chemistry and material sciences. It allows calculations of systems made of hundreds of atoms. Indeed DFT reduces the 3N-dimensional Schroedinger electronic structure problem to the search for a ground state electronic density in 3D. In practice it leads to the search for N electronic wave functions solutions of an energy minimization problem in 3D, or equivalently the solution of an eigenvalue problem with a non-linear operator.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm

Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC algorithm has been found in which the fermion determinant may not necessarily factorizable, but can instead be expressed as a product of complex conjugate pairs of eigenvalues, thus eliminating the sign problem for a much wider class of models. In this paper, we present general conditions for the applicability of this algorithm and point out that it is deeply related to the time reversal symmetry of the fermion matrix. We apply this method to various models of strongly correlated systems at all doping levels and lattice geometries, and show that many novel phases can be simulated without the sign problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reputation mechanism: From resolution for truthful online auctions to the model of optimal one-gambler problem

In this paper we study reputation mechanisms, and show how the notion of reputation can help us in building truthful online auction mechanisms. From the mechanism design prospective, we derive the conditions on and design a truthful online auction mechanism. Moreover, in the case when some agents may lay or cannot have the real knowledge about the other agents reputations, we derive the resolution of the auction, such that the mechanism is truthful. Consequently, we move forward to the optimal one-gambler/one-seller problem, and explain how that problem is refinement of the previously discussed online auction design in the presence of reputation mechanism. In the setting of the optimal one-gambler problem, we naturally rise and solve the specific question: What is an agent's optimal strategy, in order to maximize his revenue? We would like to stress that our analysis goes beyond the scope, which game theory usually discusses under the notion of reputation. We model one-player games, by introducing a new parameter (reputation), which helps us in predicting the agent's behavior, in real-world situations, such as, behavior of a gambler, real-estate dealer, etc.

97 MATHEMATICS AND COMPUTING↗

A Distance Measure Comparison to Improve Crowding in Multi-Modal Problems.

Solving multi-modal optimization problems are of interest to researchers solving real world problems in areas such as control systems and power engineering tasks. Extensions of simple Genetic Algorithms, particularly types of crowding, have been developed to help solve these types of problems. This paper examines the performance of two distance measures, Mahalanobis and Euclidean, exercised in the processing of two different crowding type implementations against five minimization functions. Within the context of the experiments, empirical evidence shows that the statistical based Mahalanobis distance measure when used in Deterministic Crowding produces equivalent results to a Euclidean measure. In the case of Restricted Tournament selection, use of Mahalanobis found on average 40% more of the global optimum, maintained a 35% higher peak count and produced an average final best fitness value that is 3 times better.

97 MATHEMATICS AND COMPUTING↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

On the Shape Sensitivity of the First Dirichlet Eigenvalue for Two-Phase Problems

We consider a two-phase problem in thermal conductivity: inclusions filled with a material of conductivity {sigma}{sub 1} are layered in a body of conductivity {sigma}{sub 2}. We address the shape sensitivity of the first eigenvalue associated with Dirichlet boundary conditions when both the boundaries of the inclusions and the body can be modified. We prove a differentiability result and provide the expressions of the first and second order derivatives. We apply the results to the optimal design of an insulated body. We prove the stability of the optimal design thanks to a second order analysis. We also continue the study of an extremal eigenvalue problem for a two-phase conductor in a ball initiated by Conca et al. (Appl. Math. Optim. 60(2):173-184, 2009) and pursued in Conca et al. (CANUM 2008, ESAIM Proc., vol. 27, pp. 311-321, EDP Sci., Les Ulis, 2009).

97 MATHEMATICS AND COMPUTING↗

Nonlocal Boundary-Value Problem for a Differential-Operator Equation with Weak Nonlinearity in the Spaces of Dirichlet–Taylor Series with Fixed Spectrum

We study the nonlocal boundary-value problem for a differential-operator equation with nonlinear right-hand side and an operator B = (B{sub 1},…B{sub p}), where its components B{sub j} ≡ z{sub j}∂/∂z{sub j}, j = 1,…,p, are the operators of generalized differentiation with respect to the complex variable z{sub j}. By using the Nash–Moser iterative scheme, we establish the conditions of solvability of this problem in the scale of spaces of functions of several complex variables, which are Dirichlet–Taylor series with fixed spectrum.

97 MATHEMATICS AND COMPUTING↗

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

Non-homogeneous solutions of a Coulomb Schrödinger equation as basis set for scattering problems

We introduce and study two-body Quasi Sturmian functions which are proposed as basis functions for applications in three-body scattering problems. They are solutions of a two-body non-homogeneous Schrödinger equation. We present different analytic expressions, including asymptotic behaviors, for the pure Coulomb potential with a driven term involving either Slater-type or Laguerre-type orbitals. The efficiency of Quasi Sturmian functions as basis set is numerically illustrated through a two-body scattering problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution of second order quasi-linear boundary value problems by a wavelet method

A wavelet Galerkin method based on expansions of Coiflet-like scaling function bases is applied to solve second order quasi-linear boundary value problems which represent a class of typical nonlinear differential equations. Two types of typical engineering problems are selected as test examples: one is about nonlinear heat conduction and the other is on bending of elastic beams. Numerical results are obtained by the proposed wavelet method. Through comparing to relevant analytical solutions as well as solutions obtained by other methods, we find that the method shows better efficiency and accuracy than several others, and the rate of convergence can even reach orders of 5.8.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Well-posedness of the Cauchy problem for the stochastic system for the Lorenz model for a baroclinic atmosphere

The paper is concerned with the Cauchy problem for a nonlinear system of partial differential equations with parameters. This system describes the two-layer quasi-solenoidal Lorenz model for a baroclinic atmosphere on a rotating two-dimensional sphere. The right-hand side of the system is perturbed by white noise, and random initial data is considered. This system is shown to be uniquely solvable, and an estimate for the continuous dependence of the solution on the set of random initial data and the right-hand side is established on a finite time interval. In passing, an estimate for the continuous dependence on the set of parameters, the initial data, and the right-hand side is obtained on a finite time interval for the solution of the Cauchy problem with deterministic initial data and deterministic right-hand side. Bibliography: 32 titles.

97 MATHEMATICS AND COMPUTING↗

LAGRANGE SOLUTIONS TO THE DISCRETE-TIME GENERAL THREE-BODY PROBLEM

There is no known integrator that yields exact orbits for the general three-body problem (G3BP). It is difficult to verify whether a numerical procedure yields the correct solutions to the G3BP because doing so requires knowledge of all 11 conserved quantities, whereas only six are known. Without tracking all of the conserved quantities, it is possible to show that the discrete general three-body problem (d-G3BP) yields the correct orbits corresponding to Lagrange solutions of the G3BP. We show that the d-G3BP yields the correct solutions to the G3BP for two special cases: the equilateral triangle and collinear configurations. For the triangular solution, we use the fact that the solution to the three-body case is a superposition of the solutions to the three two-body cases, and we show that the three bodies maintain the same relative distances at all times. To obtain the collinear solution, we assume a specific permutation of the three bodies arranged along a straight rotating line, and we show that the d-G3BP maintains the same distance ratio between two bodies as in the G3BP. Proving that the d-G3BP solutions for these cases are equivalent to those of the G3BP makes it likely that the d-G3BP and G3BP solutions are equivalent in other cases. To our knowledge, this is the first work that proves the equivalence of the discrete solutions and the Lagrange orbits.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗