Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 68047 for “"Least"”.

  1. Interactive least squares

    … developed for solving either linear or nonlinear least squares problems. Designed for use from a remote computer terminal, the program provides the user with instant feedback and the opportunity to make changes or corrections during execution of the program.</p><p>The least squares method used is …

    ut-knoxville Repository record for Interactive least squares (opens in a new tab)

  2. Least squares approximations

    … to certain functions in the sense of least squares.

    bu Repository record for Least squares approximations (opens in a new tab)

  3. Least absolute error regression

    … analysis is usually based on the method of least squares . However, the least squares estimator is highly sensitive to outliers and can be far from optimal when the errors are non-normal in distribution. As an alternative to the least squares estimator, the least absolute error estimator has …

    uvic Repository record for Least absolute error regression (opens in a new tab)

  4. Stabilized Least Squares Migration

    … true acoustic propagation operator. Conventional least squares migration uses a true inverse operator, but is limited in functionality by the large size of modern seismic datasets. This research uses a new technique, called stabilized least squares migration, to correctly migrate seismic data …

    uno Repository record for Stabilized Least Squares Migration (opens in a new tab)

  5. Functional Least Squares Minimization

    In this thesis, we forecast the trend and price of a selected stock using four new algorithms and a previous mathematical model built from economic ‘tendencies’. We use a new variational regularization method to determine the coefficients of the delay differential equation in the previous …

    uab Repository record for Functional Least Squares Minimization (opens in a new tab)

  6. Ordering sparse least squares problems

    … of three methods for ordering a large sparse least squares problem Ax = b, where A is m x n, m ≥ n, and of rank n, are compared. A system Ax = b is ordered by finding permutation matrices P and Q so that the equivalent reordered system PAQ = Pb suffers little fill-in when forming its Cholesky …

    ut-knoxville Repository record for Ordering sparse least squares problems (opens in a new tab)

  7. Bias in least squares regression.

    Much of the data analysed by least squares regression methods violates the assumption that independent variables are known without error. Also, it has been demonstrated that parameter estimates based on minimum residual sums of squares have a high probability of being unsatisfactory if the …

    ubc Repository record for Bias in least squares regression. (opens in a new tab) Download PDF for Bias in least squares regression. (opens in a new tab)

  8. Interactive least squares surface fitting

    … of a surface fitting technique using weighted least squares with tensor products of B-splines on regular data grids (i.e. the position of the data points can be represented as the cross product of two vectors). While somewhat more restrictive than other surface fitting methods, this technique, …

    ubc Repository record for Interactive least squares surface fitting (opens in a new tab) Download PDF for Interactive least squares surface fitting (opens in a new tab)

  9. On the nonnegative least squares

    In this document, we study the nonnegative least squares primal-dual method for solving linear programming problems. In particular, we investigate connections between this primal-dual method and the classical Hungarian method for the assignment problem. Firstly, we devise a fast procedure for …

    gatech Repository record for On the nonnegative least squares (opens in a new tab)

  10. Large sparse least squares computations

    … is a popular method for solving large sparse least squares problems. Row and column permutations of the data matrix are necessary to preserve sparsity, and reduce the computational effort during factorization. The computation of a solution is usually divided into a symbolic ordering phase, and …

    iastate Repository record for Large sparse least squares computations (opens in a new tab)

  11. Topics on Least Squares Estimation

    … on some old but challenging problems concerning least squares estimation. Two major problems are addressed: (i) least squares estimation with heavy-tailed errors, and (ii) least squares estimation in non-Donsker classes. For (i), we study this problem both from a worst-case perspective, and a …

    washington Repository record for Topics on Least Squares Estimation (opens in a new tab)

  12. Least squares mixture decomposition estimation

    The Least Squares Mixture Decomposition Estimator (LSMDE) is a new nonparametric density estimation technique developed by modifying the ordinary kernel density estimators. While the ordinary kernel density estimator assumes equal weight (l/<i>n</i>) for each data point, LSMDE assigns the optimized …

    vt Repository record for Least squares mixture decomposition estimation (opens in a new tab)

  13. Interior point least squares estimation

    … years has led many to regard the recursive least-squares algorithm (RLS) and its variants as the state of the art. The principal advantage of RLS over the rivalling least mean square algorithm (LMS) is its fast rate of convergence, which in many applications justifies the higher …

    mcmaster Repository record for Interior point least squares estimation (opens in a new tab)

  14. Constrained adaptive least mean squared filters

    The possibility of designing constrained adaptive finite impulse response digital filters is investigated as motivated by a study of adaptive noise cancellation. The first constraint considered consists of a fixed angle between filter zeros and is implemented in a master-slave approach in which one …

    nps Repository record for Constrained adaptive least mean squared filters (opens in a new tab)

  15. A Geometric Approach to Least Squares

    A routine problem is to best fit a line to planar data. The goal of this thesis is to view linear regression in a geometric light. Lines in the plane can be identified with points on the cylinder, and fitting a line to a data set can be defined by mapping from that cylinder to R. The best-fit line …

    ttu Repository record for A Geometric Approach to Least Squares (opens in a new tab)

  16. Modified approaches to linear least squares

    <p>A method for solving the linear least squares problem is presented, which can be considered as a generalization of the Gaussian elimination method for square, linear systems. It is a combination of the Gaussian elimination and the modified Gram-Schmidt orthogonalization procedures. A computer …

    ut-knoxville Repository record for Modified approaches to linear least squares (opens in a new tab)

  17. Constrained least-squares digital image restoration

    … this dissertation presents a constrained least-squares (CLS) restoration filter for digital image restoration. The CLS restoration filter is based on a comprehensive, continuous-input/discrete- processing/continuous-output (c/d/c) imaging system model that accounts for acquisition blur, …

    wm-mary Repository record for Constrained least-squares digital image restoration (opens in a new tab)

  18. Essays on Least Squares Model Averaging

    This dissertation adds to the literature on least squares model averaging by studying and extending current least squares model averaging techniques. The first chapter reviews existing literature and discusses the contributions of this dissertation. The second chapter proposes a new estimator for …

    queens Repository record for Essays on Least Squares Model Averaging (opens in a new tab)

Page 1 of 3403