Table of Contents Author Guidelines Submit a Manuscript
Science and Technology of Nuclear Installations
Volume 2017 (2017), Article ID 7072197, 10 pages
https://doi.org/10.1155/2017/7072197
Research Article

Development and Application of a New High-Efficiency Sparse Linear System Solver in the Thermal-Hydraulic System Analysis Code

1Xi’an Jiaotong University, 28 W. Xianning Rd, Xi’an, China
2Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu, China

Correspondence should be addressed to Jianqiang Shan; nc.ude.utjx.liam@nahsqj

Received 7 April 2017; Revised 3 July 2017; Accepted 22 August 2017; Published 19 September 2017

Academic Editor: Manmohan Pandey

Copyright © 2017 Li Ge et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Saad, “A flexible inner-outer preconditioned GMRES algorithm,” SIAM Journal on Scientific Computing, vol. 14, no. 2, pp. 461–469, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  2. H. A. van der Vorst, “BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems,” SIAM Journal on Scientific and Statistical Computing, vol. 13, no. 2, pp. 631–644, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  3. K. L. Ho and L. Greengard, “A fast direct solver for structured linear systems by recursive skeletonization,” SIAM Journal on Scientific Computing, vol. 34, no. 5, pp. A2507–A2532, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer, “A comparison of several bandwidth and profile reduction algorithms,” ACM Transactions on Mathematical Software (TOMS), vol. 2, no. 4, pp. 322–330, 1976. View at Publisher · View at Google Scholar · View at Scopus
  5. A. George and J. W. Liu, “Computer solution of large sparse positive definite systems,” Mathematics of Computation, vol. 39, no. 159, 1981. View at Google Scholar
  6. P. R. Amestoy, T. A. Davis, and I. S. Duff, “Algorithm 837: AMD, an approximate minimum degree ordering algorithm,” ACM Transactions on Mathematical Software, vol. 30, no. 3, pp. 381–388, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  7. A. George and J. W. Liu, “The evolution of the minimum degree ordering algorithm,” SIAM Review, vol. 31, no. 1, pp. 1–19, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  8. J. R. Gilbert and R. E. Tarjan, “The analysis of a nested dissection algorithm,” Numerische Mathematik, vol. 50, no. 4, pp. 377–404, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. P. R. Amestoy, X. S. Li, and S. Pralet, “Unsymmetric ordering using a constrained Markowitz scheme,” SIAM Journal on Matrix Analysis and Applications, vol. 29, no. 1, pp. 302–327, 2006/07. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. L. Siefken, SCDAP/RELAP5/MOD 3.3 Code Manual, Division of Systems Technology, Office of Nuclear Regulatory Research, US Nuclear Regulatory Commission, 2001, Siefken L. SCDAP/RELAP5/MOD 3.3 Code Manual[M]: Division of Systems Technology, Office of Nuclear Regulatory Research, US Nuclear Regulatory Commission, 2001.
  11. J. Ebert, “A versatile data structure for edge-oriented graph algorithms,” Communications of the ACM, vol. 30, no. 6, pp. 513–519, 1987. View at Publisher · View at Google Scholar · View at Scopus
  12. T. A. Davis, Direct Methods for Sparse Linear Systems, SIAM, Philadelphia, Pa, USA, 2006. View at Publisher · View at Google Scholar · View at MathSciNet