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 29 for “"matrix-vector multiplication"”.
-
Sparse matrix-vector multiplication by specialization
… in the very common numerical procedure of sparse matrix-vector multiplication, in the case where a single matrix is to be multiplied by many vectors, is explored. The main objective is the evaluation of the speed-ups that can be obtained with program specialization without considering the …
-
Autotuning divide-and-conquer matrix-vector multiplication
… Ztune approach [14] on serial divide-and-conquer matrix-vector multiplication. We implemented Ztune to autotune serial divide-and-conquer matrix-vector multiplication on machines with different hardware configurations, and found that Ztuneoptimized codes ran 1%-5% faster than the hand-optimized …
-
Hypergraph-Based Combinatorial Optimization of Matrix -Vector Multiplication
The second problem we address is parallel matrix-vector multiplication for large sparse matrices. Parallel sparse matrix-vector multiplication is a particularly important numerical kernel in computational science. We have focused on optimizing the parallel performance of this operation by reducing …
-
Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication
… thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific computing, both involving matrix-vector multiplication, and both are solved using hypergraph models. For both …
-
Optimization by runtime specialization for sparse matrix-vector multiplication
… the potential for obtaining speed-ups for sparse matrix-dense vector multipli- cation using runtime specialization, in the case where a single matrix is to be multiplied by many vectors. We experiment with five methods involving run-time specialization with parallelization, comparing them to …
-
On implementing sparse matrix-vector multiplication on intel platform
Sparse matrix-vector multiplication, SpMV, can be a performance bottle-neck in iterative solvers and algebraic eigenvalue problems. In this thesis, we present our sparse matrix compressed chunk storage format (CCF) and SpMV CCF kernel that realizes high performance on Intel Xeon multicore and Phi …
-
High-Performancs Sparse Matrix-Vector Multiplication on GPUS for Structured Grid Computations
In this thesis, we address efficient sparse matrix-vector multiplication for matrices arising from structured grid problems with high degrees of freedom at each grid node. Sparse matrix-vector multiplication is a critical step in the iterative solution of sparse linear systems of equations arising …
-
Fast algorithms for solving integral equations of electromagnetic wave scattering
… (1) The fast iterative method, which reduces the matrix-vector multiplication from $N\sp2$ to $N\sp{1.5}$ and to N (log(N) $\sp2.$ (2) A fast far-field approximation (FAFFA) method, which solves surface integral equations iteratively with computational complexity of O($N\sp{4/3}$) for one matrix …
-
A fast characteristic finite difference method for fractional advection-diffusion equations with non-linear reaction.
… equation utilizing fast Toeplitz matrix-vector multiplication. We then extend the method to the two-dimensional case. Numerical results are provided to compare performance of the methods proposed.
-
Accelerating induction machine finite-element simulation with parallel processing
… of the sparse iterative solution, and matrix-vector multiplication for magnetic flux density calculation. Due to the sparsity of the finite element problem, GPU-implementation of the sparse iterative solution did not result in faster computation times. The dominant speed-up achieved …
-
A Generic Mesh Data Structure With Parallel Applications
… of simulation, not just the implementation of a matrix-vector product. With this as motivation, we have developed a generic data structure that both provides efficient linear algebra subroutines by optimizing the computation at a fine-grained level and allows for rapid, reusable implementations …
-
A Generic Data Structure with Parallel Applications
… of simulation, not just the implementation of a matrix-vector product. With this as motivation, we have developed a generic data structure that both provides efficient linear algebra subroutines by optimizing the computation at a fine-grained level and allows for rapid, reusable implementations …
-
Authentication protocol using trapdoored matrices
… In our construction, the public key is a n x n matrix and the secret key is a trapdoor of this matrix. The task which an honest user has to perform in order to authenticate himself is a matrix-vector multiplication, where the vector is supplied by the verifier. We provide specific constructions …
-
The Reconstruction of Binary Images in Discrete Tomography by Using the Binary Steering Scheme
… an efficient storage of the binary sparse system matrix A and analyze the work load of the fast execution of the matrix-vector multiplication Ax. Numerical experiments are given to illustrate faster convergence by binary steering block iterations and efficient storage of A.</p>
-
I2MAPREDUCE: DATA MINING FOR BIG DATA
… Fuzzy-C-Means(FCM), Generalized Iterated Matrix-Vector Multiplication(GIM-V), Single Source Shortest Path(SSSP). The main purpose of this project is to reduce input/output overhead, to avoid incurring the cost of re-computation and avoid stale data mining results. Finally, the performance …
-
Studies on Low Frequency Fast Multipole Algorithms
… and diagonal translations are used for one FMA matrix-vector multiplication. This method can effectively overcome the low frequency limitation of MLFMA.
-
Large-scale neuromorphic computing hardware for analog AI enabled by epitaxial random access memory
… small cell footprint, low energy consumption for matrix-vector multiplication, capability of both storage and computing, three-dimensionality, and many analog weight steps. Although there have been intensive studies on the development of an analog memristive device and its large-scale crossbar to …
-
High Performance Algorithms for Structural Analysis of Grid Stiffened Panels
… a new block-oriented algorithm for computing the matrix-vector multiplication w=A⁻¹Bx is developed. The experimental results show that the new sequential SPANDO can save over 70% of memory size, and is at least 10 times faster than the original SPANDO. In parallel SPANDO, ScaLAPACK and BLACS are …
-
Computational electromagnetics for microstrip and MEMS structures
… structures. It is based on a newly developed matrix-friendly dyadic Green's function for layered media (DGLM), which is represented in terms of only two Sommerfeld integrals and is suitable for developing fast algorithms. The path deformation technique and the multipole-based acceleration are …
-
Fast time domain simulation for large order hybrid systems
… continuous-time IVP becomes a set of of smaller matrix vector multiplication routines. Special matrix vector product solver is chosen to exploit the sparsity resulted from the diagonalized structure of the A-matrix. Also, subsystems are considered in frequency domain to see if multiple sampling …
Page 1 of 2