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 20 of 57 for “"lanczos algorithm"”.

  1. Block Lanczos algorithm.

    We use a block Lanczos algorithm for computing a few of the smallest eigenvalues and the corresponding eigenvectors of a large symmetric matrix rather than computing all the eigenvalue-eigenvector pairs. The basic Lanczos algorithm generates a similar matrix which is block tridiagonal from a given …

    nps Repository record for Block Lanczos algorithm. (opens in a new tab)

  2. Lanczos Algorithm and Conjugate Gradient

    … from the literature 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 …

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

  3. DOA estimation by eigendecomposition using single vector Lanczos Algorithm.

    … eigenvectors of correlation matrices. Using the Lanczos algorithm some of the extreme eigenvalues and eigenvectors can be approximated without requiring the entire matrix decomposition theoretically saving many computations. This thesis develops a model and a form of the Lanczos algorithm to …

    nps Repository record for DOA estimation by eigendecomposition using single vector Lanczos Algorithm. (opens in a new tab)

  4. Solving the photon diffusion equation by Fem with Lanczos Algorithm

    In this thesis, finite element method (FEM) with Lanczos algorithm under uniform-grid and multi-grid meshes, denoted as FEML-U and FEML-M algorithms respectively, are introduced to solve the photon diffusion equation. In FEML-U and FEML-M algorithms, an n-dimensional state-space system is …

    hawaii Repository record for Solving the photon diffusion equation by Fem with Lanczos Algorithm (opens in a new tab)

  5. Restarting the Lanczos algorithm for large eigenvalue problems and linear equations.

    … versions of both the symmetric and nonsymmetric Lanczos algorithms are given. For the symmetric case, we give a method called Lan-DR that simultaneously solves linear equations and computes eigenvalues and eigenvectors. The use of approximate eigenvectors deflates eigenvalues. Maintaining the …

    baylor Repository record for Restarting the Lanczos algorithm for large eigenvalue problems and linear equations. (opens in a new tab)

  6. The Lanczos algorithm for chaotic Hamiltonians: A framework for approximating Green's functions

    … diffusion constant of chaotic models using the Lanczos algorithm, together with a theoretical framework for analysing the associated errors. Our approach represents Green’s functions as continued fractions, with coefficients at the n-th level denoted by bn, obtained recursively via the Lanczos …

    kings Repository record for The Lanczos algorithm for chaotic Hamiltonians: A framework for approximating Green's functions (opens in a new tab) Download PDF for The Lanczos algorithm for chaotic Hamiltonians: A framework for approximating Green's functions (opens in a new tab)

  7. Analyses of the Lanczos Algorithm and of the Approximation Problem in Richardson's Method

    Two algorithms of use in sparse matrix computation are studied. The rounding errors of the computational Lanczos algorithm are examined in order to account for the differences between the ideal and the machine-operator quantities. The observed behavior of these errors is explained by means of a …

    uiuc Repository record for Analyses of the Lanczos Algorithm and of the Approximation Problem in Richardson's Method (opens in a new tab)

  8. Sequential and data-parallel implementations of a Lanczos algorithm for the singular value decomposition

    … implementations of the single-vector Lanczos algorithm for computing the singular value decomposition of large unstructured sparse matrices. Our intent is to produce robust numerical software in C that is portable across a variety of high-performance workstations such as the IBM …

    ut-knoxville Repository record for Sequential and data-parallel implementations of a Lanczos algorithm for the singular value decomposition (opens in a new tab)

  9. Numerical safeguarded use of the implicit restarted Lanczos algorithm for solving nonlinear eigenvalue problems and its monotonicity analysis

    … we develop an efficient accurate numerical algorithm for evaluating a few of the smallest eigenvalues and their corresponding eigenvectors for large scale nonlinear eigenproblems. The entries of the matrices in these problems are transcendental functions approximated well by rational …

    rice Repository record for Numerical safeguarded use of the implicit restarted Lanczos algorithm for solving nonlinear eigenvalue problems and its monotonicity analysis (opens in a new tab)

  10. Wilson Fermions in Lattice Quantum Chromodynamics

    … quenched approximation. Having implemented the Lanczos algorithm to study Wilson fermion spectrum on finite volumes we have presented results to confirm the existence of a phase transition accompanied by a massless mode from a phase where parity is restored to a phase where this discrete …

    glasgow Download PDF for Wilson Fermions in Lattice Quantum Chromodynamics (opens in a new tab)

  11. Connections Between Lanczos Iteration and Orthogonal Polynomials

    … between orthogonal polynomials and the Lanczos algorithm for tridiagonalizing a Hermitian matrix. The Lanczos algorithm provides an easy way to calculate and to estimate the eigenvalues and eigenvectors of such a matrix. It also forms the basis of several popular iterative methods for …

    washington Repository record for Connections Between Lanczos Iteration and Orthogonal Polynomials (opens in a new tab)

  12. Parallel Block Lanczos for solving large binary systems

    The Lanczos algorithm is very useful in solving a large, sparse linear system A x = y and then finding vectors in the kernel of A. Such a system may arise naturally through number factoring algorithms for example. In this thesis, we present a variant of the binary Lanczos algorithm that directly …

    ttu Repository record for Parallel Block Lanczos for solving large binary systems (opens in a new tab)

  13. A restarted Lanczos process for computing a large percentage of the eigenvalues of a symmetric matrix

    The Lanczos algorithm is a well known technique for approximating a few eigenvalues and corresponding eigenvectors of a large-scale real symmetric matric arising in many scientific and engineering applications. In this thesis a modified restarted k-step Lanczos algorithm is presented. The basic …

    rice Repository record for A restarted Lanczos process for computing a large percentage of the eigenvalues of a symmetric matrix (opens in a new tab)

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

    … 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 for Recycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB (opens in a new tab)

  15. The Eigenvalue Spectrum of the Fermion Matrix in Lattice Higgs Systems

    … we consider the performance of various block algorithms for the inversion of large sparse matrices. By computing the eigenvalue spectra of the matrices under consideration we are able to directly relate the performance of the algorithms to the difficulty of the calculation. We find that the …

    glasgow Download PDF for The Eigenvalue Spectrum of the Fermion Matrix in Lattice Higgs Systems (opens in a new tab)

  16. Solução de problemas de autovalor generalizados através do método de iteração por subespaços em blocos e do algoritmo de Lanczos com ortogonalização seletiva

    … is studied. It is also examined a version of the Lanczos Algorithm with selective orthogonalization, in arder to avoid numerical instabilities. Those methods are applied to the free vibrations solution of a jacket platform simplified model, a self-elevative drilling unit anda jacket platform. …

    brazil-uerj Repository record for Solução de problemas de autovalor generalizados através do método de iteração por subespaços em blocos e do algoritmo de Lanczos com ortogonalização seletiva (opens in a new tab)

  17. A Lanczos study of superconducting correlations on a honeycomb lattice

    … and both are solved numerically using the Lanczos algorithm. In order to search for superconducting correlations in the ground state the pair-pair correlation and susceptibility functions are defined. In one dimension the correlation function, at lower electronic fillings, displayed …

    queens Repository record for A Lanczos study of superconducting correlations on a honeycomb lattice (opens in a new tab)

  18. Lanczos Approximation of Joint Spectral Quantities and Applications

    The Lanczos process is a method to approximate quadratic forms (f(A)v, v) for a symmetric matrix A, vector v, and smooth function f. In this thesis we focus on utilizing the Lanczos process to approximate joint spectral quantities determined by the spectra of two distinct operators. Joint spectral …

    umn Repository record for Lanczos Approximation of Joint Spectral Quantities and Applications (opens in a new tab)

  19. Análise estática não-linear geométrica de estruturas pelo método de superposição modal com base Lanczos-Ritz

    … vectors produced in a non-iterative way from a Lanczos algorithm. In the method of buckling mode superposition the eingenvectores have been tradionally used as basis vectors. The high computational cost of this procedure, caused by the iterative character of the eingenvalue problem, is its main …

    brazil-uerj Repository record for Análise estática não-linear geométrica de estruturas pelo método de superposição modal com base Lanczos-Ritz (opens in a new tab)

Page 1 of 3