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 829 records · Page 46

HYPERVELOCITY STARS AND THE RESTRICTED PARABOLIC THREE-BODY PROBLEM

Motivated by detections of hypervelocity stars that may originate from the Galactic center, we revisit the problem of a binary disruption by a passage near a much more massive point mass. The six orders of magnitude mass ratio between the Galactic center black hole (BH) and the binary stars allows us to formulate the problem in the restricted parabolic three-body approximation. In this framework, results can be simply rescaled in terms of binary masses, their initial separation, and the binary-to-black hole mass ratio. Consequently, an advantage over the full three-body calculation is that a much smaller set of simulations is needed to explore the relevant parameter space. Contrary to previous claims, we show that, upon binary disruption, the lighter star does not remain preferentially bound to the black hole. In fact, it is ejected in exactly 50% of the cases. Nonetheless, lighter objects have higher ejection velocities, since the energy distribution is independent of mass. Focusing on the planar case, we provide the probability distributions for disruption of circular binaries and for the ejection energy. We show that even binaries that penetrate deeply into the tidal sphere of the BH are not doomed to disruption, but survive in 20% of the cases. Nor do these deep encounters produce the highest ejection energies, which are instead obtained for binaries arriving to 0.1-0.5 of the tidal radius in a prograde orbit. Interestingly, such deep-reaching binaries separate widely after penetrating the tidal radius, but always approach each other again on their way out from the BH. Finally, our analytic method allows us to account for a finite size of the stars and recast the ejection energy in terms of a minimal possible separation. We find that, for a given minimal separation, the ejection energy is relatively insensitive to the initial binary separation.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum N-body problem with a minimal length

The quantum N-body problem is studied in the context of nonrelativistic quantum mechanics with a one-dimensional deformed Heisenberg algebra of the form [x,p]=i(1+{beta}p{sup 2}), leading to the existence of a minimal observable length {radical}({beta}). For a generic pairwise interaction potential, analytical formulas are obtained that allow estimation of the ground-state energy of the N-body system by finding the ground-state energy of a corresponding two-body problem. It is first shown that in the harmonic oscillator case, the {beta}-dependent term grows faster with increasing N than the {beta}-independent term. Then, it is argued that such a behavior should also be observed with generic potentials and for D-dimensional systems. Consequently, quantum N-body bound states might be interesting places to look at nontrivial manifestations of a minimal length, since the more particles that are present, the more the system deviates from standard quantum-mechanical predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Schwarzschild-anti-de Sitter black holes within isothermal cavity: Thermodynamics, phase transitions, and the Dirichlet problem

The thermodynamics of Schwarzschild black holes within spherical isothermal cavities in anti-de Sitter (AdS) space is studied for arbitrary dimensions in the semiclassical approximation of the Euclidean path integral of quantum gravity. For such boundary conditions, known classical solutions are a hot AdS and two or no Schwarzschild-AdS depending on whether or not the wall-temperature of the cavity is above or below a minimum value. Earlier work in four dimensions with such boundary conditions showed that the larger and smaller holes have positive and negative specific heats and hence are locally thermodynamically stable and unstable, respectively. The standard area-law of entropy was known to hold too. We derive the area-law for arbitrary dimensions and show that qualitative behavior of local stability remains the same. Then using a careful analysis of the associated Dirichlet boundary-value problem we address global issues. We find that for wall-temperatures above a critical value a phase transition takes hot AdS to the larger Schwarzschild-AdS. The larger hole thus can be globally thermodynamically stable. We find that the smaller the cavity the higher the critical temperature for phase transition is and it always remains above the minimum temperature needed for the classical existence of the holes in that cavity. In the infinite limit of cavity this picture reduces to that considered by Hawking and Page. All these hold for arbitrary dimensions, however the case of five dimensions turns out to be special in that the Dirichlet problem can be solved exactly giving exact analytic expressions for the black-hole masses as functions of boundary variables (cavity-radius and temperature). This makes it possible to compute the on-shell Euclidean action as a function of boundary variables too from which other quantities of interest can be evaluated. In particular, we obtain the minimum temperature (for the holes to exist classically) and the critical temperature (for phase transition) as functions of the cavity-radius in five dimensions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Collinear solution to the general relativistic three-body problem

The three-body problem is reexamined in the framework of general relativity. The Newtonian three-body problem admits Euler's collinear solution, where three bodies move around the common center of mass with the same orbital period and always line up. The solution is unstable. Hence, it is unlikely that such a simple configuration would exist owing to general relativistic forces dependent not only on the masses but also on the velocity of each body. However, we show that the collinear solution remains true with a correction to the spatial separation between masses. Relativistic corrections to the Sun-Jupiter Lagrange points L{sub 1}, L{sub 2}, and L{sub 3} are also evaluated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uniqueness of collinear solutions for the relativistic three-body problem

Continuing work initiated in an earlier publication [Yamada, Asada, Phys. Rev. D 82, 104019 (2010)], we investigate collinear solutions to the general relativistic three-body problem. We prove the uniqueness of the configuration for given system parameters (the masses and the end-to-end length). First, we show that the equation determining the distance ratio among the three masses, which has been obtained as a seventh-order polynomial in the previous paper, has at most three positive roots, which apparently provide three cases of the distance ratio. It is found, however, that, even for such cases, there exists one physically reasonable root and only one, because the remaining two positive roots do not satisfy the slow-motion assumption in the post-Newtonian approximation and are thus discarded. This means that, especially for the restricted three-body problem, exactly three positions of a third body are true even at the post-Newtonian order. They are relativistic counterparts of the Newtonian Lagrange points L{sub 1}, L{sub 2}, and L{sub 3}. We show also that, for the same masses and full length, the angular velocity of the post-Newtonian collinear configuration is smaller than that for the Newtonian case. Provided that the masses and angular rate are fixed, the relativistic end-to-end length is shorter than the Newtonian one.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

74 ATOMIC AND MOLECULAR PHYSICS↗

Solving a Class of Nonlinear Eigenvalue Problems by Newton's Method

We examine the possibility of using the standard Newton's method for solving a class of nonlinear eigenvalue problems arising from electronic structure calculation. We show that the Jacobian matrix associated with this nonlinear system has a special structure that can be exploited to reduce the computational complexity of the Newton's method. Preliminary numerical experiments indicate that the Newton's method can be more efficient for small problems in which a few smallest eigenpairs are needed.

97 MATHEMATICS AND COMPUTING↗

From h to p efficiently: optimal implementation strategies for explicit time-dependent problems using the spectral/ hp element method: FROM h TO p EFFICIENTLY

We investigate the relative performance of a second-order Adams–Bashforth scheme and second-order and fourth-order Runge–Kutta schemes when time stepping a 2D linear advection problem discretised using a spectral/hp element technique for a range of different mesh sizes and polynomial orders. Numerical experiments explore the effects of short (two wavelengths) and long (32 wavelengths) time integration for sets of uniform and non-uniform meshes. The choice of time-integration scheme and discretisation together fixes a CFL limit that imposes a restriction on the maximum time step, which can be taken to ensure numerical stability. The number of steps, together with the order of the scheme, affects not only the runtime but also the accuracy of the solution. Through numerical experiments, we systematically highlight the relative effects of spatial resolution and choice of time integration on performance and provide general guidelines on how best to achieve the minimal execution time in order to obtain a prescribed solution accuracy. The significant role played by higher polynomial orders in reducing CPU time while preserving accuracy becomes more evident, especially for uniform meshes, compared with what has been typically considered when studying this type of problem.

42 ENGINEERING↗

Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems

This work discusses techniques for computing a few selected eigenvalue–eigenvector pairs of large and sparse symmetric matrices. A recently developed class of techniques to solve this type of problems is based on integrating the matrix resolvent operator along a complex contour that encloses the interval containing the eigenvalues of interest. This paper considers such contour integration techniques from a domain decomposition viewpoint and proposes two schemes. The first scheme can be seen as an extension of domain decomposition linear system solvers in the framework of contour integration methods for eigenvalue problems, such as FEAST. The second scheme focuses on integrating the resolvent operator primarily along the interface region defined by adjacent subdomains. A parallel implementation of the proposed schemes is described, and results on distributed computing environments are reported. These results show that domain decomposition approaches can lead to reduced run times and improved scalability.

97 MATHEMATICS AND COMPUTING↗

Data–driven model reduction for the Bayesian solution of inverse problems

One of the prime challenges in the Bayesian solution of inverse problems governed by partial differential equations (PDEs) is the computational cost of repeatedly evaluating numerical PDE models, as required by Markov chain Monte Carlo (MCMC) methods for posterior sampling. This paper presents a data-driven projection-based model reduction technique to reduce this computational cost. The proposed technique has two distinctive features. To begin, the model reduction strategy is tailored to inverse problems: the snapshots used to construct the reduced-order model are computed adaptively from the posterior distribution. Posterior exploration and model reduction are thus pursued simultaneously. Second, to avoid repeated evaluations of the full-scale numerical model as in a standard MCMC method, we couple the full-scale model and the reduced-order model together in the MCMC algorithm. This maintains accurate inference while reducing its overall computational cost. In numerical experiments considering steady-state flow in a porous medium, the data-driven reduced-order model achieves better accuracy than a reduced-order model constructed using the classical approach. It also improves posterior sampling efficiency by several orders of magnitude compared with a standard MCMC method.

97 MATHEMATICS AND COMPUTING↗

A Planning Problem Combining Calculus of Variations and Optimal Transport

We consider some variants of the classical optimal transport where not only one optimizes over couplings between some variables x and y but also over some control variables governing the evolutions of these variables with time. Such a situation is motivated by an assignment problem of tasks with workers whose characteristics can evolve with time (and be controlled). We distinguish between the coupled and decoupled case. The coupled case is a standard optimal transport with the value of some optimal control problem as cost. The decoupled case is more involved since it is nonlinear in the transport plan.

97 MATHEMATICS AND COMPUTING↗

Inconsistent Investment and Consumption Problems

In a traditional Black–Scholes market we develop a verification theorem for a general class of investment and consumption problems where the standard dynamic programming principle does not hold. The theorem is an extension of the standard Hamilton–Jacobi–Bellman equation in the form of a system of non-linear differential equations. We derive the optimal investment and consumption strategy for a mean-variance investor without pre-commitment endowed with labor income. In the case of constant risk aversion it turns out that the optimal amount of money to invest in stocks is independent of wealth. The optimal consumption strategy is given as a deterministic bang-bang strategy. In order to have a more realistic model we allow the risk aversion to be time and state dependent. Of special interest is the case were the risk aversion is inversely proportional to present wealth plus the financial value of future labor income net of consumption. Using the verification theorem we give a detailed analysis of this problem. It turns out that the optimal amount of money to invest in stocks is given by a linear function of wealth plus the financial value of future labor income net of consumption. The optimal consumption strategy is again given as a deterministic bang-bang strategy. We also calculate, for a general time and state dependent risk aversion function, the optimal investment and consumption strategy for a mean-standard deviation investor without pre-commitment. In that case, it turns out that it is optimal to take no risk at all.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On a Highly Nonlinear Self-Obstacle Optimal Control Problem

We consider a non-quadratic optimal control problem associated to a nonlinear elliptic variational inequality, where the obstacle is the control itself. We show that, fixed a desired profile, there exists an optimal solution which is not far from it. Detailed characterizations of the optimal solution are given, also in terms of approximating problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fundamental Solutions for Two-Point Boundary Value Problems in Orbital Mechanics

We consider a two-point boundary value problem (TPBVP) in orbital mechanics involving a small body (e.g., a spacecraft or asteroid) and N larger bodies. The least action principle TPBVP formulation is converted into an initial value problem via the addition of an appropriate terminal cost to the action functional. The latter formulation is used to obtain a fundamental solution, which may be used to solve the TPBVP for a variety of boundary conditions within a certain class. In particular, the method of convex duality allows one to interpret the least action principle as a differential game, where an opposing player maximizes over an indexed set of quadratics to yield the gravitational potential. In the case where the time duration is less than a specific bound, there exists a unique critical point for the resulting differential game, which yields the fundamental solution given in terms of the solutions of associated Riccati equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of the SBP-SAT Stabilization for Finite Element Methods Part I: Linear Problems

In the hyperbolic community, discontinuous Galerkin (DG) approaches are mainly applied when finite element methods are considered. As the name suggested, the DG framework allows a discontinuity at the element interfaces, which seems for many researchers a favorable property in case of hyperbolic balance laws. On the contrary, continuous Galerkin methods appear to be unsuitable for hyperbolic problems and there exists still the perception that continuous Galerkin methods are notoriously unstable. To remedy this issue, stabilization terms are usually added and various formulations can be found in the literature. However, this perception is not true and the stabilization terms are unnecessary, in general. In this paper, we deal with this problem, but present a different approach. We use the boundary conditions to stabilize the scheme following a procedure that are frequently used in the finite difference community. Here, the main idea is to impose the boundary conditions weakly and specific boundary operators are constructed such that they guarantee stability. This approach has already been used in the discontinuous Galerkin framework, but here we apply it with a continuous Galerkin scheme. No internal dissipation is needed even if unstructured grids are used. Further, we point out that we do not need exact integration, it suffices if the quadrature rule and the norm in the differential operator are the same, such that the summation-by-parts property is fulfilled meaning that a discrete Gauss Theorem is valid. This contradicts the perception in the hyperbolic community that stability issues for pure Galerkin scheme exist. In numerical simulations, we verify our theoretical analysis.

97 MATHEMATICS AND COMPUTING↗

Solvability of Nonlinear Inverse Problem for Hyperbolic Equation

We consider the nonlinear inverse problem for a second order hyperbolic equation with unknown coefficient depending on the time. We establish the existence and uniqueness of regular solutions which are used for constructing a soltuion to the inverse problem under consideration.

97 MATHEMATICS AND COMPUTING↗

On Solutions to the Schwarz Problem in a Disk in the Three-Dimensional Case

We consider the Schwarz problem for first order elliptic systems in the plane. We obtain the conditions on three– and two-dimensional matrices J admitting nondiagonal Jordan form under which a solution to the Schwarz problem in an arbitrary disk exists and is unique in Hölder classes. We describe an algorithm for constructing the solution. Bibliography: 5 titles.

97 MATHEMATICS AND COMPUTING↗