Matching Items (17)
187441-Thumbnail Image.png
Description
During the inversion of discrete linear systems, noise in data can be amplified and result in meaningless solutions. To combat this effect, characteristics of solutions that are considered desirable are mathematically implemented during inversion. This is a process called regularization. The influence of the provided prior information is controlled by

During the inversion of discrete linear systems, noise in data can be amplified and result in meaningless solutions. To combat this effect, characteristics of solutions that are considered desirable are mathematically implemented during inversion. This is a process called regularization. The influence of the provided prior information is controlled by the introduction of non-negative regularization parameter(s). Many methods are available for both the selection of appropriate regularization parame- ters and the inversion of the discrete linear system. Generally, for a single problem there is just one regularization parameter. Here, a learning approach is considered to identify a single regularization parameter based on the use of multiple data sets de- scribed by a linear system with a common model matrix. The situation with multiple regularization parameters that weight different spectral components of the solution is considered as well. To obtain these multiple parameters, standard methods are modified for identifying the optimal regularization parameters. Modifications of the unbiased predictive risk estimation, generalized cross validation, and the discrepancy principle are derived for finding spectral windowing regularization parameters. These estimators are extended for finding the regularization parameters when multiple data sets with common system matrices are available. Statistical analysis of these estima- tors is conducted for real and complex transformations of data. It is demonstrated that spectral windowing regularization parameters can be learned from these new esti- mators applied for multiple data and with multiple windows. Numerical experiments evaluating these new methods demonstrate that these modified methods, which do not require the use of true data for learning regularization parameters, are effective and efficient, and perform comparably to a supervised learning method based on es- timating the parameters using true data. The theoretical developments are validated for one and two dimensional image deblurring. It is verified that the obtained estimates of spectral windowing regularization parameters can be used effectively on validation data sets that are separate from the training data, and do not require known data.
ContributorsByrne, Michael John (Author) / Renaut, Rosemary (Thesis advisor) / Cochran, Douglas (Committee member) / Espanol, Malena (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2023
157823-Thumbnail Image.png
Description
Uncertainty is inherent in predictive decision-making, both with respect to forecasting plausible future conditions based on a historic record, and with respect to backcasting likely upstream states from downstream observations. In the first chapter, I evaluated the status of current water resources management policy in the United States (U.S.) with

Uncertainty is inherent in predictive decision-making, both with respect to forecasting plausible future conditions based on a historic record, and with respect to backcasting likely upstream states from downstream observations. In the first chapter, I evaluated the status of current water resources management policy in the United States (U.S.) with respect to its integration of projective uncertainty into state-level flooding, drought, supply and demand, and climate guidance. I found uncertainty largely absent and discussed only qualitatively rather than quantitatively. In the second chapter, I turned to uncertainty in the interpretation of downstream observations as indicators of upstream behaviors in the field of Wastewater-Based Epidemiology (WBE), which has made possible the near real-time, yet anonymous, monitoring of public health via measurements of biomarkers excreted to wastewater. I found globally, seasonality of air and soil temperature causes biomarker degradation to vary up to 13-fold over the course of a year, constituting part of the background processes WBE must address, or detrend, prior to decision-making. To determine whether the seasonal change in degradation rates was introducing previously unaccounted for uncertainty with respect to differences in observed summertime and winter-time populations, I evaluated demographic indicators recorded by the Census Bureau for correlation with their distance from all major wastewater treatment plants across the U.S. The analysis identified statistically significant correlation for household income, education attainment, unemployment, military service, and the absence of health insurance. Finally, the model was applied to a city-wide case study to test whether temperature could explain some of the trends observed in monthly observations of two opiate compounds. Modeling suggests some of the monthly changes were attributed to natural temperature fluctuation rather than to trends in the substances’ consumption, and that uncertainty regarding discharge location can dominate even relative observed differences in opiate detections. In summary, my work has found temperature an important modulator of WBE results, influencing both the type of populations observed and the likelihood of upstream behaviors disproportionally magnified or obscured, particularly for the more labile biomarkers. There exists significant potential for improving the understanding of empirical observations via numerical modeling and the application of spatial analysis tools.
ContributorsHart, Olga (Author) / Halden, Rolf (Thesis advisor) / Mascaro, Giuseppe (Committee member) / Renaut, Rosemary (Committee member) / Nelson, Keith (Committee member) / Arizona State University (Publisher)
Created2019
157649-Thumbnail Image.png
Description
I focus on algorithms that generate good sampling points for function approximation. In 1D, it is well known that polynomial interpolation using equispaced points is unstable. On the other hand, using Chebyshev nodes provides both stable and highly accurate points for polynomial interpolation. In higher dimensional complex regions, optimal sampling

I focus on algorithms that generate good sampling points for function approximation. In 1D, it is well known that polynomial interpolation using equispaced points is unstable. On the other hand, using Chebyshev nodes provides both stable and highly accurate points for polynomial interpolation. In higher dimensional complex regions, optimal sampling points are not known explicitly. This work presents robust algorithms that find good sampling points in complex regions for polynomial interpolation, least-squares, and radial basis function (RBF) methods. The quality of these nodes is measured using the Lebesgue constant. I will also consider optimal sampling for constrained optimization, used to solve PDEs, where boundary conditions must be imposed. Furthermore, I extend the scope of the problem to include finding near-optimal sampling points for high-order finite difference methods. These high-order finite difference methods can be implemented using either piecewise polynomials or RBFs.
ContributorsLiu, Tony (Author) / Platte, Rodrigo B (Thesis advisor) / Renaut, Rosemary (Committee member) / Kaspar, David (Committee member) / Moustaoui, Mohamed (Committee member) / Motsch, Sebastien (Committee member) / Arizona State University (Publisher)
Created2019
158103-Thumbnail Image.png
Description
Global optimization (programming) has been attracting the attention of researchers for almost a century. Since linear programming (LP) and mixed integer linear programming (MILP) had been well studied in early stages, MILP methods and software tools had improved in their efficiency in the past few years. They are now fast

Global optimization (programming) has been attracting the attention of researchers for almost a century. Since linear programming (LP) and mixed integer linear programming (MILP) had been well studied in early stages, MILP methods and software tools had improved in their efficiency in the past few years. They are now fast and robust even for problems with millions of variables. Therefore, it is desirable to use MILP software to solve mixed integer nonlinear programming (MINLP) problems. For an MINLP problem to be solved by an MILP solver, its nonlinear functions must be transformed to linear ones. The most common method to do the transformation is the piecewise linear approximation (PLA). This dissertation will summarize the types of optimization and the most important tools and methods, and will discuss in depth the PLA tool. PLA will be done using nonuniform partitioning of the domain of the variables involved in the function that will be approximated. Also partial PLA models that approximate only parts of a complicated optimization problem will be introduced. Computational experiments will be done and the results will show that nonuniform partitioning and partial PLA can be beneficial.
ContributorsAlkhalifa, Loay (Author) / Mittelmann, Hans (Thesis advisor) / Armbruster, Hans (Committee member) / Escobedo, Adolfo (Committee member) / Renaut, Rosemary (Committee member) / Sefair, Jorge (Committee member) / Arizona State University (Publisher)
Created2020
Description

The inverse problem associated with electrochemical impedance spectroscopy requiring the solution of a Fredholm integral equation of the first kind is considered. If the underlying physical model is not clearly determined, the inverse problem needs to be solved using a regularized linear least squares problem that is obtained from the

The inverse problem associated with electrochemical impedance spectroscopy requiring the solution of a Fredholm integral equation of the first kind is considered. If the underlying physical model is not clearly determined, the inverse problem needs to be solved using a regularized linear least squares problem that is obtained from the discretization of the integral equation. For this system, it is shown that the model error can be made negligible by a change of variables and by extending the effective range of quadrature. This change of variables serves as a right preconditioner that significantly improves the condition of the system. Still, to obtain feasible solutions the additional constraint of non-negativity is required. Simulations with artificial, but realistic, data demonstrate that the use of non-negatively constrained least squares with a smoothing norm provides higher quality solutions than those obtained without the non-negative constraint. Using higher-order smoothing norms also reduces the error in the solutions. The L-curve and residual periodogram parameter choice criteria, which are used for parameter choice with regularized linear least squares, are successfully adapted to be used for the non-negatively constrained Tikhonov least squares problem. Although these results have been verified within the context of the analysis of electrochemical impedance spectroscopy, there is no reason to suppose that they would not be relevant within the broader framework of solving Fredholm integral equations for other applications.

ContributorsHansen, Jakob (Author) / Hogue, Jarom (Author) / Sander, Grant (Author) / Renaut, Rosemary (Author) / Popat, Sudeep (Author) / College of Liberal Arts and Sciences (Contributor)
Created2015-04-15
129269-Thumbnail Image.png
Description

The χ[superscript 2] principle and the unbiased predictive risk estimator are used to determine optimal regularization parameters in the context of 3-D focusing gravity inversion with the minimum support stabilizer. At each iteration of the focusing inversion the minimum support stabilizer is determined and then the fidelity term is updated

The χ[superscript 2] principle and the unbiased predictive risk estimator are used to determine optimal regularization parameters in the context of 3-D focusing gravity inversion with the minimum support stabilizer. At each iteration of the focusing inversion the minimum support stabilizer is determined and then the fidelity term is updated using the standard form transformation. Solution of the resulting Tikhonov functional is found efficiently using the singular value decomposition of the transformed model matrix, which also provides for efficient determination of the updated regularization parameter each step. Experimental 3-D simulations using synthetic data of a dipping dike and a cube anomaly demonstrate that both parameter estimation techniques outperform the Morozov discrepancy principle for determining the regularization parameter. Smaller relative errors of the reconstructed models are obtained with fewer iterations. Data acquired over the Gotvand dam site in the south-west of Iran are used to validate use of the methods for inversion of practical data and provide good estimates of anomalous structures within the subsurface.

ContributorsVatankhah, Saeed (Author) / Ardestani, Vahid E. (Author) / Renaut, Rosemary (Author) / College of Liberal Arts and Sciences (Contributor)
Created2015-01-01
128965-Thumbnail Image.png
Description

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub{Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to nd a subspace approximation to the full problem. Determination of the regularization, parameter for the projected problem by unbiased predictive risk

Tikhonov regularization for projected solutions of large-scale ill-posed problems is considered. The Golub{Kahan iterative bidiagonalization is used to project the problem onto a subspace and regularization then applied to nd a subspace approximation to the full problem. Determination of the regularization, parameter for the projected problem by unbiased predictive risk estimation, generalized cross validation, and discrepancy principle techniques is investigated. It is shown that the regularized parameter obtained by the unbiased predictive risk estimator can provide a good estimate which can be used for a full problem that is moderately to severely ill-posed. A similar analysis provides the weight parameter for the weighted generalized cross validation such that the approach is also useful in these cases, and also explains why the generalized cross validation without weighting is not always useful. All results are independent of whether systems are over- or underdetermined. Numerical simulations for standard one-dimensional test problems and two- dimensional data, for both image restoration and tomographic image reconstruction, support the analysis and validate the techniques. The size of the projected problem is found using an extension of a noise revealing function for the projected problem [I. Hn etynkov a, M. Ple singer, and Z. Strako s, BIT Numer. Math., 49 (2009), pp. 669{696]. Furthermore, an iteratively reweighted regularization approach for edge preserving regularization is extended for projected systems, providing stabilization of the solutions of the projected systems and reducing dependence on the determination of the size of the projected subspace.

ContributorsRenaut, Rosemary (Author)
Created2017-03-08