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 7 of 7 for “"CP Decomposition"”.

  1. Parallel Gauss-Newton method for CP decomposition

    … to Alternating least squares algorithm for CP decomposition. Alternating least squares may exhibit slow or no convergence, especially when high accuracy is required. CP decomposition problem can be formulated as a non-linear least squares problem to apply iterative Newton-like methods. …

    uiuc Repository record for Parallel Gauss-Newton method for CP decomposition (opens in a new tab)

  2. Breaking the curse of dimensionality in electronic structure methods: towards optimal utilization of the canonical polyadic decomposition

    … and application of higher-order tensor (HOT) decompositions, specifically the canonical polyadic (CP) decomposition, is fairly limited. The CP decomposition is an incredibly useful sparse tensor factorization that has the ability to disentangle all correlated modes of a tensor. However the …

    vt Repository record for Breaking the curse of dimensionality in electronic structure methods: towards optimal utilization of the canonical polyadic decomposition (opens in a new tab)

  3. Algorithms and software for efficient tensor decompositions

    … computational and statistical challenges. Tensor decomposition techniques address these issues by extracting low-dimensional representations, reducing storage and computational cost, and enabling efficient analysis and imputation. This thesis develops new algorithms and scalable software for …

    uiuc Repository record for Algorithms and software for efficient tensor decompositions (opens in a new tab)

  4. Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition

    Tensor decompositions have gained popularity in various research communities as a means of analyzing high dimensional, complex data.

    wfu Repository record for Parallel Algorithms for and Applications of the Dense Canonical Polyadic Decomposition (opens in a new tab)

  5. CONVERGENGE ANALYSIS ON SVD-BASED ALGORITHMS FOR TENSOR LOW RANK APPROXIMATIONS

    This thesis is to study a few problems on tensor decompositions and approximations in real space. Among other things, we revisit the classical problem of finding the best rank-R CANDECOMP/PARAFAC(CP) approximation with diff erent cases R > 1 and R = 1 respectively. Unlike the rank-1 approximation …

    nus Repository record for CONVERGENGE ANALYSIS ON SVD-BASED ALGORITHMS FOR TENSOR LOW RANK APPROXIMATIONS (opens in a new tab)

  6. Investigating the loss of crystal structure in carbohydrate materials

    … in regards to the reversing heat capacity (Cp) signal. If the reversing Cp signal exhibited signs of recrystallization during melting and returned to the baseline at the end of the heating process, the material exhibited thermodynamic melting. If it did not, the material was could be …

    uiuc Repository record for Investigating the loss of crystal structure in carbohydrate materials (opens in a new tab)

  7. Parametric model order reduction development for Navier-Stokes equations from 2D chaotic to 3D turbulent flow problems

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Parametric model order reduction development for Navier-Stokes equations from 2D chaotic to 3D turbulent flow problems (opens in a new tab)