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 34 for “"Krylov methods"”.

  1. Krylov methods for solving linear systems

    Krylov methods are considered as one of the most popular classes of numerical methods to solve large sparse linear systems of equations. One of the reasons for their popularity is that they are relatively simple to implement. Therefore, Krylov methods have been increasingly accepted as efficient …

    texas Repository record for Krylov methods for solving linear systems (opens in a new tab)

  2. Rational Krylov Methods for Operator Functions

    … unified and self-contained treatment of rational Krylov methods for approximating the product of a function of a linear operator with a vector. With the help of general rational Krylov decompositions we reveal the connections between seemingly different approximation methods, such as the …

    qucosa-diss

  3. CLAIRE-MG: Efficient Diffeomorphic Image Registration Using Multigrid-Preconditioned Newton–Krylov Methods

    … Optimization in CLAIRE employs a Newton–Krylov method. The central contribution of my thesis is the design and analysis of a sophisticated multigrid preconditioning strategy for the reduced space Hessian. Explicitly forming and storing the Hessian matrix is computationally intractable for …

    houston Repository record for CLAIRE-MG: Efficient Diffeomorphic Image Registration Using Multigrid-Preconditioned Newton–Krylov Methods (opens in a new tab) Embargoed until 2027-08-01

  4. Krylov methods for solving a sequence of large systems of linear equations.

    … A₍ᵢ₎ ϵℂⁿᵡⁿ and b⁽ⁱ⁾ϵℂⁿ using some variations of Krylov subspace methods, like GMRES. For a single system Ax=b, it is well-known that the eigenvectors of the coefficient matrix A can be used to speed up the convergence of GMRES by deflating the corresponding eigenvalues. In this dissertation, we …

    baylor Repository record for Krylov methods for solving a sequence of large systems of linear equations. (opens in a new tab)

  5. Iterative Solver Selection Techniques for Sparse Linear Systems

    … For large problems, preconditioned iterative methods are a popular choice. High-performance numerical libraries offer a variety of preconditioned Newton-Krylov methods for solving sparse problems. However, the selection of a well-performing Krylov method remains to be the user’s …

    oregon Repository record for Iterative Solver Selection Techniques for Sparse Linear Systems (opens in a new tab)

  6. Time Integration Methods for Large-scale Scientific Simulations

    … require the use of numerical time integration methods to solve. Many problems of scientific interest exhibit stiff behavior for which implicit methods are favorable, however standard implicit methods are computationally expensive. They require the solution of one or more large nonlinear systems …

    vt Repository record for Time Integration Methods for Large-scale Scientific Simulations (opens in a new tab)

  7. Analysis of the BiCG Method

    … Gradient (BiCG) method is an iterative Krylov subspace method that utilizes a 3-term recurrence. BiCG is the basis of several very popular methods, such as BiCGStab. The short recurrence makes BiCG preferable to other Krylov methods because of decreased memory usage and CPU time. …

    vt Repository record for Analysis of the BiCG Method (opens in a new tab)

  8. Lightly-Implicit Methods for the Time Integration of Large Applications

    … are widely used in the implementation of such methods. The primary focus of this work is on the development of novel ``lightly-implicit'' time integration methodologies. These methods consider the time integration and the solution of the implicit terms as a single computational process. We …

    vt Repository record for Lightly-Implicit Methods for the Time Integration of Large Applications (opens in a new tab)

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

    … propose a new framework 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 …

    temple Repository record for A new block Krylov subspace framework with applications to functions of matrices acting on multiple vectors (opens in a new tab)

  10. Efficient Iterative Solution Algorithms For Numerical Models of Multiphase Flow

    … and application of optimally efficient numerical methods for the simulation of vascular tumour growth, based upon the multiphase fluid model introduced by Hubbard and Byrne [57]. This multiphase model involves the flow and interaction of four different, but coupled, phases which are each treated …

    whiterose Download PDF for Efficient Iterative Solution Algorithms For Numerical Models of Multiphase Flow (opens in a new tab)

  11. Efficient computation of Jacobian matrices for entropy stable summation by parts schemes

    … stable summation-by-parts schemes. Competing methods for computing Jacobian matrices include finite difference, automatic differentiation, graph coloring, and Jacobian-free Newton-Krylov methods. In contrast to these methods the formulas proposed provide a sparsity-informed method for …

    rice Repository record for Efficient computation of Jacobian matrices for entropy stable summation by parts schemes (opens in a new tab)

  12. Crouzeix's Conjecture and the GMRES Algorithm

    … solving linear systems and is one of the many Krylov methods. Despite its popularity, the convergence of GMRES is not completely understood. While the spectrum can in some cases be a good indicator of convergence, it has been shown that in general, the spectrum does not provide sufficient …

    byu Repository record for Crouzeix's Conjecture and the GMRES Algorithm (opens in a new tab) Download PDF for Crouzeix's Conjecture and the GMRES Algorithm (opens in a new tab)

  13. Inexact methods for the chemical master equation with constant or time-varying propensities, and application to parameter inference

    … that it can be put in the framework of inexact Krylov methods that relax matrix-vector products and compute them expediently by trading accuracy for speed. We also examine practical applications of our work in delay CME and parameter inference through local and global optimization schemes.

    alabama Repository record for Inexact methods for the chemical master equation with constant or time-varying propensities, and application to parameter inference (opens in a new tab)

  14. Analysis and Implementation Considerations of Krylov Subspace Methods on Modern Heterogeneous Computing Architectures

    Krylov subspace methods are the state-of-the-art iterative algorithms for solving large, sparse systems of equations, which are ubiquitous throughout scientific computing. Even with Krylov methods, these problems are often infeasible to solve on standard workstation computers and must be solved …

    temple Repository record for Analysis and Implementation Considerations of Krylov Subspace Methods on Modern Heterogeneous Computing Architectures (opens in a new tab)

  15. On the Use of Arnoldi and Golub-Kahan Bases to Solve Nonsymmetric Ill-Posed Inverse Problems

    Iterative Krylov subspace methods have proven to be efficient tools for solving linear systems of equations. In the context of ill-posed inverse problems, they tend to exhibit semiconvergence behavior making it difficult detect ``inverted noise" and stop iterations before solutions become …

    vt Repository record for On the Use of Arnoldi and Golub-Kahan Bases to Solve Nonsymmetric Ill-Posed Inverse Problems (opens in a new tab)

  16. Parallel Newton-Krylov-Schwarz Solvers for the Full Potential Flow Equation

    Newton-Krylov-Schwarz methods are increasingly applied in Computational Fluid Dynamics (CFD). We develop a parallel analysis code based on this method for the full potential flow model. The full potential model consists of a single nonlinear second-order partial differential equation of mixed type …

    odu Repository record for Parallel Newton-Krylov-Schwarz Solvers for the Full Potential Flow Equation (opens in a new tab)

  17. Robust spectral coarse spaces for indefinite Helmholtz-type problems

    … of subdomains increase. Domain Decomposition Methods (DDMs) address these issues by splitting the global problem into local subproblems solved in parallel by direct methods. While DDMs may be used as iterative solvers, they have proven to be effective preconditioners within Krylov methods, …

    strathclyde Repository record for Robust spectral coarse spaces for indefinite Helmholtz-type problems (opens in a new tab)

  18. WaveHoltz: Theory and High Performance Applications

    … linear system on which general-purpose iterative methods perform poorly or fail outright, making specialized methods for the equation a challenging, active research topic. This dissertation advances one such method: WaveHoltz, which relates the Helmholtz equation to its time-dependent counterpart, …

    vt Repository record for WaveHoltz: Theory and High Performance Applications (opens in a new tab)

  19. Block Preconditioners for the Navier-Stokes Equations

    … Navier--Stokes equations based on preconditioned Krylov methods. These include physics-based methods, such as SIMPLE, and purely algebraic preconditioners based on the approximation of the Schur complement. All these techniques can be represented as approximate block factorization (ABF) type …

    maryland Repository record for Block Preconditioners for the Navier-Stokes Equations (opens in a new tab)

Page 1 of 2