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 103 for “"least squares problem"”.

  1. The Linear Least Squares Problem of Bundle Adjustment

    A method is described for finding the least squares solution of the overdetermined linear system that arises in the photogrammetric problem of bundle adjustment of aerial photographs. Because of the sparse, blocked structure of the coefficient matrix of the linear system, the proposed method is …

    unf Repository record for The Linear Least Squares Problem of Bundle Adjustment (opens in a new tab) Download PDF for The Linear Least Squares Problem of Bundle Adjustment (opens in a new tab)

  2. A method for the solution of the generalized nonlinear least squares problem

    … for the solution of the generalized nonlinear least squares problem. The method combines a modified Gauss-Newton iterative technique with a block iterative scheme for the solution of the normal equations to solve the problem.</p><p>The method converges in some instances when the other available …

    ut-knoxville Repository record for A method for the solution of the generalized nonlinear least squares problem (opens in a new tab)

  3. Comparison of algorithms for solving the least squares problem with applications in computed tomography

    One approach to the image reconstruction problem in Computed Tomography (CT) is to solve a least squares problem. For this application, direct solutions to the least squares problem are ineffective and iterative methods are employed. The current iterative method being used is the Landweber …

    ubc Repository record for Comparison of algorithms for solving the least squares problem with applications in computed tomography (opens in a new tab) Download PDF for Comparison of algorithms for solving the least squares problem with applications in computed tomography (opens in a new tab)

  4. Estimation of the In-Cylinder Air/Fuel Ratio of an Internal Combustion Engine by the Use of Pressure Sensors

    … exponent. The first method results in a linear least-squares problem, and the second method results in a nonlinear least-squares problem. The nonlinear least-squares problem is solved by separating out the nonlinear dependence and solving the single-variable minimization problem. For this, a …

    lund Repository record for Estimation of the In-Cylinder Air/Fuel Ratio of an Internal Combustion Engine by the Use of Pressure Sensors (opens in a new tab) Download PDF for Estimation of the In-Cylinder Air/Fuel Ratio of an Internal Combustion Engine by the Use of Pressure Sensors (opens in a new tab)

  5. Rounding error in least squares approximation with applications in financial mathematics

    … techniques which can be used to estimate Least-Squares polynomial approximations to model interest rates. Four of these techniques are the Least-Squares approximation, the QR Decomposition approach to solving the Least-Squares problem, the Gram-Schmidt Orthogonalization Process approach to …

    ttu Repository record for Rounding error in least squares approximation with applications in financial mathematics (opens in a new tab)

  6. A Multiple Linear Regression Analysis on Mathematics Placement at The University of Tennessee, Knoxville

    <p>This paper looks at solving the least squares problem and then using that theory to solve a simple multiple regression analysis for placing students into mathematics courses at the University of Tennessee, Knoxville.</p> <p>The first chapter is an introduction and a basic outline of the problem. …

    ut-knoxville Repository record for A Multiple Linear Regression Analysis on Mathematics Placement at The University of Tennessee, Knoxville (opens in a new tab)

  7. Local and superlinear convergence of structured secant methods from the convex class

    … class for the equality-constrained optimization problem and the nonlinear least-squares problem. Particular cases of these methods are the SQP augmented scale BFGS and DFP secant methods for constrained optimization problems introduced by Tapia. Another particular case, for which local and …

    rice Repository record for Local and superlinear convergence of structured secant methods from the convex class (opens in a new tab)

  8. Motion modeling and video processing

    … of MA filtering) to the solution of a weighted least squares problem. This least squares problem is then generalized to enable modeling (filtering) of motion fields. Our AR model for motion is significantly different from previous approaches in that instead of computing motion at a pixel as a …

    uiuc Repository record for Motion modeling and video processing (opens in a new tab)

  9. Towards Better Understanding of Algorithms and Complexity of Some Learning Problems

    We present several novel results on computational problems related to supervised learning.We focus on the computational resources required by algorithms to solve learning problems. The computational resources we consider are running time, memory usage and query complexity, which is the number of …

    washington Repository record for Towards Better Understanding of Algorithms and Complexity of Some Learning Problems (opens in a new tab)

  10. 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)

  11. A Riemannian approach to large-scale constrained least-squares with symmetries

    This thesis deals with least-squares optimization on a manifold of equivalence relations, e.g., in the presence of symmetries which arise frequently in many applications. While least-squares cost functions remain a popular way to model large-scale problems, the additional symmetry constraint should …

    liege Repository record for A Riemannian approach to large-scale constrained least-squares with symmetries (opens in a new tab) Download PDF for A Riemannian approach to large-scale constrained least-squares with symmetries (opens in a new tab)

  12. The Sherman Morrison Iteration

    … method is developed to solve regularized least squares problems. Notions of pivoting and splitting are deliberated on to make the method more robust. The Sherman Morrison iteration method is shown to be effective when dealing with an extremely underdetermined least squares problem. The …

    vt Repository record for The Sherman Morrison Iteration (opens in a new tab)

  13. Adaptive Sphere Decoding and Radius Selection with Error Analysis in Sphere Decoding

    … such as communications may be modeled as integer least squares problems. The goal is to find the solution to the integer least squares problem, which could be the encoded integer vector in these applications. From the point of view of lattice space, finding the solution to an integer least squares …

    mcmaster Repository record for Adaptive Sphere Decoding and Radius Selection with Error Analysis in Sphere Decoding (opens in a new tab)

  14. A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares

    … method is used extensively for solving nonlinear least-squares problems. We describe an extension of the Levenberg- Marquardt method to problems with bound constraints on the variables. Each iteration of our algorithm approximately solves a linear least-squares problem subject to the original …

    ubc Repository record for A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares (opens in a new tab) Download PDF for A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares (opens in a new tab)

  15. A large-scale trust-region approach to the regularization of discrete ill-posed problems

    We consider the problem of computing the solution of large-scale discrete ill-posed problems when there is noise in the data. These problems arise in important areas such as seismic inversion, medical imaging and signal processing. We pose the problem as a quadratically constrained least squares …

    rice Repository record for A large-scale trust-region approach to the regularization of discrete ill-posed problems (opens in a new tab)

  16. Wavelet-based digital image restoration

    … restoration is a fundamental image processing problem with underlying physical motivations. A digital imaging system is unable to generate a continuum of ideal pointwise measurements of the input scene. Instead, the acquired digital image is an array of measured values. Generally, algorithms …

    wm-mary Repository record for Wavelet-based digital image restoration (opens in a new tab)

  17. Efficient finite basis physics informed neural networks

    … and being easily extendable to solving inverse problems. One promising approach for allowing PINNs to scale to multi-scale problems is to combine them with domain decomposition; for example, finite basis physics-informed neural networks (FBPINNs) replace the global PINN network with many …

    strathclyde Repository record for Efficient finite basis physics informed neural networks (opens in a new tab)

  18. Gravitational lens modeling with iterative source deconvolution and global optimization of lens density parameters

    … method expresses the source modeling step as a least-squares problem for a given set of lens model parameters. The blurring effect due to the point spread function of the instrument used to observe the lensed images is also taken into account. In general, regularization is needed to solve the …

    manitoba Repository record for Gravitational lens modeling with iterative source deconvolution and global optimization of lens density parameters (opens in a new tab)

  19. Marker-free human motion capture in dynamic cluttered environments from a single view-point

    … 3D space. This formulation leads to a Nonlinear Least Squares problem, which is solved with gradient-based methods. With the formulation in this thesis the necessary derivatives can be derived analytically. This speeds up processing and increases accuracy. Different gradient based methods are …

    cau-kiel Repository record for Marker-free human motion capture in dynamic cluttered environments from a single view-point (opens in a new tab)

  20. The Conditioning of Reservoir Computing and NG-RC for Forecasting and the Effects of Temporal Overparameterization

    … the solutions found. With either algorithm, the least squares problem which is solved to give parameters as a function of the time series data is ill-conditioned, leading to parameter non-identifiability. Both algorithms fall into the class of "sloppy models." Standard practice to regularize …

    byu Repository record for The Conditioning of Reservoir Computing and NG-RC for Forecasting and the Effects of Temporal Overparameterization (opens in a new tab) Download PDF for The Conditioning of Reservoir Computing and NG-RC for Forecasting and the Effects of Temporal Overparameterization (opens in a new tab)

Page 1 of 6