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 “"symmetric eigenvalue problem"”.

  1. Parallel symmetric eigenvalue problem solvers

    Sparse symmetric eigenvalue problems arise in many computational science and engineering applications: in structural mechanics, nanoelectronics, and spectral reordering, for example. Often, the large size of these problems requires the development of eigensolvers that scale well on parallel …

    purdue-thes Repository record for Parallel symmetric eigenvalue problem solvers (opens in a new tab)

  2. A parallel algorithm for the non-symmetric eigenvalue problem

    … on an algorithm for the solution of the non-symmetric eigenvalue problem. The algorithm is based on a divide and conquer procedure that provides initial approximations to the eigenpairs which are then refined using Newton iterations. Since the smaller subproblems can be solved independently, …

    utk-theses Repository record for A parallel algorithm for the non-symmetric eigenvalue problem (opens in a new tab)

  3. Finite element method - a Galerkin approach

    … proof for a finite element solution of a non-symmetric eigenvalue problem and by developing a computer program for the finite element analysis of the two-dimensional steady state flow of an incompressible viscous fluid.

    ubc Repository record for Finite element method - a Galerkin approach (opens in a new tab) Download PDF for Finite element method - a Galerkin approach (opens in a new tab)

  4. Multiprocessor sparse SVD algorithms and applications

    … robust algorithms for the solution of the sparse symmetric eigenvalue problem using Lanczos (with or without re-orthogonalization) and subspace iteration methods. Our intent is to extend and refine this knowledge for computing the sparse singular value decomposition on a parallel computer. We …

    uiuc Repository record for Multiprocessor sparse SVD algorithms and applications (opens in a new tab)

  5. Diagonal plus low rank approximation of matrices for solving modal frequency response problems

    … the cost of solving the modal frequency response problem substantially. Even if the rank of the contribution to the finite element structural damping matrix from the second material is very low, the matrix becomes fully populated when transformed to the modal representation. As a result, the …

    texas Repository record for Diagonal plus low rank approximation of matrices for solving modal frequency response problems (opens in a new tab)

  6. Lanczos Algorithm and Conjugate Gradient

    … on the conjugate gradient algorithm for solving symmetric positive definite linear systems and the related Lanczos algorithm. We derive the conjugate gradient algorithm from the more general conjugate directionmethod, using projectors. We establish error bounds using exact arithmetic theory and …

    washington Repository record for Lanczos Algorithm and Conjugate Gradient (opens in a new tab)