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 10 of 10 for “"gram matrix"”.
-
Orthogonality and convergence of discrete Zernike polynomials
… the orthonormal polynomials visually with the Gram matrix and computationally with the rank and condition number. The convergence of the Fourier-Zernike coe\ufb03cients and the Fourier-Zernike series are also examined using various measures of error. The orthogonality and convergence are …
-
The Distance to Uncontrollability via Linear Matrix Inequalities
… two alternative algorithms that result in linear matrix inequalities. For the first algorithm, proposed by Ebihara et. al., a semidefinite programming problem is derived via the Kalman-Yakubovich-Popov (KYP) lemma. The dual formulation is also considered and leads to rank conditions for exactness …
-
COMPOSITE KERNEL FEATURE ANALYSIS FOR CANCER CLASSIFICATION
… linear combination in the construction of Kernel Gram matrix which can then used for efficient reconstruction of feature space. The main contribution of this work lies in providing a Composite kernel Matrix that involves appearance-based approach to improve kernel feature analysis for the …
-
Spectral theory using linear systems and sampling from the spectrum of Hill's equation
… Furthermore, we show that the determinant of the Gram matrix associated with the Riesz basis is a Lipschitz continuous function of (tn)n∈Z. Finally, we look at an integral, Ia associated with Ramanujan and use it to create a basis for PW π2. We conclude with an evaluation of various determinants …
-
Derived categories of coherent sheaves on rational homogeneous manifolds
… the conjecture also makes a prediction about the Gram matrix of such a collection). A proof of this conjecture would also support M. Kontsevich's homological mirror conjecture, one of the most important open problems in applications of complex geometry to physics today. The goal of this work will …
-
Improvement and measurement of neural style transfer
… better E at strong cost in C. While the histogram loss improves the E statistics of Gatys' method, it does not make the method admissible. Surprisingly, style weights have relatively little effect, and most variability in transfer is explained by the style itself (meaning experimenters can be …
-
Optimisation of condition number for eigenstructure problems
… of the closedloop eigenframe of the state matrix. In fact, the aim is to develop a new methodology for determining the best angle between closed-loop eigenvectors by optimising the minimal condition number of the closed-loop eigenvector matrix. This problem is strongly linked to sensitivity …
-
Modified Kernel Principal Component Analysis and Autoencoder Approaches to Unsupervised Anomaly Detection
… and memory complexity in the construction of the gram matrix and a cubic time complexity in its eigendecomposition. The problem of tuning the Gaussian kernel parameter, $sigma$, is solved using the mini-batch stochastic gradient descent (SGD) optimization of a loss function that maximizes the …
-
Spectral Geometry for Structural Pattern Recognition
… the Laplacian eigensystem over time. The matrix of embedding co-ordinates for the nodes of the graph is obtained by performing a Young-Householder decomposition on the heat kernel. Once the embedding of its nodes is to hand we proceed to characterise a graph in a geometric manner. With the …
-
Matrix probing, skeleton decompositions, and sparse Fourier transform
… and perform the Fast Fourier Transform. Matrix probing and its conditioning When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B1,... , Bp, we can apply A to a random vector and solve a linear system to recover this linear …