Abstract
We present a parallel algorithm for the direct factorization of sparse saddle-point matrices of moderate size coming from real-time multibody dynamics simulations. We used the specific structure of these problems both for a priori construction of supernodes and to avoid all dynamic permutations during factorization. For the latter, we present a technique we call “leaf swapping” which performs permutations of the supernodes in the elimination tree without any reference to numerical values. The results compare favorably with currently available high performance codes on our problem sets because of the high overhead necessary to process very large problems on increasingly complex supercomputers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amestoy, P.R., Duff, I.S., L’Excellent, J.Y.: Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer Methods in Applied Mechanics and Engineering 184(2–4), 501–520 (2000)
Amestoy, P.R., Enseeiht-Irit, Davis, T.A., Duff, I.S.: Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30(3), 381–388 (2004)
Bodin, K., Lacoursière, C., Servin, M.: Constraint fluids. IEEE Trans. on Visualization and Computer Graphics (2010) (to appear)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. McGraw-Hill, New York (1990)
Duff, I.S., Pralet, S.: Towards stable mixed pivoting strategies for the sequential and parallel solution of sparse symmetric indefinite systems. SIAM J. on Mat. Anal. and Appl. 29(3), 1007–1024 (2007)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins Press, Baltimore (1996)
Gould, N.I.M., Scott, J.A., Hu, Y.: A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. 33(2), 10 (2007)
Gupta, A., Karypis, G., Kumar, V.: Highly scalable parallel algorithms for sparse matrix factorization. IEEE Trans. on Par. and Dist. Syst. 8(5), 502–520 (1997)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graph. SIAM J. Sci. Comp. 20(1), 359–392 (1998)
Lacoursière, C.: Regularized, stabilized, variational methods for multibodies. In: Bunus, D.F.P., Führer, C. (eds.) The 48th Scandinavian Conference on Simulation and Modeling (SIMS 2007). Linköping Electronic Conference Proceedings, pp. 40–48. Linköping University Electronic Press, Linköping (2007)
Marsden, J.E., West, M.: Discrete mechanics and variational integrators. Acta Numer. 10, 357–514 (2001)
Schenk, O., Gaertner, K.: On fast factorization pivoting methods for sparse symmetric indefinite systems. Elec. Trans. Numer. Anal. 23, 158–179 (2006)
Schenk, O., Waechter, A., Hagemann, M.: Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization. Computational Optimization and Applications 36(2–3), 321–341 (2007)
Servin, M., Lacoursière, C., Nordfelth, F., Bodin, K.: Hybrid, multiresolution wires with massless frictional contacts. IEEE Transactions on Visualization and Computer Graphics (2010) (in press)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lacoursière, C., Linde, M., Sabelström, O. (2012). Direct Sparse Factorization of Blocked Saddle Point Matrices. In: Jónasson, K. (eds) Applied Parallel and Scientific Computing. PARA 2010. Lecture Notes in Computer Science, vol 7134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28145-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-28145-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28144-0
Online ISBN: 978-3-642-28145-7
eBook Packages: Computer ScienceComputer Science (R0)