SEARCH · Search NASA
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.
We consider the Cauchy problem for a first-order quasilinear differential equation with delayed argument of neutral type, and obtain sufficient conditions of existence and uniqueness of its solutions. Proofs of the solvability of nonlinear problems, estimates of solutions, and constructions of approximate methods are based on Chaplygin-type theorems on differential inequalities.
We present a review of recent results on asymptotic approximations of solutions to boundary value problems in domains with large clusters of small defects. There are no assumptions which require periodicity within the cluster. The asymptotic approximations we discuss are uniform and include the boundary layers occurring in neighborhoods of singularly perturbed boundaries of the domains concerned. The term “meso-scale” is used to describe these approximations since they go beyond the conventional constraints of the homogenization theory.
We explore the aerodynamic implications of a novel data-driven separable shape tensor framework used to represent discrete airfoil shapes. In this study, we construct a data-driven parameter space defined by separable shape tensors and informed by tens of thousands of distinct airfoils. We use this design space to generate new airfoil designs to study parametric sensitivities with respect to various aerodynamic responses. We use a HAM2D RANS solver to approximate the lift, drag, and moment coefficients for the generated airfoils at two different angles-of-attack. We analyze the robustness and sensitivities of using the separable shape tensor design space by examining the coverage of the aerodynamic response space, uncovering low-dimensional polynomial ridge approximations, and computing various sensitivity metrics. The results show that the data-driven design space produce significant variation in target aerodynamic quantities and facilitate highly accurate approximations (R^2 > 0.96) of one- and two-dimensional structures in each aerodynamic response. This further reduces the effective dimension to enable simplified design and optimization tasks.
The X-ray phase imaging method has been applied to observe soft biological tissues, and it is possible to image the soft tissues by using the benefit of the so-called “Talbot effect” by an X-ray grating. One type of the X-ray phase imaging method was reported by combining an X-ray imaging microscope equipped by a Fresnel zone plate with a phase grating. Using the fringe scanning technique, a high-precision phase shift image could be obtained by displacing the grating step by step and measuring dozens of sample images. The number of the images was selected to reduce the error caused by the non-sinusoidal component of the Talbot self-image at the imaging plane. A larger number suppressed the error more but increased radiation exposure and required higher mechanical stability of equipment. In this paper, we analyze the approximation error of fringe scanning technique for the X-ray microscopy which uses just one grating and proposes an improved algorithm. We compute the approximation error by iteration and substitute that into the process of reconstruction of phase shift. This procedure will suppress the error even with few sample images. The results of simulation experiments show that the precision of phase shift image reconstructed by the proposed algorithm with 4 sample images is almost the same as that reconstructed by the conventional algorithm with 40 sample images. We also have succeeded in the experiment with real data.
In the study of packed granular materials, the performance of a sample (e.g., the detonation of a high-energy explosive) often correlates to measurements of a fluid flowing through it. The “effective surface area,” the surface area accessible to the airflow, is typically measured using a permeametry apparatus that relates the flow conductance to the permeable surface area via the Carman-Kozeny equation. This equation allows calculating the flow rate of a fluid flowing through the granules packed in the sample for a given pressure drop. However, Carman-Kozeny makes inherent assumptions about tunnel shapes and flow paths that may not accurately hold in situations where the particles possess a wide distribution in shapes, sizes, and aspect ratios, as is true with many powdered systems of technological and commercial interest. To address this challenge, we replicate these measurements virtually on micro-CT images of the powdered material, introducing a new Pore Network Model based on the skeleton of the Morse-Smale complex. Pores are identified as basins of the complex, their incidence encodes adjacency, and the conductivity of the capillary between them is computed from the cross-section at their interface. We build and solve a resistive network to compute an approximate laminar fluid flow through the pore structure. Here, we provide two means of estimating flow-permeable surface area: (i) by direct computation of conductivity, and (ii) by identifying dead-ends in the flow coupled with isosurface extraction and the application of the Carman-Kozeny equation, with the aim of establishing consistency over a range of particle shapes, sizes, porosity levels, and void distribution patterns.
We describe applications of asymptotic methods to problems of mathematical physics and mechanics, primarily, to the solution of nonlinear singularly perturbed problems in local domains. We also discuss applications of Padé approximations for transformation of asymptotic expansions to rational or quasi-fractional functions.
A comprehensive test program is defined which is being implemented in the NASA/Ames 3.5 foot Hypersonic Wind Tunnel for obtaining data on a generic all-body hypersonic vehicle for computational fluid dynamics (CFD) code validation. Computational methods (approximate inviscid methods and an upwind parabolized Navier-Stokes code) currently being applied to the all-body model are outlined. Experimental and computational results on surface pressure distributions and Pitot-pressure surveys for the basic sharp-nose model (without control surfaces) at a free-stream Mach number of 7 are presented.
Formulas are derived for the computation of the random input-describing functions for MIMO nonlinearities; these straightforward and rigorous derivations are based on the optimal mean square linear approximation. The computations involve evaluations of multiple integrals. It is shown that, for certain classes of nonlinearities, multiple-integral evaluations are obviated and the computations are significantly simplified.
In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.
An approximate method for computing water loads and pressure distributions on lightly loaded elliptical cylinders during oblique water impacts is presented. The method is of special interest for the case of emergency water landings of helicopters. This method makes use of theory developed and checked for landing impacts of seaplanes having bottom cross sections of V and scalloped contours. An illustrative example is given to show typical results obtained from the use of the proposed method of computation. The accuracy of the approximate method was evaluated through comparison with limited experimental data for two-dimensional drops of a rigid circular cylinder at a trim of 0 degrees and a flight -path angle of 90 degrees. The applicability of the proposed formulas to the design of rigid hulls is indicated by the rough agreement obtained between the computed and experimental results. A detailed computational procedure is included as an appendix.
We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.
In this work, we study approximations of solutions of fractional differential equations of order 1/2. We present a new method of approximation and obtain the order of convergence. The presentation is given within the abstract framework of a semidiscrete approximation scheme, which includes finite-element methods, finite-difference schemes, and projection methods.
An approximate solution is obtained for a singularly perturbed system of initial valued, time invariant, linear differential equations with multiple boundary layers. Conditions are stated under which the approximate solution converges uniformly to the exact solution as the perturbation parameter tends to zero. The solution is obtained by the method of matched asymptotic expansions. Use of the results for obtaining approximate solutions of general linear systems is discussed. An example is considered to illustrate the method and it is shown that the formulas derived give a readily computed uniform approximation.
Digital computer program for Newtonian aerodynamics of body composed of flat plate segments
A computationally fast algorithm for approximating the amplitude (A) of a quadrature pair (I,Q) has been discovered. The piecewise linear formula, the unbiased estimate of A=X+1/8y when X or = 3Y and 7/8X + 1/2Y when X or = 3Y applies where X is congruent to the maximum absolute value of (I,Q) and Y is congruent to the minimum absolute value of (I,Q). This algorithm has been proven to be far more accurate then currently used approximations. An immediate application is the wideband digital spectrum analyzer under development for monitoring radio frequency interference at Deep Space Network stations.
We study the problem of finding approximations to the optimal control with respect to a quadratic-type quality criterion in the form of feedback (synthesis) for a linear-quadratic problem in the from of a hyperbolic equation with rapidly oscillating coefficients and distributed control on the right-hand side. On the basis of the exact formula of synthesis, its approximate version (based on the replacement of the rapidly oscillating variables by averaged quantities) is substantiated.
We present a polynomial approximation method for realizing modified Landau–Kolmogorov type inequalities with small order derivatives. Bibliography: 6 titles.
Approximation for graphical confidence bounds is simple enough to run on programmable calculator. Approximation is used in lieu of numerical tables not always available, and exact calculations, which often require rather sizable computer resources. Approximation verified for collection of up to 50 data points. Method used to analyze tile-strength data on Space Shuttle thermal-protection system.