Results 281 to 290 of about 10,133,028 (343)
Some of the next articles are maybe not open access.
Partial Least Squares Structural Equation Modeling
Handbook of Market Research, 2021M. Sarstedt, C. Ringle, Joseph F. Hair
semanticscholar +1 more source
Least squares and total least squares methods in image restoration
1997Image restoration is the process of removing or minimizing degradations (blur) in an image. Mathematically, it can be modeled as a discrete ill-posed problem Hf=g, where H is a matrix of large dimension representing the blurring phenomena, and g is a vector representing the observed image.
Julie Kamm, James G. Nagy
openaire +2 more sources
Collinearity and Total Least Squares
SIAM Journal on Matrix Analysis and Applications, 1994The least squares (LS) and total least squares (TLS) methods are commonly used to solve the overdetermined system of equations \(Ax\approx b\). The main objective of this paper is to examine TLS when \(A\) is nearly rank deficient by outlining its differences and similarities to the well-known truncated LS method.
Ricardo D. Fierro, James R. Bunch
openaire +2 more sources
2009
The method of least squares controls the flow of errors via the elements of the design matrix. Hence, assuming linear systems with differing design matrices aiming at the same set of unknowns, the adjustment’s uncertainties would differ even if the uncertainties of the input data were the same.
openaire +1 more source
The method of least squares controls the flow of errors via the elements of the design matrix. Hence, assuming linear systems with differing design matrices aiming at the same set of unknowns, the adjustment’s uncertainties would differ even if the uncertainties of the input data were the same.
openaire +1 more source
Maximum likelihood, least squares, and penalized least squares for PET
IEEE Transactions on Medical Imaging, 1993The EM algorithm is the basic approach used to maximize the log likelihood objective function for the reconstruction problem in positron emission tomography (PET). The EM algorithm is a scaled steepest ascent algorithm that elegantly handles the nonnegativity constraints of the problem. It is shown that the same scaled steepest descent algorithm can be
openaire +2 more sources
Least Squares or Least Circles?
CHANCE, 2010(2010). Least Squares or Least Circles? CHANCE: Vol. 23, Collecting Data in Challenging Settings, pp. 38-42.
Ivo Petras, Igor Podlubny
openaire +1 more source
Least Squares Sign-Solvability
SIAM Journal on Matrix Analysis and Applications, 1995The author constructs a family of least squares sign-solvable linear systems from the vertex-incidence matrices of trees, and develops their general properties. The structure of a least squares sign-solvable system is shown to be analogous to that of sign-solvable linear systems.
openaire +2 more sources
1981
In the next three chapters we shall discuss a particular form of statistical model, which gives rise to simple statistical methods of very wide applicability. The basic model has been mentioned in Section 2.1, Equation (2.2), see also Example 3.12, but the following example illustrates how it arises in practice.
openaire +1 more source
In the next three chapters we shall discuss a particular form of statistical model, which gives rise to simple statistical methods of very wide applicability. The basic model has been mentioned in Section 2.1, Equation (2.2), see also Example 3.12, but the following example illustrates how it arises in practice.
openaire +1 more source

