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 6 of 6 for “"non-square matrices"”.
-
Least-Change Secant Updates of Non-Square Matrices
… problems involving the solution of a system of nonlinear equations, it is necessary to keep an approximation to the Jacobian matrix which is updated at each iteration. Computational experience indicates that the best updates are those that minimize some reasonable measure of the change to the …
-
Evaluating the impact of differences in the definition of overlap training on target acquisition in non-square matrices
… in the most efficient training sequence in a non-square matrix. This study found that for one participant, the training sequence using the definition put forth in Curiel et al. (2021) resulted in 91.67 percent correct responding for all targets in the probes, and 100 percent correct responding …
-
Applications of full rank factorization to solving matrix equations.
In the study of matrices, we are always searching for tools which allow us to simplify our investigations. Because full rank factorizations exist for all matrices and their properties often help to simplify arguments, their uses are abundant. There exist many matrix equations for which solutions …
-
Practical fast matrix multiplication algorithms
… of computations required for multiplying n x n matrices from O(n³) to O(n [superscript 2.807]). Over the last half century, this has fueled many theoretical improvements such as other variations of Strassen-like FMM algorithms. Previous implementations of these FMM algorithms led to the "street …
-
Noise and Information in Deep Learning: A Statistical Physics Perspective on Learning and Neural Representations
… Since these models consist of large weight matrices, random matrix theory (RMT) provides a natural framework for analysis. In this thesis, we study how information is stored in the model’s weight matrices by comparing its spectra to those of randomly initialized networks, where RMT makes …
-
Constraint Solving for User Interface Layout Problems
… particularly efficient for problems with sparse matrices, as they appear in GUI layout specifications. However, SOR as described in the literature has its limitations: it works only with square matrices and does not support soft constraints, which makes it inapplicable to UI layout problems. This …