Parallel processing of sparse power system equations

Access Full Text

Parallel processing of sparse power system equations

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Generation, Transmission and Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Algorithms for parallel computation of the sparse matrix equations found in power system modelling are discussed and evaluated. A number of matrix factoring algorithms have been applied to a 60-busbar power system network with useful results. The greatest speed-up was achieved by a method that matches the number of parallel activities to the number of processors available. The PERT-based scheduling algorithm works well for small problems and should give useful results for larger networks.

Inspec keywords: parallel processing; digital simulation; PERT; matrix algebra; scheduling; power system analysis computing

Other keywords: parallel processing; PERT-based scheduling algorithm; busbar; sparse power system equations; digital simulation; matrix factoring algorithms; modelling

Subjects: Power engineering computing; Multiprocessing systems; Power systems

http://iet.metastore.ingenta.com/content/journals/10.1049/ip-gtd_19949756
Loading

Related content

content/journals/10.1049/ip-gtd_19949756
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading