Computational & Technology Resources
an online resource for computational,
engineering & technology publications 

CivilComp Proceedings
ISSN 17593433 CCP: 84
PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping, G. Montero and R. Montenegro
Paper 116
A Parallel Model Reduction Algorithm for Efficient Power Flow Prediction in Vibrating Systems X. Li
Department of Naval Architecture and Ocean Engineering, Dalian University of Technology, China X. Li, "A Parallel Model Reduction Algorithm for Efficient Power Flow Prediction in Vibrating Systems", in B.H.V. Topping, G. Montero, R. Montenegro, (Editors), "Proceedings of the Fifth International Conference on Engineering Computational Technology", CivilComp Press, Stirlingshire, UK, Paper 116, 2006. doi:10.4203/ccp.84.116
Keywords: power flow, Krylov subspace, model reduction, parallel implementation, adaptive interpolation.
Summary
This paper focuses on power flow prediction in vibrating systems over a frequency band of interest. An efficient method is proposed to predict power flow from finite element models based on the rational Krylov subspace projection [1]. It belongs to a family of wellestablished momentmatching techniques, which have been successfully used in circuit simulation [2], electromagnetic problems [3] and acoustic field computation [4,5]. In this paper, general formulation of power flow is derived as multipleinput multipleoutput transfer functions of linear timeinvariant systems. Instead of constructing the reducedorder models (ROMs) by directly projecting the original systems onto the rational Krylov subspaces, a matrixfree algorithm is developed to construct the ROMs from the interpolation values of the transfer functions and their higherorder derivatives [6]. The ROMs match the moments of the transfer functions of the original systems at interpolation frequencies to a specified order, which guarantees the preservation of power flow and its higherorder derivatives up to the same order. The matrixfree algorithm reduces both the computational cost and the memory requirement in constructing the ROMs.
The accuracy of the ROMs is mainly determined by the choice of interpolation frequencies. This paper investigates how to improve the accuracy of the ROMs by adaptive interpolation. After an initial ROM is constructed, its accuracy is improved by adding new interpolation points at the frequencies corresponding to large approximation error. Unfortunately, the exact error is not known without solving the original system. The results presented in this paper show that the residual norms provide a good way to identify the frequencies with large approximation error. Since the residual norms are obtained directly from the ROM, this approach minimizes the approximation error at a reasonable cost. The performance of the matrixfree algorithm can be enhanced by adapting it for simultaneous execution in multiple processes. The main process adaptively chooses interpolation frequencies according to the current error estimate, evenly distributes them among all processes to achieve load balancing, gathers computation results from the rest processes, and constructs the ROM according to the matrixfree algorithm. Interprocess communication is implemented by using the message passing interface [7]. Significant parallel speedup is achieved because the major computational task in each process is independent. Case studies are conducted on the testbeds from HarwellBoeing collection [8]. Four numerical examples are presented to illustrate the efficiency of adaptive interpolation, the effect of matchingmoment order, and the effect of different combinations of initial and updating sizes. For the ROMs of the same size, the one using more interpolation frequencies is usually more accurate. Initial and updating sizes also affect the accuracy of the resulting ROMs. It is observed that starting from a smallsized ROM and iterating many times with small updating size does not necessarily guarantee an accurate ROM. It is preferable to use a large initial size and update only one or two times in order to construct an accurate ROM efficiently. References
purchase the fulltext of this paper (price £20)
go to the previous paper 
