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 18 of 18 for “"QR algorithm"”.

  1. The QR Algorithm

    In this section, we will consider two methods for computing an eigenvector and in addition the associated eigenvalue of a matrix A.

    utahstate Repository record for The QR Algorithm (opens in a new tab)

  2. The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems

    … on the implementation of sequential and parallel algorithms for solving block bidiagonal linear system arising from the discretization of boundary value problems for linear ordinary differential equations. It consists of two parts. In Part I, several sequential algorithms, the Alternate Row and …

    ubc Repository record for The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems (opens in a new tab) Download PDF for The implementation of sequential and parallel algorithms for solving almost block bidiagonal systems (opens in a new tab)

  3. Exact Gram-Schmidt QR Factorization

    QR factorization (A = QR) is a widely used tool across mathematics, computer science, and engineering for applications including linear least squares problems, quadratic programming, and rank determination. A critical property in this factorization is that the columns of Q are pairwise orthonormal. …

    tamu Repository record for Exact Gram-Schmidt QR Factorization (opens in a new tab)

  4. The unsymmetric tridiagonal eigenvalue problem

    … by the fact that there is not an accepted good algorithm for exploiting this form. Nevertheless, recently, promising elimination techniques for achieving a stable reduction to this form have been developed. But the standard QR algorithm destroys it immediately. Our work aims to fill this gap in …

    minho-thes Repository record for The unsymmetric tridiagonal eigenvalue problem (opens in a new tab)

  5. Polynomial zerofinding matrix algorithms.

    … to polynomials with complex zeros. New matrix algorithms based on Schmeisser's and Fiedler's companion matrices are developed. The matrix algorithm which is based on Schmeisser's matrix uses no initial values and computes the simple and multiple zeros with high accuracy. The algorithms based on …

    ottawa-retro Repository record for Polynomial zerofinding matrix algorithms. (opens in a new tab)

  6. A Stable Algorithm for Divergence-Free and Curl-Free Radial Basis Functions in the Flat Limit

    … when researchers started to develop stable algorithms for "flat" RBFs. One of the most successful of these is the RBF-QR algorithm, which completely bypasses the ill-conditioning associated with flat scalar-valued RBFs on the sphere using a clever change of basis. In this thesis, we extend …

    boise Repository record for A Stable Algorithm for Divergence-Free and Curl-Free Radial Basis Functions in the Flat Limit (opens in a new tab)

  7. A Restarted Homotopy Method for the Nonsymmetric Eigenvalue Problem

    … is neither as elegant nor as robust as the QR algorithm, it is about twice as fast in the randomly generated examples considered and is highly parallelizable.

    arkansas Repository record for A Restarted Homotopy Method for the Nonsymmetric Eigenvalue Problem (opens in a new tab)

  8. Rapid Implicit Diagonalization of Variable-Coefficient Differential Operators Using the Uncertainty Principle

    … estimates of eigenvalues, and then through the QR algorithm, we will use these estimates to formulate highly accurate eigenvalues and eigenfunctions. Ultimately, we will produce a more efficient solution method that avoids traditional time-stepping.

    usm Repository record for Rapid Implicit Diagonalization of Variable-Coefficient Differential Operators Using the Uncertainty Principle (opens in a new tab)

  9. A STRUCTURED METHOD FOR THE REAL QUADRATIC EIGENVALUE PROBLEM FOR SPECIFIC GYROSCOPIC SYSTEMS

    … the (2,2) zero block.. The goal is to find an algorithm method which diagonalizes matrix A without contaminating the (2,2) zero block. Once this algorithm is developed, the study measures the eigenvalue error bounds and compare its efficiency to the standard symmetric QR workhorse. Also, this …

    ku Repository record for A STRUCTURED METHOD FOR THE REAL QUADRATIC EIGENVALUE PROBLEM FOR SPECIFIC GYROSCOPIC SYSTEMS (opens in a new tab)

  10. Computation of nodes and weights of Gaussian Quadrature rule by using Jacobi method

    … the symmetric eigenvalue problems. Of these the QR algorithm, Cholesky iteration and Jacobi rotational methods are commonly used. In this project we checked rate the of convergence and accuracy of the Cholesky-iterative method and the Jacobi's method for finding eigenvalues and eigen vectors and …

    birmingham Download PDF for Computation of nodes and weights of Gaussian Quadrature rule by using Jacobi method (opens in a new tab)

  11. Iterative refinement methods for eigenproblems

    … have their genesis in the discovery that the QR algorithm is closely related to the Toda flow. Many discrete methods follow the solution trajectory of a differential equation, either exactly or approximately. For example, Newton’s iteration can be thought of as Euler’s method applied to a …

    anu Repository record for Iterative refinement methods for eigenproblems (opens in a new tab)

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

    … main memory at one time, and the traditional SVD algorithms that require all the matrix components to be loaded into memory before computation starts cannot be used directly. Moving data (communication) between levels of memory hierarchy and the disk exposes extra challenges to design SVD for such …

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

  13. The Development and Application of Methods to Study the Evolution of Specificity, Allostery, and RNA -Protein Interactions in Translation

    We have developed the sequence QR algorithm to generate complete evolutionary profiles that represent the topology of the molecular phylogenetic tree of the homologous group. These biasless profiles were used to identify a putative class II cysteinyl-tRNA synthetase (CysRS) in several archaea that …

    uiuc Repository record for The Development and Application of Methods to Study the Evolution of Specificity, Allostery, and RNA -Protein Interactions in Translation (opens in a new tab)

  14. General algorithms based on least squares calculations for maximum likelihood estimation in multiparameter models : a thesis presented in partial fulfilment of the requirements for the degree of Ph.D. in Statistics at Massey University

    This thesis develops algorithms for maximum likelihood estimation that can be implemented using a sequence of weighted least squares computations and examines their properties. Standard least squares algorithms are first described and their execution times, storage requirements and accuracies are …

    massey Repository record for General algorithms based on least squares calculations for maximum likelihood estimation in multiparameter models : a thesis presented in partial fulfilment of the requirements for the degree of Ph.D. in Statistics at Massey University (opens in a new tab)

  15. Steady State Stability Analysis of AC-DC Power Systems

    … to determine system stability and develop new algorithms for the stability analysis and control of large power systems.</p> <p>The method exploits the powerful features of the Component Connection Method for power system modelling and overcomes the disadvantages of the earlier methods. The …

    mcmaster Repository record for Steady State Stability Analysis of AC-DC Power Systems (opens in a new tab)

  16. Singular value analysis and scaling : applications for multivariable process design and control

    … to match the results of analytical SVD and the QR algorithm. The concept of "controller conditioning" versus "process conditioning" has been introduced.</p> <p>New definitions have been introduced and several theorems were developed to provide research direction and help explain the numerical …

    utk-theses Repository record for Singular value analysis and scaling : applications for multivariable process design and control (opens in a new tab)

  17. Development and Application of the Delta-DM Method for Computing Shortwave Radiative Fluxes in a Vertically Inhomogeneous Atmosphere

    … of individual layers.</p> <p>The Delta-DM algorithm is based on the discrete ordinate method for solving the radiative transfer equation and includes several major refinements: (i) replacement of Gauss-Legendre quadrature for the source function with shifted-Legendre quadrature; (ii) …

    mcmaster Repository record for Development and Application of the Delta-DM Method for Computing Shortwave Radiative Fluxes in a Vertically Inhomogeneous Atmosphere (opens in a new tab)

  18. Eigenvalue Algorithms for Symmetric Hierarchical Matrices

    … symmetric hierarchical matrices. The numerical algorithms used for this computation are derivations of the LR Cholesky algorithm, the preconditioned inverse iteration, and a bisection method based on LDLT factorizations. The investigation of QR decompositions for H-matrices leads to a new QR …

    qucosa-diss