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 3 of 3 for “"random sketching"”.

  1. Large-scale Clustering using Random Sketching and Validation

    … thesis introduces a clustering framework, named random sketching and validation (SkeVa). This framework builds upon and markedly broadens the scope of random sample and consensus RANSAC ideas that have been used successfully for robust regression. Four main algorithms are introduced, which enable …

    umn Repository record for Large-scale Clustering using Random Sketching and Validation (opens in a new tab)

  2. Convergence Estimate of Minimal Residual Methods and Random Sketching of Krylov Subspace Methods

    … using non-orthonormal basis vectors based on random sketching. For a matrix A with spectrum Λ(A), it is well known that the min-max polynomial problem min max |pk (z)| pk ∈Pk, pk (0)=1, z∈Λ(A) is used to bound the relative error of Krylov subspace minimum residual methods or similar methods. …

    clemson Repository record for Convergence Estimate of Minimal Residual Methods and Random Sketching of Krylov Subspace Methods (opens in a new tab)

  3. RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS

    In the thesis, we look at the implementation of randomized algorithms on two major topics in scientific computing - least squares (LS) and low rank approximation (LR) problems. By studying the properties of a random sketching matrix, we derive theorems composed of sufficient conditions for a …

    nus Repository record for RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS (opens in a new tab) Download file for RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS (opens in a new tab)