Search NASA⌕ Search

SEARCH · Search NASA

Results for “Inverse 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,783 records · Page 99

Magnetic Helicity Condensation and the Solar Cycle

Solar filaments exhibit a global chirality pattern where dextral/sinistral filaments, corresponding to negative/ positive magnetic helicity, are dominant in the northern/southern hemisphere. This pattern is opposite to the sign of magnetic helicity injected by differential rotation along east–west oriented polarity inversion lines, posing a major conundrum for solar physics. A resolution of this problem is offered by the magnetic helicity-condensation model of Antiochos. To investigate the global consequences of helicity condensation for the hemispheric chirality pattern, we apply a temporally and spatially averaged statistical approximation of helicity condensation. Realistic magnetic field configurations in both the rising and declining phases of the solar cycle are simulated. For the helicity-condensation process, we assume convective cells consisting of positive/negative vorticities in the northern/southern hemisphere that inject negative/positive helicity. The magnitude of the vorticity is varied as a free parameter, corresponding to different rates of helicity injection. To reproduce the observed percentages of dominant and minority filament chiralities, we find that a vorticity of magnitude 2.5 x 10(exp −6)/s is required. This rate, however, is insufficient to produce the observed unimodal profile of chirality with latitude. To achieve this, a vorticity of at least 5 x 10(exp −6)/s is needed. Our results place a lower limit on the small-scale helicity injection required to dominate differential rotation and reproduce the observed hemispheric pattern. Future studies should aim to establish whether the helicity injection rate due to convective flows and/or flux emergence across all latitudes of the Sun is consistent with our results.

Mackay, Duncan H.↗

Optimal Control Prediction Method for Control Allocation

This paper proposes a novel prediction method for online optimal control allocation that extends the volume of moments achievable with the Moore-Penrose generalized inverse to the entire Attainable Moment Set. This method formulates the control allocation problem using selected basis vectors and associated gains which reduces the optimization problem dimensions and provides physical insight into the resulting optimal solutions. The proposed algorithm finds the entire family of unique optimal control solutions along the desired moment vector from the origin to the boundary of the Attainable Moment Set. Numerical results for the Moore-Penrose prediction method show that the unique minimal controls obtained yield the desired moment with near machine precision accuracy while maintaining control effectors within specified position limits. This method has been fully validated against the unique solution obtained on the boundary of the Attainable Moment Set using the Durham Direct Allocation method. Minimal control solutions obtained for moments in the interior of the Attainable Moment Set, similarly yield the desired moment to near machine precision while providing control solutions that are smaller (i.e. 2-norm) than solutions found with traditional control allocation algorithms (e.g. interior point methods) applied to the minimal control problem. Numerical simulations using a Matlab® autocoded executable (MEX) for the representative real world problem of 3-moments with 20 individual control effectors and prescribed control position limits show a mean computation speed of approximately 125 Hz which is sufficient to enable real-time flight allocation.

Acheson, Michael J.↗

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗

Aeroacoustic Optimization of Installed Propeller Configurations with Scattering and Shielding Effects

An optimization capability is developed for acoustic scattering and shielding of installed propellers and rotors, based on a spacetime Galerkin time domain boundary element method (TDBEM). The time domain approach is particularly suitable for efficient simulation of transient, rotating, and broadband noise sources such as propellers. The use of algorithmic differentiation allows efficient evaluation of design sensitivities required for gradient-based design optimization with a large number of design variables. We present a validation exercise for the coherent broadband scattering capability against an analytical solution, showing excellent agreement. We then demonstrate the optimization tool on a series of inverse design cases with broadband and rotating sources, as well as an optimization problem for a propeller-wing configuration. The results show good performance for optimization problems with the characteristics of realistic installed propeller configurations.

Maks J Groom↗

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗

On the Implementation of 3D Galerkin Boundary Integral Equations

In this article, a reverse contribution technique is proposed to accelerate the construction of the dense influence matrices associated with a Galerkin approximation of singular and hypersingular boundary integral equations of mixed-type in potential theory. In addition, a general-purpose sparse preconditioner for boundary element methods has also been developed to successfully deal with ill-conditioned linear systems arising from the discretization of mixed boundary-value problems on non-smooth surfaces. The proposed preconditioner, which originates from the precorrected-FFT method, is sparse, easy to generate and apply in a Krylov subspace iterative solution of discretized boundary integral equations. Moreover, an approximate inverse of the preconditioner is implicitly built by employing an incomplete LU factorization. Numerical experiments involving mixed boundary-value problems for the Laplace equation are included to illustrate the performance and validity of the proposed techniques.

97 MATHEMATICS AND COMPUTING↗

Propagation of a strong x-ray pulse: Pulse compression, stimulated Raman scattering, amplified spontaneous emission, lasing without inversion, and four-wave mixing

We study the compression of strong x-ray pulses from x-ray free-electron lasers (XFELs) propagating through the resonant medium of atomic argon. The simulations are based on the three-level model with the frequency of the incident x-ray pulse tuned in the 2p{sub 3/2}-4s resonance. The pulse propagation is accompanied by the self-seeded stimulated resonant Raman scattering (SRRS). The SRRS starts from two channels of amplified spontaneous emission (ASE), 4s-2p{sub 3/2} and 3s-2p{sub 3/2}, which form the extensive ringing pattern and widen the power spectrum. The produced seed field triggers the Stokes ASE channel 3s-2p{sub 3/2}. The population inversion is quenched for longer propagation distances where the ASE is followed by the lasing without inversion (LWI), which amplifies the Stokes component. Both ASE and LWI reshape the input pulse: The compressed front part of the pulse (up to 100 as) is followed by the long tail of the ringing and beating between the pump and Stokes frequencies. The pump pulse also generates weaker Stokes and anti-Stokes fields caused by four-wave mixing. These four spectral bands have fine structures caused by the dynamical Stark effect. A slowdown of the XFEL pulse up to 78% of the speed of light in vacuum is found because of a large nonlinear refractive index.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Techniques for Scattering from Submerged Objects

To represent the final results in terms of matrices, one expands all appropriate physical quantities in terms of partial wave basis states. This includes expansions for the incident and scattered fields and the surface quantities. The method then utilizes the Huygen-Poincare integral representation for both the exterior and interior solutions, leading to the required matrix equations. One thus deals with matrix equations, the complexity of which depends on the nature of the problem. It is shown that in general a transition matrix T can be obtained relating the incident field A with the scattered field f having the form T = PQ(-1), where f = TA. The structure of Q can be quite complicated and can itself be composed of other matrix inversions such as arise from layered objects. Recent improvements in this method appropriate for a variety of physical problems are focused on, and on their implementation. Results are outlined from scattering simulations for very elongated submerged objects and resonance scattering from elastic solids and shells. The final improvement concerns eigenfunction expansions of surface terms, arising from solution of the interior problem, obtained via a preconditioning technique. This effectively reduces the problem to that of obtaining eigenvalues of a Hermitian operator. This formalism is reviewed for scattering from targets that are rigid, sound-soft, acoustic, elastic solids, elastic shells, and elastic layered objects. Two sets of the more interesting results are presented. The first concerns scattering from elongated objects, and the second to thin elastic spheroids.

Werby, M. F.↗

Scalable deep learning for watershed model calibration

Watershed models such as the Soil and Water Assessment Tool (SWAT) consist of high-dimensional physical and empirical parameters. These parameters often need to be estimated/calibrated through inverse modeling to produce reliable predictions on hydrological fluxes and states. Existing parameter estimation methods can be time consuming, inefficient, and computationally expensive for high-dimensional problems. In this paper, we present an accurate and robust method to calibrate the SWAT model (i.e., 20 parameters) using scalable deep learning (DL). We developed inverse models based on convolutional neural networks (CNN) to assimilate observed streamflow data and estimate the SWAT model parameters. Scalable hyperparameter tuning is performed using high-performance computing resources to identify the top 50 optimal neural network architectures. We used ensemble SWAT simulations to train, validate, and test the CNN models. We estimated the parameters of the SWAT model using observed streamflow data and assessed the impact of measurement errors on SWAT model calibration. We tested and validated the proposed scalable DL methodology on the American River Watershed, located in the Pacific Northwest-based Yakima River basin. Our results show that the CNN-based calibration is better than two popular parameter estimation methods (i.e., the generalized likelihood uncertainty estimation [GLUE] and the dynamically dimensioned search [DDS], which is a global optimization algorithm). For the set of parameters that are sensitive to the observations, our proposed method yields narrower ranges than the GLUE method but broader ranges than values produced using the DDS method within the sampling range even under high relative observational errors. The SWAT model calibration performance using the CNNs, GLUE, and DDS methods are compared using R 2 and a set of efficiency metrics, including Nash-Sutcliffe, logarithmic Nash-Sutcliffe, Kling-Gupta, modified Kling-Gupta, and non-parametric Kling-Gupta scores, computed on the observed and simulated watershed responses. The best CNN-based calibrated set has scores of 0.71, 0.75, 0.85, 0.85, 0.86, and 0.91. The best DDS-based calibrated set has scores of 0.62, 0.69, 0.8, 0.77, 0.79, and 0.82. The best GLUE-based calibrated set has scores of 0.56, 0.58, 0.71, 0.7, 0.71, and 0.8. The scores above show that the CNN-based calibration leads to more accurate low and high streamflow predictions than the GLUE and DDS sets. Our research demonstrates that the proposed method has high potential to improve our current practice in calibrating large-scale integrated hydrologic models.

54 ENVIRONMENTAL SCIENCES↗

Totally parallel multilevel algorithms for sparse elliptic systems

The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).

Frederickson, Paul O.↗

Harnessing Collaborative Learning Automata to Guide Multi-objective Optimization based Inverse Analysis for Structural Damage Identification

Structural damage identification based on physical models is often transformed into an optimization problem that minimizes the difference between measurement information of structure being monitored and the model prediction in the parametric space. However, the objective function in this context often exhibits multimodality, involving high-dimensional variables due to the reliance on finite element models for damage identification. These features pose challenges to optimization algorithms, where entrapment in local solutions can lead to false positives and false negatives in damage identification. In this research, we propose a reinforcement learning based multi-swarm optimizer to tackle such challenges in pursuit of a small yet diverse solution set that can capture the true damage scenario as one of the solutions. The proposed method leverages the flexibility of the particle swarm optimizer and incorporates novel strategies of metaheuristics to realize targeted improvement. To enable the particle swarm to adaptively select the appropriate search strategy based on the current environment, we adopt the learning automata technique, which sidesteps the need for reward strategy selection that is usually ad hoc at each step of the search. The integration harnesses the automatic learning and self-adaptation capabilities of learning automata, enabling the particles to navigate based on environmental signals. This leads to accumulated probabilities tied to advantageous movements, fostering an adaptive exploration of particles in the search space. The proposed approach is first validated through implementing into benchmark test cases with comparisons. It is then applied to structural damage identification with piezoelectric admittance experimental signals. `The results highlight the capability of the algorithm to identify a small solution set with high accuracy to match the actual damage scenario.

Yang Zhang↗

Eigenproblem solution by a combined Sturm sequence and inverse iteration technique.

Description of an efficient and numerically stable algorithm, along with a complete listing of the associated computer program, developed for the accurate computation of specified roots and associated vectors of the eigenvalue problem Aq = lambda Bq with band symmetric A and B, B being also positive-definite. The desired roots are first isolated by the Sturm sequence procedure; then a special variant of the inverse iteration technique is applied for the individual determination of each root along with its vector. The algorithm fully exploits the banded form of relevant matrices, and the associated program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most significantly economical in comparison to similar existing procedures. The program may be conveniently utilized for the efficient solution of practical engineering problems, involving free vibration and buckling analysis of structures. Results of such analyses are presented for representative structures.

Gupta, K. K.↗

Novel strategies for modal-based structural material identification

Here, we present modal-based methods for model calibration in structural dynamics, and address several key challenges in the solution of gradient-based optimization problems with eigenvalues and eigenvectors, including the solution of singular Helmholtz problems encountered in sensitivity calculations, non-differentiable objective functions caused by mode swapping during optimization, and cases with repeated eigenvalues. Unlike previous literature that relied on direct solution of the eigenvector adjoint equations, we present a parallel iterative domain decomposition strategy (Adjoint Computation via Modal Superposition with Truncation Augmentation) for the solution of the singular Helmholtz problems. For problems with repeated eigenvalues we present a novel Mode Separation via Projection algorithm, and in order to address mode swapping between inverse iterations we present a novel Injective mode ordering metric. We present the implementation of these methods in a massively parallel finite element framework with the ability to use measured modal data to extract unknown structural model parameters from large complex problems. A series of increasingly complex numerical examples are presented that demonstrate the implementation and performance of the methods in a massively parallel finite element framework [7], [5], using gradient-based optimization techniques in the Rapid Optimization Library (ROL) [21].

36 MATERIALS SCIENCE↗

A novel pulse technique for thermal diffusivity determination of high-temperature levitated materials - Inverse analysis and experimental set-up

In order to determine the thermal diffusivity of materials at high temperatures, a two-step extended flash technique, which is applicable to levitated spherical samples, is proposed. The containerless flash method is modeled as an axisymmetric transient conduction heat transfer problem within the sphere subjected to a radiative boundary condition on its surface. The problem of nonlinearity which arises from the radiative heat transfer boundary condition is solved by replacing it with the measured time-dependent surface temperature data, thus giving rise to an 'Inverse Analysis'. Upon obtaining the analytic solution for the temperature field, the determination of the thermal diffusivity turns into a minimization problem, whereby the difference between the actual surface boundary condition and the analytic solution is minimized. In performing the proposed experiments, there is a need to undertake a cool-down experiment which should be governed by the lumped parameter analysis.

Shen, F.↗

TOPEX/POSEIDON tides estimated using a global inverse model

Altimetric data from the TOPEX/POSEIDON mission will be used for studies of global ocean circulation and marine geophysics. However, it is first necessary to remove the ocean tides, which are aliased in the raw data. The tides are constrained by the two distinct types of information: the hydrodynamic equations which the tidal fields of elevations and velocities must satisfy, and direct observational data from tide gauges and satellite altimetry. Here we develop and apply a generalized inverse method, which allows us to combine rationally all of this information into global tidal fields best fitting both the data and the dynamics, in a least squares sense. The resulting inverse solution is a sum of the direct solution to the astronomically forced Laplace tidal equations and a linear combination of the representers for the data functionals. The representer functions (one for each datum) are determined by the dynamical equations, and by our prior estimates of the statistics or errors in these equations. Our major task is a direct numerical calculation of these representers. This task is computationally intensive, but well suited to massively parallel processing. By calculating the representers we reduce the full (infinite dimensional) problem to a relatively low-dimensional problem at the outset, allowing full control over the conditioning and hence the stability of the inverse solution. With the representers calculated we can easily update our model as additional TOPEX/POSEIDON data become available. As an initial illustration we invert harmonic constants from a set of 80 open-ocean tide gauges. We then present a practical scheme for direct inversion of TOPEX/POSEIDON crossover data. We apply this method to 38 cycles of geophysical data records (GDR) data, computing preliminary global estimates of the four principal tidal constituents, M(sub 2), S(sub 2), K(sub 1) and O(sub 1). The inverse solution yields tidal fields which are simultaneously smoother, and in better agreement with altimetric and ground truth data, than previously proposed tidal models. Relative to the 'default' tidal corrections provided with the TOPEX/POSEIDON GDR, the inverse solution reduces crossover difference variances significantly (approximately 20-30%), even though only a small number of free parameters (approximately equal to 1000) are actually fit to the crossover data.

Egbert, Gary D.↗

An analysis of the spatio-temporal resolution of the immersed boundary method with direct forcing

The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fracture Network and Fluid Flow Imaging for Enhanced Geothermal Systems Applications from Multi-Dimensional Electrical Resistivity Structure

We have developed an algorithm for the inversion of magnetotelluric (MT) data to a 3D earth resistivity model based upon the finite element method. Hexahedral edge finite elements are implemented to accommodate discontinuities in the electric field across resistivity boundaries, and to accurately simulate topographic variations. All matrices are reduced and solved using direct solution modules which avoids ill-conditioning endemic to iterative solvers such as conjugate gradients, principally PARDISO for the finite element system and PLASMA for the parameter step estimate. Large model parameterizations can be handled by transforming the Gauss-Newton estimator to data-space form. Accuracy of the forward problem and jacobians has been checked by comparison to integral equations results and by limiting asymptotes. Inverse accuracy and performance has been verified against the public Dublin Secret Test Model 2 and the well-known Mount St Helens 3D MT data set. This algorithm we believe is the most capable yet for forming 3D images of earth resistivity structure and their implications for geothermal fluids and pathways.

15 GEOTHERMAL ENERGY↗