Direct Sparse Factorization of Blocked Saddle Point Matrices

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7134)


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.


Bipartite Graph Multibody System Kinematic Constraint Data Layout Elimination Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefzbMATHGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Bodin, K., Lacoursière, C., Servin, M.: Constraint fluids. IEEE Trans. on Visualization and Computer Graphics (2010) (to appear)Google Scholar
  4. 4.
    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)zbMATHGoogle Scholar
  5. 5.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins Press, Baltimore (1996)zbMATHGoogle Scholar
  7. 7.
    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)MathSciNetCrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graph. SIAM J. Sci. Comp. 20(1), 359–392 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Marsden, J.E., West, M.: Discrete mechanics and variational integrators. Acta Numer. 10, 357–514 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Schenk, O., Gaertner, K.: On fast factorization pivoting methods for sparse symmetric indefinite systems. Elec. Trans. Numer. Anal. 23, 158–179 (2006)MathSciNetzbMATHGoogle Scholar
  13. 13.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.HPC2N/UMITUmeå UniversitySweden
  2. 2.Algoryx Simulation ABUmeåSweden
  3. 3.Department of Computing ScienceUmeå UniversitySweden

Personalised recommendations