John K. Reid - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2011

Partial factorization of a dense symmetric indefinite matrixJohn K. Reid, Jennifer A. Scott. TOMS, 38(2):10, 2011. [doi]

2010

Design of a Multicore Sparse Cholesky Factorization Using DAGsJ. D. Hogg, John K. Reid, Jennifer A. Scott. siamsc, 32(6):3627-3649, 2010. [doi]

2009

An out-of-core sparse Cholesky solverJohn K. Reid, Jennifer A. Scott. TOMS, 36(2), 2009. [doi]

Algorithm 891: A fortran virtual memory systemJohn K. Reid, Jennifer A. Scott. TOMS, 36(1), 2009. [doi]

2007

Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid formatFred G. Gustavson, John K. Reid, Jerzy Wasniewski. TOMS, 33(1):8, 2007. [doi]

2006

The Design of a New Out-of-Core Multifrontal SolverJohn K. Reid, Jennifer A. Scott. para 2007: 598-607 [doi]

2005

A fully portable high performance minimal storage hybrid format cholesky algorithmBjarne Stig Andersen, John A. Gunnels, Fred G. Gustavson, John K. Reid, Jerzy Wasniewski. TOMS, 31(2):201-227, 2005. [doi]

2004

Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-codingShaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid. TOMS, 30(3):266-299, 2004. [doi]

An overview of Fortran 2003John K. Reid. SIGPLAN, 39(8):31-38, 2004. [doi]

Fortran Is Getting More and More PowerfulJohn K. Reid. para 2006: 33-42 [doi]

2002

Implementing Hager s exchange methods for matrix profile reductionJohn K. Reid, Jennifer A. Scott. TOMS, 28(4):377-391, 2002. [doi]

Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic DifferentiationMohamed Tadjouddine, Shaun A. Forth, John D. Pryce, John K. Reid. iccS 2002: 1077-1086 [doi]

2001

Reversing the row order for the row-by-row frontal methodJohn K. Reid, Jennifer A. Scott. nla, 8(1):1-6, 2001. [doi]

1990

5 Algorithms for In-Core Factorization of Sparse MatricesMario Arioli, Iain S. Duff, Nick I. M. Gould, John K. Reid. siamsc, 11(5):913-927, 1990. [doi]

1989

New crash procedures for large systems of linear constraintsNicholas I. M. Gould, John K. Reid. mp, 45(1-3):475-501, 1989. [doi]

1983

The Multifrontal Solution of Indefinite Sparse Symmetric LinearIain S. Duff, John K. Reid. TOMS, 9(3):302-325, 1983. [doi]

1982

A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming basesJohn K. Reid. mp, 24(1):55-69, 1982. [doi]

1977

A practicable steepest-edge simplex algorithmDonald Goldfarb, John K. Reid. mp, 12(1):361-371, 1977. [doi]

1969

Book Review: Semi-Groups of Operators and Approximation, by Paul L. Butzer and Hubert Berens, 1967; 318 pagesJohn K. Reid. cj, 12(1):71, 1969. [doi]

1967

A Note on the Least Squares Solution of a Band System of Linear Equations by Householder ReductionsJohn K. Reid. cj, 10(2):188-189, 1967. [doi]

1966

A Method for Finding the Optimum Successive Over-Relaxation ParameterJohn K. Reid. cj, 9(2):200-204, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL