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 1,531 records · Page 85

NSF-NASA Extreme Design & Wicked Problems Workshop

To learn how we might solve some important and challenging problems that require us to step into extreme or “wicked problem” domains. Where systems-level engineering and design are required to integrate with other domains. Connect with the external community to cross-pollinate on best methods, processes, and tools.

Innovation↗

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↗

Systems of Functions Orthogonal Over the Domain and Their Application in Boundary-Value Problems of Mathematical Physics

We formulate a boundary-value problem for eigenvalues and eigenfunctions of the Helmholtz equation in a complex domain with the use of mutually conjugated complex variables. The obtained systems of functions are orthogonal in this domain and constructed by using the Bessel functions and powers of the conformal mappings of the analyzed domains onto a circle. The solutions of boundary-value problems for the principal equations of mathematical physics (hyperbolic, parabolic and elliptic types) are obtained in the form of the sums of series in the systems of functions orthogonal over the domain.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Restoration of the Initial Data in the Problem for a Diffusion Equation with Fractional Derivative with Respect to Time

We prove the correctness of the inverse problem of finding a pair of functions: the classical solution u(x,t) of the first boundary-value problem for a linear diffusion equation with regularized fractional derivative of order α ∈ (1, 2) with respect to time in a rectangular domain (0, ℓ) × (0, t{sub 0}] and unknown initial values of the function u(x,t) for the case of additionally given values of the function at a certain fixed time t{sub 0} .

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. I. Explicit Methods

We develop a general algorithm for the analysis the spectral stability of generalized multistage Runge–Kutta methods of various orders of accuracy as applied to the numerical integration with respect to time of an initial-boundary-value problem for the second-order parabolic equation. The expression for the function of spectral stability is obtained in two alternative forms: on the basis of matrix relations and in the determinant form. We study specific realizations of various generalized explicit Runge–Kutta methods and their spectral stability. It is shown that all explicit generalized Runge–Kutta methods possess the property of conditional spectral stability and the property of conditional monotonicity of the numerical solution in time whose violation leads to the appearance of false oscillations of the approximate solution. The stability function for these methods is polynomial. It is shown that the application of two-stage generalized explicit Runge–Kutta methods leads to the appearance of predictor-corrector-type schemes. In the case of nonstationary one-dimensional heat-conduction problem, on the basis of a one-stage generalized Runge–Kutta method, we obtain the classical two-layer conditionally stable explicit finite-difference scheme on a four-point template. It is demonstrated that the five-stage generalized Runge–Kutta–Merson method is characterized by the weakest condition of spectral stability as compared with all investigated explicit generalized Runge–Kutta methods.

42 ENGINEERING↗

Solution of Boundary Value Problems in Cylinders with Two-Layer Film Inclusions

We consider the class of boundary value problems for elliptic, parabolic, and hyperbolic equations in cylinders separated by a two-layer film into two half-cylinders. We prove the existence and uniqueness theorem and express the solutions in terms of solutions to analogous classical problems in cylinders without films.

97 MATHEMATICS AND COMPUTING↗

On the Solvability of a Matrix Boundary-Value Problem

We found solvability conditions and a construction of the generalized Green operator for a linear matrix boundary-value problem; we present an operator that reduces a linear matrix equation to the conventional linear Noether boundary-value problem. To solve a linear matrix system, we use the operator that reduces a linear matrix equation to a linear algebraic equation with a rectangular matrix.

97 MATHEMATICS AND COMPUTING↗