Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tikhonov regularization”

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.

72 records · Page 4

Soft X-Ray Imaging Design and Analysis Methods on DIII-D

A new tangential 2D Soft X-Ray Imaging System (SXRIS) is being designed to examine the edge magnetic island structure in the lower X-point region of DIII-D. A synthetic diagnostic calculation coupled to 3D emissivity estimates is used to generate phantom images. Phillips-Tikhonov regularization is used to invert the phantom images for comparison to the original emissivity model. Noise level, island size, and equilibrium accuracy are scanned to assess the feasibility of detecting edge island structures. Models of typical DIII-D discharges indicate integration times > 1 ms with accurate equilibrium reconstruction are needed for small island (< 3 cm) detection.

Shafer, Morgan W↗

Tomographic Neutron Imaging using SIRT

Neutron imaging is complementary to x-ray imaging in that materials such as water and plastic are highly attenuating while material such as metal is nearly transparent. We showcase tomographic imaging of a diesel particulate filter. Reconstruction is done using a modified version of SIRT called PSIRT. We expand on previous work and introduce Tikhonov regularization. We show that near-optimal relaxation can still be achieved. The algorithmic ideas apply to cone beam x-ray CT and other inverse problems.

Gregor, Jens↗

Experimental investigation of piston heat transfer under conventional diesel and reactivity-controlled compression ignition combustion regimes

The piston of a heavy-duty single-cylinder research engine was instrumented with 11 fast-response surface thermocouples, and a commercial wireless telemetry system was used to transmit the signals from the moving piston. The raw thermocouple data were processed using an inverse heat conduction method that included Tikhonov regularization to recover transient heat flux. By applying symmetry, the data were compiled to provide time-resolved spatial maps of the piston heat flux and surface temperature. A detailed comparison was made between conventional diesel combustion and reactivity-controlled compression ignition combustion operations at matched conditions of load, speed, boost pressure, and combustion phasing. The integrated piston heat transfer was found to be 24% lower, and the mean surface temperature was 25 C lower for reactivity-controlled compression ignition operation as compared to conventional diesel combustion, in spite of the higher peak heat release rate. Lower integrated piston heat transfer for reactivity-controlled compression ignition was found over all the operating conditions tested. The results showed that increasing speed decreased the integrated heat transfer for conventional diesel combustion and reactivity-controlled compression ignition. The effect of the start of injection timing was found to strongly influence conventional diesel combustion heat flux, but had a negligible effect on reactivity-controlled compression ignition heat flux, even in the limit of near top dead center high-reactivity fuel injection timings. These results suggest that the role of the high-reactivity fuel injection does not significantly affect the thermal environment even though it is important for controlling the ignition timing and heat release rate shape. The integrated heat transfer and the dynamic surface heat flux were found to be insensitive to changes in boost pressure for both conventional diesel combustion and reactivity-controlled compression ignition. However, for reactivity-controlled compression ignition, the mean surface temperature increased with changes in boost suggesting that equivalence ratio affects steady-state heat transfer.

Splitter, Derek A↗

Inverse problems: Fuzzy representation of uncertainty generates a regularization

In many applied problems (geophysics, medicine, and astronomy) we cannot directly measure the values x(t) of the desired physical quantity x in different moments of time, so we measure some related quantity y(t), and then we try to reconstruct the desired values x(t). This problem is often ill-posed in the sense that two essentially different functions x(t) are consistent with the same measurement results. So, in order to get a reasonable reconstruction, we must have some additional prior information about the desired function x(t). Methods that use this information to choose x(t) from the set of all possible solutions are called regularization methods. In some cases, we know the statistical characteristics both of x(t) and of the measurement errors, so we can apply statistical filtering methods (well-developed since the invention of a Wiener filter). In some situations, we know the properties of the desired process, e.g., we know that the derivative of x(t) is limited by some number delta, etc. In this case, we can apply standard regularization techniques (e.g., Tikhonov's regularization). In many cases, however, we have only uncertain knowledge about the values of x(t), about the rate with which the values of x(t) can change, and about the measurement errors. In these cases, usually one of the existing regularization methods is applied. There exist several heuristics that choose such a method. The problem with these heuristics is that they often lead to choosing different methods, and these methods lead to different functions x(t). Therefore, the results x(t) of applying these heuristic methods are often unreliable. We show that if we use fuzzy logic to describe this uncertainty, then we automatically arrive at a unique regularization method, whose parameters are uniquely determined by the experts knowledge. Although we start with the fuzzy description, but the resulting regularization turns out to be quite crisp.

Kreinovich, V.↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Bayesian Spatially Varying Multi-Regularization Image Deblurring

Many scientific experiments such as those found in astronomy, geology, microbiology, and X-ray radiography require the use of high-energy instruments to capture images. Since blur and noise are inevitably present in any imaging system, the images must be \deblurred" to extract the full information content. Mathematically, image deblurring is an ill-posed inverse problem that requires regularization. The regularization, in turn, has a large effect on the deblurred image: different regularization strengths, and types, lead to drastically different reconstructions. Moreover, many images contain a mixture of smooth and sharp features which suggests the use of multi-regularization, i.e., varying the type of regularization (e.g. Tikhonov or total variation) across the image. We address these issues by formulating the image deblurring problem within a hierarchical Bayesian framework in which we spatially adapt the strength of the regularization and also vary the regularization type across the image. In this way, the image itself, along with corresponding regularization strength at each pixel, are described jointly by a posterior distribution which we can sample by Markov chain Monte Carlo (MCMC) methods. We illustrate our techniques on simplified test problems and apply them to high-energy X-ray images taken at the Nevada National Security Site. Numerical tests show that our new method is robustly applicable and increases the quality of the image reconstruction when compared to other (Bayesian) methods.

97 MATHEMATICS AND COMPUTING↗

A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games

We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.

Tikhonov regularization↗

Bayesian operator inference for data-driven reduced-order modeling

This work proposes a Bayesian inference method for the reduced-order modeling of time-dependent systems. Informed by the structure of the governing equations, the task of learning a reduced-order model from data is posed as a Bayesian inverse problem with Gaussian prior and likelihood. The resulting posterior distribution characterizes the operators defining the reduced-order model, hence the predictions subsequently issued by the reduced-order model are endowed with uncertainty. The statistical moments of these predictions are estimated via a Monte Carlo sampling of the posterior distribution. Since the reduced models are fast to solve, this sampling is computationally efficient. Furthermore, the proposed Bayesian framework provides a statistical interpretation of the regularization term that is present in the deterministic operator inference problem, and the empirical Bayes approach of maximum marginal likelihood suggests a selection algorithm for the regularization hyperparameters. The proposed method is demonstrated on two examples: the compressible Euler equations with noise-corrupted observations, and a single-injector combustion process.

97 MATHEMATICS AND COMPUTING↗

Automated shaker placement and regularized input estimation for MIMO testing.

Multi-input, multi-output (MIMO) testing is used in component qualification to reproduce operational responses in the laboratory. It is often preferred to single-input and base-shake testing because of the potential for equivalent or better tests using smaller actuators and shorter test suites. Given a target response, two key steps in MIMO test design are selecting actuator locations and solving for input loads. Actuator locations are often manually selected using expert judgment. If an automatic method is used, locations are usually determined by simulating the vibration control problem and minimizing a combination of the input energy and control residuals. To select a configuration, the relative importance of input energy and residuals must be specified. Specifying relative weights is, in general, a manual and subjective process. This paper develops an objective function that compares actuator configurations based on control accuracy and required input energy without any manual parameter tuning. The objective function uses an optimally selected tradeoff parameter for each candidate configuration. To choose actuator locations using the new objective function, a pivoting algorithm for integer programming problems is developed. Starting with an initial configuration (such as the one generated by a greedy algorithm), the pivoting algorithm guarantees an objective function decrease in each iteration until convergence is reached. In a simulation featuring a structure excited by a diffuse acoustic field, electrodynamic shaker locations and regularized inputs are solved for without any analyst-specified parameters. Simulations are performed in MIMO configurations where the number of target responses is less than, equal to, and greater than the number of actuators.

Multi-input multi-output↗

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗

Optimization methodology for the global 10 Hz orbit feedback in RHIC

To combat beam oscillations induced by triplet vibrations at the Relativistic Heavy Ion Collider (RHIC), a global orbit feedback system was developed and applied at injection and top energy in 2011, and during beam acceleration in 2012. Singular Value Decomposition (SVD) was employed to determine the strengths and currents of the applied corrections. The feedback algorithm was optimized for different magnetic configurations (lattices) at fixed beam energies and during beam acceleration. While the orbit feedback performed well since its inception, corrector current transients and feedback-induced beam oscillations were observed during the polarized proton program in 2015. In this paper, we present the feedback algorithm, the optimization of the algorithm for various lattices and the solution adopted to mitigate the observed current transients during beam acceleration.

43 PARTICLE ACCELERATORS↗

Estimation of local planetary gravity fields using line of sight gravity data and an integral operator

A novel method is presented for mapping line-of-sight gravity data (LOSGD) joining planetary probes and observers during Doppler tracking operations, with a view to geodetic and geophysical applications. LOSGD are in this case mapped as gravity anomalies along a radial direction, at constant altitude, using an inversion procedure in conjunction with a Tikhonov-Arsenine regularization method. The application of different regularization-parameter choices to a synthetic case is followed by application to the real case of Pioneer-Venus orbiter data for Venus' Gula Mons.

Barriot, J. P.↗

DIAS: A Data-Informed Active Subspace Regularization Framework for Inverse Problems

This paper presents a regularization framework that aims to improve the fidelity of Tikhonov inverse solutions. At the heart of the framework is the data-informed regularization idea that only data-uninformed parameters need to be regularized, while the data-informed parameters, on which data and forward model are integrated, should remain untouched. We propose to employ the active subspace method to determine the data-informativeness of a parameter. The resulting framework is thus called a data-informed (DI) active subspace (DIAS) regularization. Four proposed DIAS variants are rigorously analyzed, shown to be robust with the regularization parameter and capable of avoiding polluting solution features informed by the data. They are thus well suited for problems with small or reasonably small noise corruptions in the data. Furthermore, the DIAS approaches can effectively reuse any Tikhonov regularization codes/libraries. Though they are readily applicable for nonlinear inverse problems, we focus on linear problems in this paper in order to gain insights into the framework. Various numerical results for linear inverse problems are presented to verify theoretical findings and to demonstrate advantages of the DIAS framework over the Tikhonov, truncated SVD, and the TSVD-based DI approaches.

Nguyen, Hai↗

Inverse transport problem solvers based on regularized and compressive sensing techniques

According to the direct exposure measurements from flash radiographic image, regularized-based method and compressive sensing (CS)-based method for inverse transport equation are presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. With a large number of measurements, least-square method is utilized to complete the reconstruction. Owing to the ill-posedness of the inverse problems, regularized algorithm is employed. Tikhonov method is applied with an appropriate posterior regularization parameter to get a meaningful solution. However, it's always very costly to obtain enough measurements. With limited measurements, CS sparse reconstruction technique Orthogonal Matching Pursuit (OMP) is applied to obtain the sparse coefficients by solving an optimization problem. This paper constructs and takes the forward projection matrix rather than Gauss matrix as measurement matrix. In the CS-based algorithm, Fourier expansion and wavelet expansion are adopted to convert an underdetermined system to a well-posed system. Simulations and numerical results of regularized method with appropriate regularization parameter and that of CS-based agree well with the reference value, furthermore, both methods avoid amplifying the noise. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optical tomography reconstruction algorithm with the finite element method: An optimal approach with regularization tools

Highlights: •New strategies to improve the accuracy of the reconstruction through mesh and finite element parameterization. •Use of gradient filtering through an alternative inner product within the adjoint method. •An integral form of the cost function is used to make the reconstruction compatible with all finite element formulations, continuous and discontinuous. •Gradient-based algorithm with the adjoint method is used for the reconstruction. -- Abstract: Optical tomography is mathematically treated as a non-linear inverse problem where the optical properties of the probed medium are recovered through the minimization of the errors between the experimental measurements and their predictions with a numerical model at the locations of the detectors. According to the ill-posed behavior of the inverse problem, some regularization tools must be performed and the Tikhonov penalization type is the most commonly used in optical tomography applications. This paper introduces an optimized approach for optical tomography reconstruction with the finite element method. An integral form of the cost function is used to take into account the surfaces of the detectors and make the reconstruction compatible with all finite element formulations, continuous and discontinuous. Through a gradient-based algorithm where the adjoint method is used to compute the gradient of the cost function, an alternative inner product is employed for preconditioning the reconstruction algorithm. Moreover, appropriate re-parameterization of the optical properties is performed. These regularization strategies are compared with the classical Tikhonov penalization one. It is shown that both the re-parameterization and the use of the Sobolev cost function gradient are efficient for solving such an ill-posed inverse problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data driven analytic continuation for one particle spectral functions

In this proceeding, an idea is outlined suggesting a generic treatment on any type of input data for a numerical analytic continuation problem, which is needed when dynamical information is to be extracted from a calculationally convenient one particle imaginary time Green function. The quality of the resulting spectral function will rely only on the data to be treated, viz, data-driven. This is different from the Maximum Entropy or the Stochastic method which relies on an entropy term to guide convergence of the resulting spectral function.

36 MATERIALS SCIENCE↗

Optimizing the Regularization in Broadband Wavefront Control Algorithm for WFIRST Coronagraph

The WFIRST/AFTA 2.4 m space telescope currently under study includes a stellar coronagraph for the imaging and the spectral characterization of extrasolar planets. The coronagraph employs sequential deformable mirrors to compensate for phase and amplitude errors. Using the optical model of an Occulting Mask Coronagraph (OMC) testbed at the Jet Propulsion Laboratory (JPL), we have investigated and compared through modeling and simulations the performance of several actuator regularization-schemes in broadband wavefront control algorithm used to generate dark holes in an OMC, such as a Hybrid Lyot Coronagraph (HLC). Using the concept of a Tikhonov filter constituting the G-matrix, we have explained what the different regularization schemes do to singular-modes during a wavefront control process called Electric Field Conjugation (EFC). In some cases we confirmed the numerical predictions with the testbed measured results. We present our findings in this paper.

Sidick, Erkin↗

ZEEMAN DOPPLER MAPS: ALWAYS UNIQUE, NEVER SPURIOUS?

Numerical models of atomic diffusion in magnetic atmospheres of ApBp stars predict abundance structures that differ from the empirical maps derived with (Zeeman) Doppler mapping (ZDM). An in-depth analysis of this apparent disagreement investigates the detectability by means of ZDM of a variety of abundance structures, including (warped) rings predicted by theory, but also complex spot-like structures. Even when spectra of high signal-to-noise ratio are available, it can prove difficult or altogether impossible to correctly recover shapes, positions, and abundances of a mere handful of spots, notwithstanding the use of all four Stokes parameters and an exactly known field geometry; the recovery of (warped) rings can be equally challenging. Inversions of complex abundance maps that are based on just one or two spectral lines usually permit multiple solutions. It turns out that it can by no means be guaranteed that any of the regularization functions in general use for ZDM (maximum entropy or Tikhonov) will lead to a true abundance map instead of some spurious one. Attention is drawn to the need for a study that would elucidate the relation between the stratified, field-dependent abundance structures predicted by diffusion theory on the one hand, and empirical maps obtained by means of “canonical” ZDM, i.e., with mean atmospheres and unstratified abundances, on the other hand. Finally, we point out difficulties arising from the three-dimensional nature of the atomic diffusion process in magnetic ApBp star atmospheres.

79 ASTRONOMY AND ASTROPHYSICS↗