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

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

1 2 next

  1. Martins Barros, Rafael; Guimarães Lage, Guilherme; de Andrade Lira Rabêlo, Ricardo: Sequencing paths of optimal control adjustments determined by the optimal reactive dispatch via Lagrange multiplier sensitivity analysis (2022)
  2. Bonaldi, Francesco; Brenner, Konstantin; Droniou, Jérôme; Masson, Roland: Gradient discretization of two-phase flows coupled with mechanical deformation in fractured porous media (2021)
  3. Bonaldi, Francesco; Brenner, Konstantin; Droniou, Jérôme; Masson, Roland; Pasteau, Antoine; Trenty, Laurent: Gradient discretization of two-phase poro-mechanical models with discontinuous pressures at matrix fracture interfaces (2021)
  4. Klapper, Isaac; Szyld, Daniel B.; Zhao, Kai: Metabolic networks, elementary flux modes, and polyhedral cones (2021)
  5. Pablos, Blanca; Gerdts, Matthias: Substructure exploitation of a nonsmooth Newton method for large-scale optimal control problems with full discretization (2021)
  6. Davis, Timothy A.; Duff, Iain S.; Nakov, Stojce: Design and implementation of a parallel Markowitz threshold algorithm (2020)
  7. Duff, Iain; Lopez, Florent; Nakov, Stojce: Sparse direct solution on parallel computers (2018)
  8. Magnusson, Fredrik; Åkesson, Johan: Symbolic elimination in dynamic optimization based on block-triangular ordering (2018)
  9. Harwood, Stuart M.; Höffner, Kai; Barton, Paul I.: Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded (2016)
  10. Gould, Nicholas I. M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  11. Boyle, Jonathan; Mihajlovi, Milan; Scott, Jennifer: HSL_MI20: an efficient AMG preconditioner for finite element problems in 3D (2010)
  12. Hu, Yifan; Scott, Jennifer: Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers. (2005)
  13. Davis, Timothy A.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (2004)
  14. Duff, Iain S.; Scott, Jennifer A.: A parallel direct solver for large sparse highly unsymmetric linear systems (2004)
  15. Bollhöfer, Matthias: A robust and efficient ILU that incorporates the growth of the inverse triangular factors (2003)
  16. Scott, Jennifer A.: Parallel frontal solvers for large sparse linear systems (2003)
  17. Gupta, Anshul: Recent advances in direct methods for solving unsymmetric sparse systems of linear equations (2002)
  18. Bollhöfer, Matthias: A robust ILU with pivoting based on monitoring the growth of the inverse factors (2001)
  19. Asenjo, Rafael; Zapata, Emilio L.: Parallel pivots LU algorithm on the Cray T3E (1999)
  20. Davis, Timothy A.; Duff, Jain S.: A combined unifrontal/multifrontal method for unsymmetric sparse matrices (1999)

1 2 next