Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematics and 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 811 records · Page 45

Quasielliptic Operators and Equations Not Solvable with Respect to the Higher Order Derivative

We consider a class of quasielliptic operators in R{sup n} and establish the isomorphism property in special weighted Sobolev spaces. In more general weighted spaces, we obtain the unique solvability conditions for quasielliptic equations and prove estimates for solutions. Based on the obtained results, we study the solvability of the initial problem for equations that are not solvable with respect to the higher order derivative.

97 MATHEMATICS AND COMPUTING↗

A Priori Tame Estimates in Sobolev Spaces for the Plasma–Vacuum Interface Problem

We study the free boundary problem for the plasma–vacuum interface in the case where the plasma density is strictly positive up to the boundary. For the linearized problem we derive the so-called tame estimates which can be used for proving the existence of solutions to the nonlinear problem by the Nash-Moser method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Nonlocal Inverse Problem for the Two-Dimensional Heat-Conduction Equation

We consider an inverse problem of determination of the time-dependent leading coefficient of a two-dimensional heat-conduction equation with nonlocal overdetermination condition. The existence and uniqueness conditions are established for the classical solution of the analyzed problem.

97 MATHEMATICS AND COMPUTING↗

Discrete Morse Theory for the Barycentric Subdivision

Let F be a discrete Morse function on a simplicial complex L. We construct a discrete Morse function Δ(F) on the barycentric subdivision Δ(L). The constructed function Δ(F) “behaves the same way” as F, i.e., has the same number of critical simplices and the same gradient path structure.

97 MATHEMATICS AND COMPUTING↗

Operator-Norm Convergence Estimates for Elliptic Homogenization Problems on Periodic Singular Structures

For an arbitrary periodic Borel measure μ we prove order O(ε) operator-norm resolvent estimates for the solutions to scalar elliptic problems in L{sup 2}(ℝ{sup d}, dμ{sup ε}) with ε-periodic coefficients, ε > 0. Here, μ{sup ε} is the measure obtained by ε-scaling of μ. Our analysis includes the case of a measure absolutely continuous with respect to the standard Lebesgue measure, as well as the case of “singular” periodic structures (or “multistructures”), when μ is supported by lower-dimensional manifolds.

97 MATHEMATICS AND COMPUTING↗

Vector Bundles on P{sup 1}{sub ℤ} with Simple Jumps

Vector bundles of rank 2 on the projective line over ℤ are considered. It is assumed that such a bundle E is trivial on a generic fiber, and its restriction to any special fiber is isomorphic either to O{sup 2} or to O(−1)⊕O(1). Under these assumptions it is proved that an exact sequence of the form 0→O(−2) → E →O(2) → 0 exists.

97 MATHEMATICS AND COMPUTING↗

On the Kräuter–Seifter Theorem on Permanent Divisibility

The paper investigates the divisibility of the permanent function of (1,−1)-matrices by different powers of 2. It is shown that the Kräuter–Seifter bound is the best possible one for generic(1,−1)-matrices.

97 MATHEMATICS AND COMPUTING↗

A Generalization of the Theorem on Forming a Matroid from Parts

The following generalization of the theorem on forming a matroid from parts is proved: If a finite set is subdivided into some blocks, each of which is supplied with a matroid structure, and the ranks of every union of certain blocks are prescribed and satisfy the conditions on the rank function of a matroid, then the rank function can be extended to all the subsets of the original set in such a way that the latter becomes a matroid.

97 MATHEMATICS AND COMPUTING↗

Semirings of Continuous (0,∞]-Valued Functions

The semiring C{sup ∞}(X) of all continuous functions on an arbitrary topological space X with values in the topological semiring (0,∞] is studied. General properties of semirings C{sup ∞}(X) are considered. Properties of lattices of ideals and congruences of semirings C{sup ∞}(X) over the P-spaces X, the F-spaces X, and the finite discrete spaces are proved.

97 MATHEMATICS AND COMPUTING↗

Application of the p-Adic Topology on ℤ to the Problem of Finding Solutions in Integers of an Implicit Linear Difference Equation

We study solutions in integers of an implicit linear inhomogeneous first order difference equation bx{sub n+1} = ax{sub n} + f{sub n}. Based on the p-adic topology on the ring of integers, we obtain a criterion for the existence of solutions and show that for a = 1 a typical (in the natural topological sense) equation has no integer solutions.

97 MATHEMATICS AND COMPUTING↗

On the Kernel of a Two-Point Problem for a Partial Differential Equation of the Second Order in Time

We study the problem for a homogeneous partial differential equation of the second order with respect to time with given homogeneous two-point conditions in this variable and, in general, of the infinite order in the other (space) variable. It is proved that the analyzed problem possesses solely the trivial solution if the characteristic determinant is not identically equal to zero. In the case where the set of zeros of the characteristic determinant of this problem is nonempty, we propose a method for the construction of nontrivial solutions of the problem.

97 MATHEMATICS AND COMPUTING↗

A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Simulation of Gas Production from Multilayered Hydrate-Bearing Media with Fully Coupled Flow, Thermal, Chemical and Geomechanical Processes Using TOUGH+Millstone. Part 2: Geomechanical Formulation and Numerical Coupling

The TOUGH+Millstone simulator has been developed for the analysis of coupled flow, thermal and geomechanical processes associated with the formation and/or dissociation of CH 4 hydrates in geological media. It is composed of two constituent codes: (a) a significantly enhanced version of the TOUGH+HYDRATE simulator, v2.0, that accounts for all known flow, physical, thermodynamic and chemical processes associated with the behavior of hydrate-bearing systems undergoing changes and includes the most recent advances in the description of the system properties, coupled seamlessly with (b) Millstone v1.0, a new code that addresses the conceptual, computational and mathematical shortcomings of earlier codes used to describe the geomechanical response of these systems. The capabilities of the TOUGH+Millstone code are demonstrated in the simulation and analysis of the system flow, thermal and geomechanical behavior during gas production from a realistic complex offshore hydrate deposit. In the second part of this series, we describe the Millstone geomechanical simulator. The hydrate-dependent, rate-based poromechanical formulation is presented and solved using a finite element discretization. A novel multimesh coupling scheme is introduced, wherein interpolators are automatically built to transfer data between the finite difference discretization of TOUGH+ and the finite element discretization of Millstone. We provide verification examples against analytic solutions for poroelasticity and a simplified demonstration problem for mechanically induced phase change in a hydrate sediment.

58 GEOSCIENCES↗