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 22 articles , 1 standard article )

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

1 2 next

  1. Davis, Timothy A.; Duff, Iain S.; Nakov, Stojce: Design and implementation of a parallel Markowitz threshold algorithm (2020)
  2. Duff, Iain; Lopez, Florent; Nakov, Stojce: Sparse direct solution on parallel computers (2018)
  3. Magnusson, Fredrik; Åkesson, Johan: Symbolic elimination in dynamic optimization based on block-triangular ordering (2018)
  4. Harwood, Stuart M.; Höffner, Kai; Barton, Paul I.: Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded (2016)
  5. Gould, Nicholas I. M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  6. Boyle, Jonathan; Mihajlovi, Milan; Scott, Jennifer: HSL_MI20: an efficient AMG preconditioner for finite element problems in 3D (2010)
  7. Hu, Yifan; Scott, Jennifer: Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers. (2005)
  8. Davis, Timothy A.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (2004)
  9. Duff, Iain S.; Scott, Jennifer A.: A parallel direct solver for large sparse highly unsymmetric linear systems (2004)
  10. Bollhöfer, Matthias: A robust and efficient ILU that incorporates the growth of the inverse triangular factors (2003)
  11. Scott, Jennifer A.: Parallel frontal solvers for large sparse linear systems (2003)
  12. Gupta, Anshul: Recent advances in direct methods for solving unsymmetric sparse systems of linear equations (2002)
  13. Bollhöfer, Matthias: A robust ILU with pivoting based on monitoring the growth of the inverse factors (2001)
  14. Asenjo, Rafael; Zapata, Emilio L.: Parallel pivots LU algorithm on the Cray T3E (1999)
  15. Davis, Timothy A.; Duff, Jain S.: A combined unifrontal/multifrontal method for unsymmetric sparse matrices (1999)
  16. Keeping, B. R.; Pantelides, C. C.: A distributed-memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic equations. (1998) ioport
  17. Keeping, B. R.; Pantelides, C. C.: A distributed memory parallel algorithm for the efficient computation of sensitivities of differential-algebraic systems (1998)
  18. Feehery, William F.; Tolsma, John E.; Barton, Paul I.: Efficient sensitivity analysis of large-scale differential-algebraic systems (1997)
  19. Duff, Iain S.: A review of frontal methods for solving linear systems (1996)
  20. Duff, I. S.; Reid, J. K.: The design of MA48: A code for the direct solution of sparse unsymmetric linear systems of equations (1996)

1 2 next