By Topic

Tearing Algorithms for Large-Scale Network Programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Happ, H.H. ; General Electric Company ; Young, C.C.

In a recent survey taken among more than 50 electric utilities and power pools, more than 30 percent expressed a need for load flow and stability programs that would be capable of representing more than 2000 buses and 3000 branches. In fact, more than 20 percent indicated a need for 3000 bus programs within the next two years, and some wanted 4000 bus programs. When using methods for network solution such as the Newton-Raphson method, the amount of computer memory required by a 2000 bus program, even when sparsity is effectively exploited, is near the limit of very large computers. There is, then, an obvious need for tearing techniques that can be applied to such solution methods as the Newton-Raphson method, the Y-bus method, the factorized Z-bus method, and other equivalent methods.

Published in:

Power Apparatus and Systems, IEEE Transactions on  (Volume:PAS-90 ,  Issue: 6 )