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 35 for “"dense matrices"”.

  1. Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation

    … mutual inductive couplings results in a fully dense inductance matrix that renders the circuit simulation computationally expensive. Model Order Reduction (MOR) techniques have been employed routinely to substitute the large scale parasitic model by a model of lower order with similar response …

    greece Repository record for Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation (opens in a new tab)

  2. Spectral Regression: A Regression Framework for Efficient Regularized Subspace Learning

    … usually involve eigen-decomposition of dense matrices which is expensive in both time and memory. In this thesis, we introduce a novel dimensionality reduction framework, called {\bf Spectral Regression} (SR). SR casts the problem of learning an embedding function into a regression …

    uiuc Repository record for Spectral Regression: A Regression Framework for Efficient Regularized Subspace Learning (opens in a new tab)

  3. Finite-size effects in low-density parity-check codes applied to cryptography

    … on the computational difficulty in factorising dense matrices, has been studied so far in the limit of infinite system size. In this work we study numerically the finite-size effects in such a system, such that may have a significant impact on the reliability of the cryptosystem, and we derive …

    aston Repository record for Finite-size effects in low-density parity-check codes applied to cryptography (opens in a new tab) Download PDF for Finite-size effects in low-density parity-check codes applied to cryptography (opens in a new tab)

  4. Smith Normal Form over Local Rings and Related Problems

    The Smith normal form is a diagonalization of matrices with many applications in diophantine analysis, graph theory, system control theory, simplicial homology, and more recently, in topological analysis of big data. Efficient computation of Smith normal form is a well-studied area for matrices …

    waterloo Repository record for Smith Normal Form over Local Rings and Related Problems (opens in a new tab)

  5. On diagonally structured matrix computation

    … effort. The proposed storage scheme handles dense matrices and matrices with special structures such as banded, symmetric in a uniform manner. Test results from numerical experiments with OpenMP implementation are promising. We also show that, using our diagonal framework, Java native arrays …

    lethbridge Repository record for On diagonally structured matrix computation (opens in a new tab)

  6. Hierarchical Matrix Techniques on Massively Parallel Computers

    … techniques can be used to efficiently treat dense matrices. With an H-matrix, the storage requirements and performing all fundamental operations, namely matrix-vector multiplication, matrix-matrix multiplication and matrix inversion can be done in almost linear complexity. In this work, we …

    qucosa-diss

  7. Mobile array designs with ANSERLIN antennas and efficient, wide-band PEEC models for interconnect and power distribution network analysis

    … the method of moments, the PEEC method generates dense matrices for its cell interactions. This thesis contains research focused on efficiently using a limited number of cells for accurate results. This has been approached with a hybrid method and also with grid refinements. Additionally, the …

    must-thes Repository record for Mobile array designs with ANSERLIN antennas and efficient, wide-band PEEC models for interconnect and power distribution network analysis (opens in a new tab)

  8. Efficient GPU acceleration of Compressed Matrix Multiplication - Implementation and analysis of Pagh’s algorithm for compressed matrix multiplication on massively parallel hardware

    … benchmarked against the cuBLASXt library using dense matrices of sizes 210 to 217 with result matrices with few elements impacting the Frobenius norm. The benchmarking results demonstrate that it was able to surpass cuBLAS with a maximum recorded speedup of 60.38 on generated matrices tailored …

    chalmers Repository record for Efficient GPU acceleration of Compressed Matrix Multiplication - Implementation and analysis of Pagh’s algorithm for compressed matrix multiplication on massively parallel hardware (opens in a new tab)

  9. The science of high performance algorithms for hierarchical matrices

    Many matrices in scientific computing, statistical inference, and machine learning exhibit sparse and low-rank structure. Typically, such structure is exposed by appropriate matrix permutation of rows and columns, and exploited by constructing an hierarchical approximation. That is, the matrix can …

    texas Repository record for The science of high performance algorithms for hierarchical matrices (opens in a new tab)

  10. FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture

    … elements. The implementation also assumes dense matrices in the input. Timing, speedup and efficiency results based on experiments run on uniprocessor and multiprocessor implementations are also presented.

    njit Repository record for FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture (opens in a new tab)

  11. ShuFFLE: Automated Framework for HArdware Accelerated Iterative Big Data Analysis

    … analysis and hardware acceleration of large and dense (non-sparse) Gram matrices. Such matrices arise in most contemporary data mining; they are hard to handle because of the complexity of known matrix transformation algorithms and the inseparability of non-sparse correlations. ShuFFLE learns the …

    rice Repository record for ShuFFLE: Automated Framework for HArdware Accelerated Iterative Big Data Analysis (opens in a new tab)

  12. FlashX: Massive Data Analysis Using Fast I/O

    … programming framework that supports both sparse matrices and dense matrices for general data analysis. Similar to FlashGraph, it scales matrix operations beyond memory capacity by utilizing SSDs. We demonstrate that with the current I/O technologies FlashGraph and FlashMatrix in the …

    jhu Repository record for FlashX: Massive Data Analysis Using Fast I/O (opens in a new tab)

  13. Flexible And Robust Iterative Methods For The Partial Singular Value Decomposition

    … its entirety, making them suitable for smaller dense matrices where the computation cost is tractable. On the other end of the spectrum, streaming methods were created to provide an "on-line" algorithm that computes an approximate SVD as data is created or read-in over time. Consequently, they …

    wm-mary Repository record for Flexible And Robust Iterative Methods For The Partial Singular Value Decomposition (opens in a new tab)

  14. Fast algorithm and surface integral equations for two-dimensional materials modeling

    … transform (DFT), the multipole expansions with dense matrices can be transformed to diagonal matrices with stable accuracy. Therefore a broadband 2D FMA with high efficiency and accuracy is achieved with a multi-level scheme. Then a metasurface platform to generate structured light at second …

    uiuc Repository record for Fast algorithm and surface integral equations for two-dimensional materials modeling (opens in a new tab)

  15. Randomized algorithms for revealing hidden structure in data-sparse matrices

    … a set of efficient algorithms for handling large dense matrices that have rank-structure. To simplify slightly, this means that they can be tessellated into O(N) submatrices in such a way that each submatrix is either small, or of numerically low rank. A matrix that is rank-structured can be …

    texas Repository record for Randomized algorithms for revealing hidden structure in data-sparse matrices (opens in a new tab)

  16. The Development of a Novel Cartilage Analog Scaffold for Chondral Regeneration

    … However, their low mechanical strength and dense matrices are impediments that could lead to sub-optimal repair. In this work, a natural biomaterial, the bovine nucleus pulposus (bNP), derived from intervertebral disc tissue, was identified as a candidate scaffold for cartilage regeneration. …

    clemson Repository record for The Development of a Novel Cartilage Analog Scaffold for Chondral Regeneration (opens in a new tab)

  17. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

    … multiplication for relatively small, dense matrices that arise in finite element assembly. Previous work showed that combinatorial optimization of matrix-vector multiplication can lead to faster assembly of finite element stiffness matrices by eliminating redundant operations. Based on …

    uiuc Repository record for Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication (opens in a new tab)

  18. Algorithms and technologies for photonic crystal modelling

    … meshless method requires the creation of large dense matrices and then forms a generalised eigenvalue problem. A new set of algorithms were developed that can model photonic crystals accurately. Exploration of alternative technologies was carried out to try to obtain a speed up in the modelling …

    soton Download PDF for Algorithms and technologies for photonic crystal modelling (opens in a new tab)

  19. Facilitating emerging applications on many-core processors

    … used to parallelize a wide variety of dense matrices and vectors based applications. These extensively investigated problems are mainly from linear algebra, stencil computations, image processing and so on. However, many established and emerging problems have not yet been fully …

    missouri Repository record for Facilitating emerging applications on many-core processors (opens in a new tab)

  20. Order reduction of large thermal and electrical models with system-theoretic techniques and matrix equation algorithms

    … procedure, and also involve the storage of dense matrices, making them applicable only to models of few thousand states. To eliminate computational costs and storage needs, low-rank factorization methods have been developed that allow the use of these methods in real-world applications. The …

    greece Repository record for Order reduction of large thermal and electrical models with system-theoretic techniques and matrix equation algorithms (opens in a new tab)

Page 1 of 2