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 379 records · Page 21

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗

The Citizen Cyberscience Lectures - 1) Mobile phones and Africa: a success story 2) Citizen Problem Solving

Mobile phones and Africa: a success story Dr. Mo Ibrahim, Mo Ibrahim Foundation Citizen Problem Solving Dr. Alpheus Bingham, InnoCentive The Citizen Cyberscience Lectures are hosted by the partners of the Citizen Cyberscience Centre, CERN, The UN Institute of Training and Research and the University of Geneva. The goal of the Lectures is to provide an inspirational forum for participants from the various international organizations and academic institutions in Geneva to explore how information technology is enabling greater citizen participation in tackling global development challenges as well as global scientific research. The first Citizen Cyberscience Lectures will welcome two speakers who have both made major innovative contributions in this area. Dr. Mo Ibrahim, founder of Celtel International, one of Africa’s most successful mobile network operators, will talk about “Mobile phones and Africa: a success story”. Dr. Alpheus Bingham, founder of InnoCentive, a Web-based community that solves industrial R&D; challenges, will discuss “Citizen Problem Solving”. The Citizen Cyberscience Lectures are open and free of charge. Participants from outside CERN must register by sending an email to Yasemin.Hauser@cern.ch BEFORE the 23rd october to be able to access CERN. THE LECTURES Mobile phones and Africa: a success story Dr. Mo Ibrahim, Mo Ibrahim Foundation Abstract The introduction of mobile phones into Africa changed the continent, enabling business and the commercial sector, creating directly and indirectly, millions of jobs. It enriched the social lives of many people. Surprisingly, it supported the emerging civil society and advanced the course of democracy Bio Dr Mo Ibrahim is a global expert in mobile communications with a distinguished academic and business career. In 1998, Dr Ibrahim founded Celtel International to build and operate mobile networks in Africa. Celtel became one of Africa’s most successful companies with operations in 15 countries, covering more than a third of the continent’s population and investing more than US 750 millionin Africa.The company was sold to MTC Kuwaitin 2005 for 3.4billion. In 2006 Dr Ibrahim established the Mo Ibrahim Foundation to support great African leadership. The Foundation focuses on two major initiatives to stimulate debate around, and improve the quality of, governance in Africa. The Ibrahim Prize for Achievement in African Leadership recognises and celebrates excellence; and the Ibrahim Index of African Governance provides civil society with a comprehensive and quantifiable tool to promote government accountability. Dr Ibrahim is also Founding Chairman of Satya Capital Ltd, an investment company focused on opportunities in Africa. Dr Ibrahim has been awarded an Honorary Doctorate by the University of London’s School of Oriental and African Studies, the University of Birmingham and De Montfort University, Leicester as well as an Honorary Fellowship Award from the London Business School. He has also received the Chairman’s Award for Lifetime Achievement from the GSM Association in 2007 and the Economists Innovation Award 2007 for Social & Economic Innovation. In 2008 Dr Ibrahim was presented with the BNP Paribas Prize for Philanthropy, and also listed by TIME magazine as one of the 100 most influential people in the world. Citizen Problem Solving Dr. Alpheus Bingham, InnoCentive Abstract American playwright Damien Runyon (Guys and Dolls) once remarked, "the race is not always to the swift, nor the victory to the strong -- but that IS how you bet." Not only does a system of race handicapping follow from this logic, but the whole notion of expertise and technical qualifications. Such 'credentials' allow one to 'bet' on who might most likely solve a difficult challenge, whether as consultant, contractor or employee. Of course, the approach would differ if one were allowed to bet AFTER the race. When such systems came into broad use, i.e., chat rooms, usenets, innocentive, etc., and were subsequently studied, it was often found that the greatest probability of solution lies in the "long tail" of the function rather than in the head representing formally vetted 'experts.' Insight into a problem is often the intersection of training, experience, metaphor and provocation (think Archimedes). Examples of "citizens" outside a targeted field of expertise providing uniques solutions will illustrate the principles involved. Bio Dr. Alph Bingham is a pioneer in the field of open innovation and an advocate of collaborative approaches to research and development. He is co-founder, and former president and chief executive officer of InnoCentive Inc., a Web-based community that matches companies facing R&D; challenges with scientists who propose solutions. Through InnoCentive, a platform that leverages the ability to connect to a whole planet of people through the Internet, organizations can access individuals – problem solvers – who might never have been found. Alph spent more than 25 years with Eli Lilly and Company, and offers deep experience in pharmaceutical research and development, research acquisitions and collaborations, and R&D; strategic planning. During his career he was instrumental in creating and developing Eli Lilly's portfolio management process as well as establishing the divisions of Research Acquisitions, the Office of Alliance Management and e.Lilly, a business innovation unit, from which various other ventures were spun out that create the advantages of open and networked organizational structures, including: InnoCentive, YourEncore, Inc., Coalesix, Inc., Maaguzi, Inc., Indigo Biosystems, Seriosity, Chorus and Collaborative Drug Discovery, Inc. He currently serves on the Board of Directors of InnoCentive, Inc., and Collaborative Drug Discovery, Inc.; the advisory boards of the Center for Collective Intelligence (MIT), and the Business Innovation Factory, as well as a member of the board of trustees of the Bankinter Foundation for Innovation in Madrid. He has lectured extensively at both national and international events and serves as a Visiting Scholar at the National Center for Supercomputing Application at the University of Illinois at Champaign-Urbana. He is also the former chairman of the Board of Editors of the Research Technology Management Journal. Dr. Bingham was the recipient of the Economist's Fourth Annual Innovation Summit "Business Process Award" for InnoCentive. He was also named as one of Project Management Institute's "Power 50" leaders in October 2005. Dr. Bingham received a Ph.D. in organic chemistry from Stanford University.

99 GENERAL AND MISCELLANEOUS↗

Iso-geometric analysis for neutron diffusion problems

Iso-geometric analysis can be viewed as a generalisation of the finite element method. It permits the exact representation of a wider range of geometries including conic sections. This is possible due to the use of concepts employed in computer-aided design. The underlying mathematical representations from computer-aided design are used to capture both the geometry and approximate the solution. In this paper the neutron diffusion equation is solved using iso-geometric analysis. The practical advantages are highlighted by looking at the problem of a circular fuel pin in a square moderator. For this problem the finite element method requires the geometry to be approximated. This leads to errors in the shape and size of the interface between the fuel and the moderator. In contrast to this iso-geometric analysis allows the interface to be represented exactly. It is found that, due to a cancellation of errors, the finite element method converges more quickly than iso-geometric analysis for this problem. A fuel pin in a vacuum was then considered as this problem is highly sensitive to the leakage across the interface. In this case iso-geometric analysis greatly outperforms the finite element method. Due to the improvement in the representation of the geometry iso-geometric analysis can outperform traditional finite element methods. It is proposed that the use of iso-geometric analysis on neutron transport problems will allow deterministic solutions to be obtained for exact geometries. Something that is only currently possible with Monte Carlo techniques. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Solution of stochastic media transport problems using a numerical quadrature-based method

We present a new conceptual framework for analyzing transport problems in random media. We decompose such problems into stratified subproblems according to the number of material pseudo-interfaces within realizations. For a given subproblem we assign pseudo-interface locations in each realization according to product quadrature rules, which allows us to deterministically generate a fixed number of realizations. Quadrature integration of the solutions of these realizations thus approximately solves each subproblem; the weighted superposition of solutions of the subproblems approximately solves the general stochastic media transport problem. We revisit some benchmark problems to determine the accuracy and efficiency of this approach in comparison to randomly generated realizations. We find that this method is very accurate and fast when the number of pseudo-interfaces in a problem is generally low, but that these advantages quickly degrade as the number of pseudo-interfaces increases. (authors)

97 MATHEMATICS AND COMPUTING↗

The Guderley problem revisited

The self-similar converging-diverging shock wave problem introduced by Guderley in 1942 has been the source of numerous investigations since its publication. In this paper, we review the simplifications and group invariance properties that lead to a self-similar formulation of this problem from the compressible flow equations for a polytropic gas. The complete solution to the self-similar problem reduces to two coupled nonlinear eigenvalue problems: the eigenvalue of the first is the so-called similarity exponent for the converging flow, and that of the second is a trajectory multiplier for the diverging regime. We provide a clear exposition concerning the reflected shock configuration. Additionally, we introduce a new approximation for the similarity exponent, which we compare with other estimates and numerically computed values. Lastly, we use the Guderley problem as the basis of a quantitative verification analysis of a cell-centered, finite volume, Eulerian compressible flow algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Automated Variance Reduction Applied to Nuclear Well-Logging Problems

The Monte Carlo method enables detailed, explicit geometric, energy and angular representations, and hence is considered to be the most accurate method available for solving complex radiation transport problems. Because of its associated accuracy, the Monte Carlo method is widely used in the petroleum exploration industry to design, benchmark, and simulate nuclear well-logging tools. Nuclear well-logging tools, which contain neutron and/or gamma sources and two or more detectors, are placed in boreholes that contain water (and possibly other fluids) and that are typically surrounded by a formation (e.g., limestone, sandstone, calcites, or a combination). The response of the detectors to radiation returning from the surrounding formation is used to infer information about the material porosity, density, composition, and associated characteristics. Accurate computer simulation is a key aspect of this exploratory technique. However, because this technique involves calculating highly precise responses (at two or more detectors) based on radiation that has interacted with the surrounding formation, the transport simulations are computationally intensive, requiring significant use of variance reduction techniques, parallel computing, or both. Because of the challenging nature of these problems, nuclear well-logging problems have frequently been used to evaluate the effectiveness of variance reduction techniques (e.g., Refs. 1-4). The primary focus of these works has been on improving the computational efficiency associated with calculating the response at the most challenging detector location, which is typically the detector furthest from the source. Although the objective of nuclear well-logging simulations is to calculate the response at multiple detector locations, until recently none of the numerous variance reduction methods/techniques has been well-suited to simultaneous optimization of multiple detector (tally) regions. Therefore, a separate calculation is typically performed for each desired detector response. This paper summarizes recent work to apply and evaluate the effectiveness of deterministic-adjoint-based variance reduction methods, including a recently developed method for simultaneous optimization of multiple detectors, for two simple nuclear well-logging tool problems that have been widely used in the variance reduction literature. The computational effectiveness of the method for simultaneous optimization is also compared to the use of multiple, individually optimized simulations for these simple well-logging problems.

02 PETROLEUM↗

Extended isogeometric analysis of multi-material and multi-physics problems using hierarchical B-splines

Here, this paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an extended finite element method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements. To obtain an immersed geometry representation that is consistent across all hierarchically refined B-spline discretizations, the geometry is immersed into a single mesh, the XFEM background mesh, which is constructed from the union of all hierarchical B-spline meshes. An extraction operator is introduced to represent the truncated hierarchical B-spline bases in terms of Lagrange shape functions on the XFEM background mesh without loss of accuracy. The truncated hierarchical B-spline bases are enriched using a generalized Heaviside enrichment strategy to accommodate small geometric features and multi-material problems. The governing equations are augmented by a formulation of the face-oriented ghost stabilization enhanced for locally refined B-spline bases. We present examples for two- and three-dimensional linear elastic and thermo-elastic problems. The numerical results validate the accuracy of our framework. The results also demonstrate the applicability of the proposed framework to large, geometrically complex problems.

42 ENGINEERING↗

On the numerical algorithms of parametrization method for solving a two-point boundary-value problem for impulsive systems of loaded differential equations

A linear two-point boundary value problem for a system of loaded differential equations with impulse effect is investigated. Values in the previous impulse points are taken into consideration in the conditions of impulse effect. The considered problem is reduced to an equivalent multi-point boundary value problem for the system of ordinary differential equations with parameters. A numerical implementation of parametrization method is offered using the Runge–Kutta method of 4th-order accuracy for solving the Cauchy problems for ordinary differential equations. The constructed numerical algorithms are illustrated by examples.

97 MATHEMATICS AND COMPUTING↗

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↗

Explicit Solution to a Certain Non-ELQG Risk-sensitive Stochastic Control Problem

A risk-sensitive stochastic control problem with finite/infinite horizon is studied with a 1-dimensional controlled process defined by a linear SDE with a linear control-term in the drift. In the criterion function, a non-linear/quadratic term is introduced by using the solution to a Riccati differential equation, and hence, the problem is not ELQG (Exponential Linear Quadratic Gaussian) in general. For the problem, optimal value and control are calculated in explicit forms and the set of admissible risk-sensitive parameters is given in a concrete form. As applications, two types of large deviations control problems, i.e., maximizing an upside large deviations probability and minimizing a downside large deviations probability, are mentioned.

97 MATHEMATICS AND COMPUTING↗

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

97 MATHEMATICS AND COMPUTING↗

Boundary Value Problems for Nonclassical Systems of Second Order Differential Equations

We study boundary value problems for systems of second order differential equations with principal part in the form of the squared first order differential operator. We establish the unique solvability of the boundary value problem for a nonclassical system in the plane, which can be regarded as the Riemann–Hilbert problem with discontinuous boundary conditions. Similar problems are considered in the space.

97 MATHEMATICS AND COMPUTING↗

Initial-Boundary Value Problem for the Non-Stationary Radiative Transfer Equation with Fresnel Reflection and Refraction Conditions

We consider the initial-boundary value problems for the nonstationary radiative transfer equation in a system of semitransparent bodies with boundary and initial data in the complete scale of Lebesgue spaces. We establish the unique solvability of the first initial-boundary value problem, the problem with “shooting conditions,” and the problem with Fresnel reflection and refraction conditions on the body boundaries.

97 MATHEMATICS AND COMPUTING↗

Spectrum and Stabilization in Hyperbolic Problems

We study the connection between the stabilization of solutions of a mixed hyperbolic problem and spectral properties of the corresponding elliptic boundary value problem. We consider the first mixed problem for the wave equation in bounded and unbounded domains in ℝ{sup n}, determine the class of its energy solutions, and represent the solutions in terms of the Bochner–Stieltjes integral. We study how the spectrum of the elliptic operator affects the behavior of local energy of a solution and describe a method which allows us to study the stabilization of solutions with the help of estimates in the spectral parameter for solutions of the stationary problem on the upper half-plane.

97 MATHEMATICS AND COMPUTING↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods

We consider specific realizations of different implicit generalized Runge–Kutta methods as applied to the numerical integration with respect to time of initial-boundary-value problems for the second-order parabolic equations and investigate their spectral stability. It is shown that all implicit generalized Runge–Kutta methods are unconditionally spectrally stable but some of them have the conditional property of monotonicity of the numerical solution with respect to time. The functions of spectral stability of the implicit generalized Runge–Kutta methods are rational. We compare the analytic solution of the nonstationary one-dimensional problem of heat conduction with the numerical solutions of this problem obtained by different implicit generalized Runge–Kutta methods. It is shown that, in this case, the application of the one-stage Radau methods with subsequent discretization of the problem with respect to the space variable leads to the classical forward finite difference scheme (Laasonen scheme), whereas the use of the one-stage Gauss–Legendre method leads to a six-point symmetric scheme (Crank–Nicolson scheme). It is shown that diagonally implicit generalized Nørsett and Burrage methods are realized in almost the same way as the one-stage Radau and Gauss–Legendre methods but their accuracy in the time step is 10–1000 times higher. On the basis of comparison of the numerical and analytic solutions, we conclude that, in order to get practically suitable numerical solutions without any restrictions on the time step, it is reasonable to use one- and three-stage generalized Radau methods or two- and four-stage Lobatto IIIC methods. All other explicit and implicit generalized Runge–Kutta methods require certain restrictions imposed on the time step.

42 ENGINEERING↗

Solving equilibrium problems using extended mathematical programming

We introduce an extended mathematical programming framework for specifying equilibrium problems and their variational representations, such as generalized Nash equilibrium, multiple optimization problems with equilibrium constraints, and (quasi-) variational inequalities, and computing solutions of them from modeling languages. We define a new set of constructs with which users annotate variables and equations of the model to describe equilibrium and variational problems. Our constructs enable a natural translation of the model from one formulation to another more computationally tractable form without requiring the modeler to supply derivatives. In the context of many independent agents in the equilibrium, we facilitate expression of sophisticated structures such as shared constraints and additional constraints on their solutions. We define shared variables and demonstrate their uses for sparse reformulation, economic equilibrium problems sharing economic states, mixed pricing behavior of agents, and so on. We give some equilibrium and variational examples from the literature and describe how to formulate them using our framework. Experimental results comparing performance of various complementarity formulations for shared variables are provided. Our framework has been implemented and is available within GAMS/EMP.

Equilibrium programming↗

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↗