سند علمی

Computation-free Preconditioners for the Parallel Solution of Power System Problems

چکیده

Solution of a set of linear equations Ax = b is a recurrent problem in power system analysis. Because of computational dependencies, direct methods have proven of limited value in both parallel and highly vectorized computing environments. The preconditioned conjugate gradient method has been suggested as a better alternative to direct methods. The preconditioning step itself is not particularly well suited to parallel processing. Partitioned inverse representations of A are better suited to high performance computation. However, obtaining the partitioned inverse matrices can be expensive. This paper describes two techniques for preconditioning based on the partitioned inverses where the preconditioner matrix is obtained directly from an incomplete factorization without the need for additional numerical computation. Experiments indicate a 50% reduction in solution time in a parallel environment.

اسناد مشابه

  • Computation-free Preconditioners for T H E Parallel Soijtion of Power System Problems

    سند علمی۱۹۹۷Hasan Dag

    Solution of a set of linear equations A x = b is a recurrent problem in power system analysis. Because of computational dependencies, direct methods have proven of limited value in both parallel and highly vectorized computing environments. The preconditioned conjugate gradient m

  • Computation-free preconditioners for the parallel solution of power system problems

    مقاله‌ی دسترسی آزاد۱۹۹۷IEEE Transactions on Power SystemsH.Dag, F.L.Alvarado
  • Parallel Solutions to Geometric Problems in the Scan Model of Computation

    سند علمی۱۹۹۴J. Comput. Syst. Sci.Guy E. Blelloch, James J. Little

    This paper describes several parallel algorithms that solve geometric problems. The algorithms are based on a vector model of computation|the scan-model. The purpose of this paper is both to show how the model can be used and to formulate a set of practical algorithms. The scan-m

  • Parallel Solution of Recurrence Problems

    سند علمی۱۹۷۴IBM Journal of Research and DevelopmentPeter M. Kogge

    . An mth-order recurrence problem is defined as the computation of the sequence x,; . ., x N , where xi =f(ai, xi , ; . and ai,is some vector of parameters. This paper investigates general algorithms for solving such problems on highly parallel computers. We show that if the recu

  • Parallel Solution of Covering Problems Super-Linear Speedup on a Small Set of Cores

    سند علمی۲۰۱۰Bernd Steinbach, Christian Posthoff

    This paper aims at better possibilities to solve problems of exponential complexity. Our special focus is the combination of the computational power of four cores of a standard PC with better approaches in the application domain. As the main example we selected the unate covering

  • Parallel Solution of Covering Problems Better Models and Algorithms

    سند علمی۲۰۱۰Bernd Steinbach, Christian Posthoff

    This paper aims at better possibilities to solve problems with exponential complexity. Our special focus is on the combination of using four cores of a standard PC together with better models in the application domain. As example we selected the unate covering problem, which must