Abstract
We consider direct methods for the numerical solution of linear systems with unsymmetric sparse matrices. Different strategies for the determination of the pivots are studied. For solving several linear systems with the same pattern structure we generate a pseudo code, that can be interpreted repeatedly to compute the solutions of these systems. The pseudo code can be advantageously adapted to vector and parallel computers. For that we have to find out the instructions of the pseudo code which are independent of each other. Based on this information, one can determine vector instructions for the pseudo code operations (vectorisation) or spread the operations among different processors (parallelisation). The methods are successfully used on vector and parallel computers for the circuit simulation of VLSI circuits as well as for the dynamic process simulation of complex chemical production plants.
This work was supported by the Federal Ministry of Education, Science, Research and Technology, Bonn, Germany under grants GA7FVB-3.0M370 and GR7FV1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
AspenTech: SPEEDUP, User Manual, Library Manual. Aspen Technology, Inc., Cambridge, Massachusetts, USA (1995)
Borchardt, J., Grund, F., Horn, D.: Parallelized numerical methods for large systems of differential-algebraic equations in industrial applications. Preprint No. 382, WIAS Berlin (1997); Surv. Math. Ind. (to appear)
Brenan, K.E., Campbell, S.L., Petzold, L.R.: Numerical solution of initial-value problems in differential-algebraic equations. North-Holland, New York (1997)
Davis, T.A., Duff, I.S.: An unsymmetric-pattern multifrontal method for sparse LU factorization. Tech. Report TR-94-038, CIS Dept., Univ. of Florida, Gainsville, FL (1994)
Demmel, J.W., Gilbert, J.R., Li, X.S.: SuperLU Users’ Guide, Computer Science Division U.C. Berkeley (1997)
Grund, F., Michael, T., Brüll, L., Hubbuch, F., Zeller, R., Borchardt, J., Horn, D., Sandmann, H.: Numerische Lösung groβer strukturierter DAE-Systeme der chemischen Prozeβsimulation. In: Hoffmann, K.-H., Jäger, W., Lohmann, T., Schunk, H. (eds.) Mathematik Schlüsseltechnologie für die Zukunft, pp. 91–103. Springer, Heidelberg (1997)
Kundert, K.S., Sangiovanni-Vincentelli, A.: Sparse User’s Guide, A Sparse Linear Equation Solver. Dep. of Electr. Engin. and Comp. Sc., U.C. Berkeley (1988)
Li, X.S.: Sparse Gaussian elimination on high performance computers. TechnicalReports UCB//CSD-96-919, Computer Science Division, U.C. Berkeley, Ph.D. dissertation (1996)
OpenMP: A proposed standard API for shared memory programming. White paper (1997), http://www.openmp.org
Yamamoto, F., Takahashi, S.: Vectorized LU decomposition algorithms for large-scale nonlinear circuits in the time domain. IEEE Trans. on Computer-Aided Design CAD-4, 232–239 (1985)
Zitney, S.E., Stadtherr, M.A.: Frontal algorithms for equation-based chemical process flowsheeting on vector and parallel computers. Computers chem. Engng. 17, 319–338 (1993)
Zitney, S.E., Brüll, L., Lang, L., Zeller, R.: Plantwide dynamic simulation on supercomputers: Modelling a Bayer distillation process. AIChE Symp. Ser. 91, 313–316 (1995)
Zlatev, Z.: On some pivotal strategies in Gaussian elimination by sparse technique. SIAM J. Numer. Anal. 17, 18–30 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grund, F. (1999). Direct Linear Solvers for Vector and Parallel Computers. In: Hernández, V., Palma, J.M.L.M., Dongarra, J.J. (eds) Vector and Parallel Processing – VECPAR’98. VECPAR 1998. Lecture Notes in Computer Science, vol 1573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703040_10
Download citation
DOI: https://doi.org/10.1007/10703040_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66228-0
Online ISBN: 978-3-540-48516-2
eBook Packages: Springer Book Archive