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.
-Input files for randomly selected subset data (30 instances) from primary dipole-dipole forward modeling data.-Inversion results in surfer grid format as well as in .DAT format.-Scatterplots for MLP-NN vs Gauss-Newton present in the excel sheet.
The Prandtl-Ishlinskii (PI) hysteresis model has been used to describe nonlinear hysteretic behaviors. In this paper, the PI model is first simplified to accommodate the symmetrical behavior of ferromagnetic hysteresis. A parameter identification method is then developed to extract the parameters of the symmetrical PI model from experimental data. Based on the Gauss-Newton method, regularization technique, and line search method, the model parameters can be retrieved efficiently from the measured data. Numerical examples are presented to demonstrate the performance of the proposed method.
Conventional high angular resolution electron backscatter diffraction (HREBSD) uses cross-correlation to track features between diffraction patterns, which are then related to the relative elastic strain and misorientation between the diffracting volumes of material. This paper adapts inverse compositional Gauss Newton (ICGN) digital image correlation (DIC) to be compatible with HREBSD. ICGN works by efficiently tracking not just the shift in features, but also the change in their shape. Modeling a shape change as well as a shift results in greater accuracy. This method, ICGN HREBSD, is applied to a simulated data set, and its performance is compared to conventional cross-correlation HREBSD, and cross-correlation HREBSD with remapping. ICGN HREBSD is shown to have about half the strain error of the best cross-correlation method with a comparable computation time.
Here, this study evaluates the performance of multiple machine learning (ML) algorithms and electrical resistivity (ER) arrays for inversion with comparison to a conventional Gauss-Newton numerical inversion method. Four different ML models and four arrays were used for the estimation of only six variables for locating and characterizing hypothetical subsurface targets. The combination of dipole-dipole with Multilayer Perceptron Neural Network (MLP-NN) had the highest accuracy. Evaluation showed that both MLP-NN and Gauss-Newton methods performed well for estimating the matrix resistivity while target resistivity accuracy was lower, and MLP-NN produced sharper contrast at target boundaries for the field and hypothetical data. Both methods exhibited comparable target characterization performance, whereas MLP-NN had increased accuracy compared to Gauss-Newton in prediction of target width and height, which was attributed to numerical smoothing present in the Gauss-Newton approach. MLP-NN was also applied to a field dataset acquired at U.S. DOE Hanford site.
The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.
Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.
Accurate seismic attenuation models of subsurface structures not only enhance subsequent migration processes by improving fidelity, resolution, and facilitating amplitude-compliant angle gather generation but also provide valuable constraints on subsurface physical properties. Leveraging full-wavefield information, multiparameter viscoacoustic full-waveform inversion ( Q-FWI) simultaneously estimates seismic velocity and attenuation ( Q) models. However, a major challenge in Q-FWI is the contamination of crosstalk artifacts, where inaccuracies in the velocity model are mistakenly mapped to the inverted attenuation model. While incorporating the Hessian is expected to mitigate these artifacts, the explicit implementation is prohibitively expensive due to its formidable computational cost. In this study, we formulate and develop a Q-FWI algorithm via the Newton-conjugate gradient (CG) framework, where the search direction at each iteration is determined through an internal CG loop. In particular, the Hessian is integrated into each CG step in a matrix-free fashion using the second-order adjoint-state method. We find through synthetic experiments that our Newton-CG Q-FWI significantly mitigates crosstalk artifacts compared with the limited-memory Broyden-Fletcher-Goldfarb-Shanno method and the CG method, albeit with a notable computational cost. In the discussion of several key implementation details, we also determine the significance of the approximate Gauss-Newton Hessian, the second-order adjoint-state method, and the two-stage inversion strategy.
Long-baseline atom interferometers such as the Matter-wave Atomic Gradiometer Interferometric Sensor (MAGIS-100) require stringent control and continuous characterization of background magnetic fields and spatial gradients to prevent systemic phase shifts that mimic ultralight dark matter or gravitational wave signatures. Because direct sensor placement within the ultra-high vacuum beam pipe is infeasible, in-situ magnetic field monitoring relies on external sensor arrays situated in the surrounding annular region. This work demonstrates a field reconstruction framework for a 5.3-meter MAGIS-100 modular section using finite-element Opera simulations. Transverse magnetic fields are expanded using a cylindrical multipole framework as informed by Fermilab’s Muon g-2 experiment, with magnetometer array configurations optimized via Fisher information matrix D-optimality. Inverting external sensor readings through a Gauss-Newton scheme recovers interior tube fields across distinct axial positions. In the discontinuity-averse uniform region (slice pair P4), the model achieves sub-noise-floor performance with a cross-validated root-mean-square error (RMSE) of $6.7227 \times 10^{-4}\text{ A/m}$ ($0.845\times$ sensor noise floor) and an interior field coefficient of variation of $1.71\%$. An elbow criterion in the Fisher bounds establishes $n_{\text{max}} = 2$ as the optimal multipole truncation order to prevent noise amplification from over-parameterization, with $n_{\text{max}} = 3$ (sextupole) order chosen for analysis to demonstrate further complexity and cross-pair comparison. Furthermore, analytical differentiation of the fitted multipole coefficients yields dense spatial maps of the transverse Jacobian gradient matrix $\nabla \mathbf{H}$ along with propagated $1\sigma$ uncertainty bounds across the beam region ($r \le 2.75\text{ in}$). This operational framework confirms that external magnetometer arrays can reliably monitor magnetic field uniformity and spatial gradients along the 100-meter flight path given appropriate sampling for any complexity order.
Long-baseline atom interferometers such as the Matter-wave Atomic Gradiometer Interferometric Sensor (MAGIS-100) require stringent control and continuous characterization of background magnetic fields and spatial gradients to prevent systemic phase shifts that mimic ultralight dark matter or gravitational wave signatures. Because direct sensor placement within the ultra-high vacuum beam pipe is infeasible, in-situ magnetic field monitoring relies on external sensor arrays situated in the surrounding annular region. This work demonstrates a field reconstruction framework for a 5.3-meter MAGIS-100 modular section using finite-element Opera simulations. Transverse magnetic fields are expanded using a cylindrical multipole framework as informed by Fermilab’s Muon g-2 experiment, with magnetometer array configurations optimized via Fisher information matrix D-optimality. Inverting external sensor readings through a Gauss-Newton scheme recovers interior tube fields across distinct axial positions. In the discontinuity-averse uniform region (slice pair P4), the model achieves sub-noise-floor performance with a cross-validated root-mean-square error (RMSE) of $6.7227 \times 10^{-4}\text{ A/m}$ ($0.845\times$ sensor noise floor) and an interior field coefficient of variation of $1.71\%$. An elbow criterion in the Fisher bounds establishes $n_{\text{max}} = 2$ as the optimal multipole truncation order to prevent noise amplification from over-parameterization, with $n_{\text{max}} = 3$ (sextupole) order chosen for analysis to demonstrate further complexity and cross-pair comparison. Furthermore, analytical differentiation of the fitted multipole coefficients yields dense spatial maps of the transverse Jacobian gradient matrix $\nabla \mathbf{H}$ along with propagated $1\sigma$ uncertainty bounds across the beam region ($r \le 2.75\text{ in}$). This operational framework confirms that external magnetometer arrays can reliably monitor magnetic field uniformity and spatial gradients along the 100-meter flight path given appropriate sampling for any complexity order.
Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.
The parameter identification scheme being used is a differential correction least squares procedure (Gauss-Newton method). The position, orientation, and derivatives of these quantities with respect to the parameters of interest (i.e., sensitivity coefficients) are determined by digital integration of the equations of motion and the parametric differential equations. The application of this technique to three vastly different sets of data is used to illustrate the versatility of the method and to indicate some of the problems that still remain.
A Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobian matrices. Results on a set of test problems are encouraging.
A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.
The author develops a computational approach to multivariable frequency domain identification, based on 2-norm minimization. In particular, a Gauss-Newton (GN) iteration is developed to minimize the 2-norm of the error between frequency domain data and a matrix fraction transfer function estimate. To improve the global performance of the optimization algorithm, the GN iteration is initialized using the solution to a particular sequentially reweighted least squares problem, denoted as the SK iteration. The least squares problems which arise from both the SK and GN iterations are shown to involve sparse matrices with identical block structure. A sparse matrix QR factorization method is developed to exploit the special block structure, and to efficiently compute the least squares solution. A numerical example involving the identification of a multiple-input multiple-output (MIMO) plant having 286 unknown parameters is given to illustrate the effectiveness of the algorithm.
A solution to the correlation between structural dynamic test results and finite element analyses of the same components is presented in this paper. Basically, the method can be categorized as a Levenberg-Marquardt type Gauss-Newton method which requires only the differences between FE modal analyses and test results and their first derivatives with respect to preassigned design variables. With proper variable normalization and equation scaling, the method has been made numerically better-conditioned and the inclusion of the Levenberg-Marquardt technique overcomes any remaining difficulty encountered in inverting singular or near-singular matrices. An important feature is that each iteration requires only one function evaluation along with the associated design sensitivity analysis and so the procedure is computationally efficient.
Described herein is a method and system for training nonlinear adaptive filters (or neural networks) which have embedded memory. Such memory can arise in a multi-layer finite impulse response (FIR) architecture, or an infinite impulse response (IIR) architecture. We focus on filter architectures with separate linear dynamic components and static nonlinear components. Such filters can be structured so as to restrict their degrees of computational freedom based on a priori knowledge about the dynamic operation to be emulated. The method is detailed for an FIR architecture which consists of linear FIR filters together with nonlinear generalized single layer subnets. For the IIR case, we extend the methodology to a general nonlinear architecture which uses feedback. For these dynamic architectures, we describe how one can apply optimization techniques which make updates closer to the Newton direction than those of a steepest descent method, such as backpropagation. We detail a novel adaptive modified Gauss-Newton optimization technique, which uses an adaptive learning rate to determine both the magnitude and direction of update steps. For a wide range of adaptive filtering applications, the new training algorithm converges faster and to a smaller value of cost than both steepest-descent methods such as backpropagation-through-time, and standard quasi-Newton methods. We apply the algorithm to modeling the inverse of a nonlinear dynamic tracking system 5, as well as a nonlinear amplifier 6.
Characterization of the Earth's surface is crucial to remote sensing, both to map geomorphological features and because subtracting this signal is essential during retrievals of the atmospheric constituents located between the surface and the sensor. Current operational algorithms model the surface total reflectance through a weighted linear combination of a few geometry-dependent kernels, each devised to describe a particular scattering mechanism. The information content of these measurements is overwhelmed by that of instruments with polarization capabilities: proposed models in this case are based on the Fresnel reflectance of an isotropic distribution of facets. Because of its remarkable lack of spectral contrast, the polarized reflectance of land surfaces in the shortwave infrared spectral region, where atmospheric scattering is minimal, can be used to model the surface also at shorter wavelengths, where aerosol retrievals are attempted based on well-established scattering theories. In radiative transfer simulations, straightforward separation of the surface and atmospheric contributions is not possible without approximations because of the coupling introduced by multiple reflections. Within a general inversion framework, the problem can be eliminated by linearizing the radiative transfer calculation, and making the Jacobian (i.e., the derivative expressing the sensitivity of the reflectance with respect to model parameters) available at output. We present a general methodology based on a Gauss-Newton iterative search, which automates this procedure and eliminates de facto the need of an ad hoc atmospheric correction. In this case study we analyze the color variations in the polarized reflectance measured by the NASA Goddard Institute of Space Studies Research Scanning Polarimeter during a survey of late-season snowfields in the High Sierra. This insofar unique dataset presents challenges linked to the rugged topography associated with the alpine environment and a likely high water content due to melting. The analysis benefits from ancillary information provided by the NASA Langley High Spectral Resolution Lidar deployed on the same aircraft. The results obtained from the iterative scheme are contrasted against the surface polarized reflectance obtained ignoring multiple reflections, via the simplistic subtraction of the atmospheric scattering contribution. Finally, the retrieved reflectance is modeled after the scattering properties of a dense collection of ice crystals at the surface. Confirming that the polarized reflectance of snow is spectrally flat would allow to extend the techniques already in use for polarimetric retrievals of aerosol properties over land to the large portion of snow-covered pixels plaguing orbital and suborbital observations.
In this paper, the operational Global Precipitation Measurement (GPM) mission combined radar-radiometer algorithm is thoroughly described. The operational combined algorithm is designed to reduce uncertainties in GPM Core Observatory precipitation estimates by effectively integrating complementary information from the GPM Dual-Frequency Precipitation Radar (DPR) and the GPM Microwave Imager (GMI) into an optimal, physically consistent precipitation product. Although similar in many respects to previously developed combined algorithms, the GPM combined algorithm has several unique features that are specifically designed to meet the GPM objectives of deriving, based on GPM Core Observatory information, accurate and physically consistent precipitation estimates from multiple spaceborne instruments, and ancillary environmental data from reanalyses. The algorithm features an optimal estimation framework based on a statistical formulation of the Gauss-Newton method, a parameterization for the nonuniform distribution of precipitation within the radar fields of view, a methodology to detect and account for multiple scattering in Ka-band DPR observations, and a statistical deconvolution technique that allows for an efficient sequential incorporation of radiometer information into DPR precipitation retrievals.