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

  1. 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)

  2. 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.</p>

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

  3. Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia

    … simplifies the development and testing of new algorithms across diverse computing architectures. Julia language’s multiple-dispatch and type inference facilitate the development of type-agnostic, hardware-agnostic, and multi-use frameworks by allowing composability. Utilizing a tiled approach, …

    mit Repository record for Implementing a Tiled Singular Value Decomposition: A Framework for Tiled Linear Algebra in Julia (opens in a new tab)

  4. 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 Repository record for Computation of nodes and weights of Gaussian Quadrature rule by using Jacobi method (opens in a new tab)

  5. 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)

  6. The Foundations of Infinite-Dimensional Spectral Computations

    … extend the SCI hierarchy to prove optimality of algorithms and construct a myriad of different methods for infinite-dimensional spectral problems, solving many computational spectral problems for the first time. For arguably almost any operator of applicable interest, we solve the long-standing …

    cambridge Repository record for The Foundations of Infinite-Dimensional Spectral Computations (opens in a new tab)

  7. Isospectral algorithms, Toeplitz matrices and orthogonal polynomials

    An isospectral algorithm is one which manipulates a matrix without changing its spectrum. In this thesis we study three interrelated examples of isospectral algorithms, all pertaining to Toeplitz matrices in some fashion, and one directly involving orthogonal polynomials. The first set of …

    cambridge Repository record for Isospectral algorithms, Toeplitz matrices and orthogonal polynomials (opens in a new tab)

  8. Analytic and Numerical aspects of isospectral flows

    In this thesis we address the analytic and numerical aspects of isospectral flows. Such flows occur in mathematical physics and numerical linear algebra. Their main structural feature is to retain the eigenvalues in the solution space. We explore the solution of Isospectral flows and their …

    cambridge Repository record for Analytic and Numerical aspects of isospectral flows (opens in a new tab)