NDLTD logo NDLTD Union Catalog and Global ETD Search

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 9 of 9 for “"Lanczos method"”.

  1. Fast algorithms for Brownian dynamics simulation with hydrodynamic interactions

    Liang, Zhi

    … we first present two fast multipole methods (FMM) for computing Du. The first FMM is a simple application of the kernel independent FMM (KIFMM) developed by Ying, Biros, and Zorin [3], which requires 9 scalar FMM calls. The second FMM, similar to the FMM for Stokeslet developed by …

    njit Repository record

  2. Convergence of the Arnoldi Iteration for Estimating Extreme Eigenvalues

    Chen, CeciliaMassachusetts Institute of Technology2025

    Krylov subspace methods, like the Arnoldi iteration, are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we analyze the convergence of Krylov methods for estimating the numerical range of a matrix. Prior bounds on approximation error often depend on …

    mit Repository record

  3. Integração direta da resposta em regime permanente pelo Método de Ritz-Wilson com mudança de base

    Videiro, Paulo MauricioUniversidade Federal do Rio de Janeiro1990

    … to allow the application of the Ritz-Wilson method in the solution of dynamic response due to generic load cases. The final purpose of this work is the use of both procedures in the dynamic analysis of structural systems subject to generalized periodic excitations. Some basic ideas of the …

    brazil-uerj Repository record

  4. Graphs, Principal Minors, and Eigenvalue Problems

    Urschel, John C.Massachusetts Institute of Technology2021

    … low diameter graphs. Finally, we consider the Lanczos method for computing extremal eigenvalues of a symmetric matrix and produce new error estimates for this algorithm.

    mit Repository record

  5. A new block Krylov subspace framework with applications to functions of matrices acting on multiple vectors

    Lund, KathrynTemple University. Libraries2018

    … for understanding block Krylov subspace methods, which hinges on a matrix-valued inner product. We can recast the ``classical" block Krylov methods, such as O'Leary's block conjugate gradients, global methods, and loop-interchange methods, within this framework. Leveraging the generality …

    temple Repository record

  6. Application of advanced diagonalization methods to quantum spin systems.

    Wang, JieyuLaurentian University of Sudbury2014

    … diagonalization. In this approach, numerical methods are used to find the lowest eigenvalues and associated eigenvectors of the Hamilton matrix of the quantum system. The computational problem is thus to determine the lowest eigenpairs of an extremely large, sparse matrix. Although many …

    laurentian Repository record

  7. Application of the non-equilibrium Green function method to induced fission reactions

    Uzawa, KohtarohKyoto University2025

    kyoto Repository record

  8. Recycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB

    Ahuja, KapilVirginia Tech2009

    … of linear systems to the next pair. Augmented bi-Lanczos algorithm and modified two-term recurrence are developed for using the recycle space. Recycle space is built from the approximate invariant subspace corresponding to eigenvalues close to the origin. Recycling approach is extended to the CGS …

    vt Repository record

  9. Recycling Krylov Subspaces and Preconditioners

    Ahuja, KapilVirginia Tech2011

    … Besides the benefit of only having to store few Lanczos vectors, using BiConjugate Gradients (BiCG) to solve dual linear systems may have application-specific advantages. For example, using BiCG to solve the dual linear systems arising in interpolatory model reduction provides a backward error …

    vt Repository record