Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “inverse problems”

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,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Influence of the inverse sheath on divertor plasma performance in tokamak edge plasma simulations

Recently, it was shown that strong electron thermionic emission from material walls could result in the formation of an “inverse sheath”, which prevents the flow of cold ions to the wall. Such regimes look very favorably from the point of view of plasma-material interactions at the edge of magnetic fusion devices, where the problem of the erosion of plasma facing components under ion irradiation is one of the key issues for developing of future magnetic fusion reactors. However, it is not clear whether such regimes are compatible with edge plasma parameters and heat removal requirements in fusion reactors.To address the issue of practicality of the “inverse sheath” regime for edge tokamak plasma conditions, we perform a set of numerical simulations with 2D edge plasma transport code UEDGE for a DIII-D-like geometry and magnetic configuration.To describe both “standard” and “inverse sheath” conditions within the framework of the UEDGE code (which does not consider the sheath region per se), at the material surfaces, we apply effective boundary conditions which emulate both “standard” and“inverse sheath” regimes. We demonstrate that for the same input parameters, spatial distributions of edge plasma parameters corresponding to detached divertor and“inverse sheath” regimes are similar, with only a few minor differences. We discuss the compatibility of “inverse sheath” regimes with core plasma parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1993

An inverse method for computation of structural stiffness distributions of aeroelastically optimized wings

An inverse method has been developed to compute the structural stiffness properties of wings given a specified wing loading and aeroelastic twist distribution. The method directly solves for the bending and torsional stiffness distribution of the wing using a modal representation of these properties. An aeroelastic design problem involving the use of a computational aerodynamics method to optimize the aeroelastic twist distribution of a tighter wing operating at maneuver flight conditions is used to demonstrate the application of the method. This exercise verifies the ability of the inverse scheme to accurately compute the structural stiffness distribution required to generate a specific aeroelastic twist under a specified aeroelastic load.

Schuster, David M.↗
NASA NTRS2001

The 3D Recognition, Generation, Fusion, Update and Refinement (RG4) Concept

This paper describes an active (real time) recognition strategy whereby information is inferred iteratively across several viewpoints in descent imagery. We will show how we use inverse theory within the context of parametric model generation, namely height and spectral reflection functions, to generate model assertions. Using this strategy in an active context implies that, from every viewpoint, the proposed system must refine its hypotheses taking into account the image and the effect of uncertainties as well. The proposed system employs probabilistic solutions to the problem of iteratively merging information (images) from several viewpoints. This involves feeding the posterior distribution from all previous images as a prior for the next view. Novel approaches will be developed to accelerate the inversion search using novel statistic implementations and reducing the model complexity using foveated vision. Foveated vision refers to imagery where the resolution varies across the image. In this paper, we allow the model to be foveated where the highest resolution region is called the foveation region. Typically, the images will have dynamic control of the location of the foveation region. For descent imagery in the Entry, Descent, and Landing (EDL) process, it is possible to have more than one foveation region. This research initiative is directed towards descent imagery in connection with NASA's EDL applications. Three-Dimensional Model Recognition, Generation, Fusion, Update, and Refinement (RGFUR or RG4) for height and the spectral reflection characteristics are in focus for various reasons, one of which is the prospect that their interpretation will provide for real time active vision for automated EDL.

Maluf, David A.↗
NASA NTRS1988

A general explicit solution of the central overlap problem

The matrix of the normal equations of a central overlapping-plate solution with general models for frame parameters and the star parameters is inverted explicitly in terms of the inverses of the matrices in the isolated systems for the frame and star parameters. This makes it possible to calculate from explicit formulas the numerical estimates of the star and frame parameters which would follow from a rigorous overlapping-plate solution. Also, the covariance matrix of the adjustment parameters are calculated.

Eichhorn, Heinrich↗
DOE OSTI2022

Spectral density reconstruction with Chebyshev polynomials

Accurate calculations of the spectral density in a strongly correlated quantum many-body system are of fundamental importance to study its dynamics in the linear response regime. Typical examples are the calculation of inclusive and semiexclusive scattering cross sections in atomic nuclei and transport properties of nuclear and neutron star matter. Integral transform techniques play an important role in accessing the spectral density in a variety of nuclear systems. However, their accuracy is in practice limited by the need to perform a numerical inversion which is often ill-conditioned. Here, in the present work we extend a recently proposed quantum algorithm which circumvents this problem. We show how to perform controllable reconstructions of the spectral density over a finite energy resolution with rigorous error estimates. An appropriate expansion in Chebyshev polynomials allows for efficient simulations also on classical computers. We apply our idea to obtain the local density of states for graphene in a magnetic field as a proof of principle. This paves the way for future applications in nuclear and condensed matter physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1962

Interplanetary Trajectory Optimization with Powerlimited Propulsion Systems

A trajectory-optimization process is described in which the optimum­ thrust equations are derived using the calculus of variations. The mag­nitude of the thrust is constrained within an upper and a lower bound, but the thrust direction is arbitrary. This formulation allows both the constant-thrust program and the variable-thrust program to be con­sidered. For the constant-thrust program, certain propulsion-system parameters are optimized for maximum final vehicle mass. This theory has been used to study interplanetary missions to Venus and Mars using a power-limited propulsion system. Both one-way and round­ trip rendezvous trajectories are considered. The analysis employs a two-body inverse-square force-field model of three dimensions. An iterative routine used to solve the two-point boundary-value problem is described in the Appendix.

TRAJECTORY↗
NASA NTRS1971

Thermal Analysis Methods and Basic Heat-Transfer Data for a Turbulent Heating Flight Experiment at Mach 20 (Reentry F)

A heat-transfer experiment was flight conducted on a 5 deg half-angle cone, 396.2 cm (13 ft) in length, as it entered the sensible atmosphere under laminar, transitional, and turbulent boundary-layer conditions at a free-stream Mach number of about 20. Accurate turbulent-heat-transfer data with natural transition were obtained for correlation with theories in regions of simultaneous high Mach number, Reynolds number, enthalpy, and total-to-wall temperature ratio. Temperatures were measured at four depths through the 15.24-mm-thick (0.600-in.) beryllium wall. Experimental heating rates at 20 stations on the cone were determined independently from the outermost temperature measurement and from the temperature measurement at the second depth by a single-thermocouple inverse method and also from the temperature histories at all four depths by an integral method. The thermal data analysis procedure, associated problems, and results are presented herein.

Howard, Floyd G.↗
NASA NTRS1975

Stellar model chromospheres. IV - The formation of the H-epsilon feature in the sun /G2 V/ and Arcturus /K2 III/

The formation of the Balmer-series member H-epsilon in the near-red wing of the Ca II H line is discussed for two cases: the sun (H-epsilon absorption profile) and Arcturus (H-epsilon emission profile). It is shown that although the H-epsilon source functions in both stars are dominated by the Balmer-continuum radiation field through photoionizations, the line-formation problems in the two stars are quantitatively different, owing to a substantial difference in the relative importance of the stellar chromosphere temperature inversion as compared with the stellar photosphere.

Ayres, T. R.↗
NASA NTRS1998

High-Accuracy Compact MacCormack-Type Schemes for Computational Aeroacoustics

Using MacCormack-type methods, a new class of highly accurate compact MacCormack-type schemes is derived which does not require a tridiagonal matrix inversion to obtain the spatial derivatives. Two examples are shown, and results of these schemes for three linear and nonlinear CAA Benchmark Problems are presented.

Hixon, R.↗
NASA NTRS1995

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Kenwright, David↗
NASA NTRS2001

Maximally Informative Statistics for Localization and Mapping

This paper presents an algorithm for localization and mapping for a mobile robot using monocular vision and odometry as its means of sensing. The approach uses the Variable State Dimension filtering (VSDF) framework to combine aspects of Extended Kalman filtering and nonlinear batch optimization. This paper describes two primary improvements to the VSDF. The first is to use an interpolation scheme based on Gaussian quadrature to linearize measurements rather than relying on analytic Jacobians. The second is to replace the inverse covariance matrix in the VSDF with its Cholesky factor to improve the computational complexity. Results of applying the filter to the problem of localization and mapping with omnidirectional vision are presented.

Deans, Matthew C.↗
NASA NTRS1979

Elastic lithosphere thickness on the moon from mare tectonic features - A formal inversion

The thickness (T) of the lunar elastic lithosphere at the time (3.6 to 3.8 billion years ago) of the earliest preserved basalt flows in circular mare basins can be estimated by inverting the observed locations of extensional tectonic features in and surrounding the maria. In performing the inversion, the lithosphere is modeled as an elastic shell with a liquid interior, and the basalt load for each mare is approximated by a set of concentric cylinders. To permit solving the forward problem of placing radial limits on the positions of the rilles around a given mare, an additional parameter F, the ratio of the radial stress at the radial limits to the maximum radial stress, is introduced. T and F are chosen to give the best weighted-squares fit of the radial limits to the observations, and are used as the initial values in a linearized matrix inversion to check the resolution and estimate errors. The application of the procedure to three maria with prominent extensional features, Humorum, Orientale, and Serenitatis, gives values of T from about 40 + or - 10 to 50 + or - 10 km, and in each case the linearized matrix equation has an exact inverse.

Comer, R. P.↗
DOE OSTI2022

Regularized inversion of aerosol hygroscopic growth factor probability density function: application to humidity-controlled fast integrated mobility spectrometer measurements

Abstract. Aerosol hygroscopic growth plays an important role in atmospheric particle chemistry and the effects of aerosol on radiation and hence climate. The hygroscopic growth is often characterized by a growth factor probability density function (GF-PDF), where the growth factor is defined as the ratio of the particle size at a specified relative humidity to its dry size. Parametric, least-squares methods are the most widely used algorithms for inverting the GF-PDF from measurements of the humidified tandem differential mobility analyzer (HTDMA) and have been recently applied to the GF-PDF inversion from measurements of the humidity-controlled fast integrated mobility spectrometer (HFIMS). However, these least-squares methods suffer from noise amplification due to the lack of regularization in solving the ill-posed problem, resulting in significant fluctuations in the retrieved GF-PDF and even occasional failures of convergence. In this study, we introduce nonparametric, regularized methods to invert the aerosol GF-PDF and apply them to HFIMS measurements. Based on the HFIMS kernel function, the forward convolution is transformed into a matrix-based form, which facilitates the application of the nonparametric inversion methods with regularizations, including Tikhonov regularization and Twomey's iterative regularization. Inversions of the GF-PDF using the nonparameteric methods with regularization are demonstrated using HFIMS measurements simulated from representative GF-PDFs of ambient aerosols. The characteristics of reconstructed GF-PDFs resulting from different inversion methods, including previously developed least-squares methods, are quantitatively compared. The result shows that Twomey's method generally outperforms other inversion methods. The capabilities of Twomey's method in reconstructing the pre-defined GF-PDFs and recovering the mode parameters are validated.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Structural control design based on reduced-order observer

An observer-based structural control design method is proposed in this paper. The method is a semi-inverse design procedure in that the control law is not designed before the observer system, but is a result that comes from the observer design. However, the observer design is not completely independent of the control design either, but seeks to yield a control law that is close to a prescribed control law. First, the observer design problem is considered as the reconstruction of a linear function of the state vector. The linear state function to be reconstructed is the given control law. Then, based on the derivation for linear state function observers, the observer design is formulated as a parameter optimization problem. The optimization objective is to generate a matrix that is close to the optimal feedback gain matrix. Based on that matrix, the form of the observer and a new control law can be determined. The semi-inverse design procedure can yield a reduced-order observer with dimension considerably smaller than that of the system. Two examples are used to demonstrate the proposed design procedure.

Su, Tzu-Jeng↗
DOE OSTI2022

Three-dimensional Skyrme Hartree-Fock-Bogoliubov solver in coordinate-space representation

The coordinate-space representation of the Hartree-Fock-Bogoliubov theory is the method of choice to study weakly bound nuclei whose properties are affected by the quasiparticle continuum space. To describe such systems, we developed a three-dimensional Skyrme-Hartree-Fock-Bogoliubov solver HFBFFT based on the existing, highly optimized and parallelized Skyrme-Hartree-Fock code Sky3D. The code does not impose any self-consistent spatial symmetries such as mirror inversions or parity. The underlying equations are solved in HFBFFT directly in the canonical basis using the fast Fourier transform. To remedy the problems with pairing collapse, we implemented the soft energy cutoff and pairing annealing. The convergence of HFB solutions was improved by a sub-iteration method. The Hermiticity violation of differential operators brought by Fourier-transform-based differentiation has also been solved. Furthermore, the accuracy and performance of HFBFFT were tested by benchmarking it against other HFB codes, both spherical and deformed, for a set of nuclei, both well-bound and weakly-bound.

3D coordinate-space representation↗
NASA NTRS1981

Observability for two dimensional systems

Sufficient conditions that a two-dimensional system with output is locally observable are presented. Known results depend on time derivatives of the output and the inverse function theorem. In some cases, no informaton is provided by these theories, and one must study observability by other methods. The observability problem is dualized to the controllability problem, and the deep results of Hermes on local controllability are applied to prove a theorem concerning local observability.

Hunt, L. R.↗