Scalable parallel sparse LU factorization methods on shared memory multiprocessors

@inproceedings{Schenk2000ScalablePS,
  title={Scalable parallel sparse LU factorization methods on shared memory multiprocessors},
  author={Olaf Schenk},
  year={2000}
}
This dissertation presents new techniques for solvmg large sparse sym¬ metric and structurally symmetric linear systems on shared memory high performance parallel computers, using Gaussian elimination with complete supernode pivoting Shared memory multiprocessors ha¬ ve recently attracted considerable interest m scientihc and engineering computing and the objective is to increase the parallel performance on these architectures The efficiencies of the algorithms are demonstrated for matrices… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Figures and tables from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 89 references

An asynchronous parallel supernodal algorithm to sparse partial pivoting

  • J. Demmel, J. Gilbert, X. Li.
  • SIAM Journal on Matrix Analysis and Applications…
  • 1999
Highly Influential
4 Excerpts

Modification of the Minimum-Degree algorithm by multiple elimination

  • J. Liu
  • ACM Transactions on Mathematical Software, vol…
  • 1985
Highly Influential
5 Excerpts

Planning of forming processes - time and cost reduction applying the simulation program INDEED

  • R. Sünkel, R. Pautsch
  • Proceedings of the 15th IMACS-World Congress…
  • 1997
Highly Influential
3 Excerpts

Nested dissection of a regular finite element mesh

  • A. George
  • SIAM Journal on Numerical Analysis, vol. 10, no…
  • 1973
Highly Influential
4 Excerpts

Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors

  • O. Schenk, K. Gärtaer, W. Fichtaer
  • BIT, vol. 40, no. 1, pp. 158-176, 2000.
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…