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 12 of 12 for “"Block-decomposition"”.

  1. Block decomposition algorithms for matrices in dual angular form

    … and in mathematical programming. <p> Two block decomposition algorithms, one using block Cholesky decomposition and the other using block orthogonal decomposition by Householder transformations are given. Applications to geodetic adjustments are discussed in detail. Computer …

    ut-knoxville Repository record for Block decomposition algorithms for matrices in dual angular form (opens in a new tab)

  2. Block-decomposition and accelerated gradient methods for large-scale convex optimization

    In this thesis, we develop block-decomposition (BD) methods and variants of accelerated *9gradient methods for large-scale conic programming and convex optimization, respectively. The BD methods, discussed in the first two parts of this thesis, are inexact versions of proximal-point methods applied …

    gatech Repository record for Block-decomposition and accelerated gradient methods for large-scale convex optimization (opens in a new tab)

  3. Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition

    … to decompose Strassen-like algorithms into three blocks, namely, component matrix formation (CMF), component multiplication (CM), and reconstruction (R). Each block is a recursive operation. In this thesis, we study these building blocks and investigate three optimization methods: the linearity …

    waterloo Repository record for Implementation Analysis of Strassen-Like Matrix Multiplication Algorithms Based on Block Decomposition (opens in a new tab)

  4. Accelerated Least Squares Network Adjustments and Graph Decompositions

    … method should be considered further. The Helmert Blocking method is selected for further consideration as it has the lowest time complexity of the methods considered, although this time complexity depends on properties of the block structure used. This block structure is a decomposition of the …

    carleton Repository record for Accelerated Least Squares Network Adjustments and Graph Decompositions (opens in a new tab)

  5. Limited feedback scheme using tensor decompositions for FDD massive MIMO systems

    … possible. Our method uses two different tensor decompositions, the canonical polyadic decomposition (CPD) and the rank-(L [subscript r], L [subscript r], 1) or LL-1 block decomposition, on the DL frequency channel to estimate its parameters. By feeding back only the channel parameters, we show …

    texas Repository record for Limited feedback scheme using tensor decompositions for FDD massive MIMO systems (opens in a new tab)

  6. Domain decomposition for hexahedral mesh generation using singularity lines

    … analysts manually decompose the domain into blocks and then use existing methods to generate a hexahedral mesh in each of these regions separately. However, decomposing even a simple model into blocks is not an easy task and requires a lot of experience and skills.<br/><br/>During the last …

    qu-belfast Repository record for Domain decomposition for hexahedral mesh generation using singularity lines (opens in a new tab) Download PDF for Domain decomposition for hexahedral mesh generation using singularity lines (opens in a new tab)

  7. The Derived l-Modular Unipotent Block of p-adic GLn

    … still largely unsolved. For the case of GLn, a block decomposition is known, as is a description of the irreducible representations in each block, but the full structure of the blocks remains open. Recent developments in the categorification of the Langlands correspondence have suggested that it …

    east-anglia Download PDF for The Derived l-Modular Unipotent Block of p-adic GLn (opens in a new tab)

  8. Accelerated algorithms for composite saddle-point problems and applications

    … problems are introduced. Due to the two-block structure of the CSP problem, it can be solved by any algorithm belonging to the block-decomposition hybrid proximal extragradient (BD-HPE) framework. The framework consists of a family of inexact proximal point methods for solving a general …

    gatech Repository record for Accelerated algorithms for composite saddle-point problems and applications (opens in a new tab)

  9. Dynamic load balancing of many -body molecular dynamics simulations in grid environments

    … algorithm is used in conjunction with the atom-decomposition MD technique, while the other is used with force-decomposition. MD simulations based on spatial-decomposition (for short-range potentials) technique assuming heterogeneous compute power and homogeneous links exist in the literature. To …

    nebraska Repository record for Dynamic load balancing of many -body molecular dynamics simulations in grid environments (opens in a new tab)

  10. Decomposition Algorithms for Certain Integer Problems over Networks

    … expensive to solve directly. Instead, decomposition is a more computationally tractable means in many cases. In this thesis, we focus on a few integer problems over networks. In Chapter 2, we investigate the airport flight-to-gate assignment problem, where the goal is to minimize the …

    gatech Repository record for Decomposition Algorithms for Certain Integer Problems over Networks (opens in a new tab)

  11. Structure-aware and interpretable machine learning for CRISPR-Cas9 cleavage activity prediction

    … off-target database crisprSQL, we show that Block Decomposition Method-based scores correlate stronger with SpCas9 activity compared to the experimental epigenetic features. Looking at NuPoP (Affinity) and Nucleotide BDM within the correlation and SHAP importance analyses, we conclude that it …

    oxford Repository record for Structure-aware and interpretable machine learning for CRISPR-Cas9 cleavage activity prediction (opens in a new tab)

  12. Zobrazení rozsáhlých volumetrických dat na CPU

    Tato práce řeší problém zobrazení volumetrických dat na CPU, které svým datovým rozsahem přesahují operační paměť stroje. Práce popisuje návrh vizualizačního schématu, které sestává z datové struktury pro rozsáhlá volumetrická data, a algoritmu, který takto zpracovaná data vizualizuje. Navržená …

    brno-tech Repository record for Zobrazení rozsáhlých volumetrických dat na CPU (opens in a new tab)