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 3 of 3 for “"Sparse linear solver"”.

  1. Iterative Solver Selection Techniques for Sparse Linear Systems

    … and engineering applications are dominated by linear algebra and depend on scalable solutions of 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 …

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

  2. Transforming Sparse Matrix Computations

    Sparse matrix computations are at the heart of many scientific applications and data analytics codes. The performance and memory usage of these codes depend heavily on their use of specialized sparse matrix data structures that only store the nonzero entries. However, such compaction is done using …

    toronto-retro Repository record for Transforming Sparse Matrix Computations (opens in a new tab)

  3. Scalable and resilient sparse linear solvers

    Solving a large and sparse system of linear equations is a ubiquitous problem in scientific computing. The challenges in scaling such solvers on current and future parallel computer systems are the high-cost of communication and the expected decrease in reliability of the hardware components. This …

    gatech Repository record for Scalable and resilient sparse linear solvers (opens in a new tab)