MA48

The design of MA48: A code for the direct solution of sparse unsymmetric linear systems of equations We describe the design of a new code for the direct solution of sparse unsymmetric linear systems of equations. The new code utilizes a novel restructuring of the symbolic and numerical phases, which increases speed and saves storage without sacrifice of numerical stability. Other features include switching to full-matrix processing in all phases of the computation enabling the use of all three levels of BLAS, treatment of rectangular or rank-deficient matrices, partial factorization, and integrated facilities for iterative refinement and error estimation


References in zbMATH (referenced in 16 articles , 1 standard article )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Harwood, Stuart M.; Höffner, Kai; Barton, Paul I.: Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded (2016)
  2. Gould, Nicholas I.M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  3. Davis, Timothy A.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (2004)
  4. Duff, Iain S.; Scott, Jennifer A.: A parallel direct solver for large sparse highly unsymmetric linear systems (2004)
  5. Bollhöfer, Matthias: A robust and efficient ILU that incorporates the growth of the inverse triangular factors (2003)
  6. Scott, Jennifer A.: Parallel frontal solvers for large sparse linear systems (2003)
  7. Gupta, Anshul: Recent advances in direct methods for solving unsymmetric sparse systems of linear equations (2002)
  8. Bollhöfer, Matthias: A robust ILU with pivoting based on monitoring the growth of the inverse factors (2001)
  9. Asenjo, Rafael; Zapata, Emilio L.: Parallel pivots LU algorithm on the Cray T3E (1999)
  10. Davis, Timothy A.; Duff, Jain S.: A combined unifrontal/multifrontal method for unsymmetric sparse matrices (1999)
  11. Keeping, B.R.; Pantelides, C.C.: A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems (1998)
  12. Feehery, William F.; Tolsma, John E.; Barton, Paul I.: Efficient sensitivity analysis of large-scale differential-algebraic systems (1997)
  13. Duff, Iain S.: A review of frontal methods for solving linear systems (1996)
  14. Duff, I.S.; Reid, J.K.: The design of MA48: A code for the direct solution of sparse unsymmetric linear systems of equations (1996)
  15. Harrison, W.Jill; Pearson, K.R.; Powell, Alan A.: Features of multiregional and intertemporal AGE modelling with GEMPACK (1996)
  16. Scott, J.A.: An Arnoldi code for computing selected eigenvalues of sparse, real unsymmetric matrices (1995)