| Publication | Date of Publication | Type |
|---|
| An out-of-core sparse Cholesky solver | 2017-05-19 | Paper |
| Partial factorization of a dense symmetric indefinite matrix | 2017-05-19 | Paper |
| Direct Methods for Sparse Matrices | 2016-10-12 | Paper |
| Design of a Multicore Sparse Cholesky Factorization Using DAGs | 2011-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3009031 | 2011-06-23 | Paper |
| An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems | 2010-03-29 | Paper |
| Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix | 2007-07-31 | Paper |
| Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding | 2005-07-22 | Paper |
| A fully portable high performance minimal storage hybrid format Cholesky algorithm | 2005-07-22 | Paper |
| Implementing Hager's exchange methods for matrix profile reduction | 2005-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821615 | 2004-10-20 | Paper |
| Reversing the row order for the row-by-row frontal method | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737845 | 2004-08-11 | Paper |
| Implicit scaling of linear least squares problems | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951614 | 2000-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267252 | 1999-09-23 | Paper |
| The impact of an efficient linear solver on finite element analyses | 1999-01-01 | Paper |
| The design of MA48 | 1998-04-02 | Paper |
| Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems | 1998-01-07 | Paper |
| Remark on “Fast floating-point processing in Common Lisp” | 1998-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888137 | 1996-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870477 | 1996-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692656 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4693137 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4026776 | 1993-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3999102 | 1993-01-23 | Paper |
| The advantages of Fortran 90 | 1993-01-11 | Paper |
| New crash procedures for large systems of linear constraints | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732027 | 1989-01-01 | Paper |
| The use of profile reduction algorithms with a frontal code | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028314 | 1987-01-01 | Paper |
| The Use of Linear Programming for the Solution of Sparse Sets of Nonlinear Equations | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723168 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740904 | 1986-01-01 | Paper |
| The Multifrontal Solution of Unsymmetric Sets of Linear Equations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3308952 | 1983-01-01 | Paper |
| A Note on the Work Involved in No-fill Sparse Matrix Factorization | 1983-01-01 | Paper |
| The Multifrontal Solution of Indefinite Sparse Symmetric Linear | 1983-01-01 | Paper |
| A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3914311 | 1981-01-01 | Paper |
| Solving Large Full Sets of Linear Equations in a Paged Virtual Store | 1981-01-01 | Paper |
| Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875341 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897923 | 1980-01-01 | Paper |
| Some Design Features of a Sparse Matrix Code | 1979-01-01 | Paper |
| An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix | 1978-01-01 | Paper |
| A practicable steepest-edge simplex algorithm | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127260 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4085486 | 1976-01-01 | Paper |
| A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations | 1976-01-01 | Paper |
| On George’s Nested Dissection Method | 1976-01-01 | Paper |
| On the Reduction of Sparse Matrices to Condensed Forms by Similarity Transformations | 1975-01-01 | Paper |
| Monitoring the stability of the triangular factorization of a sparse matrix | 1974-01-01 | Paper |
| A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination | 1974-01-01 | Paper |
| On the Convergence Rates of Variational Methods II Systems of Type B, C | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5180766 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5180767 | 1974-01-01 | Paper |
| On the Construction and Convergence of a Finite-Element Solution of Laplace's Equation | 1972-01-01 | Paper |
| On the Automatic Scaling of Matrices for Gaussian Elimination | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5667940 | 1972-01-01 | Paper |
| The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A” | 1972-01-01 | Paper |
| A note on the approximation of plane regions | 1971-01-01 | Paper |
| A Note on the Stability of Gaussian Elimination | 1971-01-01 | Paper |
| The Solution of Large Sparse Unsymmetric Systems of Linear Equations | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5657598 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590398 | 1969-01-01 | Paper |
| A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions | 1967-01-01 | Paper |
| A Method for Finding the Optimum Successive Over-Relaxation Parameter | 1966-01-01 | Paper |
| An Elliptic Eigenvalue Problem for a Reentrant Region | 1965-01-01 | Paper |
