| 2012 | ||
|---|---|---|
| c7 | Andreas Rauh, Luise Senkel, Harald Aschemann, Nedialko S. Nedialkov, John D. Pryce: Sensitivity analysis for systems of differential-algebraic equations with applications to predictive control and parameter estimation. CCA 2012: 1640-1645 | |
| 2008 | ||
| j10 | John D. Pryce, Emmanuel M. Tadjouddine: Fast Automatic Differentiation Jacobians by Compact LU Factorization. SIAM J. Scientific Computing 30(4): 1659-1677 (2008) | |
| c6 | R. Baker Kearfott, John D. Pryce, Nathalie Revol: Discussions on an Interval Arithmetic Standard at Dagstuhl Seminar 08021. Numerical Validation in Current Hardware Architectures 2008: 1-6 | |
| c5 | George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, John D. Pryce, Spencer Smith: Interval Subroutine Library Mission. Reliable Implementation of Real Number Algorithms 2008: 28-43 | |
| c4 | John D. Pryce, George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, Spencer Smith: Second Note on Basic Interval Arithmetic for IEEE754R. Numerical Validation in Current Hardware Architectures 2008 | |
| 2006 | ||
| j9 | John D. Pryce, George F. Corliss: Interval Arithmetic with Containment Sets. Computing 78(3): 251-276 (2006) | |
| c3 | George F. Corliss, R. Baker Kearfott, Nedialko S. Nedialkov, John D. Pryce, Spencer Smith: Interval Subroutine Library Mission. Reliable Implementation of Real Number Algorithms 2006 | |
| 2004 | ||
| j8 | Shaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid: Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. ACM Trans. Math. Softw. 30(3): 266-299 (2004) | |
| 2003 | ||
| c2 | Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce: Hierarchical Automatic Differentiation by Vertex Elimination and Source Transformation. ICCSA (2) 2003: 115-124 | |
| 2002 | ||
| c1 | Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce, John K. Reid: Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation. International Conference on Computational Science (2) 2002: 1077-1086 | |
| 2001 | ||
| j7 | Nedialko S. Nedialkov, Kenneth R. Jackson, John D. Pryce: An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE. Reliable Computing 7(6): 449-465 (2001) | |
| 1999 | ||
| j6 | John D. Pryce: A test package for Sturm-Liouville solvers. ACM Trans. Math. Softw. 25(1): 21-57 (1999) | |
| j5 | John D. Pryce: Algorithm 789: SLTSTPAK: : a test package for Sturm-Liouville solvers. ACM Trans. Math. Softw. 25(1): 58-69 (1999) | |
| 1989 | ||
| j4 | Wayne H. Enright, John D. Pryce: Corrigenda: "Two FORTRAN Packages for Assessing Initial Value Methods". ACM Trans. Math. Softw. 15(3): 287 (1989) | |
| 1987 | ||
| j3 | Wayne H. Enright, John D. Pryce: Two FORTRAN packages for assessing initial value methods. ACM Trans. Math. Softw. 13(1): 1-27 (1987) | |
| j2 | Wayne H. Enright, John D. Pryce: Algorithm 648: NSDTST and STDTST: routines for assessing the performance of IV solvers. ACM Trans. Math. Softw. 13(1): 28-34 (1987) | |
| 1985 | ||
| j1 | John D. Pryce: Experiences with Writing Library Software for an Attached Processor. Softw., Pract. Exper. 15(7): 705-714 (1985) | |
Colors in the list of coauthors
Last update Wed May 22 20:56:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page