Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematics of computing”

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,513 records · Page 84

On mechanical waves and Doppler shifts from moving boundaries

We investigate the propagation of infinitesimal harmonic mechanical waves emitted from a boundary with variable velocity and arriving at a stationary observer. In the classical Doppler effect, X s (t)=vt is the location of the source with constant velocity v. In the present work, however, we consider a source co-located with a moving boundary x=X s (t), where X s (t) can have an arbitrary functional form. For ‘slowly moving’ boundaries (i.e., ones for which the timescale set by the mechanical motion is large in comparison to the inverse of the frequency of the emitted wave), we present a multiple-scale asymptotic analysis of the moving boundary problem for the linear wave equation. Here, we obtain a closed-form leading-order (with respect to the latter small parameter) solution and show that the variable velocity of the boundary results not only in frequency modulation but also in amplitude modulation of the received signal. Consequently, our results extend the applicability of two basic tenets of the theory of a moving source on a stationary domain, specifically that (i) $.\atop{x}_s$ for non-uniform boundary motion can be inserted in place of the constant velocity v in the classical Doppler formula and (ii) that the non-uniform boundary motion introduces variability in the amplitude of the wave. The specific examples of decelerating and oscillatory boundary motion are worked out and illustrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Exchange Value Embedded in a Transport System

This paper shows that a well designed transport system has an embedded exchange value by serving as a market for potential exchange between consumers. Under suitable conditions, one can improve the welfare of consumers in the system simply by allowing some exchange of goods between consumers during transportation without incurring additional transportation cost. We propose an explicit valuation formula to measure this exchange value for a given compatible transport system. This value is always nonnegative and bounded from above. Criteria based on transport structures, preferences and prices are provided to determine the existence of a positive exchange value. Finally, we study a new optimal transport problem with an objective taking into account of both transportation cost and exchange value.

97 MATHEMATICS AND COMPUTING↗

Equilibrium in a Production Economy

Consider a closed production-consumption economy with multiple agents and multiple resources. The resources are used to produce the consumption good. The agents derive utility from holding resources as well as consuming the good produced. They aim to maximize their utility while the manager of the production facility aims to maximize profits. With the aid of a representative agent (who has a multivariable utility function) it is shown that an Arrow-Debreu equilibrium exists. In so doing we establish technical results that will be used to solve the stochastic dynamic problem (a case with infinite dimensional commodity space so the General Equilibrium Theory does not apply) elsewhere.

97 MATHEMATICS AND COMPUTING↗

A General Stochastic Maximum Principle for SDEs of Mean-field Type

We study the optimal control for stochastic differential equations (SDEs) of mean-field type, in which the coefficients depend on the state of the solution process as well as of its expected value. Moreover, the cost functional is also of mean-field type. This makes the control problem time inconsistent in the sense that the Bellman optimality principle does not hold. For a general action space a Peng's-type stochastic maximum principle (Peng, S.: SIAM J. Control Optim. 2(4), 966-979, 1990) is derived, specifying the necessary conditions for optimality. This maximum principle differs from the classical one in the sense that here the first order adjoint equation turns out to be a linear mean-field backward SDE, while the second order adjoint equation remains the same as in Peng's stochastic maximum principle.

97 MATHEMATICS AND COMPUTING↗

Insider Models with Finite Utility in Markets with Jumps

In this article we consider, under a Levy process model for the stock price, the utility optimization problem for an insider agent whose additional information is the final price of the stock blurred with an additional independent noise which vanishes as the final time approaches. Our main interest is establishing conditions under which the utility of the insider is finite. Mathematically, the problem entails the study of a 'progressive' enlargement of filtration with respect to random measures. We study the jump structure of the process which leads to the conclusion that in most cases the utility of the insider is finite and his optimal portfolio is bounded. This can be explained financially by the high risks involved in models with jumps.

97 MATHEMATICS AND COMPUTING↗

First and Second Order Necessary Conditions for Stochastic Optimal Control Problems

In this work we consider a stochastic optimal control problem with either convex control constraints or finitely many equality and inequality constraints over the final state. Using the variational approach, we are able to obtain first and second order expansions for the state and cost function, around a local minimum. This fact allows us to prove general first order necessary condition and, under a geometrical assumption over the constraint set, second order necessary conditions are also established. We end by giving second order optimality conditions for problems with constraints on expectations of the final state.

97 MATHEMATICS AND COMPUTING↗

Optimal Portfolio Selection Under Concave Price Impact

In this paper we study an optimal portfolio selection problem under instantaneous price impact. Based on some empirical analysis in the literature, we model such impact as a concave function of the trading size when the trading size is small. The price impact can be thought of as either a liquidity cost or a transaction cost, but the concavity nature of the cost leads to some fundamental difference from those in the existing literature. We show that the problem can be reduced to an impulse control problem, but without fixed cost, and that the value function is a viscosity solution to a special type of Quasi-Variational Inequality (QVI). We also prove directly (without using the solution to the QVI) that the optimal strategy exists and more importantly, despite the absence of a fixed cost, it is still in a 'piecewise constant' form, reflecting a more practical perspective.

97 MATHEMATICS AND COMPUTING↗

On implicit abstract neutral nonlinear differential equations

In this paper we continue our developments in Hernández and O’Regan (J Funct Anal 261:3457–3481, 2011) on the existence of solutions for abstract neutral differential equations. In particular we extend the results in Hernández and O’Regan (J Funct Anal 261:3457–3481, 2011) for the case of implicit nonlinear neutral equations and we focus on applications to partial “nonlinear” neutral differential equations. Some applications involving partial neutral differential equations are presented.

97 MATHEMATICS AND COMPUTING↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Structures Computable in Polynomial Time. II

We consider a new approach to investigating categoricity of structures computable in polynomial time. The approach is based on studying polynomially computable stable relations. It is shown that this categoricity is equivalent to the usual computable categoricity for computable Boolean algebras with computable set of atoms, and for computable linear orderings with computable set of adjacent pairs. Examples are constructed which show that this does not always hold. We establish a connection between dimensions based on computable and polynomially computable stable relations.

97 MATHEMATICS AND COMPUTING↗

Representation of Solutions of Systems of Linear Differential Equations with Multiple Delays and Linear Parts Given by Nonpermutable Matrices

In recent results on representation of the solutions of systems of delayed differential equations, the condition that the linear parts are given by pairwise permutable matrices was assumed. We show how this strong condition can be avoided and derive a representation of solutions of systems of differential equations with nonconstant coefficients and variable delays. The results are applied to a system with two constant delays. In addition, the nonexistence of blow-up solutions is proved for nonlinear systems.

97 MATHEMATICS AND COMPUTING↗

Qualitative Properties of Solutions to Elliptic Equations with Nonpower Nonlinearities in ℝ{sub n}

We consider a class of anisotropic elliptic equations with nonpower nonlinearities. We establish the existence of a solution in the local Sobolev–Orlicz spaces without conditions on the data growth at infinity. We find sufficient uniqueness conditions, obtain estimates characterizing the behavior of the solution at infinity, and prove the continuous dependence of the solution on the right-hand side of the equation.

97 MATHEMATICS AND COMPUTING↗

The Hurwitz Product, p-Adic Topology on ℤ, and Fundamental Solution to Linear Differential Equation in the Ring ℤ[[x]]

We study the linear inhomogeneous first order differential equation by′ + f(x) = y in the ring of formal power series with integer coefficients. Using the p-adic topology on the ring of integers, we construct a counterpart of the Hurwitz product of the Euler series and an arbitrary formal power series with integer coefficients. It is shown that the Euler series can be interpreted as the fundamental solution to the equation under consideration. Bibliography: 8 titles.

97 MATHEMATICS AND COMPUTING↗

Properties of Some Extensions of the Quadratic Form of the Vector Laplace Operator

We consider the action of the quadratic form of the Laplace operator and its extensions in subspaces of linear combinations of the “transverse” and “longitudinal” functions with the fixed orbital momentum with respect to the coordinate origin. In the statement of the problem, it is required that the extensions obtained, after the transfer back to the space of vector functions, can be represented as simple limit expressions with two coefficients. We study the behavior of these coefficients with respect to the initial choice of the linear subspace. Bibliography: 5 titles.

97 MATHEMATICS AND COMPUTING↗