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 73 for “"QR decomposition"”.

  1. Parallel QR decomposition for electromagnetic scattering problems

    Includes bibliographical references (pages 98-102).

    colo-mines Repository record for Parallel QR decomposition for electromagnetic scattering problems (opens in a new tab)

  2. Cordic-based Givens QR decomposition for MIMO detectors

    … thesis research is to realize a complex-valued QR decomposition (QRD) algorithm on FPGAs for MIMO communication systems. The challenge is to implement a QRD processor that efficiently utilizes hardware resources to meet throughput requirements in MIMO systems. By studying the basic QRD algorithm …

    gatech Repository record for Cordic-based Givens QR decomposition for MIMO detectors (opens in a new tab)

  3. A Whole Genome Phylogeny Using Truncated Pivoted QR Decomposition

    … developed methods based on the singular value decomposition (SVD) allow for the simultaneous identification and definition of well concerved motifs and gene families using very large whole genome datasets. In contrast, this work discusses the use of a truncated pivoted QR factorization as a …

    ut-knoxville Repository record for A Whole Genome Phylogeny Using Truncated Pivoted QR Decomposition (opens in a new tab)

  4. Applications of fast QR-decomposition based adaptive algorithms in wireless systems

    … to recursive least-squares (RLS) algorithm) fast QR-decomposition least-squares (FQRD-LS) algorithms; second, it develops new version of FQRD-LS algorithm for widely-linear (WL) input signal; third, It presents fixed-point analysis of FQRD-LS algorithm; and finally, it applies contant modulus …

    aalto Repository record for Applications of fast QR-decomposition based adaptive algorithms in wireless systems (opens in a new tab)

  5. Studying Problems in Elasticity and Plasticity Using a QR Decomposition of the Deformation Gradient

    With the recent developments of QR kinematics and the associated constitutive model, in this thesis, we address some of the fundamental issues in QR kinematics and extend this method to study some problems in elasto-plasticity. In this framework, the matrix of the deformation gradient is decomposed …

    tamu Repository record for Studying Problems in Elasticity and Plasticity Using a QR Decomposition of the Deformation Gradient (opens in a new tab)

  6. A parallel low-complexity MIMO detection algorithm using QR decomposition and Alamouti space-time code

    … block code. At the receiver, one or multiple QR decompositions are performed in parallel after which alternate successive interference cancellation, Alamouti decoding and coherent combining are performed. Iterative detection can also be performed should better error performance be required. …

    ottawa-retro Repository record for A parallel low-complexity MIMO detection algorithm using QR decomposition and Alamouti space-time code (opens in a new tab)

  7. On Using the Upper Triangular (QR) Decomposition Theorem for Deriving a New Strain Energy Function for the Incompressible and Orthotropic Passive Myocardium

    … than the Fung model. The upper triangular (QR) decomposition theorem was leveraged to develop a model that achieved the stated goal. Furthermore, published biaxial data was utilized from studies that measure the stresses of slabs of myocardium to find the respective functional form for the …

    tamu Repository record for On Using the Upper Triangular (QR) Decomposition Theorem for Deriving a New Strain Energy Function for the Incompressible and Orthotropic Passive Myocardium (opens in a new tab)

  8. Greedy algorithms for physics-informed sparse sensor selection

    … well-known greedy algorithm, the column-pivoted QR decomposition, which is performed on basis modes from a low-rank decomposition of the system, to pick out sensor locations that are approximately maximally informative and robust to noise. The column-pivoted QR decomposition is efficient and has …

    washington Repository record for Greedy algorithms for physics-informed sparse sensor selection (opens in a new tab)

  9. Optimal Precoder Design and Block-Equal QRS Decomposition for ML Based Successive Cancellation Detection

    … decomposes the channel matrix by using a block QR decomposition, where Q is a unitary matrix and R is a block upper triangular matrix. The optimal maximum likelihood (ML) detection process is employed within each diagonal block of R. Then, the detected block of symbols is substituted and …

    mcmaster Repository record for Optimal Precoder Design and Block-Equal QRS Decomposition for ML Based Successive Cancellation Detection (opens in a new tab)

  10. Complexity reduction in multiple input multiple output algorithms

    … the complexity problem associated with the QR decomposition algorithm, which is frequently used as a faster alternative to channel inversion in a MIMO scheme. Channel tracking can be employed with QR equalization in order to reduce the pilot overhead of a MIMO system in a non-stationary …

    vu-aus Download PDF for Complexity reduction in multiple input multiple output algorithms (opens in a new tab)

  11. Development of a New 3D Reconstruction Algorithm for Computed Tomography (CT)

    … image. The proposed algorithm consists in the QR decomposition of this matrix and the resolution of the system by a backward substitution process. The cost of this image reconstruction technique is a matrix vector multiplication and a backward substitution process, since the model construction …

    upv Repository record for Development of a New 3D Reconstruction Algorithm for Computed Tomography (CT) (opens in a new tab)

  12. Analysis and Design of Communication Avoiding Algorithms for Out of Memory(OOM) SVD

    … the solution of large, dense singular value decomposition (SVD). The size of matrices used in many of these applications is becoming too large to fit into into a computer’s main memory at one time, and the traditional SVD algorithms that require all the matrix components to be loaded into …

    utk-theses Repository record for Analysis and Design of Communication Avoiding Algorithms for Out of Memory(OOM) SVD (opens in a new tab)

  13. Speech Auditory Brainstem Response Signal Processing: Estimation, Modeling, Detection, and Enhancement

    … First, sABR noise estimation based on LQ/QR decomposition is derived, and its mathematical proof is shown. Second, an autoregression model is used to estimate the single-trial sABR which is then used to test several sABR detection and enhancement methods. Third, a novel Artificial Neural …

    ottawa-retro Repository record for Speech Auditory Brainstem Response Signal Processing: Estimation, Modeling, Detection, and Enhancement (opens in a new tab)

  14. Computation of restricted maximum likelihood estimates of variance components

    … strategies were based respectively on the LDL' decomposition, the W transformation, the SWEEP method, tridiagonalization and diagonalization of the coefficient matrix of the mixed-model equations;The computational requirements of the orthogonal transformations employed in tridiagonalization and …

    iastate Repository record for Computation of restricted maximum likelihood estimates of variance components (opens in a new tab)

  15. Προσδιορισμός παραμέτρων σεισμών του ελληνικού χώρου με τη χρήση κυματόμορφων επικεντρικών αποστάσεων μικρότερων των 90ο

    … methods, which are the normal equations, the QR-decomposition and the singular value decomposition were successfully tested, similar results were obtained and the SVD method was selected. The proposed inversion methodology was applied to large, as well as to earthquake of moderate magnitude. …

    greece Repository record for Προσδιορισμός παραμέτρων σεισμών του ελληνικού χώρου με τη χρήση κυματόμορφων επικεντρικών αποστάσεων μικρότερων των 90ο (opens in a new tab)

  16. Probabilistic Approximations of Matrix Decompositions for Inverse Problems

    … A particular focus is approximate matrix decompositions. This thesis makes use of the Sherman-Morrison-Woodbury formula/matrix inversion lemma, Schur Complements, pseudoinverses, the eigenvalue decomposition, the singular value decomposition, the Cholesky decomposition and particularly the …

    auckland-ms Repository record for Probabilistic Approximations of Matrix Decompositions for Inverse Problems (opens in a new tab)

  17. Fault Detection in Dynamic Systems Using the Largest Lyapunov Exponent

    … be estimated using the Jacobian matrix and the QR decomposition. The possible applications of this method are then explored for various chaotic systems. Finally, the method is applied to some real world data to demonstrate the general relationship between the onset and progression of faults and …

    tamu Repository record for Fault Detection in Dynamic Systems Using the Largest Lyapunov Exponent (opens in a new tab)

  18. Combined objective least squares and long step primal dual subproblem simplex methods

    … Squares (COLS). We took a deeper look at matrix decomposition algorithms that are the dominating components in COLS algorithms, in terms of computational performance and numerical stability. In addition to the traditional QR decomposition approaches, this work studied other possible approaches, …

    gatech Repository record for Combined objective least squares and long step primal dual subproblem simplex methods (opens in a new tab)

  19. Fast Linear Algorithms for Machine Learning

    … and computing inverse, inverse square root, QR decomposition or Singular Value Decomposition (SVD) of huge matrices. In this thesis, we consider three fast al- gorithms for computing Regression and Canonical Correlation Analysis approximate for huge datasets.

    penn Repository record for Fast Linear Algorithms for Machine Learning (opens in a new tab)

Page 1 of 4