Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication12
  4. New parallel algorithm for solving sparse linear systems
 
  • Details
Options

New parallel algorithm for solving sparse linear systems

Date Issued
01-01-1995
Author(s)
Balasubramanya Murthy, K. N.
C Siva Ram Murthy 
Indian Institute of Technology, Madras
Abstract
In this paper, we consider the problem of solving a sparse system of linear equations using a new LU factorization based algorithm. The algorithm employs a new technique called two-sided factorization to produce the complete solution by solving only one triangular system after the factorization phase against the solution of two triangular systems in the existing LU factorization based methods. The effectiveness of the new algorithm in solving sparse linear systems on hypercubes is demonstrated using IEEE standard power system networks as benchmarks.
Volume
2
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback