Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Amestoy, A. Buttari, J. L’Excellent, Théo Mary (2019)
Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore ArchitecturesACM Transactions on Mathematical Software (TOMS), 45
A. Wächter, L. Biegler (2006)
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 106
Xian-He Sun, Jianping Zhu (1995)
Performance Considerations of Shared Virtual Memory MachinesIEEE Trans. Parallel Distributed Syst., 6
R.P. O'Neill, A. Castillo, M.B. Cain (2012)
The IV Formulation and Linear Approximations of the AC Optimal Power Flow problem (OPF Paper 2)
S. Zaferanlouei, H. Farahmand, V. Vadlamudi, M. Korpås (2020)
BATTPOWER Toolbox: Memory-Efficient and High-Performance Multi-Period AC Optimal Power Flow SolverIEEE Transactions on Power Systems, 36
S. Abhyankar, G. Betrie, D. Maldonado, L. McInnes, Barry Smith, Hong Zhang (2020)
PETSc DMNetworkACM Transactions on Mathematical Software (TOMS), 46
J. Carpentier (1979)
Optimal Power FlowsVSC-FACTS-HVDC
S. Abhyankar, Barry Smith, E. Constantinescu (2013)
Evaluation of overlapping restricted additive schwarz preconditioning for parallel solution of very large power flow problems
This work presents a novel solution for accelerating the dynamic optimal power flow using a distributed‐memory parallelization approach. Unlike other two‐stage relaxation‐based approaches (such as ADMM), the proposed approach constructs the entire dynamic optimal power flow problem in parallel and solves it using a parallel primal‐dual interior point method with an iterative Krylov subspace linear solver with a block‐Jacobi preconditioning scheme. The parallel primal‐dual interior point method has been implemented in the open‐source portable, extensible toolkit for scientific computation (PETSc) library. The formulation, implementation, and numerical results on multicore computers to demonstrate the performance of the proposed approach on medium‐ to large‐scale networks with varying time horizons are presented. The results show that a significant speedup is achieved by using a block‐Jacobi preconditioner with an iterative Krylov subspace method for solving the dynamic optimal power flow problems.
IET Generation Transmission & Distribution – Wiley
Published: Feb 1, 2023
Keywords: power control; power generation dispatch; parallel programming; power system analysis computing; power system computation; power system economics
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.