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 28 for “"matrix-vector multiplications"”.
-
First-Order Algorithms for Convex Smooth Optimization Problems With Homogeneous Linear Constraints
… problem of computing the projection of a given vector onto the kernel of a symmetric positive semi-definite matrix. The complexity of an algorithm for computing a numerical solution is evaluated by the total number of matrix-vector multiplications required for computing an approximate solution. …
-
An Inverse-Free Projected Gradient Descent Method for the Generalized Eigenvalue Problem
… as linear operators can be probed through matrix-vector multiplications. To solve such problems, matrix-free algorithms are the only viable option. In addition, algorithms that do multiple matrix-vector multiplications simultaneously (instead of sequentially), or so-called block algorithms, …
-
A fast direct solver for boundary value problems with locally-perturbed geometries
… The resulting solver only requires inexpensive matrix-vector multiplications and matrix inversion of small size, thus dramatically reducing the cost of inverting the new linear system.
-
The Fast Multipole Method for 2D Coulombic Problems: Analysis, Implementation and Visualization
… the Java code can be easily extended to solve matrix-vector multiplications of other types, and that the code developed in this project can serve as a basis for a full set of Application Programming Interfaces (API) to promote and aide the integration of the FMM algorithm into larger Java-based …
-
An Optimized Multiple Right-Hand Side Dslash Kernel for Intel Xeon Phi
… a nearest neighbor stencil operator summing matrix-vector multiplications over lattice points, whose performance is bandwidth-bound on most architectures. Reportedly, up to 90\% of LQCD running time may be spent computing Dslash. In recent years, efforts have been made by researchers to …
-
Inverse problems in photoacoustic imaging : analysis and computation
… and a fast multipole method for accelerating matrix-vector multiplications for the discretized system. Third, we perform mathematical analysis on PAT reconstruction problem with unknown ultrasound speed. We prove local uniqueness and stability results on the simultaneous reconstruction of the …
-
Photonic Integrated Circuits for Computation
Matrix and tensor accelerators play indispensable roles in the field of artificial intelligence (AI). Although most of the matrix accelerators, such as graphic processing units (GPUs) and tensor processing units (TPUs), are still electronics based, the energy efficiency and scalability limits of …
-
Recursive identification and model reduction from time domain data
… and an efficient implementation requiring only matrix-vector multiplications is put forward. Furthermore, we extend the method to data corrupted by noise, where an additional model order reduction step is used to identify a low order model from the data. The newly developed recursive procedure …
-
Analog and Digital Memristive Devices Based on Hafnium Oxide for Neuromorphic Applications
… devices can potentially be used for computing matrix-vector-multiplications (MVMs) directly in-memory when storing pre-trained synaptic weights of an artificial neural network (ANN).
-
Design and Generation of Efficient Hardware Accelerators for Sparse and Dense Tensor Computations
… use tensor computations primarily in the form of matrix-matrix and matrix-vector multiplications. The tensor computations often used in many of these fields operate on sparse data where most of the elements are zeros. Traditionally, tensor computations have been performed on CPUs and GPUs, both of …
-
Analysis of an Aggregation-based Algebraic Multigrid Method and its Parallelization
… determining appropriate aggregates based on eigenvectors associated with small eigenvalues of a block splitting matrix. In the second part of the thesis several issues regarding the parallel implementation of aggregation-based multigrid methods are discussed. The coarsest grid solving stage of …
-
Exploiting Problem Structure for Faster Optimization: A Trilinear Saddle Point Approach
… the expensive computation of the probability vector projection. Finally, preliminary numerical experiments are conducted to demonstrate the empirical advantages of the proposed algorithms. In Chapter Three, we study the convex nested stochastic composite optimization (NSCO) problem, which …
-
Regularization and redatuming using least squares and conjugate gradients
… to avoid computation of the Hessian as a matrix-matrix multiplication and instead reduce it to two matrix-vector multiplications. This reduces the total number of multiplication operations from O (n³) for the direct solution to O (n²) for the conjugate gradient method, where n is the …
-
Higher order nets and sequences
… are digital nets, which are constructed using matrix•vector multiplications over finite fields. A further interesting special case of digital nets are polynomial lattice point sets, whose construction is based on polynomials over finite fields. Recently, Dick introduced higher order digital …
-
Preconditioning of Karush--Kuhn--Tucker Systems arising in Optimal Control Problems
… interior--point methods. Therefore, the system matrix is referred to as a KKT matrix. It is not the purpose of this thesis to investigate systems arising from general quadratic programming problems, but to study systems arising in linear quadratic control problems governed by partial …
-
Practical error correction codes and near-term algorithms for quantum computation
… including linear systems of equations and matrix-vector multiplications. We show that the linear algebra problems can be solved with near-term devices, with circuit depth linear to the condition number and super-linear to the number of qubits.</p>
-
Efficient Algorithms for Parallel Excitation and Parallel Imaging with Large Arrays
… We substitute the two computational expensive matrix- vector multiplications in the conjugate gradient (CG) solver with gridding and fast Fourier transform (FFT). Theoretical and simulation results have shown that the design speed can be improved by 10 times. Meanwhile, the memory cost is …
-
A Scalable and Flexible Framework for Gaussian Processes via Matrix-Vector Multiplication
… part due to an inference procedure that requires matrix inverses, determinants, and other expensive operations. Moreover, specialty models often require significant implementation efforts. This thesis aims to alleviate these practical concerns through a single simple design decision. Taking …
-
Spintronics-based Architectures for non-von Neumann Computing
… is capable of in-memory computing and performs matrix-vector multiplications with O(1) time complexity. We propose the on-chip training of the NN crossbar since, first, it can leverage the parallelism in the crossbar to perform weight update, second, it allows to take into account the device …
-
Unconventional Computing With Photonic Oscillator Networks
… beneficial for handling tasks that involve matrix-vector multiplications due to its ability to efficiently perform fan-in (summation) and fan-out (copying) operations. These are fundamental operations in parallel processing, while digital processors are limited by capacitive RC and LC …
Page 1 of 2