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 64 for “"Sparse linear systems"”.

  1. Support graph preconditioners for sparse linear systems

    … to model physical phenomena give rise to large sparse linear systems. Such systems can be symmetric positive definite and can be solved by the preconditioned conjugate gradients method. In this thesis, we develop support graph preconditioners for symmetric positive definite matrices that arise …

    tamu Repository record for Support graph preconditioners for sparse linear systems (opens in a new tab)

  2. Topics in Optimization and Sparse Linear Systems

    … of a new graph-based preconditioner for large sparse Symmetric Positive Definite Diagonally Dominant (SPDDD) linear systems. These kinds of linear systems arise in the solution of scalar second order PDEs for Heat Transfer, Electrostatics, Electromagnetics, Ground Water Flow, and Diffusion …

    uiuc Repository record for Topics in Optimization and Sparse Linear Systems (opens in a new tab)

  3. 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)

  4. Resilience for Asynchronous Iterative Methods for Sparse Linear Systems

    … computational time attempting to solve large systems of linear equations; typically arising from discretizations of partial differential equations that are used to mathematically model various phenomena. The algorithms used to solve these problems are typically iterative in nature, and making …

    odu Repository record for Resilience for Asynchronous Iterative Methods for Sparse Linear Systems (opens in a new tab)

  5. Robust preconditioning for indefnite and Ill-conditioned sparse linear systems

    Linear systems originating from certain applications in the physical sciences can be challenging to solve by iterative methods. In the past, direct methods like Gaussian elimination have been often used to solve these systems, due to their robust nature. However, as problems are now often …

    umn Repository record for Robust preconditioning for indefnite and Ill-conditioned sparse linear systems (opens in a new tab)

  6. A family of preconditioned iterative solvers for sparse linear systems

    … to reevaluate the preconditioner. Finally, nonlinear EN-like methods are developed, and their convergence behavior is investigated.

    uiuc Repository record for A family of preconditioned iterative solvers for sparse linear systems (opens in a new tab)

  7. Robust High Performance Preconditioning Techniques for Solving General Sparse Linear Systems

    The solution of large and sparse linear systems is often required by numerical simulations in many fields of science and engineering. Solving these linear systems is usually the major bottleneck for large-scale applications as it represents the most time-consuming part of the computations. For …

    umn Repository record for Robust High Performance Preconditioning Techniques for Solving General Sparse Linear Systems (opens in a new tab)

  8. 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)

  9. Efficient Algorithms for the Exact Solution of Sparse Linear Systems in Time Proportional to Arithmetic Work

    Obtaining the exact rational solution of sparse systems of linear equations (SLEs), Ax =b, is a fundamental problem in mathematics, engineering, and computer science. The two most common tools used to solve these sparse linear systems are LU and Cholesky factorizations. However, despite the …

    tamu Repository record for Efficient Algorithms for the Exact Solution of Sparse Linear Systems in Time Proportional to Arithmetic Work (opens in a new tab)

  10. A GMRES Solver with ILU(k) Preconditioner for Large-Scale Sparse Linear Systems on Multiple GPUs

    … is spent on the solution of large-scale sparse linear systems. The Krylov subspace solvers and the ILU preconditioners are the most commonly used methods for solving such systems. Based on excellent parallel computing performance, GPUs have been a promising hardware architecture. The work …

    calgary Repository record for A GMRES Solver with ILU(k) Preconditioner for Large-Scale Sparse Linear Systems on Multiple GPUs (opens in a new tab)

  11. MPI-based Parallel Solution of Sparse Linear Systems Using Chio's Condensation Algorithm and Test Data from Power Flow Analysis

    <p>Solving sparse systems of linear equations permeates power system analysis. Newton-Raphson, decoupled, and fast decoupled algorithms all require the repeated solving of sparse systems of linear equations in order to capture the steady state operational conditions of the power system under test. …

    ut-knoxville Repository record for MPI-based Parallel Solution of Sparse Linear Systems Using Chio's Condensation Algorithm and Test Data from Power Flow Analysis (opens in a new tab)

  12. Parallelization and graphical user interface of AUTO94

    Studies two parallel algorithms for sparse linear systems in direct connection with AUTO94P. Stresses the communication schemes of these algorithms.

    concordia Download PDF for Parallelization and graphical user interface of AUTO94 (opens in a new tab)

  13. Preconditioning for standard and two-sided Krylov subspace methods

    … with the solution of large nonsymmetric sparse linear systems. The main focus is on iterative solution methods and preconditioning. Assuming the linear system has a special structure, a minimal residual method called TSMRES, based on a generalization of a Krylov subspace, is presented and …

    aalto Repository record for Preconditioning for standard and two-sided Krylov subspace methods (opens in a new tab)

  14. Stability of the Bruhat decomposition

    … Bruhat decomposition, known from the theory of linear algebraic groups, was discussed by Kolotilina and Y eremin in the context of solving large sparse linear systems. We give an algorithm for computing the left Bruhat decomposition and consider its application to solving non-sparse linear …

    uvic Repository record for Stability of the Bruhat decomposition (opens in a new tab)

  15. 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)

Page 1 of 4