John K. Reid

J. Comput. Phys., 2015

2011

Partial factorization of a dense symmetric indefinite matrix.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2011

2010

Design of a Multicore Sparse Cholesky Factorization Using DAGs.

[BibT_eX]

[DOI]

Jonathan D. Hogg

SIAM J. Sci. Comput., 2010

2009

An out-of-core sparse Cholesky solver.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2009

Algorithm 891: A fortran virtual memory system.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2009

2007

Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format.

[BibT_eX]

[DOI]

Fred G. Gustavson

Jerzy Wasniewski

ACM Trans. Math. Softw., 2007

Co-arrays in the next Fortran Standard.

[BibT_eX]

[DOI]

Robert W. Numrich

Sci. Program., 2007

2006

Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2006

The Design of a New Out-of-Core Multifrontal Solver.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006

2005

A fully portable high performance minimal storage hybrid format cholesky algorithm.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2005

2004

Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2004

An overview of Fortran 2003.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2004

Fortran Is Getting More and More Powerful.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing, 2004

2002

Implementing Hager's exchange methods for matrix profile reduction.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2002

Co-array Fortran for Full and Sparse Matrices.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing Advanced Scientific Computing, 2002

Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Reversing the row order for the row-by-row frontal method.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2001

1998

Writing a Multigrid Solver Using Co-array Fortran.

[BibT_eX]

[DOI]

Robert W. Numrich

Kieun Kim

Proceedings of the Applied Parallel Computing, 1998

1996

Remark on "Fast Floating-Point Processing in Common Lisp".

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1996

Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1996

The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1996

The array features.

[BibT_eX]

[DOI]

Comput. Stand. Interfaces, 1996

Two approaches to exeption handling in Fortran.

[BibT_eX]

Proceedings of the Quality of Numerical Software, 1996

1992

The advantages of Fortran 90.

[BibT_eX]

[DOI]

Computing, 1992

1991

The Fortran 90 Standard.

[BibT_eX]

Proceedings of the Programming Environments for High-Level Scientific Problem Solving, 1991

1990

Use of the P<sup>4</sup> and P<sup>5</sup> Algorithms for In-Core Factorization of Sparse Matrices.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 1990

1989

New crash procedures for large systems of linear constraints.

[BibT_eX]

[DOI]

Nicholas I. M. Gould

Math. Program., 1989

1984

On solving almost block diagonal (staircase) linear systems.

[BibT_eX]

[DOI]

Alan Jennings

ACM Trans. Math. Softw., 1984

1983

The Multifrontal Solution of Indefinite Sparse Symmetric Linear.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1983

Advances in the Exploitation of Sparsity.

[BibT_eX]

Proceedings of the Information Processing 83, 1983

1982

A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases.

[BibT_eX]

[DOI]

Math. Program., 1982

1981

Algorithm 578: Solution of Real Linear Equations in a Paged Virtual Store [F4].

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1981

Solving Large Full Sets of Linear Equations in a Paged Virtual Store.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1981

1979

Some Design Features of a Sparse Matrix Code.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1979

1978

Algorithm 529: Permutations To Block Triangular Form [F1].

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1978

An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1978

1977

A practicable steepest-edge simplex algorithm.

[BibT_eX]

[DOI]

Donald Goldfarb

Math. Program., 1977

1976

Two Numerical Analyst's View on the Draft Proposed ANS Fortran.

[BibT_eX]

[DOI]

Charles L. Lawson

Proceedings of the Portability of Numerical Software, 1976

1971

A Note on the Approximation of Plane Regions.

[BibT_eX]

[DOI]

Comput. J., 1971

The Solution of Large Sparse Unsymmetric Systems of Linear Equations.

[BibT_eX]

A. R. Curtis

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971

1969

Book Review: Semi-Groups of Operators and Approximation, by Paul L. Butzer and Hubert Berens, 1967; 318 pages.

[BibT_eX]

[DOI]

Comput. J., 1969

1968

On applying Householder transformations to linear least squares problems.

[BibT_eX]

M. J. D. Powell

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967

A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions.

[BibT_eX]

[DOI]

Comput. J., 1967

1966

A Method for Finding the Optimum Successive Over-Relaxation Parameter.

[BibT_eX]

[DOI]