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 5 of 5 for “"Symmetric generalized eigenvalue problem"”.

  1. GENERALIZATIONS OF AN INVERSE FREE KRYLOV SUBSPACE METHOD FOR THE SYMMETRIC GENERALIZED EIGENVALUE PROBLEM

    Symmetric generalized eigenvalue problems arise in many physical applications and frequently only a few of the eigenpairs are of interest. Typically, the problems are large and sparse, and therefore traditional methods such as the QZ algorithm may not be considered. Moreover, it may be impractical …

    uky-thes Repository record for GENERALIZATIONS OF AN INVERSE FREE KRYLOV SUBSPACE METHOD FOR THE SYMMETRIC GENERALIZED EIGENVALUE PROBLEM (opens in a new tab)

  2. Multilevel solution procedures for structural dynamics eigenvalue problems

    … algorithms are described that can solve the symmetric generalized eigenvalue problem encountered in structural dynamics. First, the multigrid algorithm for solving linear matrix equations is incorporated into the subspace iteration and block Lanczos methods to produce implicit subspace and …

    uiuc Repository record for Multilevel solution procedures for structural dynamics eigenvalue problems (opens in a new tab)

  3. Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems

    … for the solution of large and sparse algebraic symmetric generalized eigenvalue problems. Domain decomposition techniques begin by partitioning the global (discretized) domain into a number of subdomains. The solution of the algebraic eigenvalue problem is then decoupled into two separate …

    umn Repository record for Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems (opens in a new tab)

  4. Parallel Schur Complement Algorithms for the Solution of Sparse Linear Systems and Eigenvalue Problems

    … where the solution of a linear system or an eigenvalue problem is needed.While direct methods are still preferable when solving linear systems arising from two-dimensional models, iterative methods are widely used when solving linear systems arising from three-dimensional models due to their …

    umn Repository record for Parallel Schur Complement Algorithms for the Solution of Sparse Linear Systems and Eigenvalue Problems (opens in a new tab)

  5. VARIATIONAL METHODS FOR IMAGE DEBLURRING AND DISCRETIZED PICARD'S METHOD

    … image, which is called the image deblurring problem. In particular, we make no assumptions about the blur itself, which is called a blind deconvolution. We approach the problem by miniming an energy functional that utilizes total variation norm and a fidelity constraint. In particular, we …

    uky-thes Repository record for VARIATIONAL METHODS FOR IMAGE DEBLURRING AND DISCRETIZED PICARD'S METHOD (opens in a new tab)