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 4 of 4 for “"Solution of large sparse linear systems"”.

  1. Solution of Nonsymmetric Systems of Equations on a Multiprocessor

    We consider the iterative solution of large sparse linear systems of equations arising from elliptic and parabolic partial differential equations in two and three space dimensions. Specifically, we focus our attention on non-symmetric systems of equations whose eigenvalues lie on both sides of the …

    uiuc Repository record for Solution of Nonsymmetric Systems of Equations on a Multiprocessor (opens in a new tab)

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

    Large sparse matrices arise in many applications in science and engineering, 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 …

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

  3. New Sequential and Scalable Parallel Algorithms for Incomplete Factor Preconditioning

    The solution of large, sparse, linear systems of equations Ax = b is an important kernel, and the dominant term with regard to execution time, in many applications in scientific computing. The large size of the systems of equations being solved currently (millions of unknowns and equations) …

    odu Repository record for New Sequential and Scalable Parallel Algorithms for Incomplete Factor Preconditioning (opens in a new tab)

  4. A study of advanced computational methods: high performance generic sparse approximate inverse preconditioning and multilevel techniques

    In this thesis we introduce new generic sparse approximate inverse matrix techniques as well as multilevel techniques for solving general sparse linear systems. Such linear systems are derived mainly from the Finite Difference method, the Finite Element method, multigrid or multilevel methods. …

    greece Repository record for A study of advanced computational methods: high performance generic sparse approximate inverse preconditioning and multilevel techniques (opens in a new tab)