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 7 of 7 for “"TRIANGULAR MATRIX"”.
-
Local Factorization of Multidimensional Differential Operators to Optimize Implicit Solution Methods
… to factor the operator as product of an upper triangular matrix and that matrix's adjoint. Using the factor calculated in this Affine Local Grid Factorization (ALG-F), it is possible to solve the system by simple back substitution followed by forward substitution resulting in an implicit scheme …
-
Implementação do cálculo do Fator de Cholesky diretamente a partir da matriz de rigidez do elemento estrutural
… by rneans of obtaining a factor of the stiffness matrix of the structure. The most popular solution method involves the transformation of this matrix into an upper triangular matrix, the Cholesky factor. Here, it is shown how this factor may be obtained directly from the factor of the elemental …
-
A mode-jumping algorithm for exploratory factor analysis with continuous and binary responses
… summaries. The positive-diagonal, lower-triangular (PLT) constraint is the most commonly used restriction to guarantee identifiability, in which the upper $m \times m$ submatrix of the loadings is constrained to be a lower-triangular matrix with positive-diagonal elements. The PLT …
-
Stable Sparse Orthogonal Factorization of Ill-Conditioned Banded Matrices for Parallel Computing
… a sparse orthogonal factorization of a banded matrix motivated by parallel computing. Specifically, we develop a process to factorize a banded matrix as a product of a sparse orthogonal matrix and a sparse matrix which can be transformed to an upper triangular matrix by column permutations. We …
-
A new method to calculate wave scattering from rough surfaces at low grazing angles
… The method presented in this work eliminates the matrix storage difficulties previously associated with solving this problem and significantly reduces the computation time, while providing a highly accurate solution over a large range of incident and scattering angles, as well as surface …
-
Complexity reduction in multiple input multiple output algorithms
… of QR decompositions and tracking R (the upper triangular matrix) directly, while holding unitary matrix Q fixed, can significantly reduce complexity per symbol at the expense of some introduced error. Additional modification of the CORDIC algorithm (a square root- and division-free algorithm …
-
Ομογενείς περατωμένες περιοχές της μιγαδίκης πολλαπλότητας C
Η ΑΝΤΙΣΤΟΙΧΙΑ ΠΟΥ ΥΠΑΡΧΕΙ ΜΕΤΑΞΥ ΤΩΝ ΟΜΟΓΕΝΩΝ ΠΕΡΑΤΩΜΕΝΩΝ ΠΕΡΙΟΧΩΝ ΚΑΙ ΤΩΝ NORMAL J-ΑΛΓΕΒΡΩΝ, ΕΙΝΑΙ ΤΟ ΑΝΤΙΚΕΙΜΕΝΟ ΤΗΣ ΔΙΔΑΚΤΟΡΙΚΗΣ ΔΙΑΤΡΙΒΗΣ. ΣΕ ΚΑΘΕ ΚΑΝΟΝΙΚΗ J-ΑΛΓΕΒΡΑ ΑΝΤΙΣΤΟΙΧΕΙ ΚΑΙ ΜΙΑ ΟΜΟΓΕΝΗΣ ΠΕΡΑΤΩΜΕΝΗ ΠΕΡΙΟΧΗ ΚΑΙ ΩΣ ΕΚ ΤΟΥΤΟΥΜΙΑ ΠΕΡΙΟΧΗ ΤΟΥ SIEGEL. ΤΑ ΠΡΩΤΟΤΥΠΑ ΑΠΟΤΕΛΕΣΜΑΤΑ ΒΑΣΙΖΟΝΤΑΙ ΣΤΟΝ …