A Least-Squares Method for Calculating Diffusion Coefficients for Ternary Systems

1965 ◽  
Vol 69 (12) ◽  
pp. 4361-4364 ◽  
Author(s):  
R. L. Dunn ◽  
J. D. Hatfield
Keyword(s):  
Least Squares ◽  
Diffusion Coefficients ◽  
Least Squares Method ◽  
Ternary Systems

‘Least squares’ method—theorem or law?

1980 ◽  
Vol 59 (9) ◽  
pp. 8
Author(s):  
D.E. Turnbull
Keyword(s):  
Least Squares ◽  
Least Squares Method

An Augmented Iteratively Re-weighted and Refined Least Squares Method for lp Minimization Problem in Inverse Modeling of Potential Field Magnetic Data

2020 ◽  
Vol 1 (3) ◽  
Author(s):  
Maysam Abedi
Keyword(s):  
Magnetic Field ◽  
Magnetic Susceptibility ◽  
Least Squares ◽  
Minimization Problem ◽  
Potential Field ◽  
Field Data ◽  
Least Squares Method ◽  
Porphyry Copper ◽  
Magnetic Data ◽  
Magnetic Field Data

The presented work examines application of an Augmented Iteratively Re-weighted and Refined Least Squares method (AIRRLS) to construct a 3D magnetic susceptibility property from potential field magnetic anomalies. This algorithm replaces an lp minimization problem by a sequence of weighted linear systems in which the retrieved magnetic susceptibility model is successively converged to an optimum solution, while the regularization parameter is the stopping iteration numbers. To avoid the natural tendency of causative magnetic sources to concentrate at shallow depth, a prior depth weighting function is incorporated in the original formulation of the objective function. The speed of lp minimization problem is increased by inserting a pre-conditioner conjugate gradient method (PCCG) to solve the central system of equation in cases of large scale magnetic field data. It is assumed that there is no remanent magnetization since this study focuses on inversion of a geological structure with low magnetic susceptibility property. The method is applied on a multi-source noise-corrupted synthetic magnetic field data to demonstrate its suitability for 3D inversion, and then is applied to a real data pertaining to a geologically plausible porphyry copper unit.  The real case study located in  Semnan province of  Iran  consists  of  an arc-shaped  porphyry  andesite  covered  by  sedimentary  units  which  may  have  potential  of  mineral  occurrences, especially  porphyry copper. It is demonstrated that such structure extends down at depth, and consequently exploratory drilling is highly recommended for acquiring more pieces of information about its potential for ore-bearing mineralization.

Theoretical accuracy of the last squares method in the isotope dilution analysis

1984 ◽  
Vol 49 (4) ◽  
pp. 805-820
Author(s):  
Ján Klas
Keyword(s):  
Least Squares ◽  
Isotope Dilution ◽  
Least Squares Method ◽  
Isotope Dilution Analysis ◽  
Straight Line ◽  
The One ◽  
Two Parameter ◽  
Theoretical Accuracy

The accuracy of the least squares method in the isotope dilution analysis is studied using two models, viz a model of a two-parameter straight line and a model of a one-parameter straight line.The equations for the direct and the inverse isotope dilution methods are transformed into linear coordinates, and the intercept and slope of the two-parameter straight line and the slope of the one-parameter straight line are evaluated and treated.

EXPRESS: Baseline Correction Based on a Search Algorithm from Artificial Intelligence

2020 ◽  
pp. 000370282097751
Author(s):  
Xin Wang ◽  
Xia Chen
Keyword(s):  
Artificial Intelligence ◽  
Objective Function ◽  
Least Squares ◽  
Least Squares Method ◽  
Search Algorithm ◽  
Absolute Error ◽  
Search Problem ◽  
Baseline Correction ◽  
Current Spectrum ◽  
Data Points

Many spectra have a polynomial-like baseline. Iterative polynomial fitting (IPF) is one of the most popular methods for baseline correction of these spectra. However, the baseline estimated by IPF may have substantially error when the spectrum contains significantly strong peaks or have strong peaks located at the endpoints. First, IPF uses temporary baseline estimated from the current spectrum to identify peak data points. If the current spectrum contains strong peaks, then the temporary baseline substantially deviates from the true baseline. Some good baseline data points of the spectrum might be mistakenly identified as peak data points and are artificially re-assigned with a low value. Second, if a strong peak is located at the endpoint of the spectrum, then the endpoint region of the estimated baseline might have significant error due to overfitting. This study proposes a search algorithm-based baseline correction method (SA) that aims to compress sample the raw spectrum to a dataset with small number of data points and then convert the peak removal process into solving a search problem in artificial intelligence (AI) to minimize an objective function by deleting peak data points. First, the raw spectrum is smoothened out by the moving average method to reduce noise and then divided into dozens of unequally spaced sections on the basis of Chebyshev nodes. Finally, the minimal points of each section are collected to form a dataset for peak removal through search algorithm. SA selects the mean absolute error (MAE) as the objective function because of its sensitivity to overfitting and rapid calculation. The baseline correction performance of SA is compared with those of three baseline correction methods: Lieber and Mahadevan–Jansen method, adaptive iteratively reweighted penalized least squares method, and improved asymmetric least squares method. Simulated and real FTIR and Raman spectra with polynomial-like baselines are employed in the experiments. Results show that for these spectra, the baseline estimated by SA has fewer error than those by the three other methods.

Sign in / Sign up

Export Citation Format

Share Document