| author | = | "T. Coleman and B. Garbow and J. More", | |
| title | = | "Software for Estimating Sparse Jacobian Matrices", | |
| journal | = | "ACM TOMS", | |
| volume | = | "10", | |
| number | = | "3", | |
| year | = | "1984", | |
| pages | = | "329-345"} |
| author | = | "E. Lusk and R. Overbeek", | |
| month | = | "June", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "A. Sameh and C. Kamath", | |
| title | = | "The Preconditioned Conjugate Gradient Algorithm on a Multiprocessor", | |
| number | = | "MCS-TM-28", | |
| month | = | "June", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "K. E. Hillstrom", | |
| title | = | "Installation Guide for JAKEF", | |
| number | = | "MCS-TM-17", | |
| month | = | "January", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "K. E. Hillstrom", | |
| title | = | "User Guide for JAKEF", | |
| number | = | "MCS-TM-16", | |
| month | = | "January", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and S. Chen and S. Hsiung", | |
| title | = | "Multiprocessing Linear Algebra Algorithms on the CRAY X-MP2: Experiences with Small Granularity", | |
| number | = | "MCS-TM-24", | |
| year | = | "1984", | |
| month | = | "February", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and A. Sameh", | |
| title | = | "On Some Parallel Banded System Solvers", | |
| number | = | "MCS-TM-27", | |
| month | = | "March", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and E. Lusk and R. Overbeek and B. Smith and D. Sorensen", | |
| title | = | "New Directions in Software fo rAdvanced Computer Architectures", | |
| month | = | "August", | |
| year | = | "1984", | |
| number | = | "MCS-TM-32", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "D. C. Sorensen", | |
| title | = | "Analysis of Pairwise Pivoting in Gaussian Elimination", | |
| number | = | "MCS-TM-26", | |
| year | = | "1984", | |
| month | = | "February", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "D. C. Sorensen", | |
| title | = | "Buffereing for Vector Performance on a Pipelined MIMD Machine", | |
| number | = | "MCS-TM-29", | |
| year | = | "1984", | |
| month | = | "April", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and D. Sorensen", | |
| title | = | "A Paralle Linear Algebra Library for the Denelcor HEP", | |
| month | = | "October", | |
| year | = | "1984", | |
| number | = | "MCS-TM-33", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and J. DuCroz and S. Hammarlling and R. Hanson", | |
| title | = | "A Proposal for an Extended Set of Fortran Basic Linear Algebra Subprograms", | |
| year | = | "1984", | |
| number | = | "MCS-TM-41", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "P. Messina and B. Smith and J. Dongarra", | |
| title | = | "Proceedings form the Argonne Workshop on Programing the Next Generation of Supercomputers", | |
| year | = | "1984", | |
| number | = | "MCS-TM-34", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and L. Kaufman and S. Hammarlling", | |
| title | = | "Squeezing the Most out of Eigenvalue Solvers on High Performance Computers", | |
| year | = | "1984", | |
| number | = | "MCS-TM-46", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and E. Grosse", | |
| title | = | "Distribution of Mathematical Software via Electronic Mail", | |
| year | = | "1984", | |
| number | = | "MCS-TM-48", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and T. Hewitt", | |
| title | = | "Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4", | |
| month | = | "August", | |
| year | = | "1985", | |
| number | = | "MCS-TM-55", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "H. G. Kaper and M. K. Kwong and F. V. Atkinson", | |
| title | = | "An Oscillation Criterion for Linear SEcond-Order Differential Systems", | |
| booktitle | = | "Proceedings of the American Mathematical Society", | |
| volume | = | "94", | |
| number | = | "1", | |
| year | = | "1985", | |
| month | = | "May"} |
| author | = | "I. S. Duff and C. W. Gear", | |
| title | = | "Computing the Structural Index", | |
| journal | = | "SIAM J. Alg. Disc. Meth.", | |
| volume | = | "7", | |
| issue | = | "4", | |
| year | = | "1986"} |
| author | = | "I. Duff and A. Erisman and C. Gear and J. Reid", | |
| title | = | "Some Remarks on Inverses of Sparse Matrices", , CRAY X-MP-4", | |
| year | = | "1985", | |
| number | = | "MCS-TM-51", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "I. Duff", | |
| title | = | "Comments on the Solution of Sparse Linear Equations", CRAY X-MP-4", | |
| month | = | "September", | |
| year | = | "1985", | |
| number | = | "MCS-TM-58", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "I. S. Duff", | |
| title | = | "Use of Vector and Parallel Computers in the Solution of Large, Sparse Linear Equations", CRAY X-MP-4", | |
| month | = | "November", | |
| year | = | "1986", | |
| number | = | "MCS-TM-84", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Implementation of Some Concurrent Algorithms afor Matrix Factorization", | |
| journal | = | {Parallel Computing", | |
| volume | = | "3", | |
| year | = | "1986", | |
| pages | = | "25-32"} |
| author | = | "M. Minkoff and K. E. Hillstrom and S. D. King and R. Crane", | |
| title | = | "Performance Modelling of Large-Grained Parallelism", | |
| number | = | "MCS-TM-63", | |
| month | = | "March", | |
| year | = | "1986", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra and I. Duff", | |
| title | = | "Advanced Architecture Computers", CRAY X-MP-4", | |
| month | = | "October", | |
| year | = | "1985", | |
| number | = | "MCS-TM-57", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem", CRAY X-MP-4", | |
| month | = | "January", | |
| year | = | "1986", | |
| number | = | "MCS-TM-62", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "SCHEDULE: tools for Developing and Analyzing Parallel Fortran Programs", CRAY X-MP-4", | |
| month | = | "November", | |
| year | = | "1986", | |
| number | = | "MCS-TM-86", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. J. Dongarra and L. Johnsson", | |
| title | = | "Solving Banded Systems o n a Parallel Processor", , CRAY X-MP-4", | |
| month | = | "November", | |
| year | = | "1986", | |
| number | = | "MCS-TM-85", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "H. Kaper and M. Kwong and A. Zettl", | |
| title | = | "Singular Sturm-Liouville Problems with Nonnegative and Indefinite Weights", | |
| journal | = | Monatshefte fur Mathematik", | |
| month | = | "April", | |
| year | = | "1984", | |
| volume | = | "97", | |
| pages | = | "177-189", |
| author | = | "H. Kaper and M. Kwong and Z. Zettl", | |
| title | = | "Regularizing Transformations for Certain Singular Sturm-Liouville Value Problems", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | "15", | |
| number | = | "5", | |
| year | = | "1984" |
| author | = | "H. Kaper and M. Kwong and C. Lekkeerkerker and A. Zettl", | |
| title | = | "Full and Partial Range Eigenfunctions Expansions for Sturm-Liouville Problems with Indefinite Weights", | |
| journal | = | "Proc. Royal Society of Edinburgh", | |
| volume | = | "98A", | |
| pages | = | "68-88", | |
| year | = | "1984", |
| author | = | "H. Kaper and G. Leaf and B. Matkowsky and M. Matalon", | |
| title | = | "The Stability of Plane Flames Attached to a Flameholder", | |
| journal | = | "Journal of Combustion Science and Tech.", | |
| volume | = | 43", | |
| year | = | "1985", | |
| pages | = | "271-286", |
| author | = | "G. Chisholm and J. Kljaich and B. Smith and A. Wojcik"} | |
| title | = | "Preliminary Report on the Formal Analysis of the Draper FTP Hardware and Software Using FTP", | |
| year | = | "1985", | |
| month | = | "September", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "MCS-TM-59"} |
| author | = | "P. Frederickson and R. Jones and B. Smith", | |
| title | = | "Synchronization and Control of Parallel Algorithms", | |
| journal | = | "Parallel Computing", | |
| volume | = | "2", | |
| year | = | "1985", | |
| pages | = | "255-264"} |
| author | = | "H. G. Kaper and G. K .leaf and B. J. Matkowsky", | |
| title | = | "On the Stability of the Porous Plug Burner Flame", | |
| journal | = | "Combustin Sci. and Tech.", | |
| year | = | "1986", | |
| volume | = | "47", | |
| pages | = | "93-101", | |
| year | = | "1986", |
| author | = | "W. R. Cowell", | |
| title | = | "The Toolpack Tools ISTUD, ISTCD, and ISTSB: Guide for Users and Installers", | |
| year | = | "1986", | |
| month | = | "June", | |
| institution | = | "Argonne National LAbortory", | |
| number | = | "MCS-TM-74"} |
| author | = | "D. Sorensen and M. Heath", | |
| title | = | "A Pipelined Givens Method for Computing the QR Factorizatin of a Sparse Matrix", | |
| journal | = | "Linear Algebra and Its Applications", | |
| volume | = | :77", | |
| pages | = | "189-203", | |
| year | = | "1986"} |
| author | = | "B. Gabutti and J. Lyness", | |
| title | = | "Some Generalizations of the Euler-Knopp Transformation", | |
| journal | = | "Numerische Mathematik", | |
| volume | = | "48", | |
| year | = | "1986", | |
| pages | = | "199-220"} |
| author | = | "J. N. Lyness and G Giunta", | |
| title | = | "A Modification of the Weeks Method for Numerical Inversion of the Laplace Transform", | |
| volume | = | "47", | |
| journal | = | "Mathematics of Computation", | |
| year | = | "1986", | |
| volume | = | "47", | |
| number | = | "175", | |
| pages | = | "313-322"} |
| author | = | "H. Kpaer and C. Lekkerkerker", | |
| title | = | "Spectral Analysis of the Multigroup Transport Operator", | |
| journal | = | "Tansport Theory and Statistical Physics", | |
| volume | = | "15", | |
| number | = | :4", | |
| pages | = | "411-447", | |
| year | = | "1986", |
| author | = | "H. Kaper and M. K. Kwong", | |
| title | = | "Asympototics of the Titchmarsh-Weyl m-coefficient for Integrable Potentials", | |
| year | = | "1986", | |
| pages | = | "347-358", | |
| volume | = | "103A", |
| author | = | "F. V. Atkinson and A. B. Mingarelli", | |
| title | = | "Asymptotics of the Number of Zeros and the Eigenvalues of General Weighted Sturm-Liouville Problems", | |
| journal | = | "J. fuer Reine und Angewandte Mathematik", | |
| volume | = | "375/376", | |
| year | = | "1987", | |
| pages | = | "380-393"} |
| author | = | J. Clausing and R. hagstrom and E. Lusk and R. overbeek", | |
| title | = | "A Technique for Achieving Portability among Multiprocessors: Implementation on the Lemur", | |
| journal | = | "Parallel Computing", | |
| volume | = | "2", | |
| year | = | "1985", | |
| pages | = | "137-162"} |
| author | = | "K. E. Jordan", | |
| title | = | "The Good, the Bad, and the Ugly: Comparing High-Speed Computer Systems", | |
| number | = | "MCS-TM-196", | |
| month | = | "December", | |
| year | = | "1987"} |
| author | = | "F. V. Atkinson and L. A. Peletier", | |
| title | = | "Elliptic Equations with Nearly Critical Growth", | |
| journal | = | "J. Diff. Eq.", | |
| volume | = | "70", | |
| issue | = | "3", | |
| year | = | "1987", | |
| pages | = | "349-365"} |
| author | = | "F. V. Atkinson and L. A. Peletier", | |
| title | = | "Elliptic Equations with Critical Exponents", | |
| booktitle | = | "Nonlinear Parabolic equations: Qualitative Properties of Solutions, Pitman Res. Notes in Math. 149", | |
| editor | = | "L. Boccardo and A. Tesei", | |
| publisher | = | "Longman and Wiley", | |
| year | = | "1987", | |
| pages | = | "13-21"} |
| author | = | "F. V. Atkinson and L. A. Peletier", | |
| title | = | "Radial Similarity Solutions of a Parabolic Equation", | |
| booktitle | = | "Nonlinear Parabolic Equations: Qualitative Properties of Solutions, Pitman Res. Notes in Math. 149", | |
| editor | = | " L. Boccardo and A. Tesei", | |
| publisher | = | "Longman and Wiley", | |
| year | = | "1987", | |
| pages | = | "9-12"} |
| author | = | "F. V. Atkinson and Zhang Shunian", | |
| title | = | "Asymptotic Behavior of Solutions of Linear Delay Equations", | |
| journal | = | "Acta Mathematica Sinica", | |
| volume | = | "n.s. 3", | |
| issue | = | " 4", | |
| year | = | "1987", | |
| pages | = | "289-300"} |
| author | = | "A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| title | = | "Adaptive Pseudo-Spectral Computation of Cellular Flames Stabilized by a Point Source", | |
| journal | = | "App. Math. Lett.", | |
| volume | = | "1", | |
| issue | = | "1", | |
| year | = | "1988", | |
| pages | = | "19-24"} |
| author | = | "J. M. Boyle and K. W. Dritz and M. N. Muralidharan and R. J. Taylor", | |
| title | = | "Deriving Sequential and Parallel Programs from Pure LISP Specifications by Program Transformation", | |
| booktitle | = | "Program Specification and Transformation (Proc. of the IFIP TC2/WG 2.1 Working Conference on Program Specification and Transformation, Bad Tolz, Germany, April 15-17, 1986)", | |
| editor | = | " L. G. L. T. Meertens", | |
| publisher | = | "North-Holland", | |
| address | = | "New York", | |
| year | = | "1987"} |
| author | = | "J. Boyle and R. Butler and T. Disz and B. Glickfeld and E. Lusk and R. Overbeek and J. Patterson and R. Stevens", | |
| title | = | "Portable Programs for Parallel Processing", | |
| publisher | = | "Holt, Rinehart, and Winston", | |
| address | = | "New York", | |
| year | = | "1987"} |
| author | = | "J. M. Boyle and M. N. Muralidharan", | |
| title | = | "Program Reusability through Program Transformation", | |
| journal | = | "IEEE Transactions on Software Engineering", | |
| volume | = | "SE-10", | |
| issue | = | "5", | |
| year | = | "1984", | |
| pages | = | "574-588", | |
| note | = | "Reprinted in: Tutorial: Software Reusability, ed. Peter Freeman, IEEE Computer Society, Washington, D.C., 1987"} |
| author | = | "W. J. Cody", | |
| title | = | "Software for Special Functions", | |
| number | = | "MCS-TM-37", | |
| month | = | "October", | |
| year | = | "1984", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. M. Boyle and K. W. Dritz and M. N. Muralidharan and R. Taylor", | |
| title | = | "Deriving Sequential and Parallel Programs from Pure LISP Specifications by Program Transformation", | |
| booktitle | = | "Program Specification and Transformation (Proceedings of the IFIP TC2/WG2.1 Working Conference on Program Specification and Transformation, Bad-Tolz, FRG, 15-17 April 1986)", | |
| editor | = | "L. G. L. T. Meertens", | |
| publisher | = | "North-Holland", | |
| address | = | "Amsterdam", | |
| year | = | "1988"} |
| author | = | "P. H. Calamai and J. J. More'", | |
| title | = | "Quasi-Newton Updates with Bounds", | |
| journal | = | "SIAM J. Num. Anal.", | |
| volume | = | "24", | |
| year | = | "1987", | |
| pages | = | "1434-1441"} |
| author | = | "P. H. Calamai and J. J. More'", | |
| title | = | "Projected Gradient Methods for Linearly Constrained Problems", | |
| journal | = | "Math. Programming", | |
| volume | = | "39 ", | |
| year | = | "1987", | |
| pages | = | "93-116"} |
| author | = | "R. C. Y. Chin and G. W. Hedstrom and J. S. Scroggs and D. C. Sorensen", | |
| title | = | "Parallel Computation of a Domain Decomposition Method", | |
| booktitle | = | "Advances in Computer Methods for Partial Differential Equations VI", | |
| editor | = | "R. Vichnevetsky and R. S. Stepleman", | |
| organization | = | "IMACS", | |
| address | = | "New Brunswick, NJ", | |
| year | = | "1987"} |
| author | = | "W. J. Cody", | |
| title | = | "{SPECFUN}---A Portable Special Function Package", | |
| booktitle | = | "Microcomputers in Large-Scale Scientific Computing", | |
| editor | = | " A. Wouk", | |
| publisher | = | "SIAM", | |
| addrress | = | "Philadelphia", | |
| year | = | "1987"} |
| author | = | "R. W. Colley and S. E. Seeman and D. E. Smith and J. R. Gabriel and E. L. Lusk and R. A. Overbeek", | |
| title | = | "An Entity-Relationship Model for Nuclear Power Plants", | |
| booktitle | = | "Proceedings of the 1985 International Topical Meeting on Computer Applications for Nuclear Power Plant Operation and Control", | |
| publisher | = | "Tri-Cities", | |
| address | = | "Washington, D.C.", | |
| year | = | "1986", | |
| pages | = | "765-770"} |
| author | = | "W. R. Cowell and C. P. Thompson", | |
| title | = | "Transforming Fortran DO Loops to Improve Performance on Vector Architectures", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "12", | |
| issue | = | "4", | |
| year | = | "1986", | |
| pages | = | "324-353"} |
| author | = | "J. J. Dongarra", | |
| title | = | "Experimental Parallel Computing Architectures", | |
| publisher | = | "North-Holland", | |
| year | = | "1987"} |
| author | = | "J. J. Dongarra and L. Johnssonu", | |
| title | = | "Solving Banded Systems on a Parallel Processor", | |
| journal | = | "Parallel Computing", | |
| volume | = | "5", | |
| year | = | "1987", | |
| pages | = | "219-246"} |
| iauthor | = | "J. J. Dongarra and J. Martin and J. Worlton", | |
| title | = | "Evaluating Computers and Their Performance: Perspectives, Pitfalls, and Paths", | |
| journal | = | "IEEE Spectrum", | |
| year | = | "1987"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem", | |
| journal | = | "SIAM J. of Sci. and Stat. Comp.", | |
| volume | = | "8", | |
| issue | = | "2", | |
| year | = | "1987", | |
| year | = | "139-154"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "On the Implementation of a Fully Parallel Algorithm for the Symmetric Eigenvalue Problem", | |
| Journal | = | "SPIE, Advanced Algorithms and Architectures for Signal Processing", | |
| volumer | = | "696", | |
| year | = | "1986", | |
| pages | = | "45-53"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "A Portable Environment for Developing Parallel FORTRAN Programs", | |
| journal | = | "Parallel Computing", | |
| volume | = | "5", | |
| year | = | "1987", | |
| pages | = | "175-186"} |
| author | = | "F. B. Hanson and A.-M. Wazwaz", | |
| title | = | "Singular and Turning Point Resonance: Small Perturbations - Big Effects", | |
| journal | = | "Applied Mathematics Letters", | |
| year | = | "1988"} |
| author | = | "W. J. Cody", | |
| title | = | "Algorithm 665 - MACHAR: A Subroutine to Dynamically Determine Machine parameters", | |
| journal | = | "ACM TOME:", | |
| volume | = | "14", | |
| issue | = | "4", | |
| year | = | "1988", | |
| pages | = | "303-311"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Asymptotics of the Titchmarsh-Weyl m-coefficient for Integrable Potentials", | |
| booktitle | = | "Proc. of the Royal Soc. of Edinburgh", | |
| volume | = | "103A", | |
| year | = | "1986", | |
| pages | = | "347-358"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Oscillation Theory for Linear Second-Order Differential Systems", | |
| booktitle | = | "Canadian Mathematical Society Conf. Proc.", | |
| volume | = | "8", | |
| year | = | "1987", | |
| pages | = | "187-197"} |
| author | = | "H. G. Kaper and Man Kam Kwong and A. Zettl", | |
| title | = | "Characterization of the Friedrichs Extensions of Singular Sturm-Liouville Expressions", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | "17", | |
| issue | = | "4", | |
| year | = | "1986", | |
| pages | = | "772-777"} |
| author | = | "H. G. Kaper and G. K. Leaf and S. B. Margolis and B. J. Matkowsky", | |
| title | = | "On Nonadiabatic Condensed Phase Combustion", | |
| journal | = | "Combust. Sci. and Tech.", | |
| volume | = | "53", | |
| year | = | "1987", | |
| pages | = | "289-314"} |
| author | = | "H. G. Kaper and G. K. Leaf and B. J. Matkowsky and W. E. Olmstead", | |
| title | = | "Dynamics of Nonadiabatic Premixed Flames in a Gravitational Field", | |
| journal | = | "SIAM J. Appl. Math.", | |
| volume | = | "47", | |
| issue | = | "3", | |
| month | = | "June", | |
| year | = | "1987", | |
| pages | = | "544-555" |
| author | = | "H. G. Kaper and B. E. Spellman", | |
| title | = | "Best Constants in Norm Inequalities for the Difference Operator", | |
| journal | = | "Trans. Amer. Math. Soc. ", | |
| volume | = | "299", | |
| month | = | " January", | |
| year | = | "1987", | |
| pages | = | " 351-372" |
| author | = | "Man Kam Kwong and R. Bapat", | |
| title | = | "A Generalization of $A . A ^{-1}$ >= I", | |
| journal | = | "Linear Alg. Appl.", | |
| volume | = | "93", | |
| year | = | "1987", | |
| pages | = | "107-112" |
| author | = | "Man Kam Kwong and J. W. Hooker and W. T. Patula", | |
| title | = | "Oscillatory Second-order Linear Difference Equations and Riccati Equations", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | "18", | |
| year | = | "1987", | |
| pages | = | "54-63" |
| author | = | "Man Kam Kwong and W. T. Patula", | |
| title | = | "Comparison Theorems for First-Order Linear Delay Equations", | |
| journal | = | "J. Diff. Eq.", | |
| volume | = | "70", | |
| year | = | "1987", | |
| pages | = | "275-292" |
| author | = | "Man Kam Kwong and James S.W. Wong", | |
| title | = | "Oscillation of Emden-Fowler Systems", | |
| journal | = | "Differential and Integral Equations", | |
| volume | = | "1", | |
| number | = | "2", | |
| month | = | "April", | |
| year | = | "1988", | |
| pages | = | "133-141" |
| author | = | "Man Kam Kwong and A. Zettl", | |
| title | = | "Extremals in Landau's Inequality for the Difference Operator", | |
| journal | = | "Proc. Royal Soc. Edinburgh", | |
| volume | = | "107A", | |
| year | = | "1987", | |
| pages | = | " 299-311" |
| author | = | "Man Kam Kwong and A. Zettl", | |
| title | = | "Landau's Inequality for the Differential and Difference Operators, General Inequalities V", | |
| booktitle | = | "Proc. of the Conf. on Inequalities at Oberwolfach 1986", | |
| publisher | = | "Birkhaeuser-Verlag", | |
| address | = | "Basel", | |
| year | = | "1987", | |
| pages | = | "367-379" |
| author | = | "G. K. Leaf and M. Minkoff and J. C. Diaz", | |
| title | = | "Preconditioned Iterative Methods for Partial Differential Equations", | |
| booktitle | = | "Advances in Computer Methods for Partial Differential Equations VI", | |
| editor | = | "R. Vichnevetsky and R. Stepleman", | |
| publisher | = | "IMACS", | |
| year | = | "1987", | |
| pages | = | "551-555" |
| author | = | "C. G. Lekkerkerker and H. G. Kaper", | |
| title | = | "Spectral Analysis of the Multigroup Transport Operator", | |
| journal | = | "Transport Theory and Stat. Physics", | |
| volume | = | "15", | |
| number | = | "4", | |
| year | = | "1986", | |
| pages | = | "411-447" |
| author | = | "B. Lucier and R. Overbeek", | |
| title | = | "A Parallel Adaptive Numerical Scheme for Hyperbolic Systems of Conservation Laws", | |
| journal | = | "SIAM J. on Sci. and Stat. Comp.", | |
| volume | = | " 8", | |
| month | = | "March", | |
| year | = | "1987", | |
| pages | = | "203-219" |
| author | = | "E. L. Lusk and R. A. Overbeek", | |
| title | = | "The Role of Multiprocessors in the Nuclear Power Industry: Comments on Determining Factors", | |
| booktitle | = | "ANS", | |
| address | = | "La Grange Park, Illinois", | |
| year | = | "1986", | |
| pages | = | "771-775" |
| author | = | "E. Lusk", | |
| title | = | "Review of The Computer Modelling of Mathematical Reasoning, by Allen Bundy", | |
| journal | = | "SIAM Review", | |
| volume | = | "29", | |
| number | = | "3", | |
| year | = | "1987" |
| author | = | "J. N. Lyness", | |
| title | = | "Some Quadrature Rules for Finite Trigonometric and Related Integrals", | |
| booktitle | = | "Numerical Integration", | |
| editor | = | "P. Keast and G. Fairweather", | |
| publisher | = | "D. Reidel Publishing Company", | |
| address | = | "North-Holland", | |
| year | = | "1987", | |
| pages | = | "17-33" |
| author | = | "J. N. Lyness and E. de Doncker-Kapenga", | |
| title | = | "On Quadrature Error Expansions: Part I", | |
| journal | = | "J. Comp. and Appl. Math.", | |
| volume | = | "17", | |
| year | = | "1987", | |
| pages | = | "131-149" |
| author | = | "J. N. Lyness and T. J. Kaper", | |
| title | = | "Calculating Fourier Transforms of Long-Tailed Functions", | |
| journal | = | "SIAM J. Sci. Stat. Comput.", | |
| volume | = | "8", | |
| number | = | " 6", | |
| month | = | "November", | |
| year | = | "1987", | |
| pages | = | "1005-1011" |
| author | = | "W. McCune and L. Wos", | |
| title | = | "A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "3", | |
| number | = | "1", | |
| year | = | "1987", | |
| pages | = | "91-107" |
| author | = | "M. Minkoff", | |
| title | = | "Approaches to Optimization/Simulation Problems", | |
| journal | = | "Applied Numerical Mathematics", | |
| volume | = | "3", | |
| year | = | "1987", | |
| pages | = | "453-466" |
| author | = | "Z. Nagy and R. H. Land and M. Minkoff and G. K. Leaf", | |
| title | = | "Applicability of the Potential Step Relaxation Technique in the Nonlinear Current Density-Overpotential Range", | |
| journal | = | "Electrochimica ACTA", | |
| volume | = | "32", | |
| year | = | "1987", | |
| pages | = | "1777-1782" |
| author | = | "R. Stevens", | |
| title | = | "Some Experiments in Nonassociative Ring Theory with an Automated Theorem Prover", | |
| journal | = | "J. Automated REasoning", | |
| volume | = | "3", | |
| number | = | "2", | |
| month | = | "June", | |
| year | = | "1987", | |
| pages | = | " 211-221" |
| author | = | "L. Wos", | |
| title | = | "Automated Reasoning: 33 Basic Research Problems", | |
| publisher | = | "Prentice-Hall", | |
| address | = | "Englewood Cliffs, N.J.", | |
| year | = | "1987" |
| author | = | "L. Wos", | |
| title | = | "The Problem of Extending the Set of Support Strategy", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "3", | |
| year | = | "1987", | |
| pages | = | "319-328" |
| author | = | "L. Wos", | |
| title | = | "The Problem of Choosing the Inference Rule to Employ", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "3", | |
| number | = | "2", | |
| month | = | "June", | |
| year | = | "1987", | |
| pages | = | "201-209" |
| author | = | "L. Wos", | |
| title | = | "Some Obstacles to the Automation of Reasoning, and the Problem of Redundant Information", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "3", | |
| issue | = | "1", | |
| year | = | "1987", | |
| pages | = | "81-90" |
| author | = | "L. Wos", | |
| title | = | "Automated Reasoning", | |
| booktitle | = | "A Computer Science Reader: Selections from Abacus", | |
| editor | = | "E. A. Weiss", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1987", | |
| pages | = | "110-137" |
| author | = | "L. Wos and W. McCune", | |
| title | = | "Negative Paramodulation", | |
| booktitle | = | "Proc. of the 8th Conference on Automated Deduction, Lecture Notes in Computer Science 230", | |
| editor | = | "J. H. Siekmann", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1986", | |
| pages | = | "229-239" |
| author | = | "L. Wos and R. Veroff", | |
| title | = | "Resolution, Binary: Its Nature, History, and Impact on the Use of Computers", | |
| booktitle | = | "Encyclopedia of Artificial Intelligence", | |
| publisher | = | "John Wiley and Sons", | |
| year | = | "1987", | |
| pages | = | "892-902", |
| author | = | "M. Carlsson and K. Danhof and R. Overbeek", | |
| title | = | "Practical Issues Relating to the Internal Database Predicates in an OR-Paralell Prolog: Extensions and Useful Hacks", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL-88-11", | |
| month | = | "February", | |
| year | = | "1988" |
| author | = | "W. R. Cowell and S. J. Hague and R. M. Iles", | |
| title | = | "Toolpack/1 Release 2: Introductory Guide", | |
| number | = | "ANL-86-43", | |
| month | = | "March", | |
| year | = | "1987" |
| author | = | "W. R. Cowell and Burton S. Garbow", | |
| title | = | "Users' Guide to Toolpack/1 (Release 2) in a Unix Environment", | |
| number | = | "ANL-87-12", | |
| month | = | "March", | |
| year | = | "1987" |
| author | = | "K. W. Dritz and J. M. Boyle", | |
| title | = | "Beyond `Speedup': Performance Analysis of Parallel Programs", | |
| number | = | "ANL-87-7", | |
| month | = | "February", | |
| year | = | "1987" |
| author | = | "J. R. Gabriel", | |
| title | = | "An Algebraic Theory of Program Specification and Correctness Using Symmetry Operations", | |
| number | = | "ANL-87-10", | |
| month | = | "March", | |
| year | = | "1987" |
| author | = | "J. R. Gabriel and R. O. Chapman", | |
| title | = | "Deriving Properties of Systems from Properties of Parts and Lists of Connections", | |
| number | = | "ANL-86-51", | |
| month | = | "December", | |
| year | = | "1986" |
| author | = | "J. R. Gabriel and R. O. Chapman and J. L. Kljaich", | |
| title | = | "A Theory of Program Correctness, and Algorithms for Proofs", | |
| number | = | "ANL-87-4", | |
| month | = | "January", | |
| year | = | "1987" |
| author | = | "B. Glickfeld and R. Overbeek", | |
| title | = | "An Approach to Implementing State Space Searches on Heterogeneous Systems of Multiprocessors", | |
| number | = | "ANL-88-36", | |
| month | = | "September", | |
| year | = | "1987" |
| author | = | "T. J. Heames and J. G. Daley and M. Minkoff", | |
| title | = | "SEAMOPT: A Stirling Engine Performance Optimization Code", | |
| number | = | "ANL-CT-86-2", | |
| month | = | "May", | |
| year | = | "1986" |
| title | = | "Mathematics and Computer Science Division Five-Year Plan", | |
| number | = | "ANL-86-47", | |
| month | = | "November", | |
| year | = | "1986" |
| author | = | "R. Hempel", | |
| title | = | "The SUPRENUM Communications Subroutine Library for Grid-oriented Problems", | |
| number | = | "ANL-87-23", | |
| month | = | "June", | |
| year | = | "1987" |
| author | = | "J. A. Kalman", | |
| title | = | "An ITP Workbook", | |
| number | = | "ANL-86-56", | |
| month | = | "December", | |
| year | = | "1986" |
| author | = | "Man Kam Kwong", | |
| title | = | "REDUCE-aided Study of a Problem in Hermitian Matrix Theory", | |
| number | = | "ANL-87-31", | |
| month | = | "July", | |
| year | = | " 1987" |
| author | = | "G. W. Pieper", | |
| title | = | "Research in Mathematics and Computer Science", | |
| number | = | "ANL-86-35", | |
| month | = | "July", | |
| year | = | "1986" |
| author | = | "P. T. P. Tang", | |
| title | = | "Portable Implementation of a Generic Exponential Function", | |
| number | = | "ANL-88-3", | |
| year | = | "1988" |
| author | = | "C. P. Thompson and G. K. Leaf and S. P. Vanka", | |
| title | = | "Application of a Multigrid Method to a Buoyancy-induced Flow Problem", | |
| book | = | "Multigrid Methods - Theory, Applications, and Supercomputing", | |
| editor | = | "S. F. McCormick", | |
| publisher | = | "Marcel Dekker, Inc.", | |
| address | = | "New York", | |
| pages | = | "605-629", | |
| note | = | "also ANL-87-46", | |
| year | = | "1988", |
| author | = | "A. Bayliss and D. Gottlieb and B. J. Matkowsky and M. Minkoff", | |
| title | = | "An Adaptive Pseudo-Spectral Method for Reaction Diffusion Problems", | |
| journal | = | "J. Comp. Phys." | |
| volume | = | "81", | |
| issue | = | "2", | |
| year | = | "1989", | |
| note | = | "also MCS-TM-100", |
| author | = | "P. Mayes and G. Radicati", | |
| title | = | "LAPACK Working Note No. 12 -- Banded Cholesky Factorization Using Level 3 BLAS", | |
| number | = | "ANL/MCS-TM-134", | |
| month | = | "August", | |
| year | = | "1989"} |
| author | = | "P. Deift and J. Demmel and L.-C. Li and C. Tomei", | |
| title | = | "LAPACK Working Note No. 11 - The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics", | |
| number | = | "MCS-TM-133", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "R. H. Byrd and J. Nocedal", | |
| title | = | "A Tool for the Analysis of quasi-Newton Methods with Application to Unconstrained Minimization", | |
| number | = | "MCS-TM-103", | |
| month | = | "December", | |
| year | = | "1987", |
| title | = | "Numerical Solution of Bound Constrained Problems", | |
| author | = | "J. J. More", | |
| note | = | "also MCS-TM-96", | |
| book | = | "Proc. 1987 International Conf. on Computational Techniques and Applications", | |
| editor | = | "J. Noye and C. Fletcher", | |
| year | = | "1987"} |
| author | = | "J. V. Burke", | |
| title | = | "An Exact Penalization Viewpoint of Constrained Optimization", | |
| number | = | "MCS-TM-95", | |
| month | = | "August", | |
| year | = | "1987", |
| author | = | "R. Butler and E. Lusk and W. McCune and R. Overbeek", | |
| title | = | "Parallel Logic Programming for Numeric Applications", | |
| number | = | "MCS-TM-72", | |
| month | = | "April", | |
| year | = | "1986", |
| author | = | "L. wos", | |
| title | = | "Automated Reasoning: Basic Research Problems", | |
| number | = | "MCS-TM-67", | |
| year | = | "1986"} |
| author | = | "R. Butler and E. Lusk and W. McCune and R. Overbeek", | |
| title | = | "Paths to High-Performance Automated Theorem Proving", | |
| number | = | "MCS-TM-71", | |
| year | = | "1986", |
| author | = | "R. Chin and G. Hedstrom and J. Scroggs and D. Sorensen", | |
| title | = | "Parallel Computation of a Domain Decomposition Method", | |
| number | = | "MCS-TM-91", | |
| month | = | "April", | |
| year | = | "1987", |
| author | = | "W. J. Cody", | |
| title | = | "ELEFUNT Test Results under FX/FORTRAN Version 1.0 on the Alliant FX/8", | |
| number | = | "MCS-TM-78", | |
| month | = | "July", | |
| year | = | "1986", |
| author | = | "W. J. Cody", | |
| title | = | "ELEFUNT Test Results under NS320000 FORTRAN V2.5.3 on the Sequent Balance", | |
| number | = | "MCS-TM-80", | |
| month | = | "September", | |
| yeaer | = | "1986", |
| author | = | "W. R. Cowell", | |
| title | = | "UNIX Shell Scripts to Invoke a Set of Toolpack/1 Tools", | |
| number | = | "MCS-TM-77", | |
| month | = | "July", | |
| year | = | "1986", |
| author | = | "J. Demmel and J. Dongarra and J. DuCroz and A. Greenbaum and S. Hammarling and D. Sorensen", | |
| title | = | "Prospectus for the Development of a Linear Algebra Library for High-Performance Computers", | |
| number | = | "MCS-TM-97", | |
| month | = | "September", | |
| year | = | "1987", |
| author | = | "J. J. Dongarra and S. Hammarling and D. C. Sorensen", | |
| title | = | "LAPACK Working Note No. 2: Block Reduction of Matrices to Condesned Forms for Eigenvalue Computations", , CRAY X-MP-4", | |
| month | = | "September", | |
| year | = | "1987", | |
| number | = | "MCS-TM-99", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Demmel and J. Du Croz and S. Hammarling and D. Sorensen", | |
| title | = | "LAPACK Working Note \#4: Guidelines for the Design of Symmetric Eigenroutines, SVD, and Iterative Refinement and Condition Estimation for Linear Systems", | |
| number | = | "MCS-TM-111", | |
| month | = | "February ", | |
| year | = | "1988", |
| author | = | "J. Demmel and W. Kahan", | |
| title | = | "LAPACK Working Note \#3: Computing Small Singular Values of Bidiagonal Matrices with Guaranteed High Relative Accuracy", | |
| number | = | "MCS-TM-110", | |
| month | = | "February", | |
| year | = | "1988", |
| author | = | "T. Disz and E. Lusk and R. Overbeek", | |
| title | = | "Experiments with OR-Parallel Logic Programs", | |
| book | = | "Proc. 4th International Conf. on Logic Programming", | |
| note | = | "also "MCS-TM-87", | |
| year | = | "1987", |
| author | = | "J. J. Dongarra", | |
| title | = | "Performance of Various Computers Using Standard Linear Equations Software in a Fortran Environment", | |
| number | = | "MCS-TM-23", | |
| month | = | "January", | |
| year | = | "1988", |
| author | = | "J. J. Dongarra", | |
| title | = | "Workshop on the Level 3 BLAS", | |
| number | = | "MCS-TM-89", | |
| month | = | "March", | |
| year | = | "1987", |
| author | = | "J. J. Dongarra and J. Du Croz and I. Duff and S. Hammarling", | |
| title | = | "A Proposal for a Set of Level 3 Basic Linear Algebra Subprograms", | |
| number | = | "MCS-TM-88", | |
| month | = | "April", | |
| year | = | "1987", |
| author | = | "J. J. Dongarra and J. Du Croz and S. Hammarling and R. J. Hanson", | |
| title | = | "An Extended Set of Fortran Basic Linear Algebra Subprograms: Model Implementation and Test Programs", | |
| number | = | "MCS-TM-81", | |
| month | = | "January", | |
| year | = | "1987", |
| author | = | "J. J. Dongarra and S. Hammarling and D. Sorensen", | |
| title | = | "Block Reduction of Matrices to Condensed Forms for Eigenvalue Computations", | |
| journal | = | "Journal of Computational and Applied Mathematics", | |
| volume | = | "27", | |
| pages | = | "215-227", | |
| year | = | "1989", |
| author | = | "A. Griewank", | |
| title | = | "The Global Convergence of Partitioned BFGS on Problems with Convex Decompositions and Lipschitzian Gradients", | |
| journal | = | "Math. Programming", | |
| volume | = | "50", | |
| pages | = | "141-175", | |
| note | = | "also MCS-TM-105", | |
| year | = | "1991", |
| author | = | "J. Michalakes", | |
| title | = | "Analysis of Workload and Load Balancing Issues in the NCAR Community Climate Model", | |
| number | = | "ANL/MCS-TM-144", | |
| month | = | "January", | |
| year | = | "1991"} |
| author | = | "H. G. Kaper", | |
| number | = | "ANL/MCS-TM-151", | |
| month | = | "June", | |
| year | = | "1991", | |
| title | = | "Educational Opportunities in Computational Science at Argonne National Laboratory"} |
| author | = | "H. G. Kaper", | |
| number | = | "ANL/MCS-TM-146", | |
| month | = | "March", | |
| year | = | "1991", | |
| title | = | "Mathematical Models of Superconductivity"} |
| author | = | "A. Baehr and R. Hagstrom and D. Joerg and R. Overbeek", | |
| title | = | "Querying Genomic Databases", | |
| number | = | "ANL/MCS-TM-155", | |
| year | = | "1991"} |
| author | = | "E. R. Jessup and D. C. Sorensen", | |
| title | = | "A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix", | |
| number | = | "MCS-TM-102", | |
| month | = | "December", | |
| year | = | "1987", |
| author | = | "K. E. Jordan and A. Bayliss", | |
| title | = | "A Multigrid Preconditioner Applied to a Two-Dimensional Convection-Diffusion Problem", | |
| number | = | "MCS-TM-101", | |
| month | = | "November", | |
| year | = | "1987", |
| author | = | "D. C. Liu and J. Nocedal", | |
| title | = | "Algorithms for Conic Termination for Linear Optimization", | |
| number | = | "MCS-TM-104", | |
| month | = | "December", | |
| year | = | "1987" |
| author | = | "W. W. McCune", | |
| title | = | "Un-Skolemizing Clause Sets", | |
| journal | = | "Information Processing Letters", | |
| volume | = | "29", | |
| year | = | "1988", | |
| pages | = | :257-263"} |
| author | = | "W. W. McCune and L .J. Henschen", | |
| title | = | "Maintaining State Constraints in Relational Databases: A Proof Theoretic Basis", | |
| journal | = | "JACM", | |
| year | = | "1989", | |
| volume | = | "36", | |
| number | = | "1", | |
| pages | = | "46-68"} |
| author | = | "R. Butler and T. Butler and I. Foster and N. Karonis and R. Olson and N. Pfluger and M. Price and S. Tuecke", | |
| title | = | "Generating Alignments of Genetic Sequences", | |
| numer | = | "ANL/MCS-TM-132", | |
| year | = | "1989"} |
| author | = | "J. J. More'", | |
| title | = | "Numerical Solution of Bound Constrained Problems", | |
| journal | = | "SIAM J. Optimization", | |
| volume | = | "1", | |
| issue | = | "1", | |
| pages | = | "93-111, | |
| year | = | "1989", |
| author | = | "J. J. More'", | |
| title | = | "Trust Regions and Projected Gradients", | |
| number | = | "MCS-TM-107", | |
| month | = | "January", | |
| year | = | "1988", |
| author | = | "L. R. Scott and J. M. Boyle and B. Bagheri", | |
| title | = | "Distributed Data Structures for Scientific Computation", | |
| number | = | "291", | |
| institution | = | "Institute for Mathematics and Its Applications", | |
| address | = | "Minneapolis", | |
| month | = | "January", | |
| year | = | "1987", |
| author | = | "F. V. Atkinson", | |
| title | = | "On the Order of Magnitude of Titchmarsh-Weyl Functions", | |
| journal | = | "Diff. and Integral Equations", | |
| volume | = | "1", | |
| issue | = | "1", | |
| year | = | "1988", | |
| pages | = | "79-96"} |
| author | = | "F. V. Atkinson and W. N. Everitt and A. Zettl", | |
| title | = | "Regularization of a Sturm-Liouville Problem with an Interior Singularity Using Quasi-Derivatives", | |
| journal | = | "Diff. and Integral Equations", | |
| volume | = | "1", | |
| year | = | "1988", | |
| pages | = | "213-221"} |
| autohr | = | "A. Bayliss and D. Gottlieb and B. J. Matkowsky and M. Minkoff", | |
| title | = | "An Adaptive Pseudo-Spectral Method for Reaction Diffusion Problems", | |
| journal | = | "J. Comp. Physics", | |
| volume | = | "81", | |
| issue | = | "2", | |
| year | = | "1989", | |
| pages | = | "421-443"} |
| author | = | "A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| title | = | "Adaptive Pseudo-Spectral Computation of Cellular Flames Stabilized by a Point Source", | |
| journal | = | "Applied Mathematics Letters", | |
| volume | = | "1", | |
| year | = | "1988", | |
| pages | = | "19-24"} |
| author | = | "A. Bayliss and B. Matkowsky and M. Minkoff", | |
| title | = | "Cascading Cellular Flames", | |
| journal | = | "SIAM J. on Applied Math.", | |
| year | = | "1989" | |
| volume | = | "49", | |
| issue | = | "5", | |
| pages | = | "1421-1432"} |
| author | = | "A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| title | = | "Period Doubling Gained, Period Doubling Lost", | |
| journal | = | "SIAM J. on Applied Math.", | |
| volume | = | "49", | |
| year | = | "1989", | |
| pages | = | "1047-1063"} |
| author | = | "C. H. Bischof", | |
| title | = | "Adaptive Blocking in the QR Factorization", | |
| journal | = | "The Journal of Supercomputing", | |
| volume | = | "3", | |
| issue | = | "3", | |
| year | = | "1989", | |
| pages | = | "193-208"} |
| author | = | "J. M. Boyle", | |
| title | = | "Abstract Programming and Program Transformation--An Approach to Reusing Programs", | |
| booktitle | = | "Software Reusability", | |
| eidtor | = | "T. J. Biggerstaff and A. Perlis", | |
| publisher | = | "Addison-Wesley", | |
| year | = | "1989", | |
| pages | = | "361--413"} |
| author | = | "O. Brewer and J. Dongarra and D. Sorensen", | |
| title | = | "LAPACK Working Note No. 6: Tools to Aid in the Analysis of Memory Access Patterns for Fortran Programs", | |
| journal | = | "Parallel Computing", | |
| volume | = | "9", | |
| year | = | "1989", | |
| pages | = | "25-35"} |
| autohr | = | "J. V. Burke and J. J. More", | |
| title | = | "On the Identification of Active Constraints", | |
| journal | = | {SIAM J. Numer. Anal.}, | |
| volume | = | "25", | |
| issue | = | "5", | |
| month | = | "October", | |
| year | = | "1988", | |
| pages | = | "1197-1211"} |
| author | = | "R. Butler and T. Butler and I. Foster and N. Karonis and R. Olson and N. Pfluger and M. Price and S. Tuecke", | |
| title | = | "Aligning Genetic Sequences", | |
| booktitle | = | "Strand: New Concepts in Parallel Programming", | |
| editor | = | "I. Foster and S. Taylor", | |
| publisher | = | "Prentice-Hall", | |
| address | = | " Englewood Cliffs", | |
| year | = | "1989", | |
| pages | = | "253-271" |
| author | = | "A. Bayliss and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Pulsating and Chaotic Dynmaics near the Extinction Limit", | |
| journal | = | "Combustion Sci. and Tech.", | |
| volume | = | "84", | |
| year | = | "1992", | |
| pages | = | "253-278"} |
| author | = | "C. Bischof and G. Corliss and A. Griewank", | |
| title | = | "ADIFOR Working Note No. 8: Hybrid Evaluations of Second Derivatives in ADIFOR", | |
| number | = | "MCS-TM-166", | |
| institution | = | Argonne National Laboratory", | |
| year | = | 1992"} |
| title | = | "On the Parallelization of an Adaptive Multigrid Algorithm for a Class of Flow Problems", | |
| author | = | "C. P. Thompson and W. R. Cowell and G. K. Leaf", | |
| journal | = | "Parallel Computing", | |
| volume | = | "18", | |
| year | = | "1992", | |
| pages | = | "449-466"} |
| title | = | "A Dynamically Adaptive Multigrid Algorithm for the Incompressible Navier-Stokes Equations -- Validation and Model Problems", | |
| author | = | "C. P. Thompson and W. R. Cowell and G. K. Leaf", | |
| journal | = | "Applied Numerical Mathematics", | |
| volume | = | "9", | |
| year | = | "1992", | |
| pages | = | "511-532"} |
| author | = | "W. D. Gropp and D. E. Keyes", | |
| title | = | "Domain Decomposition Methods in Computational Fluid Dynammics", | |
| journal | = | "Intnl. J. Numer. Methods Fluids", | |
| volume | = | "14", | |
| pages | = | "147-165", | |
| year | = | "1992"} |
| author | = | "M. Garbey and H. G. Kaper and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Quasi-Periodic Waves and the Transfer of Stability in condensed-Phase Surface Combustion", | |
| journal | = | "SIAM J. Appl. Math.", | |
| volume | = | "52", | |
| issue | = | "2", | |
| year | = | "1992", | |
| pages | = | "384-395"} |
| author | = | "I. Foster and R. Olson and S. Tuecke", | |
| title | = | "Productive Parallel Programming: The PCN Approach", | |
| journal | = | Sci. Programming", | |
| volume | = | "1", | |
| year | = | "1992", | |
| pages | = | "51-66"} |
| title | = | "The Parallel Scalability of the Spectral Transform Method", | |
| author | = | "I. Foster and w. Gropp and R. Stevens", | |
| journal | = | "Monthly Weather Review", | |
| volume | = | "120", | |
| issue | = | "5", | |
| year | = | "1992"} |
| author | = | "G. Corliss and A. Griewank and T. Robey and S. Wright", | |
| title | = | "Automatic Differentiation Applied to Unsaturated Flow -- ADOL-C Case Study", | |
| number | = | "MCS-TM-162", | |
| year | = | "1992"} |
| author | = | "K. W. Dritz", | |
| title | = | "Development of an Ada Standard for Primitive Floating-Point Functions", | |
| book | = | "ADA Yearbook 1992", | |
| editor | = | "F. Long", | |
| publisher | = | "Chapman and Hall", | |
| address | = | "London", | |
| year | = | "1992"} |
| author | = | "I.-L. Chern and T. Colin and H. G. Kaper", | |
| title | = | "Classical Solutions of the Nondivergent Barotropic Equations on the Sphere", | |
| journal | = | "Commun. in PDEs", | |
| volume | = | "17", | |
| pages | = | "1001-1019", | |
| issue | = | "5-6", | |
| year | = | "1992"} |
| author | = | "X.-C. Cai and W. D. Gropp and D. E. Keyes", | |
| title | = | "Convergence Rate Estimate for a Domain Decomposition Method", | |
| journal | = | "Numerische Mathematik", | |
| volume | = | "61", | |
| pages | = | "153-169", | |
| year | = | "1992"} |
| author | = | "J. M. Boyle and T. J. Harmer", | |
| title | = | "A Practical Functional Program for the CRAY X-MP", | |
| journal | = | "J. Functional Programming", | |
| volume | = | "2", | |
| issue | = | "1", | |
| year | = | "1992", | |
| pages | = | "81-126"} |
| author | = | " C. Bischof and G. Corliss and L. Green and A. Griewank and K. Haigler and P. Newman", | |
| title | = | "Automatic Differentiation of Advanced CFD Codes for Multidisciplinary Design", | |
| journal | = | "Computing Systems in Engineering", | |
| volume | = | "3", | |
| issue | = | "6", | |
| pages | = | "625-637", | |
| year | = | "1992"} |
| author | = | "H. Bellout", | |
| title | = | "A Regularity Result for a Quasilinear Equation and Its Consequences for Blowing-up Solution s of Semilinear Heat Equations", | |
| journal | = | "J. Differential Equations", | |
| volue | = | "100", | |
| issue | = | "1", | |
| year | = | :1992", | |
| pages | = | "162-172"} |
| author | = | "C. Y. Chan and Man Kam Kwong", | |
| title | = | "On a Result on the Problem of Quenching", | |
| journal | = | "Nonlinear Analysis", | |
| volume | = | "12", | |
| year | = | "1988", | |
| pages | = | "1377-1383" |
| author | = | "C. Y. Chan and H. G. Kaper", | |
| title | = | "Quenching for Semilinear Singular Parabolic Problems", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | "20", | |
| issue | = | "3", | |
| year | = | "1989", | |
| pages | = | "558-566" |
| author | = | "C. Y. Chan and Man Kam Kwong", | |
| title | = | "Existence Results of Steady-States of Semilinear Reaction-Diffusion Equations and Their Applications", | |
| journal | = | "J. Diff. Eq.", | |
| volume | = | "77", | |
| issue | = | " 2", | |
| month | = | "February", | |
| year | = | "1989", | |
| pages | = | "304-321" |
| author | = | "W. J. Cody", | |
| title | = | "MACHAR: A Subroutine to Dynamically Determine Machine Parameters", | |
| journal | = | "ACM Trans. on Math. Soft. ", | |
| volume | = | "14", | |
| issue | = | "4", | |
| month | = | "December", | |
| year | = | "1988", | |
| pages | = | "303-311" |
| author | = | "W. J. Cody and L. Stoltz", | |
| title | = | "Performance Evaluation of Programs for Certain Bessel Functions", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "15", | |
| issue | = | "1", | |
| month | = | "March", | |
| year | = | "1989", | |
| pages | = | "41-48" |
| author | = | "W. R. Cowell", | |
| title | = | "DO Loop Transforming Tools", | |
| booktitle | = | "Using Toolpack Software Tools", | |
| editor | = | "A. Pollicini", | |
| publisher | = | "Kluwer", | |
| address | = | "Boston", | |
| year | = | "1989", | |
| pages | = | "161-180" |
| author | = | "W. R. Cowell", | |
| title | = | "Tool Writing", | |
| booktitle | = | "Using Toolpack Software Tools", | |
| editor | = | "A. A. Pollicini", | |
| publisher | = | "Kluwer", | |
| address | = | "Boston", | |
| year | = | "1989", | |
| pages | = | "251-275" |
| author | = | "J. J. Dongarra and J. DuCroz and S. Hammarling and R. Hanson", | |
| title | = | "An Extended Set of Fortran Basic Linear Algebra Subprograms", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "14", | |
| issue | = | "1", | |
| month | = | "March", | |
| year | = | "1988", | |
| pages | = | "1-17" |
| author | = | "J. J. Dongarra and J. DuCroz and S. Hammarling and R. Hanson", | |
| title | = | "Algorithm 656: An Extended Set of Fortran Basic Linear Algebra Subprograms: Model Implementation and Test Programs", | |
| journal | = | "ACM Trans. Math. Soft.", | |
| volume | = | "14", | |
| issue | = | "1", | |
| year | = | "1988", | |
| pages | = | "18-32" |
| author | = | "J. J. Dongarra and D. C. Sorensen and K. Connolly and J. Patterson", | |
| title | = | "Programming Methodology and Performance Issues for Advanced Computer Architecture", | |
| journal | = | "Parallel Computing", | |
| volume | = | "8", | |
| year | = | "1988", | |
| pages | = | "41-58"} |
| author | = | "K. W. Dritz", | |
| title | = | "Plugging the Holes in the Sieve of Eratosthenes", | |
| journal | = | "Ada Letters", | |
| volume | = | "9", | |
| issue | = | "2", | |
| month | = | "March/April", | |
| year | = | "1989", | |
| pages | = | "72-77" |
| autohr | = | "I. Foster and S. Taylor", | |
| title | = | "Strand: New Concepts in Parallel Programming", | |
| publisher | = | "Prentice-Hall", | |
| address | = | "Englewood Cliffs", | |
| year | = | "1989"} |
| author | = | "B. S. Garbow and G. Giunta and J. N. Lyness and A. Murli", | |
| title | = | "Software for an Implementation of Weeks' Method for the Inverse Laplace Transform Problem", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "14", | |
| issue | = | "2", | |
| month | = | "June", | |
| year | = | "1988", | |
| pages | = | "163-170"} |
| author | = | "B. S. Garbow and G. Giunta and J. N. Lyness", | |
| title | = | "Algorithm 662: A FORTRAN Software Package for the Numerical Inversion of the Laplace Transform Based on Weeks' Method", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "14", | |
| issue | = | "2", | |
| month | = | "June", | |
| year | = | "1988", | |
| pages | = | "171-176"} |
| author | = | "D. W. Gillman and H. G. Kaper and Man Kam Kwong", | |
| title | = | "L sup 2-Norm Inequalities for the Differentiation Operator on Compact Intervals", | |
| journal | = | "Proc. Roy. Soc. of Edinburgh", | |
| volume | = | "110A", | |
| year | = | "1988", | |
| pages | = | "335-342"} |
| author | = | "C. Gupta", | |
| title | = | "Existence and Uniqueness Theorems for a Third-Order Generalized Boundary Value Problem", | |
| journal | = | "J. Applied Math. and Simulation", | |
| volume | = | "2", | |
| issue | = | "1", | |
| year | = | "1989", | |
| pages | = | "33-51"} |
| author | = | "A. Griewank and G. W. Reddien", | |
| title | = | "Computation of Cusp Singularities for Operator Equations and Their Discretizations", | |
| journal | = | "J. Computational and Applied Mathematics", | |
| volume | = | "26", | |
| year | = | "1989", | |
| pages | = | "133-153"} |
| author | = | "F. B. Hanson and A.-M. Wazwaz", | |
| title | = | "Singular and Turning Point Resonance: Small Perturbations--Big Effects", | |
| journal | = | "Applied Math. Letters", | |
| volume | = | "1", | |
| year | = | "1988", | |
| pages | = | "137-140"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Concavity and Monotonicity Properties of Solutions of Emden-Fowler Equations", | |
| journal | = | "Diff. and Integral Equations", | |
| volume | = | "1", | |
| year | = | "1988", | |
| pages | = | "327-340"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "A Non-Oscillation Theorem for the Emden-Fowler Equation: Ground States for Semilinear Elliptic Equations with Critical Exponents", | |
| journal | = | "J. Differential Equations", | |
| volume | = | "75", | |
| year | = | "1988", | |
| pages | = | "158-185"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Uniqueness for a Class of Nonlinear Initial Value Problems", | |
| journal | = | "J. Math. Anal. Appl.", | |
| volume | = | "130", | |
| number | = | "2", | |
| year | = | "1988", | |
| pages | = | "467-473"} |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "Uniqueness Results for Some Nonlinear Initial and Boundary Value Problems", | |
| journal | = | "Arch. Rat. Mech. Anal.", | |
| volume | = | "102", | |
| year | = | "1988", | |
| pages | = | "45-56"} |
| author | = | "H. G. Kaper and G. K. Leaf and B. J. Matkowsky and W. E. Olmstead", | |
| title | = | "Dynamics of Nearly Extinguished Nonadiabatic Premixed Flames in a Gravitational Field", | |
| journal | = | "SIAM J. Appl. Math.", | |
| volume | = | "48", | |
| year | = | "1988", | |
| pages | = | "1054-1063"} |
| author | = | "T. Kazic and E. Lusk and R. Olson and R. Overbeek and S. Tuecke", | |
| title | = | "Prototyping Databases in Prolog", | |
| booktitle | = | "Practice of Prolog", | |
| editor | = | "Leon Sterling", | |
| publisher | = | "MIT Press", | |
| address | = | "Cambridge, Mass.", | |
| year | = | "1990"} |
| author | = | "D. Juedes and A. Griewank", | |
| title | = | "Implementing Automatic Differentiation Efficiently", | |
| number | = | "MCS-TM-140", | |
| year | = | "1990"} |
| author | = | "B. N. Karp and C. H. Bischof", | |
| title | = | "Increasing the Granularity of Parallelism and Reducing Contention in Automatic Differentiation", | |
| number | = | "ANL/MCS-TM-142", | |
| year | = | "1990"} |
| author | = | "B. S. Garbow and J. N. Lyness", | |
| title | = | "Remark on Algorithm 662", | |
| journal | = | "ACM TOMS", | |
| volume | = | "16", | |
| issue | = | "4", | |
| year | = | "1990", | |
| pages | = | "405-406"} |
| author- | = | "A. M. Krall and A. Zettl", | |
| title | = | "Singular Self-Adjoint Sturm-Liouville Problems", | |
| journal | = | "Diff. and Integral Equations", | |
| volume | = | "1", | |
| issue | = | "2", | |
| month | = | "October", | |
| year | = | "1988", | |
| pages | = | "423-432"} |
| author | = | "A. M. Krall and A. Zettl", | |
| title | = | "Singular Self-Adjoint Sturm-Liouville Problems II: Interior Singular Points", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | "19", | |
| issue | = | "5", | |
| month | = | "September", | |
| year | = | "1988", | |
| pages | = | "1135-1141"} |
| author | = | "M. K. Kwong", | |
| title | = | "On the Definiteness of the Solution of Certain Matrix Equation", | |
| journal | = | "Linear Algebra and Its Applications", | |
| volume | = | "108", | |
| year | = | "1988", | |
| pages | = | "177-197"} |
| author | = | "M. K. Kwong", | |
| title | = | "Some Results on Matrix Monotone Functions", | |
| journal | = | "Linear Algebra and Its Applications", | |
| volume | = | "118", | |
| year | = | "1989", | |
| pages | = | "129-153"} |
| author | = | "M. K. Kwong", | |
| title | = | "Uniqueness of Positive Solutions of Delta u - u + u sup p =0 in R sup n", | |
| journal | = | "Arch. Rat. Mech.", | |
| volume | = | "105", | |
| year | = | "1989", | |
| pages | = | "243-266"} |
| author | = | "M. K. Kwong and C. Bandle", | |
| title | = | "Semilinear Elliptic Problems in Annular Domains", | |
| journal | = | "ZAMP", | |
| volume | = | "40", | |
| year | = | "1989", | |
| pages | = | "245-257"} |
| author | = | "M. K. Kwong and James S. W. Wong", | |
| title | = | "Oscillation of Emden-Fowler Systems", | |
| journal | = | "Diff. and Integral Equations", | |
| volume | = | "1", | |
| year | = | "1988", | |
| pages | = | "133-141"} |
| author | = | "M. K. Kwong and A. Zettl", | |
| title | = | "Best Constants for Discrete Kolmogorov Inequalities", | |
| journal | = | "Houston J. Math.", | |
| volume | = | "15", | |
| number | = | "1", | |
| year | = | "1989", | |
| pages | = | "99-119"} |
| author | = | "M. K. Kwong and A. Zettl", | |
| title | = | "Extremals in Landau's Inequality for the Difference Operator", | |
| journal | = | "Proc. Roy. Soc. Edinburgh", | |
| volume | = | "107A", | |
| year | = | "1987", | |
| pages | = | "299-311"} |
| author | = | "M. K. Kwong and A. Zettl", | |
| title | = | "Landau's Inequality for the Difference Operator", | |
| journal | = | "Proc. AMS", | |
| volume | = | "104", | |
| issue | = | "1", | |
| year | = | "1988", | |
| pages | = | "201-206"} |
| author | = | "N. Q. Lam and T. Nguyen and G. K. Leaf and S. Yip", | |
| title | = | "Kinetics of Radiation-Induced Precipitation at the Alloy Surface", | |
| journal | = | "Nuclear Instruments and Methods in Physics Research", | |
| volume | = | "B31", | |
| year | = | "1988", | |
| pages | = | "415-424"} |
| author | = | "G. K. Leaf and M. Minkoff and J. C. Diaz", | |
| title | = | "Nested Factorization Preconditioners for Convective-Diffusion Problems in Three Dimensions", | |
| booktitle | = | "Mathematics for Large-Scale Computing", | |
| editor | = | "J. C. Diaz", | |
| publisher | = | "Marcel Decker", | |
| year | = | "1989"} |
| author | = | "W. W. McCune", | |
| title | = | "Un-Skolemizing Clause Sets", | |
| journal | = | "Information Processing Letters", | |
| volume | = | "29", | |
| year | = | "1988", | |
| pages | = | "257-263"} |
| author | = | "W. McCune and L. Henschen", | |
| title | = | "Maintaining State Constraints in Relational Databases: A Proof Theoretic Basis", | |
| journal | = | "J. ACM", | |
| volume | = | "36", | |
| year | = | "1989", | |
| pages | = | "46-68"} |
| author | = | "J. J. More' and G. Toraldo", | |
| title | = | "Algorithms for Bound Constrained Quadratic Programming Problems", | |
| journal | = | "Numerische Mathematik", | |
| volume | = | "55", | |
| year | = | "1989", | |
| pages | = | "377-400"} |
| author | = | "Z. Nagy and P. J. Hernes and M. Minkoff and G. K. Leaf and R. H. Land", | |
| itle | = | "Effect of Diffusion Layer Structure on the Determination of Corrosion Rates from dc Transient Measurements", | |
| journal | = | "J. Electrochem. Soc.", | |
| volume | = | "136", | |
| issue | = | "10", | |
| year | = | "1989", | |
| pages | = | "2816-2820"} |
| author | = | "Z. Nagy and G. K. Leaf and M. Minkoff and R. H. Land", | |
| title | = | "Extension of dc Transient Techniques to Reactions with a Potential Dependent Charge Transfer Coefficient", | |
| journal | = | "Electrochemica Acta", | |
| volume | = | "33", | |
| year | = | "1988", | |
| pages | = | "1589-1593"} |
| author | = | "I. H. Sloan and J. N. Lyness", | |
| title | = | "The Representation of Lattice Quadrature Rules as Multiple Sums", | |
| journal | = | "Math. Comp.", | |
| volume | = | "52", | |
| year | = | "1989", | |
| pages | = | "81-94"} |
| author | = | "P. T. P. Tang", | |
| title | = | "A Fast Algorithm for Linear Complex Chebyshev Approximations", | |
| journal | = | "Math. Comp.", | |
| volume | = | "51", | |
| year | = | "1988", | |
| pages | = | "721-739"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Table-Driven Implementation of the Exponential Function in IEEE Floating-Point Arithmetic", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "15", | |
| isse | = | "2", | |
| year | = | "1989", | |
| pages | = | "144-157"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Accurate and Efficient Testing of the Exponential and Logarithm Functions", | |
| journal | = | "ACM Trans. Math. Soft.", | |
| volume | = | "16", | |
| year | = | "1990", | |
| pages | = | "185-200"} |
| author | = | "T.-C. Wang and R. Stevens", | |
| title | = | "Solving Open Problems in Right Alternative Rings with Z-Module Reasoning", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "5", | |
| issue | = | "2", | |
| year | = | "1989", | |
| pages | = | "141-165"} |
| author | = | "C. A. Wick and W. W. McCune", | |
| title | = | "Automated Reasoning about Elementary Point-Set Topology", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "5", | |
| issue | = | "2", | |
| year | = | "1989", | |
| pages | = | "239-255" |
| author | = | "L. Wos", | |
| title | = | "The Problem of Explaining the Disparate Performance of Hyperresolution and Paramodulation", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "4", | |
| year | = | "1988", | |
| pages | = | "215-217" |
| author | = | "L. Wos", | |
| title | = | "The Problem of Finding a Strategy to Control Binary Paramodulation", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "4", | |
| year | = | "1988", | |
| pages | = | "101-107"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Self-analytically Choosing the Set of Support", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "4", | |
| year | = | "1988", | |
| pages | = | "327-330"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Self-analytically Choosing the Weights", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "4 ", | |
| year | = | "1988", | |
| pages | = | "463-464"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Finding an Inference Rule for Set Theory", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "5", | |
| year | = | "1989", | |
| pages | = | "93-95"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Determining the Size of a Complete Set of Reductions", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "5", | |
| year | = | "1989", | |
| pages | = | "235-237"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Guaranteeing the Existence of a Complete Set of Reductions", | |
| volume | = | "5", | |
| issue | = | "3", | |
| year | = | "1989", | |
| pages | = | "399-401"} |
| author | = | "A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| title | = | "Bistable Cellular Flames", | |
| booktitle | = | "Proc. of a Symposium to Honor C. C. Lin", | |
| editor | = | "D. J. Benney and F. H. Shu and C. Yuan", | |
| publisher | = | "World Scientific", | |
| address | = | "Singapore", | |
| year | = | "1988", | |
| pages | = | "108-115"} |
| author | = | "A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| title | = | "Numerical Computation of Bifurcation Phenomena and Pattern Formation in Combustion", | |
| booktitle | = | "Preprints of the Third International Conf. on Numerical Combustion", | |
| address | = | "Antibes, France", | |
| year | = | "1989", | |
| pages | = | "311-322"} |
| author | = | "O. Brewer and J. Dongarra and D. Levine and D. Sorensen", | |
| title | = | "Graphics Tools for Developing High-Performance Algorithms", | |
| booktitle | = | "Parallel Computing: Methods, Algorithms and Applications", | |
| year | = | "1989", | |
| pages | = | "39-50"} |
| author | = | "R. Butler and T. Disz and E. Lusk and R. Overbeek and R. Stevens", | |
| title | = | "Scheduling OR-Parallelism: An Argonne Perspective", | |
| booktitle | = | "Logic Programming", | |
| editor | = | "R. A. Kowalsky and K. A. Bowen", | |
| publisher | = | "The MIT Press", | |
| address | = | "Cambridge, Mass.", | |
| year | = | "1988", | |
| pages | = | "1590-1605"} |
| author | = | "R. M. Butler and N. T. Karonis", | |
| title | = | "Exploitation of Parallelism in Prototypical Deduction Problems", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", | |
| editor | = | "E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "333-343"} |
| author | = | "R. M. Butler and R. Loganantharaj and R. Olson", | |
| title | = | "Notes on Prolog Transformations, Prolog Style, and Efficient Compilation to the Warren Abstract Machine", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", editor E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "323-332"} |
| author | = | "D. Callahan and J. Dongarra and D. Levine", | |
| title | = | "Vectorizing Compilers: A Test Suite and Results", | |
| booktitle | = | "Proc. of Supercomputing'88", | |
| publisher | = | "IEEE Press", | |
| year | = | "1988", | |
| pages | = | "98-105"} |
| author | = | "M. Carlsson and K. Danhof and R. Overbeek", | |
| title | = | "A Simplified Approach to the Implementation of AND-Parallelism in an OR-Parallel Environment", | |
| booktitle | = | "Logic Programming", | |
| editor | = | "R. A. Kowalski and K. A. Bowen", | |
| publisher | = | "The MIT Press", | |
| address | = | "Cambridge, Mass.", | |
| year | = | "1988", | |
| pages | = | "1565-1577"} |
| author | = | "W. J. Cody", | |
| title | = | "Floating-Point Standards: Theory and Practice", | |
| booktitle | = | "Reliability in Computing: The Role of Interval Methods in Scientific Computing", | |
| editor | = | "R. E. Moore", | |
| publisher | = | "Academic Press", | |
| address | = | "San Diego", | |
| year | = | "1988", | |
| pages | = | "99-107"} |
| author | = | "J. J. Dongarra", | |
| title | = | "LINPACK Benchmark---An Explanation", | |
| booktitle | = | "Supercomputing", | |
| editor | = | "E. N. Houstichs and T. S. Papatheodorou and C. D. Polychronopoulos", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 297", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "456-475"} |
| author | = | "J. J. Dongarra and J. DuCroz and I. Duff and S. Hammarling", | |
| title | = | "A Proposal for a Set of Level 3 Basic Linear Algebra Subprograms", | |
| booktitle | = | "Parallel Processing for Scientific Computing", | |
| editor | = | "G. Rodrigue", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| year | = | "1988", | |
| pages | = | "40-44"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "Algorithm Design for High-Performance Computers", | |
| booktitle | = | "Parallel Systems and Computation", | |
| editor | = | " G. Paul and G. S. Almasi", | |
| publisher | = | "North-Holland", | |
| year | = | "1988", | |
| pages | = | "83-98"} |
| author | = | "J. J. Dongarra and D. C. Sorensen", | |
| title | = | "A Look at Software for Dense Matrix Problems over the Past Fifteen Years",'' | |
| booktitle | = | "Numerical Algorithms for Modern Parallel Computer Architectures: IMA Volumes in Mathematics and Its Applications Vol. 13", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988"} |
| author | = | "J. J. Dongarra and D. C. Sorensen and O. Brewer", | |
| title | = | "Tools and Methodology for Programming Parallel Processors", | |
| booktitle | = | "Aspects of Computation on Asynchronous Parallel Processors", | |
| editor | = | "M. H. Wright", | |
| publisher | = | "Elsevier Science Publ.", | |
| year | = | "1989", | |
| pages | = | "125-137"} |
| author | = | "A. Esfahanian and L. Ni and B. E. Sagan", | |
| title | = | "On Enhancing Hypercube Multiprocessors: 1988 International Conf. on Parallel Processing, Vol. Architecture", | |
| address | = | "St. Charles, Ill.", | |
| year | = | "1988", | |
| pages | = | "86-89"} |
| author | = | "I. Foster", | |
| title | = | "A Multicomputer Garbage Collector for a Single-Assignment Language", | |
| journal | = | "intl. J. Parallel Programming", | |
| volume | = | "19", | |
| year | = | "1990"} |
| author | = | "F. B. Hanson", | |
| title | = | "Parallel Computation for Stochastic Dynamic Programming: Row Versus Column Code Orientation", | |
| booktitle | = | "Algorithms and Applications", | |
| editor | = | "D. H. Bailey", | |
| publisher | = | "Penn. State Univ. Press", | |
| address | = | "University Park", | |
| year | = | "1988", | |
| pages | = | "117-119"} |
| author | = | "M. D. Hirsch and S. Vavasis", | |
| title | = | "Exponential Lower Bounds for Finding Brouwer Fixed Points", | |
| booktitle | = | "Proc. of the 28th Annual Symposium on Foundations of Computer Science", | |
| publisher | = | "Computer Society Press", | |
| address | = | "Washington", | |
| year | = | "1988", | |
| pages | = | "401-410"} |
| author | = | "E. R. Jessup and D. C. Sorensen", | |
| title | = | "A Divide and Conquer Algorithm for Computing the Singular Value Decomposition", | |
| booktitle | = | "Parallel Processing for Scientific Computing", | |
| editor | = | "G. Rodrigue", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| year | = | "1988", | |
| pages | = | "61-66"} |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "Asymptotics of the Titchmarsh-Weyl $m$-Coefficient for Integrable Potentials II", | |
| booktitle | = | "Lecture Notes in Mathematics Vol. 1285," | |
| editor | = | 'I. W. Knowles and Y. Saito", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1986", | |
| pages | = | "222-229"} |
| author- | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "Comparison Theorems and Their Use in the Analysis of Some Nonlinear Diffusion Problems", | |
| booktitle | = | "Transport Theory, Invariant Imbedding, and Integral Equations", | |
| editor | = | "P. Nelson et al.", | |
| publisher | = | "Marcel Dekker", | |
| address | = | "New York", | |
| year | = | "1989"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Oscillation Theory for Linear Second-Order Differential Systems", | |
| booktitle | = | "Oscillation, Bifurcation and Chaos: CMS Conf. Proc.", | |
| Volume | = | "8", | |
| editor | = | "F. V. Atkinson and W. F. Langford and A. B. Mingarelli", | |
| publisher | = | "AMS", | |
| address | = | "Providence, R.I.", | |
| year | = | "1988", | |
| pages | = | "187-198"} |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "Uniqueness of Non-Negative Solutions of a Class of Semi-linear Elliptic Equations", | |
| booktitle | = | "Nonlinear Diffusion Equations and Their Equilibrium States", | |
| editor | = | "W.-M. Ni and L. A. Pelletier and J. Serrin", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "1-17"} |
| author | = | "Chung-Ta King and Wen-Hwa Chou and L. M. Ni", | |
| title | = | "Pipelined Data Parallel Algorithms: Concept and Modeling", | |
| booktitle | = | "Proc. of the 1988 International Conf. on Supercomputing", | |
| address | = | "Saint-Malo, France", | |
| year | = | "1988", | |
| pages | = | "385-395"} |
| author | = | "Y. Lan and L. Ni and A.-H. Esfahanian", | |
| title | = | "Distributed Multi-Destination Routing in Hypercube Multiprocessors", | |
| booktitle | = | "Proc. of the Third Conf. on Hypercube Concurrent Computers and Applications", | |
| year | = | "1988", | |
| pages | = | "631-639"} |
| author | = | "E. Lusk and others", | |
| title | = | "The Aurora OR-Parallel Prolog System", | |
| journal | = | "New Generation Computing", | |
| volume | = | "7", | |
| year | = | "1990", | |
| pages | = | "243-271"} |
| author | = | "E. Lusk and R. Overbeek", | |
| title | = | "Lecture Notes in Computer Science Vol. 310", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988"} |
| author | = | "J. N. Lyness", | |
| title | = | "Some Comments on Quadrature Rule Construction Criteria", | |
| booktitle | = | "International Series of Numerical Mathematics Vol. 85, Numerical Integration III", | |
| editor | = | "G. Hammerlin and H. Brass", | |
| publisher | = | "Birkhauser Verlag", | |
| address | = | "Basel", | |
| year | = | "1988", | |
| pages | = | "117-129"} |
| author | = | "W. McCune", | |
| title | = | "Challenge Equality Problems in Lattice Theory", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", | |
| editor | = | "E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "704-409"} |
| author | = | "B. McMillin and L. M. Ni", | |
| title | = | "Executable Assertion Development for Reliable Parallel Processing", | |
| booktitle | = | "Proc. of the 1988 COMPSAC", | |
| address | = | "Chicago", | |
| year | = | "1988", | |
| pages | = | "284-291"} |
| author | = | "J. J. More'", | |
| title | = | "Numerical Solution of Bound Constrained Problems", | |
| booktitle | = | "Computational Techniques and Applications CTAC-87", | |
| editor | = | "J. Noye and C. Fletcher", | |
| publisher | = | "North-Holland", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "29-37"} |
| author | = | "J. J. More'", | |
| title | = | "Trust Regions and Projected Gradients", | |
| booktitle | = | "Lecture Notes in Control and Information Sciences Vol. 113", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| yeaer | = | "1988", | |
| pages | = | "1-13"} |
| author | = | "L. M. Ni", | |
| title | = | "Large-grain Pipelining on Hypercube Computers", | |
| booktitle | = | "Proc. of the Third Conf. on Hypercube Concurrent Computers and Applications", | |
| year | = | "1988", | |
| pages | = | "1583-1591"} |
| author | = | "L. M. Ni", | |
| title | = | "Relay Approach Message Routing in Hypercube Multiprocessors", | |
| booktitle | = | "Proc. of the Third Intl. Conf. on Supercomputing", | |
| address | = | "Boston", | |
| year | = | "1988", | |
| pages | = | "174-182"} |
| author | = | "L. M. Ni", | |
| title | = | "Large-Grain Pipelining on Distributed-Memory Multiprocessors", | |
| booktitle | = | "Proc. of the Third Intl. Conf. on Supercomputing", | |
| address | = | "Boston", | |
| year | = | "1988", | |
| pages | = | "188-194"} |
| author | = | "R. L. Stevens", | |
| title | = | "Challenge Problems from Nonassociative Rings for Theorem Provers", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", | |
| editor | = | "E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "730-734"} |
| author | = | "C. P. Thompson and G. K. Leaf and S. P. Vanka", | |
| title | = | "Application of a Multigrid Method to a Buoyancy-Induced Flow Problem", | |
| booktitle | = | "Multigrid Methods: Theory, Applications, and Supercomputing", | |
| editor | = | "S. F. McCormick", | |
| publisher | = | "Marcel Dekker", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "605--629"} |
| author | = | "T.-C. Wang", | |
| title | = | "Elements of Z-Module Reasoning", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", | |
| editor | = | " E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "21-40"} |
| author | = | "L. Wos and W. McCune", | |
| title | = | "Challenge Problems Focusing on Equality and Combinatory Logic Evaluating Automated Theorem-Proving Programs", | |
| booktitle | = | "Lecture Notes in Computer Science Vol. 310", | |
| editor | = | "E. Lusk and R. Overbeek", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1988", | |
| pages | = | "714-729"} |
| author | = | "J. Dongarra and J. DuCroz and I. Duff and S. Hammarling", | |
| title | = | "A Set of Level 3 Basic Linear Algebra Subprograms", | |
| number | = | "MCS-P1-0888", | |
| institution | = | "Argonne national Laboratory", | |
| year | = | "1988"} |
| author | = | "J. Dongarra and J. DuCroz and I. Duff and S. Hammarling", | |
| title | = | "Level 3 Basic Linear Algebra Subprograms: Model Implementation and Test Programs", | |
| number | = | "MCS-P2-0888", | |
| institution | = | "Argonne national Laboratory", | |
| year | = | "1988"} |
| author | = | "Man Kam Kwong", | |
| title | = | "Oscillation of First-Order Delay Equations", | |
| journal | = | "J. Math. Anal. and Applic.", | |
| volume | = | "156', | |
| volume | = | "1", | |
| year | = | "1991", | |
| pages | = | "274-286"} |
| author | = | "A. Griewank", | |
| title | = | "Automatic Evaluation of First- and Higher-Derivative Vectors", | |
| book | = | "Internatinoal Series of Numerical Mathematics, Vol. 96", | |
| year | = | "1991", | |
| publisher | = | "Birkhauser Verlag", | |
| addrress | = | "Basel"} |
| author | = | "I.-L. Chern", | |
| title | = | "Large-Time Behavior of Solutions of Lax-Friedrichs Finite Difference Equations for Hyperbolic Conservation Laws", | |
| journal | = | "Math. Computation", | |
| volume | = | "56", | |
| issue | = | "193", | |
| year | = | "1991", | |
| pages | = | "107-118"} |
| title | = | "A Comparative Study of Automatic Vectorizing Compilers", | |
| author | = | "D. Levine and D. Callahan and J. Dongarra", | |
| journal | = | "Parallel Computing", | |
| volume | = | "17", | |
| year | = | "1991", | |
| pages | = | "1223-1244"} |
| authors | = | "J. M. Boyle and T. J. Harmer", | |
| title | = | "Functional Specifications for Mathematical Computations", | |
| book | = | "Constructing Programs from Specifications", | |
| editor | = | B. Moller", | |
| publisher | = | "Elsevier Science Publ.", | |
| address | = | "North=Holland", | |
| year | = | "1991", | |
| pages | = | "205-224"} |
| author | = | "A. Griewank and L. Sheng", | |
| title | = | "On the Gauss-Broyden Method for Nonlinear Least Squares", | |
| booktitle | = | "Mathematics for Large Scale Computing", | |
| editor | = | "J. C. Diaz", | |
| publisher | = | "Marcel Dekker", | |
| place | = | "New York", | |
| year | = | "1989", | |
| pages | = | "1-31"} |
| author | = | "Man Kam Kwong and A. Zettl", | |
| title | = | "Determining the Best Constant for the 2 x 2 Matrix Landau Inequality Using MAPLE", | |
| number | = | "MCS-P7-0988", | |
| year | = | "1988"} |
| author | = | "Man Kam Kwong and A. Zettl", | |
| title | = | "Norm Inequalities for the Powers of a Matrix", | |
| journal | = | "American Mathematical Monthly", | |
| volume | = | "98", | |
| issue | = | "6", | |
| year | = | "1991", | |
| pages | = | "533-538"} |
| author | = | "R. H. Byrd and J. Nocedal", | |
| title | = | "An Analysis of Reduced Hessian Methods for Constrained Optimization", | |
| journal | = | "Math. Prog.", | |
| volume | = | "49", | |
| year | = | "1991", | |
| pages | = | "285-323"} |
| author | = | "W. J. Cody", | |
| title | = | "Performance Evaluation of Programs Related to the Real Gamma Function", | |
| number | = | "MCS-P12-0988", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1988"} |
| author | = | "K. Dritz", | |
| title | = | "Influence of Language Features on the Specification of a Standardized Generic Package of Elementary Functions in Ada", | |
| number | = | "MCS-P16-1088", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1988"} |
| author | = | "P. B. Bailey and B. S. Garbow and H. G. Kaper and A. Zettl", | |
| title | = | "Eigenvalue and Eigenfunction Computations for Sturm-Liouville Problems", | |
| journal | = | "ACM Trans. Math. Software", | |
| volume | = | "17", | |
| issue | = | "4", | |
| year | = | "1991", | |
| pages | = | "491-499"} |
| author | = | "S. Balakrishna and L. T. Biegler", | |
| journal | = | "Industrial and Engineering Chemistry Resesarch", | |
| year | = | "1992", | |
| page | = | "31", | |
| title | = | "Constructive Targeting Approaches for the Synthesis of Chemical Reaactor Networks"} |
| author | = | "K. Deng and M. K. Kwong and H. A. levine", | |
| title | = | "The Influence of Nonlocal Nonlinearities on the Long Time Behavior of Solutions of Burgers's Equation", | |
| journal | = | "Q. Applied Math.", | |
| volume | = | "L", | |
| issue | = | "1", | |
| year | = | "1992", | |
| pages | = | "173-200"} |
| title | = | "Some Numerical Results on Best Uniform Rational Approximation of xa on [0,1]", | |
| author | = | R. Varga and A. Carpenter", | |
| journal | = | "Numerical Algorithms", | |
| volume | = | "2", | |
| year | = | "1992", | |
| pages | = | " 171-185"} |
| author | = | "P. B. Bailey and B. S. Garbow and H. G. Kaper and A. Zettl", | |
| title | = | "Algorithm XXX: A Fortran Software Package for Sturm-Liouville Problems", | |
| number | = | "MCS-P19-1088", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1988"} |
| author | = | "P. T. P. Tang", | |
| title | = | "A Fast Algorithm for Linear Complex Chebyshev Approximation", | |
| journal | = | "Math. Comp.", | |
| volume | = | "51", | |
| year | = | "1988", | |
| pages | = | "721-739"} |
| author | = | "C. H. Bischof", | |
| title | = | "A Parallel QR Factorization Algorithm with Controlled Local Pivoting", | |
| journal | = | "SIAM J. Sci. Stat. Comput.", | |
| volume | = | "12", | |
| issue | = | "1", | |
| year | = | "1991", | |
| pages | = | "36-57"} |
| author | = | "F. B. Hanson and D. C. Sorensen", | |
| title | = | "The SCHEDULE Parallel Programming Package with Recycling Job Queues and Iterated Dependency Graphs", | |
| journal | = | "Concurrency: Practice and Experience", | |
| volume | = | "2", | |
| year | = | "1990", | |
| pages | = | "33-53"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Use of Language Features in the Implementation and Validation of a Standardized Generic Package of Elementary Functions in Ada", | |
| booktitle | = | "Sandia Workshop on Ada in Real-Time and Scientific Environments", | |
| address | = | "Albuquerque", | |
| year | = | "1988"} |
| author | = | "A. Griewank and P. J. Rabier", | |
| title | = | "On the Smoothness of Convex Envelopes", | |
| journal | = | "Trans. Amer. Math. Soc.", | |
| volume | = | "322", | |
| year | = | "1990", | |
| pages | = | "691-709"} |
| author | = | "M. T. Chu", | |
| title | = | "A Continuous Jacobi-like Approach to the Simultaneous Reduction of Real Matrices", | |
| journal | = | "Linear Algebra and Its Applications", | |
| volume | = | "147", | |
| year | = | "1991", | |
| pages | = | "75-96"} |
| author | = | "I. B. Tjoa and L. T. Biegler", | |
| title | = | "Simultaneous Strategies for Data Reconciliation and Gross Error Detection of Nonlinear Systems", | |
| journal | = | "Computers and Chemical Engineering", | |
| volume | = | "15", | |
| issue | = | "10", page = "679", | |
| year | = | "1991"} |
| author | = | "S. J. Wright", | |
| title | = | "Algorithms for Minimization Subject to Bounds", | |
| number | = | "MCS-P32-1288", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1988"} |
| author | = | "W. Winsborough", | |
| title | = | "Source-Level Transformations for Multiple Specialization of Horn Clauses", | |
| number | = | "MCS-P33-1288", | |
| year | = | "1988"} |
| author | = | "J. N. Lyness and T. Sorevik and P. Keast", | |
| title | = | "Notes on Integration and Integer Sublattices", | |
| journal | = | "Math. Comp.", | |
| volume | = | "56", | |
| issue | = | "193", | |
| year | = | "1991", | |
| pages | = | "243-255"} |
| author | = | "M. Garbey and H. G. Kaper and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Bifurcation Analysis of Condensed-Phase Surface Combustion", | |
| journal | = | "Euro. J. Applied Math.", | |
| volume | = | "1", | |
| year | = | "1990", | |
| pages | = | "73-89"} |
| author | = | "M. Garbey and H. G. Kaper and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Linear Stability Analysis of Cylindrical Flames", | |
| journal | = | "Quart. Appl. Math.", | |
| volume | = | "42", | |
| year | = | "1989", | |
| pages | = | "691-704"} |
| author | = | "J. J. More' and S. A. Vavasis", | |
| title | = | "On the Solution of Concave Knapsack Problems", | |
| journal | = | "Mathematical Programming", | |
| volume | = | "49", | |
| year | = | "1991", | |
| pages | = | "397-411"} |
| author | = | "A. Griewank", | |
| title | = | "The Equivalence of Strict Convexity and Injectivity of the Gradient in Bounded Level Sets", | |
| number | = | "MCS-P41-0189", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "J. V. Burke", | |
| title | = | "On the Identification of Active Constraints II: The Nonconvex Case", | |
| number | = | "MCS-P43-0189", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "E. Lusk and R. Olson and R. Overbeek and S. Tuecke", | |
| title | = | "Prototyping Databases in Prolog", | |
| booktitle | = | "Practice of Prolog", | |
| editor | = | "Leon Sterling", | |
| publisher | = | "MIT Press", | |
| year | = | "1989"} |
| author | = | "M. T. Chu", | |
| title | = | "A Derivative-Free Iterative Method for Locating the Hand Position of a Robot Manipulator", | |
| number | = | "MCS-P48-0189", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "A. Bayliss and B. Matkowsky and M. Minkoff", | |
| title | = | "Numerical Computation of Bifurcation Phenomena and Pattern Formation in Combustion", | |
| number | = | "MCS-P52-0189", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "G. K. Leaf and M. Minkoff and J. C. Diaz", | |
| title | = | "Nested Block Factorization Preconditioners for Convective-Diffusion Problems in Three Dimensions", | |
| number | = | "MCS-P53-0289", | |
| institution | = | "Argonne National Laboratory", | |
| yeaer | = | "1989"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Table-Driven Implementation of the Logarithm Function in IEEE Floating-Point Arithmetic", | |
| number | = | "MCS-P55-0289", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "P. Takac", | |
| title | = | "A Fast Diffusion Equation Which Generates a Monotone Local Semiflow I: Local Existence and Uniqueness", | |
| journal | = | "Diff. and Integral Eqs.", | |
| volume | = | "4", | |
| issue | = | "1", | |
| year | = | "1991", | |
| pages | = | "151-174"} |
| author | = | "P. Takac", | |
| title | = | "A Fast Diffusion Equation Which Generates a Monotone Local Semiflow II: Global Existence and Asymptotic Behavior", | |
| journal | = | "Diff. and Integral Eqs.", | |
| volume | = | "4", | |
| issue | = | "1", | |
| year | = | "1991", | |
| pages | = | "175-187"} |
| author | = | "C. Gupta", | |
| title | = | "Existence and Uniqueness Theorems for a Fourth Order Boundary Value Problem of Sturm-Liouville Type", | |
| journal | = | Differential and Integral Equations", | |
| volume | = | "4", | |
| issue | = | "2", | |
| pages | = | "397-410", | |
| year | = | "1991"} |
| author | = | "W. J. Cody and L. Stoltz", | |
| title | = | "The Use of Taylor Series to Test Accuracy of Function Programs", | |
| journal | = | "ACM Trans. on Math. Soft.", | |
| volume | = | "17", | |
| issue | = | "1", | |
| year | = | "1991", | |
| pages | = | "55-63"} |
| author | = | "M. S. Du and Man Kam Kwong", | |
| title | = | "Sturm Comparison Theorems for Second-Order Delay Equations", | |
| year | = | "1990", | |
| volume | = | "152", | |
| issue | = | "2", | |
| pages | = | "305-323", |
| author | = | "J. M. Howie and R. B. McFadden", | |
| title | = | "Ideals Are Greater on the Left", | |
| journal | = | "Semigroup Forum", | |
| volume | = | "40", | |
| year | = | "1990", | |
| pages | = | "247-248"} |
| author | = | "S. J. Wright", | |
| title | = | "A Parallel Algorithm for Banded Linear Systems", | |
| number | = | "MCS-P64-0289", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "M. T. Chu and K. R. Driessel", | |
| title | = | "The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints", | |
| journal | = | "SIAM J. Numer. Anal.", | |
| volume | = | "27", | |
| year | = | "1990", | |
| pages | = | "1050-1060"} |
| author | = | "O. Brewer and J. Dongarra and D. Sorensen", | |
| title | = | "A Graphics Tool to Aid in the Generation of Parallel Fortran Programs", | |
| booktitle | = | "Proc. 13th Annual International Computer Software and Appl. Conf.", | |
| year | = | "1989", | |
| publisher | = | 'IEEE", | |
| address | = | "Washington", | |
| pages | = | "89-93"} |
| author | = | "J. Demmel and A. McKenney", | |
| title | = | "LAPACK Working Note No. 9: A Test Matrix Generation Suite", | |
| number | = | "MCS-P69-0389", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "M. T. Chu", | |
| title | = | "Least Squares Approximation by Real Normal Matrices with Specified Spectrum", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "12", | |
| year | = | "1991", | |
| pages | = | "115-127"} |
| author | = | "C. Bischof", | |
| title | = | "Computing the Singular Value Decomposition on a Distributed System of Vector Processors", | |
| number | = | "MCS-P71-0389", | |
| journal | = | "Parallel Computing", | |
| volume | = | "11", | |
| pages | = | "171-186", | |
| year | = | "1989"} |
| author | = | "M. K. Kwong", | |
| title | = | "A Comparison Result and Elliptic Equations Involving Subcritical Exponents", | |
| book | = | "Progress in Nonlinear Differential Equalitons", | |
| editor | = | "N. G. Lloyd and W. M. Ni and L. A. Peletier and J. Serrin", | |
| address | = | "Birkhauser", | |
| year | = | "1992"} |
| author | = | "P. Takac", | |
| title | = | "Invariant 2-Tori in the Time-Dependent Ginsburg-Landau Equation", | |
| journal | = | "Nonlinearity", | |
| pages | = | "289-321", | |
| volume | = | "5", | |
| year | = | "1992"} |
| author | = | "R. Stevens and P. McDonough", | |
| title | = | "Instruction Timings and Message Passing Performance of the Connection Machine 2", | |
| number | = | "MCS-P76-0489", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "J. J. More' and G. Toraldo", | |
| title | = | "On the Solution of Large Quadratic Programming Problems with Bound Constraints", | |
| journal | = | "SIAM Journal on Optimization", | |
| volume | = | "1", | |
| year | = | "1991", | |
| pages | = | "93-113"} |
| author | = | "L. Wos and W. McCune", | |
| title | = | "Automated Theorem Proving and Logic Programming: A Natural Symbiosis", | |
| journal | = | "J. Logic Programming", | |
| volume | = | "11", | |
| issue | = | '1", | |
| year | = | "1991", | |
| pages | = | "1-53"} |
| author | = | "C. P. Gupta", | |
| title | = | "Existence and Uniqueness Theorems for Some Fourth Order Fully Quasilinear Boundary Value Problems", | |
| journal | = | "Applicable Analysis", | |
| volume | = | "36", | |
| year | = | "1990", | |
| pages | = | "157-169"} |
| author | = | "I. Foster and S. Taylor", | |
| title | = | "Strand: A Practical Parallel Programming Tool", | |
| booktitle | = | "Proc. North American Symp. on Logic Programming", | |
| publisher | = | 'MIT Press", | |
| pages | = | "497-512", | |
| year | = | "1989"} |
| author | = | "S. Wright", | |
| title | = | "Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization", | |
| number | = | "MCS-P83-0689", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Testing Computer Arithmetic by Elementary Number Theory", | |
| number | = | "MCS-P84-0889", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "M. Garbey and D. Levine", | |
| title | = | "Massively Parallel Computation of Conservation Laws", | |
| journal | = | "Parallel Computing", | |
| volume | = | "16", | |
| year | = | "1990", | |
| pages | = | "293-304"} |
| author | = | "W. Winsborough", | |
| title | = | "Path-Dependent Reachability Analysis for Multiple Specialization", | |
| number | = | "MCS-P86-0689", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "W. McCune and L. Wos", | |
| title | = | "The Absence and the Presence of Fixed Point Combinators", | |
| journal | = | "Theoretical Computer Science", | |
| volume | = | "87", | |
| pages | = | '221-228", | |
| year | = | "1991"} |
| author | = | "T. Harmer and J. M. Boyle", | |
| title | = | "An Optimization to Increase Parallelism in Parallel Pure Lisp Implementations", | |
| number | = | "MCS-P88-0689", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "S. J. Wright", | |
| title | = | "Solution of Discrete-Time Optimal Control Problems on Parallel Computers", | |
| journal | = | "Parallel Computing", | |
| volume | = | "16", | |
| year | = | "1990", | |
| pages | = | "221-238"} |
| author | = | "W. J. Cody", | |
| title | = | "ALGORITHM XXX: Functions to Support the IEEE Standard for Binary Floating-Point Arithmetic", | |
| number | = | " MCS-P90-0789", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "F. V. Atkinson and L. A. Pelletier", | |
| title | = | "Oscillation of Solutions of Perturbed Autonomous Equations, with an Application to Nonlinear Elliptic Eigenvalue Problems Involving Critical Sobolev Exponents", | |
| number | = | "MCS-P91-0789", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Scroggs and D. Sorensen", | |
| title | = | "An Asymptotic Induced Numerical Method for the Convection-Diffusion-Reaction Equation", | |
| booktitle | = | "Mathematics for Large Scale Computing", | |
| editor | = | "J. C. Diaz", | |
| publisher | = | "Marcel Dekker", | |
| address | = | "New York", | |
| year | = | "1989", | |
| pages | = | "81-114"} |
| author | = | "L. Wos and R. Overbeek and E. Lusk", | |
| title | = | "Subsumption: A Sometimes Undervalued Procedure", | |
| booktitle | = | "Festschrift for J. A. Robinson" | |
| editor | = | ' J.-L. Lassez and Gordon Plotkin", | |
| publisher | = | "MIT Press", | |
| address | = | "Cambridge, Mass.", | |
| pages | = | "3-40", | |
| year | = | "1991"} |
| author | = | "C. A. Bischof", | |
| title | = | "A Block QR Factorization Algorithm Using Restricted Pivoting", | |
| number | = | "MCS-P95-0789", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Guaranteeing the Absence of a Complete Set of Reductions", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "5", | |
| issue | = | "4", | |
| pages | = | "531-532", | |
| year | = | "1989"} |
| author | = | "C. P. Gupta", | |
| title | = | "Solvability of a Fourth-Order Fully Quasilinear Boundary Value Problem with Periodic Boundary Conditions II", | |
| journal | = | "Internat. J. Math. and Sci.", | |
| volume | = | "14", | |
| year | = | "1991", | |
| pages | = | "127-138"} |
| author | = | "Man Kam Kwong and Peng-Yung Woo and Rondong Wang", | |
| title | = | "Using MAPLE for Symbolic Derivation of Dynamic Equations of Robotic Manipulators", | |
| number | = | "MCS-P97-0889", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} @article"SinOve89:derive, | |
| author | = | "A. K. Singh and R. Overbeek", | |
| title | = | "Derivation of Efficient Parallel Programs: An Example from Genetic Sequence Analysis", | |
| journal | = | "Int. J. Parallel Programming", | |
| volume | = | "18", | |
| issue | = | "6", | |
| year | = | "1989"} |
| author | = | "L. Bomans and R. Hempel", | |
| title | = | "The Argonne/GMD Macros in FORTRAN for Portable Parallel Programming and Their Implementation of the Intel iPSC/2", | |
| number | = | "MCS-P98-0889", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "I. Foster and W. Winsborough", | |
| title | = | "Copy Avoidance through Compile-Time Analysis and Local Reuse",' | |
| booktitle | = | "Proc. Intl. Symp. on Logic Programming", | |
| pages | = | "455-469", | |
| publisher | = | 'MIT Press", | |
| year | = | "1991"} |
| author | = | "F. V. Atkinson", | |
| title | = | "Asymptotics of an Eigenvalue Problem Involving an Interior Singularity", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: vol. 2, Singular Differential Equations, ANL-87-26", | |
| year | = | "1988", | |
| pages | = | "1-18"} |
| author | = | "F. V. Atkinson", | |
| title | = | "Estimation of the Titchmarsh-Weyl Function m(lambda) in a Case with an Oscillating Leading Coefficient", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Vol. 2: Singular Differential Equations, ANL-87-26", | |
| year | = | "1988", pages "19-43"} |
| author | = | "F. V. Atkinson and C. T. Fulton", | |
| title | = | "Asymptotics of the Titchmarsh-Weyl $m$-Coefficient for Nonintegrable Potentials", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Vol. 2: Singular Differential Equations, ANL-87-26", | |
| year | = | "1988", | |
| pages | = | "79-103"} |
| author | = | "F. V. Atkinson and A. M. Krall and G. K. Leaf and A. Zettl", | |
| title | = | "On the Numerical Computation of Eigenvalues of Sturm-Liouville Problems with Matrix Coefficients", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Vol. 3, Linear Differential Equations and Systems, ANL-87-26", | |
| year | = | "1989", | |
| pages | = | "21-38"} |
| author | = | "C. Bischof and J. Demmel and J. Dongarra and A. Greenbaum and S. Hammarling and D. Sorensen", | |
| title | = | "LAPACK Working Note No. 5: Provisional Contents", | |
| number | = | "ANL-88-38", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "M. Carlsson and K. Danforth and R. Overbeek", | |
| title | = | "Practical Issues Relating to the Internal Database Predicates in an OR-Parallel Prolog: Extensions and Useful Hacks", | |
| number | = | "ANL-88-11", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "W. R. Cowell", | |
| title | = | "Users' Guide to Toolpack/1 Tools for Data Dependency Analysis and Program Transformation", | |
| number | = | "ANL-88-17", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "K. W. Dritz", | |
| title | = | "Rationale for the Proposed Standard for a Generic Package of Elementary Functions for Ada", | |
| number | = | "ANL-89/2", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "C. T. Fulton and S. A. Pruess", | |
| title | = | "A User's Guide to Subroutine SPDNSF,'' | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Vol. 3: Linear Differential Systems and Equations ANL-87-26", | |
| year | = | "1989", | |
| pages | = | "77-101"} |
| author | = | "D. W. Gillman and H. G. Kaper and M. K. Kwong", | |
| title | = | "L2-Norm Inequalities for the Differentiation Operator on Compact Intervals", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems" Vol. 3: Linear Differential Systems and Equations ANL-87-26", | |
| year | = | "1989", | |
| pages | = | "103-111" |
| author | = | "H. G. Kaper and B. Schultze", | |
| title | = | "Spectral Analysis of a Fourth-Order Singular Differential Operator,'' Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems ANL-87-26, Vol. 2: Singular Differential Equations", | |
| year | = | "1988", | |
| pages | = | "113-124"} |
| author | = | "M. K. Kwong and H. G. Kaper", | |
| title | = | "Landau's Inequality for the Difference Operator", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems, ANL-87-26, Vol. 3: Linear Differential Systems and Equations", | |
| year | = | "1989", | |
| pages | = | "127-134"} |
| author | = | "J. N. Lyness and W. Newman", | |
| title | = | "A Classification of Lattice Rules Using the Reciprocal Lattice Generator Matrix", | |
| number | = | "ANL-89/20", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989"} |
| author | = | "W. W. McCune", | |
| title | = | "OTTER 1.0 Users' Guide", | |
| number | = | "ANL-88-44", | |
| year | = | "1989}, | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "G. W. Pieper, ed.', | |
| title | = | "Activities and Operations of the Advanced Computing Research Facility: November 1987 - December 1988", | |
| number | = | "ANL-89/1", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "G. W. Pieper, ed.", | |
| title | = | "Research in Mathematics and Computer Science at Argonne: July 1, 1986 - January 6, 1988", | |
| number | = | "ANL-88-18", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Proceedings of the Workshop on Advanced Computer Technologies and Biological Sequencing", | |
| number | = | "ANL-88-45", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "B. T. Smith", | |
| title | = | "Reference Manual for the Environmental Theorem Prover: An Incarnation of AURA", | |
| number | = | "ANL-88-2", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Accurate and Efficient Testing of the Exponential and Logarithm Functions in Ada", | |
| number | = | "ANL-88-24", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "P. T. P. Tang", | |
| title | = | "Portable Implementation of a Generic Exponential Function in Ada", | |
| number | = | "ANL-88-3", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "L. Wos and W. McCune", | |
| title | = | "Searching for Fixed Point Combinators by Using Automated Theorem Proving: A Preliminary Report", | |
| number | = | "ANL-88-10", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "D. Adams et al.", | |
| title | = | "Global Trends in Computer Technology and Their Impact on Export Control, National Research Council Report", | |
| year | = | "1988"} |
| author | = | "E. Anderson and J. Dongarra", | |
| title | = | "LAPACK Working Note No. 10: Installing and Testing the Initial Release of LAPACK Unix and Non-Unix Versions", | |
| number | = | "MCS-TM-130", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "Z. Bai and J. Demmel", | |
| title | = | "LAPACK Working Note No. 8: On a Block Implementation of Hessenberg Multishift QR Iteration", | |
| number | = | "MCS-TM-127", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "D. Bailey and E. Brooks and J. Dongarra and A. Hayes and M. Heath and G. Lyons", | |
| title | = | "Benchmarks to Supplant Export `FPDR' Calculations", | |
| institution | = | "Institute for Computer Science and Technology", | |
| number | = | "NBSIR 88-3795", | |
| year | = | "1988) |
| author | = | "J. Barlow and J. Demmel", | |
| title | = | "LAPACK Working Note 7: Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices", | |
| number | = | "MCS-TM-126", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. V. Burke and J. J. More' and G. Toraldo", | |
| title | = | "Convergence Properties of Trust Region Methods for Linear and Convex Constraints", | |
| journal | = | "Math. Prog.", | |
| volume | = | "47", | |
| year | = | "1990", | |
| pages | = | 305-336", | |
| year | = | "1988", | |
| note | = | "also MCS-TM-116"} |
| author | = | "W. J. Cody", | |
| title | = | "ELEFUNT Test Results under FORTRAN-PLUS on the Active Memory Technology DAP 510-8", | |
| number | = | "MCS-TM-125", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "W. J. Cody", | |
| title | = | "ELEFUNT Test Results Using Titan Fortran under Ardent UNIX 2.0 on the Titan", | |
| number | = | "MCS-TM-129", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Demmel and W. Kahan", | |
| title | = | "LAPACK Working Note No. 3: Computing Small Singular Values of Bidiagonal Matrices with Guaranteed High Relative Accuracy", | |
| number | = | "MCS-TM-110", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Demmel and J. DuCroz and S. Hammarling and D. Sorensen", | |
| title | = | "LAPACK Working Note No. 4: Guidelines for the Design of Symmetric Eigenroutines, SVD, and Iterative Refinement and Condition Estimation for Linear Systems", | |
| number | = | "MCS-TM-111", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Dongarra", | |
| title | = | "Performance of Various Computers Using Standard Linear Equations Software in a Fortran Environment", | |
| number | = | "MCS-TM-23", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. J. Dongarra and E. L. Lusk", | |
| title | = | "Final Report: Institute in Parallel Computing", | |
| number | = | "MCS-TM-122", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "A. Griewank", | |
| title | = | "The Global Convergence of Partitioned BFGS on Problems with Convex Decompositions and Lipschitzian Gradientsu", | |
| num ber | = | "MCS-TM-105", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "F. Hanson", | |
| title | = | "Computational Dynamic Programming for Stochastic Optimal Control on a Vector Multiprocessor", | |
| number | = | "MCS-TM-113", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "A. Jindal and R. Overbeek and W. McCune", | |
| title | = | "A Parallel Processing Approach for Implementing High-Performance First-Order Logic Deduction Systems", | |
| number | = | "MCS-TM-131", | |
| year | = | "1989", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "E. L. Lusk and R. Overbeek and L. Sterling", | |
| title | = | "Effective Utilization of OR-Parallelism: A Modest Proposal", | |
| number | = | "MCS-TM-124", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "P. Mehrotra and J. van Rosendale", | |
| title | = | "The BLAZE Family of Languages: Programming Environments for Shared and Distributed Memory Architectures", | |
| number | = | "MCS-TM-108", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. J. More' and G. Toraldo", | |
| title | = | "Algorithms for Bound-Constrained Quadratic Programming Problems", | |
| year | = | "1989", | |
| journal | = | "Numer. Math", | |
| volume | = | "55", | |
| pages | = | "377-400"} |
| author | = | "J. Scroggs", | |
| title | = | "The Solution of a Parabolic Partial Differential Equation via Domain Decomposition: The Synthesis of Asymptotic and Numerical Analysis", | |
| number | = | "MCS-TM-123", | |
| year | = | "1988", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "F. V. Atkinson", | |
| title | = | "Self-Intersecting Solutions of the Prescribed Mean Curvature Equation", | |
| booktitle | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Nonlinear Differential Equations 4: ANL-87-26", | |
| publisher | = | "Argonne National Laboratory", | |
| pages | = | "1-20", | |
| year | = | 1989 | |
| Abstract | = | " Inequalities and asymptotic estimates are obtained for solutions of the prescribed mean curvature equation in a group of cases in which f(u) is positive, increasing, and unbounded. This system is the intrinsic version of the radially symmetric prescribed mean curvature equation and permits the study of certain generalized solutions of this equation." |
| author | = | "F. V. Atkinson and L. A. Peletier", | |
| title | = | "Bounds for Vertical Points of Solutions of Prescribed Mean Curvature Type Equations,'' | |
| journal | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Nonlinear Differential Equations", | |
| volume | = | "4, ANL-87-26", | |
| pages | = | "21-42" | |
| Abstract | = | "Conditions are obtained under which radial solutions of generalized capillary-type equations exhibit a first vertical point, together with bounds and asymptotic estimates for these points." |
| author | = | "F. V. Atkinson and L. A. Peletier", | |
| title | = | "Large Solutions of Elliptic Equations Involving Critical Exponents", | |
| jounral | = | "Proc. of the Focused Research Program on Spectral Theory and Boundary Value Problems: Nonlinear Differential Equations", volume "4, ANL-87-26", | |
| year | = | "1989", | |
| pages | = | " 43-72", | |
| Abstract | = | " This paper focuses on obtaining precise estimates of positive radial solutions of particular elliptic equations." |
| title | = | "Bifurcation and Pattern Formation in Combustion", | |
| author | = | A. Bayliss and B. J. Matkowsky and M. Minkoff", | |
| booktitle | = | "Ordinary and Partial Differential Equations", | |
| editor | = | "B. D. Sleeman and R. J. Jarvis", | |
| publisher | = | "John Wiley and Sons", | |
| address | = | "N.Y.", | |
| year | = | 1989, | |
| pages | = | "1-51" | |
| Abstract | = | " The authors have developed an adaptive pseudo-spectral method that is both very accurate and very efficient. The algorithm allows them to describe the solution on bifurcation branches in combustion, far beyond the region where analytical methods work well. The analytical results that they obtain are used to choose appropriate parameter values and initial conditions for the numerical computations. In addition, the analytical results serve as benchmarks for the computations. The computations reveal new and interesting behavior. Two problems are discussed, involving solid and gaseous fuel combustion." |
| author | = | "C. H. Bischof", | |
| title | = | "Incremental Condition Estimation'", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "11", | |
| issue | = | "2", | |
| year | = | "1990", | |
| pages | = | "312-322", | |
| Abstract | = | ' This paper introduces a technique for estimating the smallest singular value of a dense triangular matrix as it is generated one row or column at a time. Numerical experiments demonstrate that despite its small computational cost, this condition estimator is very reliable. The paper also gives an example that shows the advantage of incorporating the incremental condition estimation strategy into the QR factorization algorithm with column pivoting to guard against failure of the pivoting strategy going unnoticed." |
| author | = | "C. H. Bischof and J. J. Dongarra", | |
| title | = | "A Linear Algebra Library for High-Performance Computers", | |
| booktitle | = | "Parallel Supercomputing: Methods, Algorithms and Applications", | |
| editor | = | "G. F. Carey", | |
| publisher | = | "John Wiley and Sons", | |
| address | = | "N. Y.", | |
| year | = | "1989", | |
| pages | = | "45-56", | |
| Abstract | = | " Argonne, the Courant Institute, and NAG are developing a transportable linear algebra library in Fortran 77. The library (called LAPACK) will provide routines for solving systems of simultaneous linear equations, least-squares solutions of overdetermined systems of equations, and eigenvalue problems. The new library will be based on the successful EISPACK and LINPACK libraries. It will be designed to be efficient and transportable across a wide range of computing environments, with special emphasis on modern high-performance computers. The new library will be distributed over a system similar to netlib, at no or minimal cost." |
| author | = | "R. Butler and I. Foster and A. Jindal and R. Overbeek", | |
| title | = | "A High-Performance Parallel Theorem Prover", | |
| booktitle | = | "Proc. 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 449", | |
| editor | = | " M. E. Stickel", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "Berlin", | |
| year | = | "1990", | |
| pages | = | "649-650", | |
| Abstract | = | " This paper reports on the implementation of a parallel theorem proving system that supports hyperresolution, subsumption, and the set of support strategy. The upper level of the program, written in the concurrent programming language Strand, implements the general algorithm and describes the interconnectivity of processes that perform the theorem-proving tasks such as resolution and subsumption. These compute-intensive tasks are performed by procedures implemented in C. Speedups have been demonstrated on such test problems as SAM's lemma." |
| author | = | "M. T. Chu and G. H. Guirguis", | |
| title | = | "A Numerical Method for Solving Interface Problems Arising in Two-Point Boundary Value Problems", | |
| journal | = | "Computer Methods in Appl. Mech. and Engrg.", | |
| volume | = | "74", | |
| year | = | "1989", | |
| pages | = | "99-113", | |
| Abstract | = | " A numerical approach iterating on the position of interface points is suggested for solving interface problems arising in two-point boundary value problems (BVPs). Given an interface problem, it is decomposed into several standard local boundary value problems that are coupled at the interface points. Meanwhile, a nonlinear equation involving the interface points is formulated from the interface conditions. The advantages of this approach are that the boundary conditions for each local problem can easily be selected by considering the natural physical requirements and that each of the local problems can be solved independently by standard numerical BVP techniques." |
| author | = | "W. J. Cody", | |
| title | = | "ELEFUNT Test Results under AST Fortran V1.8.0 on the Sequent Symmetry", | |
| number | = | "MCS-TM-138", | |
| year | = | "1990", | |
| Abstract | = | { This report discusses testing of the floating-point arithmetic and of the elementary function libraries under AST Fortran on a 24-processor Sequent Symmetry computer. The programs MACHAR and PARANOIA were used to check the quality of arithmetic, and the ELEFUNT suite of programs from the book Software Manual for the Elementary Functions by Cody and Waite was used to check function performance. Two complete sets of tests were run, one for each type of floating-point processor, Intel 80387 and Weitek 1167, on the machine. |
| author | = | "W. J. Cody", | |
| title | = | "Performance Evaluation of Programs for the Error and Complementary Error Functions", | |
| journal | = | "TOMS", | |
| volume | = | "16", | |
| year | = | "1990", | |
| pages | = | "29-37", | |
| Abstract | = | " This paper presents methods for performance evaluation of computer programs for the the error and complementary error functions. Accuracy estimates are based on comparisons using power series expansions and an expansion in the repeated integrals of erfc (x). Some suggestions for checking robustness are also given. Details of a specific implementation of a test program are included." |
| author | = | "W. R. Cowell", | |
| title | = | "An Introduction to VecPar77", | |
| journal | = | "NAG Newsletter" | |
| oolume | = | "1", | |
| year | = | "1990", | |
| pages | = | "13-21", | |
| Abstract | = | " VecPar77 is a precompiler tool that analyzes and transforms Fortran 77 programs intended for execution on machines with vector or shared-memory multitasking capabilities. In particular, the tool provides support for the task of modifying existing programs, written originally for serial execution, so that they perform well on advanced-architecture machines. The operation of VecPar77 is divided into two separately invoked phases. In Phase 1, two kinds of Fortran program analysis are performed: syntactic/semantic analysis to detect errors and anomalous constructions in a program, and Do-loop parallelization analysis. In Phase 2, VecPar77 acts as a specialized Fortran-intelligent editor, enabling a user to apply source-to-source transformations aimed at producing Fortran that compiles into code in which the number of references to main memory is reduced. VecPar77 is a direct descendent of Toolpack. It was created by a project jointly supported by the Numerical Algorithms Group, Inc., and the Department of Commerce and Community Affairs of the State of Illinois." |
| author | = | "W. R. Cowell and C. P. Thompson", | |
| title | = | "Tools to Aid in Discovering Parallelism and Localizing Arithmetic in Fortran Programs", | |
| journal | = | "Software--Practice and Experience", | |
| volume | = | "20", | |
| year | = | "1990", | |
| pages | = | "25-47", | |
| Abstract | = | " The authors describe a collection of software tools that analyze and transform Fortran programs. The analysis tools detect parallelism in blocks of code and are primarily intended to aid in adapting existing programs to execute on multiprocessors. The transformation tools are aimed at eliminating data dependencies, thereby introducing parallelism, and at localizing arithmetic in registers, of primary interest in adapting programs to execute on machines that can be memory bound (common for machines with vector architectures). The tools are unified conceptually by their use of a set of conditions for data independence; these conditions have been implemented so as to combine tool analysis with user/tool interaction. Included are timing results from applying the tools to programs intended for execution on two machines with different architectures--a Sequent Balance and a CRAY-2. The tools are written in Fortran in the tool-writing environment provided by Toolpack and are easily incorporated into a Toolpack installation." |
| author | = | "J. Dongarra and E. Lusk", | |
| title | = | "Summer Institute in Parallel Computing: September 5-15, 1989", | |
| number | = | "MCS-TM-136", | |
| year | = | "1989", | |
| Abstract | = | " This report summarizes the objectives of the Summer Institute in Parallel Computing held at Argonne in September 1989." |
| author | = | "J. J. Dongarra and D. C. Sorensen and S. J. Hammarling", | |
| title | = | "Block Reduction of Matrices to Condensed Forms for Eigenvalue Computations", | |
| journal | = | "J. Comp. and Appl. Math.", | |
| volume | = | "27", | |
| year | = | "1989", | |
| pages | = | "215-227", | |
| Abstract | = | " This paper describes block algorithms for the reduction of a real symmetric matrix to tridiagonal form and for the reduction of a general real matrix to either bidiagonal or Hessenberg form by using Householder transformations. The approach is to aggregate the transformations and to apply them in a blocked fashion, thus achieving algorithms that are rich in matrix-matrix operations. These reductions typically are a preliminary step in the computation of eigenvalues or singular values. The authors demonstrate how the initial reduction to tridiagonal or bidiagonal form may be pipelined with the divide-and-conquer technique for computing the eigensystem of a symmetric matrix or the singular value decomposition of a general matrix to achieve algorithms that are load balanced and rich in matrix-matrix operations." |
| author | = | "I. Foster and M. Henderson and R. Stevens", | |
| title | = | "Proc. of the Workshop on Data Systems for Parallel Climate Models held at Argonne National Laboratory, July 15-16, 1991", | |
| number | = | "ANL/MCS-TM-169"< | |
| year | = | "1992" |
| author | = | "I. Foster and H. Kaper and M. K. Kwong", | |
| title | = | "Proc. of the Workshop on the Earth's Climate as a Dynamical System, held at Argonne National Laboratory, Sept. 25-26, 1992", | |
| number | = | "MCS-M-170", | |
| year | = | "1992" |
| author | = | "I. Foster", | |
| title | = | "Automatic Generation of Self-Scheduling Programsu", | |
| journal | = | "IEEE Trans. on Parallel and Distributed Computing", | |
| volume | = | "2", | |
| year | = | "1991", | |
| pages | = | "68-78", | |
| Abstract | = | " The author describes techniques for the automatic generation of self-scheduling parallel programs. A high-level language is used to express both concurrent components of applications and scheduling algorithms. Partitioning and data dependency information are expressed by simple control statements. An automatic source-to-source transformation takes application code, control statements, and scheduling routines and generates a new program that can schedule its own execution of a parallel computer. The approach has several important advantages compared to previous proposals. It generates programs that are portable over a wide range of parallel computers. There is no need to embed special control structures in application programs. Finally, the use of a high-level language to express applications, load-balancing algorithms, and transformations facilitates the development, modification, and reuse of parallel programs." |
| author | = | "I. Foster", | |
| title | = | "A Multicomputer Garbage Collector for a Single-Assignment Language", | |
| journal | = | "International J. Parallel Prog.", | |
| volume | = | "18", | |
| issue | = | "3", | |
| year | = | "1989", | |
| pages | = | "181-203", | |
| Abstract | = | " This paper describes an asynchronous garbage collector for a message-passing multiprocessor. This combines Weighted Reference Counting interprocessor collection and tracing intraprocessor collection to permit individual processors to reclaim local storage independently. A novel feature is the integration of Weighted Reference Counting collection and the communication algorithms required to support a global address space in a single assignment language. This significantly reduces communication overhead and space requirements attributable to garbage collection." |
| author | = | "T. L. Henry and W. W. McCune", | |
| title | = | " FormEd: An X Window System Application for Managing First-Order Formulas", | |
| number | = | "MCS-TM-141", | |
| year | = | "1990"} |
| author | = | "E. Lusk", | |
| title | = | "Summer Institute in Parallel Programming 1990", | |
| number | = | "ANL/MCS-TM-147", | |
| year | = | "1991"} |
| title | = | "What's New in OTTER 2.2", | |
| author | = | "W. W. McCune", | |
| number | = | "ANL/MCS-TM-153", | |
| month | = | "July", | |
| year | = | "1991"} |
| author | = | "I. Foster and R. O. Overbeek", | |
| title | = | "Experiences with Bilingual Parallel Programming", | |
| booktitle | = | "Proc. 5th Distributed Memory Computer Conf.", | |
| pages | = | "1137-1146", | |
| year | = | "1990", | |
| Abstract | = | " Parallel programming requires tools that simplify the expression of complex algorithms, provide portability across different classes of machine, and allow reuse of existing sequential code. The authors have previously proposed bilingual programming as a basis for such tools. In particular, they have proposed the use of a high-level concurrent programming language (such as Strand) to construct parallel programs from (possibly pre-existing) sequential components. Here they report on an applications study intended to evaluate the effectiveness of this approach. They describe experiences developing both new codes and parallel versions of existing codes in computational biology, weather modeling, and automated reasoning. The bilingual approach encourages the development of parallel programs that perform well, are portable, and are easy to maintain." |
| author | = | "I. Foster and C. Kesselman and S. Taylor", | |
| title | = | "Concurrency: Simple Concepts and Powerful Tools", | |
| journal | = | "Computer Journal", | |
| year | = | "1990", | |
| volume | = | "33", | |
| issue | = | "6", | |
| pages | = | "501-508", | |
| Abstract | = | " This paper describes programming language concepts that we have found useful in applying stepwise refinement to parallel programs. The concepts allow decisions concerning program structure to be delayed until late in the design process. This capability permits rapid experimentation with alternative structures and leads to both portable and scalable code. Although simple, the concepts form a sufficient basis for the construction of powerful programming tools. Both concepts and tools have been applied successfully in a wide variety of applications and are incorporated in a commercial concurrent programming system Strand." |
| author | = | "M. Garbey and H. G. Kaper and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Nonlinear Analysis of Condensed-Phase Surface Combustion", | |
| journal | = | "Euro. J. Appl. Math.", | |
| volume | = | "1", | |
| year | = | "1990tract = ", | |
| pages | = | " 73-89", This article is concerned with the structure and stability properties of a combustion front that propagates in the axial direction along the surface of a cylindrical solid fuel element. The fuel consists of a mixture of two finely ground metallic powders, which combine upon ignition in a one-step chemical reaction. The reaction is accompanied by a melting process, which in turn enhances the reaction rate. The combustion products are in the solid state. The reaction zone, inside which the melting occurs, is modeled as a front that propagates along the surface of the cylinder. The different modes of propagation that have been observed experimentally (such as single- and multiheaded spin combustion and multiple-point combustion) are explained as the results of bifurcations from a uniformly propagating plane circular front. The stability properties of the various modes are discussed." |
| author | = | "A. Griewank", | |
| title | = | "On Automatic Differentiation", | |
| booktitle | = | "Mathematical Programming: Recent Developments and Applications", | |
| editor | = | "M. Iri and K. Tanabe", | |
| publisher | = | "Kluwer Academic Publishers" | |
| address | = | " Boston", | |
| year | = | "1989", | |
| pages | = | "83-107", | |
| Abstract | = | In comparison to symbolic differentiation and numerical differencing, the main rule-based technique of automatic differentiation is shown to evaluate partial derivatives accurately and cheaply. In particular, it is demonstrated that the reverse mode of automatic differentiation yields any gradient vector at no more than five times the cost of evaluating the underlying scalar function. After developing the basic mathematics, the author describes several software implementations and briefly discuss the ramifications for optimization." |
| author | = | "C. P. Gupta", | |
| title | = | "A Fourth-Order Nonlinear Boundary Value Problem and an Integral Type Sign Condition", | |
| journal | = | "Applied Math. and Computation", | |
| volume | = | "35", | |
| year | = | "1990", | |
| pages | = | "231-242", | |
| Abstract | = | " This paper focuses on a fourth-order nonlinear boundary value problem associated to the unstable static equilibrium of an elastic beam which is supported by sliding clamps when the nonlinearity satisfies an integral sign condition instead of the usual asymptotic pointwise sign condition. A necessary and sufficient condition is given for the existence of a solution when the nonlinearity is nondecreasing." |
| authoer | = | "C. P. Gupta", | |
| title | = | "A Nonlinear Boundary Value Problem Associated with the Static Equilibrium of an Elastic Beam Supported by Sliding Clamps", | |
| journal | = | "Internat. J. Math. \& Math. Sci.", | |
| volume | = | "12", | |
| issue | = | "4", | |
| year | = | "1989", | |
| pages | = | "697-712", | |
| Abstract | = | " A fourth-order boundary problem describes the unstable static equilibrium of an elastic beam that is supported by sliding clamps at both ends. This paper concerns the nonlinear analogue of this boundary value problem. Some resonance and nonresonance conditions on the asymptotic behavior are studied for the existence of solutions of this nonlinear boundary value problem." |
| author | = | "C. P. Gupta", | |
| title | = | "Nonlinear Second Order System of Neumann Boundary Problems at Resonance", | |
| journal | = | "JAMS", | |
| volume | = | "2" | |
| issue | = | " 3", | |
| year | = | "1989", | |
| pages | = | "169-184", | |
| Abstract | = | " This paper focuses on a nonlinear Neumann boundary value problem at resonance. Asymptotic conditions on the nonlinearity are presented to give existence of solutions for the nonlinear systems. The methods apply to the corresponding system of Lienard-type periodic boundary value problems." |
| author | = | "H. G. Kaper and A. M. Krall", | |
| title | = | "M(lambda)-Computation for Singular Differential Systems", | |
| journal | = | "Proc. Roy. Soc. Edinburgh", | |
| volume | = | "112A", | |
| year | = | "1989", | |
| pages | = | "327-330", | |
| Abstract | = | " Depending on the initial data associated with the fundamental matrix, the function M(lambda) may vary. It is shown that there is a matrix bilinear transformation between such functions M(lambda) with different initial data. The authors also show how the result can be used to simplify the calculation of a specific M(lambda)-function for a scalar second-order problem." |
| author | = | "H. G. Kaper and A. M. Krall", | |
| title | = | "M(lambda)-Computation for Singular Differential Systems", | |
| journal | = | "Royal Soc. Edinburgh", | |
| volume | = | "112A", | |
| year | = | "1989", | |
| pages | = | "327-330"} |
| author | = | "H. G. Kaper and Man Kam Kwong", | |
| title | = | "Free Boundary Problems for Emden-Fowler Equations", | |
| journal | = | 'Diff. and Integral Eqs.", | |
| volume | = | " 3", | |
| issue | = | "2", | |
| year | = | "1990", | |
| pages | = | "353-362", | |
| Abstract | = | " This article is concerned with free boundary problems for differential equations of the Emden-Fowler type. In particular, it addresses the questions of existence and uniqueness of a finite point P and a solution u satisfying conditions | |
| u'(0) | = | 0; u(x) > 0, 0 < x < P ; | |
| u (P) | = | u'(P) = 0." |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "A Non-Oscillation Theorem for the Emden-Fowler Equation; Ground States for Semilinear Elliptic Equations with Critical Exponents", | |
| journal | = | "J. Diff. Eqs.", | |
| volume | = | "75", | |
| year | = | "1988", | |
| pages | = | "158-185", | |
| Abstract | = | " The authors show that the Emden-Fowler equation is nonoscillatory at infinity under certain conditions. The result improves earlier oscillation results of Nehari and Chiou." |
| author | = | "M. K. Kwong", | |
| title | = | "On the Kolodner-Coffman Method for the Uniqueness Problem of Emden-Fowler BVP", | |
| journal | = | "J. App. Math. Phys. (ZAMP)", | |
| volume | = | " 41", | |
| year | = | "1990", | |
| pages | = | "79-104", | |
| Abstract | = | " This paper surveys the Kolodner-Coffman method which has been applied very successfully by many authors to obtain uniqueness theorems for boundary value problems for differential equations of Emden-Fowler type. The author recasts some of the arguments in the language of Sturm's oscillation theory for linear second-order differential equations. The clarification provided by the new perspective makes it possible to improve on several known results." |
| author | = | "M. K. Kwong and M. B. Dever", | |
| title | = | "Computer-aided Study of a Problem in Hermitian Matrix Theory", | |
| journal | = | "J. Symbolic Computation", | |
| volume | = | "9 ", | |
| year | = | "1990", | |
| pages | = | "87-112"} |
| autohr | = | "E. Lusk and others", | |
| title | = | "The Aurora Or-Parallel Prolog System", | |
| journal | = | "New Generation Computing", | |
| volume | = | "7", | |
| year | = | "1990", | |
| pages | = | "243-271", | |
| Abstract | = | " Aurora is a prototype or-parallel implementation of the full Prolog language for shared-memory multiprocessors, developed as part of an informal research collaboration known as the Gigalips Project. It currently runs on Sequent and Encore machines. It has been constructed by adapting Sistus Prolog, a fast, portable, sequential Prolog system. The techniques for constructing a portable multiprocessor version follow those pioneered in a predecessor system, ANL-WAM. The SRI model was adopted as the means to extend the Sistus Prolog engine for or-parallel operation. This paper describes the design and main implementation features of the current Aurora system, and presents some experimental results. For a range of benchmarks, Aurora on a 20-processor Sequent Symmetry is 4 to 7 times faster than Quintus Prolog on a Sun 3/75. Good performance is also reported on some large-scale Prolog applications." |
| author | = | "J. N. Lyness and I. H. Sloan", | |
| title | = | "Some Properties of Rank-2 Lattice Rules", | |
| journal | = | "Math. Comp.", | |
| volume | = | "53", | |
| issue | = | "188", | |
| year | = | "1989", | |
| pages | = | "627-637", | |
| Abstract | = | " This paper discusses lattice rules in general. In particular, the authors categorize a special subclass, whose leading one- and two-dimensional projections contain the maximum feasible number of abscissas. They show that rules of this subclass can be expressed in a simple tricycle form." |
| author | = | "J. N. Lyness and T. Sorevik", | |
| title | = | "The Number of Lattice Rules", | |
| journal | = | "BIT", | |
| volume | = | "29", | |
| year | = | "1989", | |
| pages | = | "527-534", | |
| Abstract | = | " A lattice rule is a quadrature rule for integration over an s-dimensional hypercube that employs N abscissas located on a lattice, chosen to conform to certain specifications. In this paper, the authors determine the number of distinct N-point s-dimensional lattice rules." |
| author | = | "W. McCune", | |
| title | = | "OTTER 2.0", | |
| booktitle | = | "Proc. 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 449", | |
| editor | = | "M. E. Stickel", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "Berlin", | |
| year | = | "1990", | |
| pages | = | " 663-664", | |
| Abstract | = | " OTTER 2.0 is Argonne's current production theorem prover. It is a descendent of AURA and ITP, and operates on clauses in batch mode. OTTER's strong points include hyperresolution and UR-resolution in small (i.e., one with few axioms) theories represented by Horn sets and near-Horn sets. Another strong point is paramodulation with sets of unit equalities. The program is free and very portable; it is available electronically as well as on tape or diskette. No formal support is provided, however." |
| author | = | "W. W. McCune", | |
| title | = | "OTTER 2.0 Users Guide", | |
| number | = | "ANL-90/9", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " OTTER is a resolution-style theorem-proving program for first-order logic with equality. It includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, and evaluable functions and predicates. OTTER is coded in C and is portable to a wide variety of computers. |
| author | = | "J. J. More' ", | |
| title | = | "Gradient Projection Techniques for Large-Scale Optimization Problems",' | |
| booktitle | = | "Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, Florida", | |
| year | = | "1990", | |
| volume | = | "1", | |
| pages | = | "378-381", | |
| Abstract | = | " We briefly describe the impact of the identification properties of the gradient projection method on algorithms for the solution of large-scale optimization problems with bound constraints. In particular, we describe recent results of More' and Toraldo which show that the gradient projection method can be combined with the conjugate gradient method to solve an important class of large-scale (number of variables between 5000 and 15000) bound constrained quadratic programming problems with a few (less than 15) iterations." |
| author | = | "J. J. More' ", | |
| title | = | "A Collection of Nonlinear Model Problems", | |
| journal | = | "Lectures in Applied Math.", | |
| volume | = | "26", | |
| year | = | "1990", | |
| pages | = | "723-762", | |
| Abstract | = | " This paper presents a collection of nonlinear problems. The aim of this collection is to provide model problems of scientific interest to researchers interested in algorithm development. The problems and their origin are described, and references are given to other papers that have dealt with these problems." |
| author | = | "G. W. Pieper", | |
| title | = | "Activities and Operations of the Advanced Computing Research Facility: January 1989 through January 1990", | |
| number | = | "ANL-90/12", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " This report highlights the activities and operations that have contributed to the success of the ACRF during the period January 1989 through January 1990." ] |
| author | = | "G. W. Pieper", | |
| title | = | "Research in Mathematics and Computer Science at Argonne: January 1988 - August 1989", | |
| number | = | "ANL-89/12", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989", | |
| Abstract | = | ' This report highlights the research activities of the MCS Division during the period January 1988 through August 1989." |
| author | = | "G. W. Pieper", | |
| title | = | "Joint Japanese-American Workshop on Future Trends in Logic Programming", | |
| number | = | "ANL-89/43", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989", | |
| Abstract | = | " This report summarizes the activities related to the Joint Japanese-American Workshop on Future Trends in Logic Programming, held at Argonne on October 11-13, 1989. Four main areas were considered: multiprocessing, constraint logic programming, logical foundation of programming, and knowledge representation and database. This report includes abstracts of the 16 presentations, copies of the papers presented, and summaries of the discussion sessions. An important part of the workshop was the demonstration of the Japanese fifth-generation computer; included in this report is a detailed guide to the Japanese demonstration." |
| author | = | "J. K. Slaney and E. L. Lusk", | |
| title | = | "Parallelizing the Closure Computation in Automated Deduction", | |
| booktitle | = | "Proc. 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 449", | |
| editor | = | " M. E. Stickel", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "Berlin", | |
| year | = | "1990", | |
| pages | = | "28-39", | |
| Abstract | = | " This paper presents a parallel algorithm for computing the closure of a set under an operation. This type of computation has been used in automated theorem proving, abstract algebra, and formal logic. The algorithm is particularly suited for shared-memory parallel computers, where it makes possible economies of space. Implementations of the algorithm in two application contexts are described and experimental results given." |
| author | = | "I. H. Sloan and J. N. Lyness", | |
| title | = | "Lattice Rules: Projection Regularity and Unique Representations", | |
| journal | = | "Math. of Comp.", | |
| volume | = | "54", | |
| issue | = | "190", | |
| month | = | "April", | |
| year | = | "1990", | |
| pages | = | "649-660", | |
| note | = | "MCS-P75-0489", | |
| Abstract | = | " This paper introduces a unique characterization for lattice rules that are projection regular." |
| author | = | "P. T. T. Tang", | |
| title | = | "Some Software Implementations of the Functions Sine and Cosine", | |
| number | = | "ANL-90/3", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "April", | |
| year | = | "1990", | |
| Abstract | = | " This document presents several software implementations of the elementary functions sin and cos designed to fit a large class of machines. Implementation details are provided. Also provided is a detailed error analysis that bounds the errors of these implementations, over the full range of input arguments, from 0.721 to 0.912 units in the last place. Tests performed on these codes give results that are consistent with the error bounds." |
| author | = | "S. Winker and R. Overbeek and C. R. Woese and G. J. Olsen and N. Pfluger", | |
| title | = | "An Automated Procedure for Covariation-based Detection of RNA Structure", | |
| number | = | "ANL-89/42", | |
| institutin | = | "Argonne National Laboratory", | |
| month | = | "December", | |
| year | = | "1989", | |
| Abstract | = | " This paper summarizes investigations into the computational detection of secondary and tertiary structure of ribosomal RNA. The authors have developed a new automated procedure that not only identifies potential bondings of secondary and tertiary structure, but also provides the covariation evidence that supports the proposed bondings, and any counterevidence that can be detected in the known sequences. A small number of previously unknown bondings have been detected in individual RNA molecules through the use of the new procedure." |
| author | = | "J. N. Lyness", | |
| journal | = | "IMA J. Numer. Analy.", | |
| volume | = | "9", | |
| year | = | "1989", | |
| pages | = | "405-419", | |
| title | = | "An Introduction to Lattice Rules and Their Generator Matrices"} |
| author | = | "L. Wos", | |
| title | = | "Applications of Automated Reasoning", | |
| booktitle | = | "Knowledge Engineering II: Applications", | |
| editor | = | " H. Adeli', | |
| publisher | = | "McGraw-Hill", | |
| address | = | "New York", | |
| year | = | "1990", | |
| pages | = | "56-83", This article focuses on how the field of automated reasoning was founded, why it was extended, what caused it to grow, and what successes have been realized by using automated reasoning programs." |
| author | = | "L. Wos and S. Winker and W. McCune and R. Overbeek and E. Lusk and R. Stevens and R. Butler", | |
| title | = | "Automated Reasoning Contributes to Mathematics and Logic", | |
| booktitle | = | "Proc. 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 449", | |
| editor | = | " M. E. Stickel", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "Berlin", | |
| year | = | "1990", | |
| pages | = | "485-499", | |
| Abstract | = | " This article presents results of research focusing on the use of the automated reasoning program OTTER to prove theorems from Robbins algebra, equivalential calculus, implicational calculus, combinatory logic, and finite semigroups. Included are answers to open questions and new shorter and less complex proofs to known theorems. To obtain these results, the authors used a paradigm that relies heavily on demodulation, subsumption, set of support, weighting, paramodulation, hyperresolution, and UR-resolution. Examples are given that show success when the paradigm is used, failure when it is not." |
| author | = | 'L. Wos", | |
| title | = | "Meeting the Challenge of Fifty Years of Logic", | |
| journal | = | "JAR", | |
| volume | = | "6", | |
| issue | = | "2", | |
| year | = | "1990", | |
| pages | = | "213-232", | |
| note | = | " MCS-P129-0290", | |
| Abstract | = | " This paper discusses how experiments with a new representation and a new use of the weighting strategy resulted in obtaining proofs of 13 theorems in logic. The author presents these theorems as challenging problems to test the power of a reasoning program or to evaluate the effectiveness of a new idea. In addition, the author discusses a possible approach to finding shorter proofs and presents new results." |
| author | = | "L. Wos", | |
| title | = | "The Problem of Choosing between Logic Programming and General-Purpose Automated Reasoning", | |
| journal | = | "JAR", | |
| volume | = | "6", | |
| issue | = | "1", | |
| year | = | "1990", | |
| pages | = | "77-78", | |
| note | = | "MCS-P130-0290", | |
| Abstract | = | " This article focuses on finding criteria for correctly choosing between using logic programming and a more general automated reasoning approach to attack a given assignment. The problem proposed for research asks one to find criteria that classify problems as solvable with a well-focused algorithm or as requiring a more general search for new information. Included are suggestions for evaluating a proposed solution to this research problem." |
| author | = | "L. Wos", | |
| title | = | "The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation", | |
| journal | = | "JAR", | |
| volume | = | "6", | |
| isue | = | "2", | |
| year | = | "1990", | |
| pages | = | '211-212", | |
| note | = | "MCS-P133-0290", | |
| Abstract | = | " The focus of this paper is on the relationship between two approaches to the automation of reasoning: the paradigm based on the clause language and that based on natural deduction. The problem proposed for research asks one to find a mapping between the two approaches such that reasoning programs based on either approach perform identically on a specific assignment. For evaluating a proposed solution to this research problem, the author includes suggestions concerning possible test problems." |
| author | = | "L. Wos", | |
| title | = | "The Problem of Guaranteeing the Existence of a Complete Set of Reductions", | |
| journal | = | "JAR", | |
| volume | = | "5", | |
| issue | = | "3 ", | |
| year | = | "1989", | |
| pages | = | "399-401", | |
| Abstraact | = | " This article focuses on finding criteria for guaranteeing the existence of a complete set of reductions. Included is a suggestion for evaluating a proposed solution to this research problem." |
| author | = | "C. H. Bischof and P. C. Hansen", | |
| title | = | "Structure-Preserving and Rank-Revealing QR-Factorization", | |
| journal | = | "SIAM J. Sci. Stat. Comput.", | |
| volume | = | "12", | |
| issue | = | "6", | |
| month | = | "November", | |
| year | = | "1991", | |
| pages | = | "1332-1350", | |
| note | = | "MCS-P100-0989", | |
| Abstract | = | " The rank-revealing QR factorization is a special QR factorization guaranteed to reveal the numerical rank of the matrix in consideration. Thus, it is useful in the numerical treatment of rank-deficient least-squares problems. This paper presents a new, efficient method for computing such a factorization, which seeks to preserve the structure and sparsity of the matrix as much as possible while retaining the ability to safely capture the numerical rank. The method uses incremental condition estimation and restricted pivoting in a forward pass to compute an approximation to the numerical rank and null space. This pass can be tailored for the zero/nonzero structure of the problem at hand. In a second pass, the algorithm of Chan is used to refine the estimates for the numerical rank and null space. Numerical experiments show that the new algorithm compares favorably with existing algorithms, in terms of both fill-in and the number of floating-point operations and memory accesses required." |
| author | = | "W. W. McCune", | |
| journal | = | J. Automated Reasoning", | |
| title | = | "Experiments with Discrimination-Tree Indexing and Path Indexing for Term Retrieval", | |
| year | = | "1992", | |
| pages | = | "147-167", | |
| volume | = | "9"} @article"Mcc92:app, | |
| author | = | "W. W. McCune", | |
| journal | = | Annals of Math. and AI", | |
| title | = | "The Application of Automated Reasoning to Questions in Mathematics and Logic", | |
| year | = | "1992", | |
| volume | = | "5", | |
| pages | = | "321-370"} |
| author | = | "C. H. Bischof and G. M. Shroff", | |
| title | = | "On Updating Signal Subspaces", | |
| note | = | "MCS-P101-0989", | |
| journal | = | "IEEE Trans. on Signal Processing", | |
| volume | = | "40", | |
| issue | = | "1", | |
| month | = | "January ", | |
| year | = | "1992", | |
| pages | = | "96-105", | |
| Abstract | = | " This paper presents an algorithm to adaptively solve signal processing problems using the signal subspace approach. The noise subspace is estimated using a rank-revealing QR factorization instead of the more expensive singular value or eigenvalue decompositions. The authors show how to inexpensively update a rank-revealing triangular factorization of a matrix when new rows are added and old rows deleted. An incremental condition estimation technique is used to exploit the structure of past solutions during the updating process while maintaining the rank-revealing property of the factorization." |
| author | = | "Y. P. Hong and C.-T. pan", | |
| title | = | "Rank-Revealing QR Factorizatin and SVD", | |
| journal | = | "Math. Computation", | |
| volume | = | "58", | |
| issue | = | "197", | |
| pages | = | "213-232", | |
| year | = | "1992"} |
| title | = | "Achieving Logarithmic Growth of Temporal and Spatial Complexity in Reverse Automatic Differentiation", | |
| journal | = | "Optimizaiton Methods and Software", | |
| year | = | "1992", | |
| volume | = | "1", | |
| pages | = | "35-54"} |
| author | = | "I.=B. Tjoa and L. T. Biegler", | |
| title | = | "A Reduced Successive Quadratic Programming Strategy for Errors-in-Variables Estimation", | |
| journal | = | "Computers and Chemical Engineering", | |
| volume | = | "16", | |
| issue | = | "6", | |
| page | = | "523", | |
| year | = | "1992"} |
| author | = | "J. J. More' ", | |
| title | = | "Gradient Projection Techniques for Large-Scale Optimization Problems", | |
| note | = | "MCS-P102-0989", | |
| booktitle | = | "Proceedings of the 28th IEEE Conference on Decision and Control 1", | |
| year | = | "1990", | |
| pages | = | "378--381", | |
| Abstract | = | " This paper briefly describes the impact of the identification properties of the gradient projection method on algorithms for the solution of large-scale optimization problems with bound constraints. In particular, the authors describe recent results of More' and Toraldo that show that the gradient projection method can be combined with the conjugate gradient method to solve an important class of large-scale (number of variables between 5000 and 15000) bound-constrained quadratic programming problems with a few (less than 15) iterations." |
| author | = | "J. M. Howie and E. L. Lusk and R. B. McFadden", | |
| title | = | "Combinatorial Results Relating to Products of Idempotents in Finite Full Transformation Semigroups", | |
| journal | = | "Proc. Royal Society of Edinburgh", | |
| volume | = | "115A", | |
| pages | = | "289-299", | |
| year | = | "1990"} |
| author | = | "A. K. Singh and R. Overbeek", | |
| title | = | "Derivations of Efficient Parallel Programs: An Example from Genetic Sequence Analysis", | |
| number | = | "MCS-P104-0989", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Implementation issues such as synchronization of shared data, implementation of abstract data types, and scheduling of processes are usually not addressed in the formal derivation of parallel programs. Here the authors seek to redress the situation by considering these issues in the context of developing an efficient implementation of an actual parallel program. The computational problem selected was motivated by work in aligning sequences of genetic material. The authors first develop an algorithm in Unity and then investigate the issues that arose in producing an efficient C implementation. Additionally, the authors present some theorems about program refinements and discuss the usefulness of the theorems in the context of refining the original Unity program." |
| author | = | "C. H. Bischof and J. J. Dongarra", | |
| title | = | "A Project for Developing a Linear Algebra Library for High-Performance Computers", | |
| booktitle | = | " Parallel and Vector Supercomputing: Methods and Algorithms", | |
| editor | = | "Graham Carey", | |
| pages | = | "45--56", | |
| piblisher | = | "John Wiley \& Sons", | |
| year | = | "1989", | |
| note | = | "MCS-P105-0989", | |
| Abstract | = | " This paper summarizes the objectives of the LAPACK project, its use of the BLAS and block algorithms, documentation issues, and the programming language and style. The library is intended to be usable on all of the most powerful computers currently available for general-purpose scientific computing." |
| author | = | "C. H. Bischof and J. G. Lewis and D. J. Pierce", | |
| title | = | "Incremental Condition Estimation for Sparse Matrices", | |
| journal | = | "SIAM Journal on Matrix Analysis and Applications", | |
| volume | = | "11", | |
| issue | = | "4", | |
| pages | = | "644--659", | |
| year | = | "1990", | |
| note | = | "MCS-P106-0989", | |
| Abstract | = | " Incremental condition estimation provides an estimate for the smallest singular value of a triangular matrix. In particular, it gives a running estimate of the smallest singular value of a triangular factor matrix as the factor is generated one column or row at a time. An incremental condition estimator for dense matrices was originally suggested by Bischof. In this paper the scheme is generalized to handle sparse triangular matrices, especially those that are factors of sparse matrices. Numerical experiments on a variety of matrices demonstrate the reliability of this scheme in estimating the smallest singular value. A partial description of its implementation in a sparse matrix factorization code further illustrates its practicality.", |
| author | = | "M. Garbey", | |
| title | = | "Asymptotic Analysis of Singular Perturbation Problems Governed by a Conservation Law", | |
| number | = | "MCS-P107-1089", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1989", | |
| Abstract | = | " This paper presents an asymptotic analysis of a quasi-linear parabolic-hyperbolic singular perturbation problem in one dimension. The main part of the analysis concerns the construction of the transition layers and boundary layers associated with the discontinuities of a conservation law. An example is given of an oil problem modeled by Le Fur." |
| author | = | "G. H. Chisholm and J. Kljaich and B. T. Smith and A. S. Wojcik", | |
| title | = | "A Paradigm for Analyzing Independence in System Behavior by Using Formal Methods", | |
| number | = | "MCS-P108-1089", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper introduces a technique based on formal methods, which analyzes dependence by generating dependency lists. Each list represents all the components on which a replicated channel depends for proper operation. The analysis manipulates these lists to determine independence. The technique treats hardware, software, and the interface between them, with the result that the total system can be analyzed with respect to independence properties." |
| author | = | "G. H. Chisholm and B. T. Smith and A. S. Wojcik", | |
| title | = | "Using Formal Methods to Develop a Paradigm for Software Design", | |
| number | = | "MCS-P109-1089", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper is a shortened version of MCS-P108." |
| author | = | "R. L. Stevens", | |
| title | = | "The Interesting Future of Supercomputing", | |
| number | = | "MCS-P110-1189", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This informal discussion of trends in supercomputing looks briefly at trends in graphics, programming languages, and computer architectures." |
| author | = | "G. H. Chisholm and B. T. Smith and J. Kljaich and A. S. Wojcik", | |
| title | = | "Formal Analysis of Software in a Fault-Tolerant Environment", | |
| number | = | " MCS-P111-1189", | |
| institution | = | "Argonne National Laboratory" | |
| Abstract | = | " This paper describes the application of modeling and analysis techniques to software that is designed to execute on the Charles Stark Draper laboratory Fault-Tolerant Processor (FTP). The software performs sensor validation of independent signals from the Experimental Breeder Reactor-II operated by Argonne. The authors describe an abstraction of the data flow in terms of the specification of a generic application program for the FTP. They prove the fault-tolerance of the application program to hardware and sensor failures, provided that the validation algorithms have a certain generic structure and functionality. Using a more detailed specification of the application software, they also demonstrate that this program satisfies the sufficient conditions developed for the generic program to claim system fault tolerance." |
| author | = | "G. H. Chisholm and B. T. Smith and A. S. Wojcik", | |
| title | = | "An Automated Reasoning Problem Associated with Proving Claims about Programs Using Floyd-Hoare Inductive Assertion Methods", | |
| number | = | "MCS-P112-1189", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Proving claims about behavior of software is essential for the qualification of computer-based systems used in the control of nuclear reactors. Here the authors select one of the verification conditions for a C program that initializes an array to zero. They add assertions about the initial conditions and state of the program and about the expected behavior of the program in terms of its state. The modeling and specification technique is the inductive assertion technique of Floyd-Hoare. The program with assertions is then transformed by the source-to-source program transformation system TAMPR into a set of separate verification conditions to be proven by the automated reasoning system." |
| author | = | "M. K. Kwong and P.-Y. Woo and R. Wong", | |
| title | = | "Using MAPLE for Symbolic Computations in Robotics", | |
| number | = | "MCS-P113-1289", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Programs are presented for deriving forward kinematics, Jacobians, and dynamic equations of robotic manipulators in symbolic closed forms by using the algebraic manipulation software MAPLE. Examples are given, and efficiency of the computations is discussed." |
| author | = | "M. Garbey and H. G. Kaper and G. K. Leaf and B. J. Matkowsky", | |
| title | = | "Using MAPLE for the Analysis of Bifurcation Phenomena in Condensed-Phase Surface Combustion", | |
| journal | = | "J. Symbolic Computation", | |
| volume | = | "12", | |
| year | = | "1991", | |
| pages | = | "89-113", | |
| note | = | "MCS-P114-1189", | |
| Abstract | = | " This article describes the use of the symbolic computation language MAPLE for the analysis of bifurcation phenomena in condensed-phase combustion. The physical problem concerns the structure and stability properties of a combustion front that propagates in the axial direction along the surface of a cylindrical solid fuel element. Experimental observations suggest that the front may propagate in a number of different ways; the objective of the investigation is to describe these different modes. The analysis involves the study of a set of nonlinear partial differential equations which describe the structure and evolution of the combustion front. Because the location of the front is unknown and must be found as part of the solution, the problem is a free boundary problem." |
| author | = | "J. Dongarra and O. Brewer and S. Fineberg and J. A. Kohl", | |
| title | = | "A Tool to Aid in the Design, Implementation, and Understanding of Matrix Algorithms for Parallel Processors", | |
| year | = | "1989", | |
| number | = | "MCS-P115-1189", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper discusses a tool that aids in the design, development, and understanding of parallel algorithms for high-performance computers. The tool provides a vehicle for studying memory access patterns, different cache strategies, and the effects of multiprocessors on matrix algorithms in a Fortran setting. Such a tool puts the user in a better position to understand where performance problems may occur and enhances the likelihood of increasing the program's performance before actual execution on a high-performance computer." |
| author | = | "H. G. Kaper and M. K Kwong", | |
| title | = | "Ground States of Semi-Linear Diffusion Equations", | |
| note | = | "MCS-P116-1189", | |
| booktitle | = | "Differential Equations with Applications in Biology, Physics, and Engineering", | |
| editor | = | "Jerome A. Goldstein and Franz Kappel and Wilhelm Schappacher", | |
| publisher | = | "Marcel Dekker", | |
| address | = | "New York", | |
| year | = | "1991", | |
| pages | = | "219--226", | |
| Abstract | = | " This article is concerned with the uniqueness of nontrivial nonnegative solutions of semilinear diffusion equations in radially symmetric domains." |
| author | = | "M. K. Kwong and L. Zhang", | |
| title | = | "Uniqueness of the Positive Solution of | |
| DELTA u + f(u) | = | 0 in an Annulus", | |
| journal | = | "Diff. and Integral Eqs.", | |
| volume | = | "4", | |
| issue | = | "3", | |
| year | = | "1991", | |
| pages | = | "583--599", | |
| number | = | "MCS-P117-1289", | |
| Abstract | = | " This paper presents an extension of the recent result of Kwong on the uniqueness of the positive radial solution of a semilinear elliptic equation. When reduced to the special case considered by Kwong, the proof is shorter." |
| author | = | "M. K. Kwong", | |
| title | = | "Uniqueness Results for Emden-Fowler Boundary Value Problems", | |
| ijournal | = | "Nonlinear Analysis", | |
| volume | = | "16", | |
| year | = | "1991", | |
| pages | = | "435--454", | |
| note | = | "MCS-P118-0190", | |
| Abstract | = | ' This paper establishes new uniqueness results for boundary value problems of the superlinear Emden-Fowler type, with either a Dirichlet or Neumann condition at each endpoint. The first result extends a known criterion to nonlinear terms that may change sign. The proof uses the theory of differential inequalities, after changing the independent variable to the quantity u." |
| author | = | " N. T. Karonis", | |
| title | = | "Timing Parallel Programs That Use Message Passing", | |
| number | = | "MCS-P119-0190", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A timing methodology is presented that is capable of accurately determining the execution time of parallel programs, This timing methodology is also capable of acquiring timing data when the number of processes exceeds the number of physical CPUs. Through simulation this methodology also provides a means by which to study the behavior of a parallel program under an arbitrary hardware/software communications configuration." |
| author | = | "D. Solow and R. S. Womersley", | |
| title | = | "A Piecewise Linear Concave Minimization Algorithm for the Linear Complementarity Problem", | |
| number | = | "MCS-P120-0190", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper considers solving the Linear Complementary Problem by finding a global minimizer of a linearly constrained piecewise linear concave function. In contrast to Lemke's algorithm and the principal pivoting algorithms, the algorithm described here finds a feasible point for the linearity constraints first, then works toward satisfying the complementarity condition. Once an extreme point of the feasible region is found, the algorithm moves from one extreme to another while reducing this concave objective." |
| author | = | "A. Jindal and R. Overbeek and W. C. Kabat", | |
| title | = | "Exploitation of Parallel Processing for Implementing High-Performance Deduction Systems", | |
| note | = | "MCS-P121-0190", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "8", | |
| issue | = | "1", | |
| year | = | "1992", | |
| pages | = | "23-38", | |
| Abstract | = | " This paper describes a scheme for parallelizing first-order logic deduction systems. This scheme has been used for parallelizing OTTER. The new program, PARROT-II, has attained real speedups in excess of 20 over the best results of current sequential deduction systems." |
| author | = | "L. M. Ewerbring and F. T. Luk", | |
| title | = | "The HK Singular Value Decomposition of Rank-Deficient Matrix Triplets", | |
| number | = | "MCS-P125-0190", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper focuses on a simultaneous reduction of three matrices. The described method is extended from earlier work by Ewerbring and Luk to include rank-deficient data. it is shown how, via an initial reduction, the problem becomes one of diagonalizing a product of three matrices. Three different algorithms are compared." |
| author | = | "N. R. Nagarajan and A. S. Cullick and A. Griewank", | |
| title | = | "New Strategy for Phase Equilibrium and Critical Point Calculations by Thermodynamic Energy Analysis. Part I. Stability Analysis and Flash", | |
| journal | = | "Fluid Phase Equilibria", | |
| volume | = | "62", | |
| pages | = | "191--210", | |
| year | = | "1991tract=", | |
| note | = | "MCS-P126-0190". The use of equations of state to compute phase behavior of petroleum reservoir fluids and their mixtures with injected fluids is well established in the oil industry. The first step prior to performing a two- or multiphase flash calculation for a reservoir fluid is to determine the stable phase condition of the mixture. The stability analysis presented here is based on work by Michelsen but uses a different set of primary variables, the component molar densities in place of mole numbers of mole fractions to improve the numerical stability of the Newton iterative scheme. The new procedure is especially well suited to predict behavior in the critical region where other methods sometimes face convergence problems." |
| author | = | "N. R. Nagarajan and A. S. Cullick and A. Griewank", | |
| title | = | "New Strategy for Phase Equilibrium and Critical Point Calculations by Thermodynamic Energy Analysis. Part II. Critical Point Calculations,'' | |
| journal | = | "Fluid Phase Equilibria", | |
| volume | = | "62", | |
| pages | = | "211--223", | |
| year | = | "1991", | |
| note | = | "MCS-P127-0190", | |
| Abstract | = | " In enhanced oil recovery processes, miscibility is developed through a multiple contact process via a critical point. Prediction of these critical points is important in modeling the phase behavior of the fluid mixtures for simulating these processes. Tradition equation-of-state prediction of the critical points involves complex computations and is often made difficult because of the extreme sensitivity of fluid properties to small changes in pressure or temperature in the critical region. The authors of this paper present a new strategy for critical point search based on the Gibbs criteria for criticality and thermodynamic energy analysis." ] |
| author | = | "X. Yang and N. J. Zabusky and I-L. Chern", | |
| title | = | "Breakthrough via Dipolar-Vortex/Jet Formation in Shock-Accelerated Density-Stratified Layers'", | |
| number | = | "MCS-P128-0290", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " In this paper the authors observe and quantify convective ``breakthrough'' after an inclined planar light fluid layer is struck by a shock wave. The results of direct numerical simulations are interpreted, and a convective breakthrough time is quantified. Initially, vorticity of opposite sign is deposited on each interface of the layer. Breakthrough occurs when these vortex regions approach and bind into a dipolar vortex that moves away from the wall. Variations of the breakthrough time with the Mach number of the incoming shock wave are given." |
| author | = | "J. V. Burke", | |
| title | = | "A Robust Trust Region Method for Constrained Nonlinear Programming Problems", | |
| number | = | "MCS-P131-0190", | |
| year | = | "1990", | |
| Abstract | = | " This paper presents a general framework for trust region algorithms for constrained problems that does not require strong global regularity and that allows very general constraints. The approach is modeled on the one given by Powell for convex composite optimization problems and is driven by linear subproblems that yield viable estimates for the value of an exact penalty parameter. These results are applied to the Wilson-Han-Powell SQP algorithm and Fletcher's algorithm. Local convergence results are also given." |
| author | = | "A. Griewank", | |
| title | = | "Direct Calculation of Newton Steps without Accumulating Jacobians", | |
| booktitle | = | "Large-Scale Numerical Optimization", | |
| editor | = | "Thomas F. Coleman and Yuying Li", | |
| publisher | = | "SIAM", | |
| address | = | 'Philadelphia", | |
| pages | = | "115--137", | |
| year | = | "1990", | |
| note | = | "MCS-P132-0290", | |
| Abstract | = | " In computational practice, nonlinear vector functions whose roots must be calculated are often specified in the form of an evaluation program supplied by the user. This program usually generates a large number of intermediate quantities that are local variables and thus ordinarily not visible to the calling routine. By considering the intermediate quantities as additional independent variables, one obtains an extended nonlinear system, which should be attacked directly for several reasons. First, the extended Jacobian is extremely sparse and can be evaluated at little extra cost simultaneously with the original vector function. Second, any method for computing Newton steps on the original vector function is, in terms of complexity, equivalent to a scheme for solving a linear system in the extended Jacobian. The conditioning of this large sparse matrix reflects not only the stability of the original vector function but also the accuracy of the evaluation algorithm. This allows the design of realistic stopping criteria without user-suplied tolerances." ] |
| author | = | "I-Liang Chern", | |
| title | = | "Multiple-Mode Diffusion Waves for Viscous Nonstrictly Hyperbolic Conservation Laws", | |
| number | = | "MCS-P134-0290", | |
| institution | = | "ARgonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " This paper focuses on the large-time behavior of solutions of viscous conservation laws whose inviscid part is a nonstrictly hyperbolic system. The initial data considered here is a perturbation of a constant state. It is shown that the solutions converge to single-mode diffusion waves in directions of strictly hyperbolic fields, and to multiple-mode diffusion waves in directions of nonstrictly hyperbolic fields. The multiple-mode diffusion waves, which are the new elements here, are the self-similar solutions of the viscous conservation laws projected to the nonstrictly hyperbolic fields, with the nonlinear fluxes replaced by their quadratic parts." |
| author | = | "D. Jacobs and A. Langen and W. Winsborough", | |
| title | = | "Multiple Specialization of Logic Programs with Run-Time Tests", | |
| number | = | "MCS-P135-0290", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents a framework for multiple specialization of logic programs that incorporates run-time testing. This framework supports specialization based on a compiler-generated ``wish list'' of requirements that enable useful optimizations. In addition, entry mode declarations are used to restrict the class of reachable activations. Our goal is to generate code containing tests at outer levels of the call tree that guard high-performance specialized procedures that are likely to be called." |
| author | = | "W. McCune", | |
| title | = | "Skolem Functions and Equality in Automated Deduction", Proceedings of the Eighth National Conference on Artificial Intelligence,} | |
| publisher | = | "MIT Press", | |
| address | = | "Cambridge, Mass.", | |
| year | = | "1990", | |
| pages | = | " 246--251", | |
| note | = | "MCS-P136-0290", | |
| Abstrtact | = | ' This paper presents a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to prevent paramodulation into subterms of Skolem expressions. A weak completeness result is presented (the functional reflexive axioms are assumed). Experimental results on problems in set theory, combinatory logic, Tarski geometry, and algebra show that the strategy can be useful when searching for refutations and when applying Knuth-Bendix completion. The emphasis of the paper is on the effectiveness of the strategy rather than on its completeness." |
| author | = | "A. Mulkers and W. Winsborough and M. Bruynooghe", | |
| title | = | "Analysis of Shared Data Structures for Compile-Time Garbage Collection in Logic Programs", | |
| number | = | " MCS-P137-0290", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " One of the central problems in program analysis for compile-time garbage collection is detecting the sharing of term substructure that can occur during program execution. The authors present an abstract domain for representing possibly shared structures and an abstract unification operation based on this domain. When supplied to an abstract interpretation framework, this domain induces a powerful analysis of shared structures." |
| author | = | "I-Liang Chern", | |
| title | = | "Large-Time Behavior of Solutions of Lax-Friedrichs Finite Difference Equations for Hyperbolic Systems of Conservation Laws", | |
| number | = | "MCS-P138-0290", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper focuses on the large-time behavior of discrete solutions of the Lax-Friedrichs finite-difference equations for hyperbolic systems of conservation laws. The initial data considered here is small and tends to a constant state at | |
| x | = | +- infinity. The author shows that the solutions tend to discrete diffusion waves which can be constructed from the self-similar solutions of the heat equation and the Burgers equation through an averaging process." ] |
| author | = | "J. J. More' ", | |
| title | = | "On the Performance of Algorithms for Large-Scale Bound-Constrained Problems", | |
| booktitle | = | "Large-Scale Numerical Optimization", | |
| editor | = | "T. F. Coleman and Y. Li", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| year | = | "1991", | |
| note | = | "MCS-P140-0290", | |
| pages | = | "32-45", | |
| Abstract | = | " The paper discusses issues that affect the performance of algorithms for the solution of large-scale bound-constrained problems on parallel computers. The discussion centers on the solution of the elastic-plastic torsion problem and the journal bearing problem. These two problems are model large-scale quadratic programming problems that arise as finite element approximations to elliptic variational inequalities. Performance issues are illustrated with the GPCG algorithm of More' and Toraldo. This algorithm uses the gradient projection method to select an active set and the conjugate gradient method to explore the active set defined by the current iterate. Significant improvements in performance are obtained with the GPCG algorithm by using partitioning techniques in a parallel environment. These partitioning techniques lead to almost linear speedups on function-gradient evaluations and Hessian-vector products for partially separable functions." |
| author | = | "G.-Q. chen", | |
| title | = | "Hyperbolic Systems of Conservation Laws with Symmetry", | |
| journal | = | "Communications on PDEs", | |
| volume | = | "16", | |
| pages | = | "1461-1487", | |
| year | = | "1991"} |
| author | = | "G.-Q. Chen", | |
| title | = | "Limit Behavior of Approximate Solutions to Conservation Laws", | |
| number | = | "MCS-P141-0390", | |
| year | = | "1990", | |
| institutin | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper focuses on the limit behavior of approximate solutions to hyperbolic systems of conservation laws. Several mathematical compactness theories and their role are described. Some recent and ongoing developments are reviewed and analyzed." |
| author | = | "H. G. Kaper and M. Knaap and M. K. Kwong" | |
| title | = | "Existence Theorems for Second-Order Boundary Value Problems", | |
| journal | = | "Diff. and Integral Eqs.", | |
| volume | = | "4", | |
| issue | = | "3", | |
| month | = | "May ", | |
| year | = | "1991", | |
| pages | = | "543--554", | |
| note | = | "MCS-P142-0390", | |
| Abstract | = | " This article is concerned with the existence of positive solutions of boundary value problems for nonlinear second-order differential equations that arise, for example, in the study of reaction -diffusion equations in annular regions." |
| author | = | "P. T. P. Tang", | |
| title | = | "Table-driven Implementation of the Expm1 Function in IEEE Floating-Point Arithmetic", | |
| number | = | "MCS-P144-0390", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Algorithms and implementation details for the Expm1 function in both single and double precision of IEEE 754 arithmetic are presented. With a table of moderate size, the implementations need only working-precision arithmetic and are provably accurate to within 0.58 ulp." |
| author | = | "L. Wos", | |
| title | = | "The Problem of Finding a Semantic Strategy for Focusing Inference Rules", | |
| journal | = | "J. Automated Reasosning", | |
| volume | = | "6", | |
| issue | = | "3", | |
| pages | = | "337-339", | |
| month | = | "August", | |
| year | = | "1990", | |
| note | = | "MCS-P145-0390", | |
| Abstract | = | " The problem posed for research asks one to find semantic criteria for selecting the clauses needed to complete the application of an inference rule. Suggestions for test problems are included." |
| author | = | "H. Zhang", | |
| title | = | "Large-Time Behavior of the Maximal Solution of [the Singular Diffustion] Equation", | |
| number | = | "MCS-P146-0490", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " The singular diffusion equation arises in many areas of application. This paper considers the large-time behavior of the solution of a more general equation. It is shown that the solution of the Cauchy problem converges to its corresponding similarity solution as t -> infinity. Moreover, an iteration process is used to obtain the optimal rate of convergence." |
| author | = | "W. D. Gropp and D. E. Keyes", | |
| title | = | "Parallel Performance of Domain-decomposed Preconditioned Krylov Methods for PDEs with Adaptive Refinement", | |
| journal | = | "SIAM Journal on Scientific and Statistical Computing", | |
| volume | = | "13", | |
| year | = | "1992", | |
| pages | = | "128--145", | |
| note | = | "MCS-P147-0490", | |
| Abstract | = | " Numerical experiments are presented on both shared- and distributed-memory computers for convection-diffusion problems at modest Peclet (or Reynolds) numbers, without recirculation. Because of the development of boundary layers, these problems benefit from local mesh refinement, which is straightforward to accommodate within the domain decomposition framework in a locally uniform sense, but which introduces load balancing as a further consideration in choosing the granularity of the preconditioner. In spite of the tradeoffs, cumulative speedups are obtainable out to at least medium-scale granularity (up to 64 processors in the tests reported)." |
| author | = | "C. H. Bischof", | |
| title | = | "A Block QR Factorization Algorithm for Rank-Deficient Matrices", | |
| booktitle | = | "Parallel Processing for Scientific Computing", | |
| editor | = | "Jack J. Dongarra and Paul Messina and Danny C. Sorensen and Robert G. Voigt", | |
| pages | = | "9--14", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| year | = | "1990"< | |
| note | = | "MCS-P148-0490", | |
| Abstract | = | " This paper presents a new algorithm for computing the QR factorization of a rank-deficient matrix that is well suited for high-performance machines. The traditional QR factorization algorithm with column pivoting is not well suited for such environments, since it precludes the use of matrix-matrix operations. The author suggests a restricted pivoting strategy based on incremental condition estimation which allows one to formulate a block QE factorization logarithm where the bulk of the work is in matrix-matrix operations. Performance results on the CRAY 2, CRAY X-MP, and CRAY Y-MP show that the new algorithm performance significantly better than the traditional scheme and can more than halve the cost of computing the QR factorization." |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "A Free Boundary Problem Arising in Plasma Physics", | |
| booktitle | = | "Nonlinear Diffusion Equations and Their Equilibrium States 3", | |
| editor | = | "N. G. Lloyd and W. M. Ni and L. A. Peletier and J. Serrin", | |
| pages | = | "265--274", | |
| publisher | = | "Birkh\"{a}user Verlag", | |
| address | = | "Basel", | |
| year | = | "1992", | |
| note | = | "MCS-P149-0490", | |
| Abstract | = | " This paper is concerned with the existence and uniqueness of free boundary problems for certain differential equations." |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "On Two Conjectures concerning the Multiplicity of Solutions of a Dirichlet Problem", | |
| journal | = | "SIAM J. Math. Anal.", | |
| volume | = | :23", | |
| issue | = | "3", | |
| pages | = | "571-578", | |
| year | = | "1992"} |
| author | = | "M. K. Kwong", | |
| journal | = | "Nonlinear Analysis, Theory, Methods and Applications", | |
| title | = | "On the Unboundedness of the Number of Solutions of a Dirichlet Problem", | |
| volume | = | 18", | |
| issue | = | "10", | |
| pages | = | "993-1001", | |
| year | = | "1992"} |
| author | = | "M. K. Kwong", | |
| journal | = | "World Scientific Series in Applicable Analysis", | |
| title | = | "A Dirichlet Problem with Infiinite Multiplicity", | |
| volume | = | 1", | |
| pages | = | "393-402", | |
| year | = | "1992"} |
| author | = | "C. Bischof", | |
| title | = | "Fundamental Linear Algebra Computations on High-Performance Computers", | |
| note | = | 'MCS-P150-0490", | |
| booktitle | = | "Informatik Fachberichte 250 -- Special Issue on Supercomputer'90", | |
| editor | = | "Hans Meuer", | |
| pages | = | "176--182", Springer Verlag, | |
| address | = | Berlin", | |
| year | = | "1990", | |
| Abstract | = | " This paper presents an overview of the LAPACK library, a portable, public-domain library to solve the most common linear algebra problems. This library provides a uniformly designed set of subroutines for solving systems of simultaneous linear equations, least-squares problems, and eigenvalue problems for dense and banded matrices. We elaborate on the design methodologies incorporated to make the LAPACK codes efficient on today's high-performance architectures. In particular, we discuss the use of block algorithms and the reliance on the Basic Linear Algebra Subprograms (BLAS). We present performance results that show the suitability of the LAPACK approach for vector uniprocessors and shared-memory multiprocessors. We also discuss some issues that have to be addressed in implementing such a library on other types of parallel architectures. These issues involve efficient implementations of the BLAS on parallel machines, the proper choice of blocking parameters, and the use of parallelism outside of the BLAS." |
| author | = | "C. H. Bischof and P. G. Lacroute", | |
| title | = | "An Adaptive Blocking Strategy for Matrix Factorizations", | |
| booktitle | = | "Proceedings of CONPAR90/VAPP IV, Lecture Notes in Computer Science 457", | |
| editor | = | "H. Burkhart", | |
| pages | = | "210--221", | |
| publisher | = | "Springer Verlag", | |
| address | = | 'Berlin", | |
| year | = | "1990", | |
| note | = | "MCS-P151-0490", | |
| Abstract | = | " This paper presents an adaptive blocking methodology for determining in a systematic manner an optimal blocking strategy for a uniprocessor machine. The technique is demonstrated on a block QR factorization routine on a uniprocessor. After generating timing models for the high-level kernels of the algorithm, the author shows how one can formulate the optimal blocking strategy in a recurrence relation that can be solved inexpensively with a dynamic programming technique. Experiments of one processor of a CRAY-2 show that this strategy is as good as any fixed-width blocking strategy. Thus, while the optimum fixed-width blocking strategy cannot be determined unless the problem is run several times, adaptive blocking provides optimum performance in the very first run." |
| author | = | "D. C. Sorensen and P. T. P. Tang", | |
| title | = | "On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques", | |
| journal | = | "SIAM J. Numer. Anal.", | |
| volume | = | "28", | |
| issue | = | "6", | |
| month | = | "December", | |
| year | = | "1991", | |
| pages | = | '1752-1775", | |
| note | = | "MCS-P152-0490", | |
| Abstract | = | " A detailed analysis on the accuracy issues in calculating the eigensystems of rank-1 perturbed diagonal systems is presented. Such calculations are the core of the divide-and-conquer technique. Here the authors prove that the computed eigenvectors are guaranteed orthogonality provided the secular equation is evaluated in a precision that doubles the working one. An efficient algorithm that simulates such ``doubled precision'' in working precision is also provided. Numerical results that confirm the analysis and implementation are presented." |
| author | = | "G.-Q. Chen", | |
| title | = | "The Theory of Compensated Compactness and the System of Isentropic Gas Dynamics", | |
| number | = | "MCS-P154-0590", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | ' Properties of the system of isentropic gas dynamics, especially the behavior of entropy, are analyzed and documented. The Lax-Friedrichs approximations, the Godunov approximations, and the viscosity approximations to the Cauchy problem for the system are constructed; and a compactness framework for these approximations is established with the aid of the theory of compensated compactness. Convergence for the approximations is shown." |
| author | = | "G.-Q. Chen", | |
| title | = | "Global Solutions to the Compressible Navier-Stokes Equations for a Reacting Mixture", | |
| year | = | "1990", | |
| number | = | "MCS-P155-0590", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this note the author establishes existence theorems for global generalized solutions to the compressible Navier-Stokes equations for a reacting mixture, which describe dynamic combustion. Equivalence of the Navier-Stokes equations in Euler coordinates and Lagrangian coordinates for the generalized solutions is verified. The asymptotic behavior obtained from impermeable thermally insulated boundaries and prescribed data boundaries is identified and proved." |
| author | = | "M. K. Kwong and Yi Li", | |
| title | = | "Uniqueness of Radial Solutions of Semilinear Elliptic Equations", | |
| number | = | "MCS-P156-0590", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " E. Yanaida has proved that the classical Matukuma equation with a given exponent has only one finite mass solution. In this paper the authors show how similar ideas can be exploited to obtain uniqueness results for other classes of equations as well as Matukuma equations with more general coefficients. The key ingredients of the method are energy functions and suitable transformations. Also studied are general boundary conditions, using an extension of a recent result by Bandle and Kwong. Yanaida's proof does not extend to solutions of Matukuma's equation satisfying other boundary conditions." |
| author | = | "Per Christian Hansen", | |
| title | = | "Analysis of Discrete Ill-Posed Problems by Means of the L-Curve", | |
| number | = | "MCS-P157-0690", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " When discrete ill-posed problems are analyzed and solved by various numerical regularization techniques, a convenient way to display information about the regularized solution is to plot the norm or seminorm of the solution vs. the norm of the residual vector. In particular, the graph associated with Tikhonov regularization plays a central role. This paper advocates the use of this graph in the numerical treatment of discrete ill-posed problems. The graph is characterized quantitatively, and important relations between regularized solutions and the graph are derived. The authors demonstrate that several methods for choosing the regularization parameter are related to locating a characteristic L-shaped ``corner'' of the graph." |
| author | = | "M. T. Jones and M. L. Patrick", | |
| title | = | "LANZ: Software for Solving the Large Sparse Symmetric Generalized Eigenproblem", | |
| note | = | "MCS-P158-0690", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " This paper describes the package LANZ for solving the large sparse symmetric generalized eigenproblem. The package has been tested on four different architectures: Convex 200, CRAY Y-MP, Sun-3, and Sun-4. The package uses a version of Lanczos' method and is based on recent research into solving the generalized eigenproblem." |
| author | = | "M. T. Jones and M. L. Patrick", | |
| title | = | "The Lanczos Algorithm for the Generalized Symmetric Eigenproblem on Shared-Memory Architectures", | |
| journal | = | "Applied Numer. Math.", | |
| volume | = | "12", | |
| year | = | "1993", | |
| pages | = | "377-389"} |
| author | = | "W. D. Gropp and L. C. McInnes and B. F. Smith", | |
| title | = | "Using the Scalable Nonlinear Equations Solvers Package", | |
| number | = | "MCS-TM-193", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | Uniform Strategies: The CADE-11 Theorem Proving Contest", | |
| author | = | :E. L. Lusk and W. W. McCune", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "11", | |
| pages | = | "317-331", | |
| year | = | "1993"} |
| author | = | "E. Lusk", | |
| title | = | "Performance Visaulization for Parallel Programs", | |
| journal | = | "Theoretica Chimica Acta", | |
| volume | = | "84", | |
| issue | = | "4-5", | |
| pages | = | "377-384", | |
| year | = | "1993"} |
| author | = | "M. K. Kwong", | |
| journal | = | "Applied Mathematics and Computation", | |
| title | = | "Sweeping Algorithms for Inverting the Discrete Ginzburg-Landau Operator", | |
| volume | = | 53", | |
| pages | = | "129-150", | |
| year | = | "1993"} |
| author | = | "H. G. Kaper and M. K. Kwong and Y. Li", | |
| title | = | "Symmetry Results for Reaction-Diffusion Equations", | |
| journal | = | "Differential and Integral Eqms.", | |
| volume | = | "6", | |
| issue | = | "5", | |
| year | = | "1993", | |
| pages | = | "1045-1056"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Computation of Equilibrium Vortex Structures for Type-II Superconductors", | |
| journal | = | "Intnl. J. Supercomputer Apps.", | |
| volume | = | "7", | |
| issue | = | "2", | |
| year | = | "1993", | |
| pages | = | "129-143"} |
| author | = | "M. T. Jones and M. L. Patrick", | |
| title | = | "Bunch-Kaufman Factorization for Real Symmetric Indefinite Banded Matrices", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "14", | |
| issue | = | "2", | |
| pages | = | "553-559", | |
| year | = | "1993"} |
| author | = | "J. M. Boyle and T. J. Harmer", | |
| title | = | "A Practical Functional Program for the CRAY X-MP", | |
| journal | = | "Journl of Functional Programming", | |
| volume | = | "2", | |
| issue | = | "1", | |
| pages | = | "81-126", | |
| year | = | "1992", | |
| Abstract | = | " This paper demonstrates how one can have all the advantages of functional programming (correctness, clarity, simplicity, and flexibility) without any sacrifice in performance, even for a scientifically significant computation on a supercomputer. In the example chosen, pure Lisp is used to express the functional specification for a PDE solver. From this specification, an executable Fortran program is produced automatically by means of automated program transformations. The generated program vectorizes on the CRAY X-MP and runs about 13% faster than a hand-written Fortran program for the same problem." |
| author | = | "R. Veroff and L. Wos", | |
| title | = | "The Linked Inference Principle, I: The Formal Treatment", | |
| note | = | "MCS-P160-0690", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "8', | |
| issue | = | '2", | |
| pages | = | "213-274", | |
| month | = | "April", | |
| year | = | "1992", | |
| Abstract | = | " This paper presents a detailed, formal treatment of the linked inference principle. The principle is applied to obtain the abstract formulations of various linked inference rules. Included among such rules are linked UR-resolution, linked hyperresolution, and linked binary resolution, each of which generalized the corresponding standard and well-known inference rule. In addition to the formalism, the paper focuses on the motivation and objectives for the formulation of linked inference rules. Included are experimental results and numerous examples." |
| author | = | "K. W. Dritz", | |
| title | = | "Ada Solutions to the Salishan Problems", | |
| book | = | "A Comparative Study of Parallel Programming Languages: The Salishan Problems", | |
| editor | = | "J. T. Feo", | |
| publisher | = | "Elsevier", | |
| year | = | "1992", | |
| pages | = | "9-92" } |
| author | = | "G.-Q. Chen and A. Rustichini", | |
| title | = | "Global Solutions to a System of Conservation Laws and Nonzero Sum Dynamic Games'", | |
| number | = | "MCS-P161-0790", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper uses techniques for solving solutions of systems of conservation law to solve a problem in game theory. At the same time, it provides an example of an interesting new application for the theory of systems of conservation laws. Specifically, the paper extends the idea of viscosity solutions to nonzero sum differential games. The extensions provide a sound way of defining the concept of value for a nonzero sum game. They also provide a criterion for selecting among the possible equilibria of the deterministic game." |
| author | = | "S. J. Wright", | |
| title | = | "An Interior-Point Algorithm for Linearly Constrained Optimization", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| note | = | 'MCS-P162-0790", | |
| Abstract | = | " The author describes an algorithm for optimization of a smooth function subject to general linear constraints. An algorithm of the gradient projection class will be used, with the important feature that the projection at each iteration is performed by using a primal-dual interior point method for convex quadratic programming. Convergence properties can be maintained even if the projection is done inexactly in a well-defined way. Higher-order derivative information on the manifold defined by the apparently active constraints can be used to increase the rate of local convergence." |
| author | = | "I. Foster and R. Overbeek", | |
| title | = | "Bilingual Parallel Programming", | |
| booktitle | = | "Proceedings of the 3rd Workshop on Parallel Languages and Compilers", | |
| publisher | = | 'MIT Press", | |
| year | = | "1990", | |
| note | = | "MCS-P163-0790", | |
| Abstract | = | ' This paper presents an approach to parallel programming based on bilingual programming. The key is to construct the upper levels of applications in a high-level language while coding selected low-level components in low-level languages. This approach permits the advantages of a high-level notation--expressiveness, elegance, and conciseness--to be obtained without the cost in performance normally associated with high-level approaches. In addition, it provides a natural framework for reusing existing code." |
| author | = | "D. G. Szyld and M. T. Jones", | |
| title | = | "Two-Stage and Multi-Splitting Methods for the Parallel Solution of Linear Systems", | |
| number | = | "MCS-P165-0790", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A two-stage multi-splitting method for the parallel solution of linear systems is presented. The method reduces to each of the others in specific cases. Conditions for convergence are given. In the case of a multi-splitting method related to block Jacobi, the method is equivalent to a two-stage method with only one iteration per outer iteration. A fixed number p of iterations of this method is compared with a two-stage method with a p inner iterations. The asymptotic rate of convergence of the first method is faster, but--depending on the structure of the matrix and the parallel architecture--it takes more time to converge. Numerical experiments are presented for illustration." |
| author | = | "G. M. Shroff and C. H. Bischof", | |
| title | = | "Adaptive Condition Estimation for Rank-One Updates of QR Factorizations", | |
| journal | = | "SIAM Journal on Matrix Analysis and Applications", | |
| year | = | "1992", | |
| volume | = | "13", | |
| issue | = | "4", | |
| pages | = | "1264-1278", | |
| Abstract | = | " In this paper the authors consider general (i.e., nonsymmetric) matrices undergoing rank-one changes and develop an adaptive condition estimation algorithm GRACE to monitor the condition number of the matrices during the update process. The algorithm requires only O(n) overhead beyond the cost of updating the QR factorization. Potential numerical difficulties of the algorithm are analyzed, and modifications are presented to overcome these difficulties. The paper includes experimental results that demonstrate that GRACE works well in practice." |
| author | = | "R. M. M. Mattheij and S. J. Wright", | |
| title | = | "Parallel Stable Compactification for ODE with Parameters and Multipoint Coditions", | |
| journal | = | "Applied Num. Math.", | |
| volume | = | "13", | |
| year | = | "1993", | |
| pages | = | "305-333"} |
| author | = | "C. H. Bischof and C.-T. Pan and P. T. P. Tang", | |
| title | = | "Stable Cholesky Up- and Downdating Algorithms for Systolic and SIMD Architectures", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "14", | |
| issue | = | " 3", | |
| month | = | "May", | |
| year | = | "1993", | |
| pages | = | '670--676", | |
| note | = | "MCS-P167-0790", | |
| Abstract | = | " This paper presents a stable algorithm for maintaining Cholesky factors of symmetric positive definite matrices under arbitrary rank-one changes. The algorithm is well suited for implementation on systolic arrays and SIMD architectures. By exploiting the similarity between the downdating algorithm recently suggested by Pan and the updating algorithm suggested by Carlson, one can derive an algorithm where up- and downdates can be pipelined. Implementation results on the 1024-processor AMT DAP 510 emphasize the simplicity and practicality of the proposed scheme." |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "A Parallel Graph Coloring Heuristic", | |
| journal | = | "SIAM J. Sic. Comput.", | |
| volume | = | "14", | |
| issue | = | "3", | |
| pages | = | "654-669", | |
| year | = | "1993"} |
| author | = | "W. J. Cody", | |
| title | = | "Algorithm 715: SPECFUN - A Portable FORTRAN package of Special Function Routines and Test Drivers", | |
| journal | = | "ACM TOMS", | |
| volume | = | "19", | |
| issue | = | "1", | |
| year | = | "1993", | |
| pages | = | "22-32"} |
| author | = | "W. J. Cody", | |
| title | = | "CELEFUNT: A Portable Test package for Complex Elementary Functions", | |
| journal | = | "ACM TOMS", | |
| volume | = | "19", | |
| issue | = | "1", | |
| year | = | "1993", | |
| pages | = | "1-21"} |
| title | = | "Spectral viscosity Approximations to Multidimensional Scalar conservation Laws", | |
| journal | = | "Math. Computation", | |
| volume | = | "61", | |
| pages | = | "629-643", | |
| year | = | "1993", | |
| author | = | "G.-Q Chen and Q. Du and E. Tadmor"} |
| author | = | "C. Bishcof and G. Corliss and A. Griewank", | |
| title | = | "Structured Second- and Higher-Order Derivatives through Univariate Taylor Series", | |
| journal | = | "Optimization Methods and Software", | |
| volume | = | "2", | |
| year | = | "1993", | |
| pages | = | "211-232"} |
| title | = | "A Relaxed Reduced Space SQP Strategy for Dynamic Optimization Problems", | |
| journal | = | "Computers and Chemical Engineering", | |
| volume | = | "17", | |
| issue | = | "4", | |
| page | = | "367", | |
| year | = | "1993", | |
| author | = | "J. S. Logsdon ad L. T. Biegler"} |
| author | = | "S. Winker and R. Overbeek and C. R. Woese and G. J. Olsen and N. Pfluger", | |
| title | = | "Structure Detection through Automated Covariance Search", | |
| journal | = | "CABIOS", | |
| volume | = | " 6", | |
| year | = | "1990", | |
| pages | = | "365--371", | |
| note | = | "MCS-P168-0890", | |
| Abstract | = | " This paper summarizes the authors' investigations into the computational detection of secondary and tertiary structure of ribosomal RNA. They have developed a new automated procedure that not only identifies potential secondary and tertiary structural interactions, but also provides the covariation evidence that supports the proposed bondings, and any counterevidence that can be detected in the known sequences. A small number of previously unknown higher-order structural features have been detected in individual RNA molecules (16S rRNA and 7S RNA) through the use of this automated procedure." |
| author | = | "C. R. Woese and S. Winker and R. R. Gutello", | |
| title | = | "The Architecture of Ribosomal RNA: Constraints on the Composition of Tetra-loops", | |
| number | = | "MCS-P169-0890", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The four base loops that cap many double helical structures in ribosomal RNA (the so-called ``tetra-loops'') exhibit highly invariant to highly variable compositions depending upon their location in the molecule. However, in the vast majority of these cases the composition of a tetra-loop is independent of its location and conforms to one of three general motifs: GNRA, UNCG, and (more rarely) CUUG. For the most frequently varying of the 16S rRNA tetra-loops, that at position 83 (E. coli) numbering), the three sequences CUUG, UUCG, and GCAA account for almost all the examples encountered; and each of them has independently arisen at least a dozen times. The closing base pair of tetra-loop hairpins reflects the loop composition: tending to be C:G for UUCG loops and G:C for CUUG loops." |
| author | = | "M. Garbey and H. G. Kaper and M. K. Kwong", | |
| title | = | "Symbolic Manipulation Software and the Study of Differential Equations", {Asymptotic Analysis and Numerical Methods for Partial Differential Equations", | |
| editors | = | "M. Garbey and H. G. Kaper", | |
| pages | = | "241--265", | |
| publisher | = | "Marcel Dekker", | |
| address | = | "New York", | |
| year | = | "1991", | |
| Abstract | = | " | |
| number | = | "MCS-P170-0890. In this note, the authors describe some of their experiences with symbolic manipulation software for the analysis of differential equations. They give several examples from their work on semilinear diffusion equations and from a bifurcation analysis of a nonlinear problem in combustion." |
| author | = | "A. W. Bojanczyk and M. Ewerbring and F. T. Luk and P. Van Dooren", ``An Accurate Product SVD Algorithm", | |
| number | = | "MCS-P171-0890", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1990", | |
| Abstract | = | " The authors propose a new algorithm for computing a singular value decomposition of a product of three matrices. The algorithm is numerically desirable in that all relevant residual elements are numerically small." |
| author | = | "B. M. Averick and R. C. Carter and J. J. More'", | |
| title | = | "The MINPACK-2 Test Problem Collection", | |
| number | = | "ANL/MCS-TM-150", | |
| month | = | "October", | |
| year | = | "1991", |
| author | = | "B. M. Averick and J. J. More'", | |
| title | = | "User Guide for the MINPACK-2 Test Problem Collection", | |
| number | = | "ANL/MCS-TM-157", | |
| month | = | "October", | |
| year | = | "1991", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The Army High Performance Computing Research Center at the University of Minnesota and the MCS Division at Argonne are collaborating on the development of the software package MINPACK-2. As part of the project, they are developing a collection of significant optimization problems to serve as test problems for the package. This report describes the software associated with the preliminary version of the MINPACK-2 test problem collection. The discussion centers on the description of subroutine parameters, but additional information on the implementation of these subroutines is also provided. The information in this report should be sufficient to use these subroutines for testing and evaluating software.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM157.ps.Z} |
| author | = | "C. Bischof and J. Hu", | |
| title | = | "Utilities for Building and Optimizing a Computational Graph for Algorithmic Decomposition", | |
| number | = | "ANL/MCS-TM-148", | |
| month | = | "January", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " This document describes a utility to construct and evaluate an optimized execution graph from the tapefile generated by the ADOL-C automatic differentiation software. It describes the format of the ADOL-C tapefile, the data structures used in building and storing the graph, and the optimizations performed in transforming the computation trace stored in the tape into an efficient graph representation. In particular, we eliminate assignments, increase granularity by ``hoisting'' chains of unary operations, and remove so-called dead roots -- intermediate values that have no influence on the dependent. Examples show that the optimized graphs contain up to 50\% fewer nodes than a graph that would be an exact analogue of the ADOL-C tape. We also describe an attempt at generating compiled code for the graph evaluation as an alternative to interpretative approaches to evaluating the graph.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM148.ps.Z"} |
| author | = | "I. Foster and E. Tick", | |
| title | = | "Proceedings of the Workshop on Compilation of (Symbolic) Languages for Parallel Computers", | |
| number | = | "ANL-91/34", | |
| month | = | "November", | |
| year | = | "1991", | |
| Abstrtact | = | " This report comprises the abstracts and papers for the talks presented at the Workshop on Compilation of (Symbolic) Languages for Parallel Computers held October 31-November 1, 1991, in San Diego. The goal of the workshop was to bring together researchers from different disciplines with common problems in compilation. In particular, the organizers wished to encourage interaction between researchers working in compilation of symbolic languages and those working on compilation of conventional, imperative languages. This workshop was a first step at opening up discussions and contributing to the solution of problems in language compilation for parallel computers.} |
| author | = | "I. Foster and S. Tuecke", | |
| title | = | "Parallel Programming with PCN", | |
| number | = | "ANL-91/32 - rev. 1", | |
| month | = | "December", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " This document provides all the information required to develop parallel programs with the PCN programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools." | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9132.ps.Z"} |
| author | = | "Ian Foster and Steve Tuecke and Stephen Taylor", | |
| title | = | "A Portable Run-Time System for PCN", | |
| number | = | "ANL/MCS-TM-137 - rev. 1", | |
| month | = | "December", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " This report describes a run-time system to support Program Composition Notation (PCN), a high-level concurrent programming notation. The run-time system is described in terms of an abstract machine. We specify an abstract architecture that represents the state of a PCN computation and executes abstract machine instructions that encode tests on or modifications to the computation state. Programs to be executed on the abstract machine are encoded as seq uences of abstract machine instructions. The abstract machine may be implemented by an emulator written in a low-level language. Alternatively, sequences of abstract machine instructions may be further compiled to machine code. The run-time system is designed to run on uniprocessors, multiprocessors, and multicomputers.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM137.ps.Z"} ANL/MCS-TM-137. |
| author | = | "W. W. McCune", | |
| title | = | "Proofs for Group and Abelian Groups Single Axioms", | |
| number | = | "ANL/MCS-TM-16a", | |
| month | = | "October", | |
| year | = | "1991", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This memorandum serves as a companion to the paper "Single axioms for groups and Abelian groups with various operations." That paper presents single axioms for groups and Abelian groups in terms of {product, inverse}, {division}, {double division, identity}, {double division, inverse}, {division, identity}, and {division, inverse}. Proofs that were omitted from that paper are presented here.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM156.ps.Z"} |
| author | = | "R. Olson", | |
| title | = | "Using host-control", | |
| number | = | "ANL/MCS-TM-154", | |
| month | = | "October", | |
| year | = | "1991", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The utility host-control conveniently configures a set of machines for use with the networked version of PCN. It enables the user to specify exactly how PCN is to be run on each node, and it allows for easy control of runaway PCN nodes. This document provides the information needed for a new user to get started with host-control. It also provides the advanced user with the information needed to get around more difficult problems in a networked PCN configuration.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM154.ps.Z"} |
| author | = | "R. C. Taylor", | |
| title | = | "Automated Insertion of Sequences into a Ribosomal Alignment: An Application of Computational Linguistics in Molecular Biology", | |
| number | = | "ANL-91/29", | |
| month | = | "November", | |
| year | = | "1991", | |
| Abstract | = | " This thesis involved the construction of (1) a grammar that incorporates knowledge on base invariancy and secondary structure in a molecule, and (2) a parser engine that uses the grammar to position bases into the structural subunits of the molecule. These concepts were combined with a novel pinning technique to form a tool that semi-automates insertion of a new species into the alignment for the 16S rRNA molecule (a component of the ribosome) maintained by Dr. Carl Woese's group at the University of Illinois at Urbana. The tool was tested on species extracted from the alignment and on a group of entirely new species. The results were very encouraging, and the tool should be of substantial aid to the curators of the 16S alignment. The construction of the grammar was automated, allowing application of the tool to alignments for other molecules. The logic programming language Prolog was used to construct all programs involved. The computational linguistics approach used here was found to be a useful way to attack the problem of insertion into an alignment.} |
| author | = | "C. Bischof and Andreas Griewank and David Juedes", | |
| title | = | "Exploiting Parallelism in Automatic Differentiation", | |
| booktitle | = | "Proceedings of the 1991 International Conference on Supercomputing", | |
| editors | = | "E. Houstis and Y. Muraoka", | |
| pages | = | "136--143", | |
| publisher | = | "ACM Press", | |
| address | = | "Baltimore", | |
| year | = | "1991", | |
| Abstract | = | " The numerical methods employed in the solution of many scientific computing problems require the computation of first- or second-order derivatives of a function f: $R^n$ -> $R^m$. We present an approach that, given a serial C program for the computation of f(x), derives a parallel execution schedule for the computation of f and its derivatives in a completely automatic fashion. This is achieved by overloading the computation of f(x) in C++ to obtain a trace of the computations to be performed and then transforming this trace into a data flow graph for the computation of f(x). In addition to the computation of f(x), this graph also allows us to exactly and inexpensively compute derivates of f by the repeated use of the chain rule. Parallelism is exploited in two ways: rows or columns of derivative matrices can be computed by independent passes through the computational graph, and parallelism within the processing of this computational graph can be exploited by processing independent subgraphs concurrently. We present experimental results that show that good performance on shared-memory machines can be obtained by using a graph interpreter approach. We then present some ideas that are currently under development for improving computational granularity and for implementing parallel automatic differentiation schemes in a portable and more efficient fashion.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P204.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "An Improved Incomplete Cholesky Factorization", | |
| journal | = | "ACM Transactions on Mathematical Softwarez", | |
| volume | = | "21", | |
| issue | = | "1", | |
| month | = | "March", | |
| year | = | "1995", | |
| pages | = | "5--17", | |
| Abstract | = | ' Incomplete factorization has been shown to be a good preconditioner for the conjugate gradient method on a wide variety of problems. It is well known that allowing some fill-in during the incomplete factorization can significatnly reduce the number of iterations needed for convergence. Allowing fill-in, however, increases the time for the factorization and for the triangular system solutions. Additionally, it is difficult to predict a priori how much fill-in to allow and how to allow it. the unpredictability of the required storage/work and the unknown benefits of the additional fill-in make such strategies impractical to use in many situations. In this article we motivate, and then present, two ``black-box'' strategies that significantly increase the effectiveness of incomplete Cholesky factorization as a preconditioner. These strategies require no parameters from the user and do not increase the cost of the triangular system solutions. Efficient implementations for these algorithms are described. These algorithms are shown to be successful for a variety of problems from the Harwell-Boeing sparse matrix collection.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P206.ps.Z"} |
| author | = | "F. V. atkinson and H. G. Kaper and M. K. Kwong", | |
| journal | = | "Methods and Applications of Analysis", | |
| volume | = | "2", | |
| issue | = | "4", | |
| year | = | "1995", | |
| pages | = | "466-474"} |
| author | = | "W. W. McCune", | |
| title | = | "Single Axioms for the Left Group and Right Group Calculi", | |
| journal | = | "Notre Dame Journal of Formal Logic", | |
| volume | = | "34", | |
| issue | = | "1", | |
| year | = | "1993", | |
| pages | = | "132--139", | |
| Abstract | = | " This article is on axiomatizations of the left gruop calculus and of the right group calculus. The axiomatizations use modus ponens rather than equality substitution as the inference rule. The structures being axiomatized are ordinary free group, and the sole operation is division. Previous axiomatizations are due to J. A. Kalman. The article contains single axioms and other simple axiomatizations of the two calculi. An automated theorem-proving program was used extensively to find candidate axiomatizations and to find proofs that candidates are in fact axiomatizations.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P219.ps.Z"} |
| author | = | "G. Corliss", | |
| title | = | "Automatic Differentiation Bibliography", | |
| number | = | "ANL/MCS-TM-167", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1992"} |
| author | = | "G. Corliss", | |
| title | = | "ADIFOR Working Note No. 10: ADIFOR Case Study", | |
| number | = | "ANL/MCS-TM-168", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1992"} |
| author | = | " W. W. McCune", | |
| title | = | "Automated Discovery of New Axiomatizations of the Left Group and Right Group Calculi", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "9", | |
| year | = | "1992", | |
| pages | = | "1--24", | |
| Abstract | = | " This paper shows how the automated theorem-proving program OTTER was used to discover new axiomatizations, including single axioms, for the left group and right group calculi. J. A. Kalman's original axiomatizations of the two calculi each contain five axioms. Three of Kalman's axioms (L1, L4, and L5) for the left group calculus were shown to be dependent on the remaining two axioms. Four of Kalman's axioms (R1, R3, R4, and R5) for the right group calculus were shown to be dependent on the remaining axiom. Alternative simpler axiomatizations were discsovered for both calculi, including a single axiom for the left group calculus and five additional single axioms for the right group calculus. The program OTTER was vital in discovering candidate axiomatizations as well as in finding proofs of new axiomatizations. All of the relevant OTTER proofs are included.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P220.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Algorithm 740: Fortran Subroutines to Compute Improved Incomplete Cholesky Factorizations", | |
| journal | = | "ACM Transactions on Mathematical Software", | |
| volume | = | "21", | |
| issue | = | "1", | |
| month | = | "March", | |
| year | = | "1995", | |
| pages | = | "18--19", | |
| Abstract | = | "Efficient and reliable code to compute incomplete Cholesky factors of sparse matrices for use as preconditioners in a conjugate gradient algorithm is described. This code implements two recently developed, improved incomplete factorization algorithms. An efficient implemlentation of the standard incomplete Cholesky factorization is also included.} |
| author | = | "C. H. Bischof and P. T. P. Tang" | |
| title | = | "Generalizing Incremental Condition Estimation", | |
| journal | = | "J. Numer. Linear Algebra", | |
| volume | = | "1", | |
| issue | = | "2", | |
| year | = | "1992", | |
| pages | = | "149--163", | |
| Abstract | = | 'This paper presents a generalization of incremental condition estimation, a technique for tracking the extremal singular values of a triangular matrix. While the original approach allowed for the estimation of the largest or smallest singular value, the generalized scheme allows for the estimation of any number of extremal singular values. For example, we can derive estimates for the three smallest singular values and the corresponding singular vectors at the same time. When estimating k singular values at the same time, the cost of one step of our generalized scheme on an n x n matrix is $O(n k^2)$. Experimental results show that the resulting estimator does a good job of estimating the extremal singular values of triangular matrices and that, in particular, it leads to an inexpensive, yet very accurate and robust condition estimator.} | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P233.ps.Z"} |
| author | = | "C. H. Bischof", | |
| title | = | "Issues in Parallel Automatic Differentiation", | |
| journal | = | "Automatic Differentiation of Algorithms", | |
| editor | = | "A. Griewank and G. Corliss", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| pages | = | " 100--113", | |
| year | = | "1991", | |
| Abstract | = | " This paper shows how first-order derivatives can be computed in parallel by considering the computational graph that underlies the evaluation of the target function. The graph can be generated efficiently from the ADOL-C computational trace and can be used to automatically deduce the structure of the Jacobian matrix and compute the Jacobian using the reverse mode of automatic differentiation. By employing well-known graph-coloring techniques, one can dramatically decrease the number of reverse passes required. The resulting implementation performs well on the Sequent Symmetry and BBN Butterfly TC2000 shared-memory multiprocessors. Lastly, we look at the problems that must be tackled to make automatic differentiation a commonplace computing tool, and to allow for efficient implementations on high-performance computers. In our view, the key lies in finding better ways to incorporate user and/or compile-time information about the behavior of the program into the automatic differentiation approach.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P235.ps.Z"} |
| author | = | "C. H. Bischof", | |
| title | = | "LAPACK: Linear Algebra Software for Supercomputers", | |
| booktitle | = | "Proc. 2nd ODIN Symposium", | |
| editor | = | "A. Schreiner and W. Ewinger", | |
| pages | = | "101--120", | |
| year | = | "1991", | |
| ABSTRACT | = | " This paper presents an overview of the LAPACK library, a portable, public-domain library to solve the most common linear algebra problems. This library provides a uniformly designed set of subroutines for solving systems of simultaneous linear equations, least-squares problems, and eigenvalue problems for dense and banded matrices. We elaborate on the design methodologies incorporated to make the LAPACK codes efficient on today's high-performance architectures. In particular, we discuss the use of block algorithms and the reliance on the Basic Linear Algebra Subprograms (BLAS). We present performance results that show the suitability of the LAPACK approach for vector uniprocessors and shared-memory multiprocessors. We also address some issues that have to be dealt with in tuning LAPACK for specific architectures. Lastly, we present results that show that the LAPACK software can be adapted with little effort to we distributed-memory environments, and discuss future efforts resulting from this project.f.a", | |
| note | = | ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P236.ps.Z"} |
| author | = | "W. McCune and L. Wos", | |
| title | = | "Experiments in Automated Deduction with Condensed Detachment", | |
| booktitle | = | "Proc. of 11th International Conf. on Automated Deduction (CADE 11: Lecture Notes in Artificial Intelligence 607" | |
| editor | = | "D. Kapur", | |
| publisher | = | "Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1992", | |
| pages | = | "209--223", | |
| Abstract | = | " This paper contains 112 problems that use condensed detachment in nine different logic calculi: three versions of the two-valued sentential calculus, the many-valued sentential calculus, the implicational calculus, the equivalential calculus, the R calculus, the left grouop calculus, and the right group calculus. Results of experiments with the theorem-proving program OTTER are presented. Each problem was run with at least three strategies: (1) a basic strategy, (2) a strategy with a more refined method for selecting clauses on which to focus, and (3) a strategy that uses the refined selection mechanism and deletes deduced formulas according to some simple rules. Two new features of OTTER are also presented: the refined method for selecting the next formula on which to focus, and a method for controlling memory usage.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P237.ps.Z"} |
| author | = | "J. N. Lyness and E. de Doncker", | |
| title | = | "Quadrature Error Expansions--Part II: The Full Corner Singularity", | |
| journal | = | "Numer. Math.", | |
| volume | = | "64", | |
| year | = | "1993", | |
| pages | = | "355--370", | |
| Abstract | = | " This paper continues the work of Part I, treating in detail the theory of numerical quadrature over a square. The extreme case treated here is one in which the integrand function has a full-corner algebraic singularity.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P248.ps.Z"} |
| author | = | "C. H. Bischof and Per Christian Hansen", | |
| title | = | "A Block Algorithm for Computing Rank-Revealing QR Factorizations", | |
| journal | = | "Numerical Algorithms", | |
| volume | = | "2", | |
| number | = | "3--4", | |
| year | = | "1992", | |
| pages | = | "371--392", | |
| Abstract | = | " We present a block algorithm for computing rank-revealing QR factorizations (RRQR factorizations) of rank-deficient matrices. The algorithm is a block generalization of the RRQR-algorithm of Foster and Chan. While the unblocked algorithm reveals the rank by peeling off small singular values one by one, our algorithm identifies groups of small singular values. In our block algorithm, we use incremental condition estimation to compute approximations to the nullvectors of the matrix. By applying another (in essence also rank-revealing) orthogonal factorization to the nullspace matrix such created, we can then generate triangular blocks with small norm in the lower right part of E. This scheme is applied in an iterative fashion until the rank has been revealed in the (updated) QR factorization. We show that the algorithm produces the correct solution, under very weak assumptions for the orthogonal factorization used for the nullspace matrix. We then discuss issues concerning an efficient implementation of the algorithm and present some numerical experiments. Our experiments show that the block algorithm is reliable and successfully captures several small singular values, in particular in the initial block steps. Our experiments confirm the reliability of our algorithm and show that the block algorithm greatly reduces the number of triangular solves and increases the computational granularity of the RRQR computation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P251.ps.Z"} |
| author | = | "E. L. Lusk and W. W. McCune", | |
| title | = | "Experiments with ROO: A Parallel Automated Deduction System", | |
| booktitle | = | " Parallelization in Inference Systems, Lecture Notes in Artificial Intelligence 590", | |
| editor | = | "B. Fronhofer and G. Wrightson", | |
| publisher | = | 'Springer-Verlag", | |
| address | = | "New York", | |
| year | = | "1992", | |
| pages | = | "139--162", | |
| Abstract | = | " This paper provides a close look at the behavior of ROO, a parallel theorem prover, on a wide variety of theorem-proving problems. The problems show ROO at its best and at its worst. The authors note that the nondeterministic nature of parallel algorithms means that consecutive runs of the same input file, on the same number of processes, can produce different results. The question of stability and reproducibility of the results reported is addressed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P254.ps.Z"} |
| title | = | "ROO - A Parallel Theorem Prover", | |
| author | = | E. L. Lusk and W. W. McCune and J. K. Slaney", | |
| number | = | "ANL/MCS-TM-149", | |
| year | = | "1991"} |
| author | = | "I.-B. Tjoa and L. T. Biegler", | |
| title | = | "A Reduced Successive Quadratic Programming Strategy for Errors-in-Variables Estimation", | |
| number | = | "MCS-P255-0891", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " In this study the authors develop a tailored nonlinear programming strategy for errors-in-variables (EVM) problems. The method is based on a reduced Hessian approach to successive quadratic programming, but with the decomposition performed separately for each data set. This leads to the elimination of all variables but the model parameters, which are determined by a quadratic programming coordination step. In this way the computational effort remains linear in the number of data sets. Moreover, the approach directly incorporates constraints on the model parameters. The approach is demonstrated on five example problems with up to 102 degrees of freedom. Compared with general-purpose NLP algorithms, large improvements in computational performance are observed.} |
| author | = | "J. S. Logsdon and L. T. Biegler", | |
| title | = | "Reduced Gradient Strategies for Dynamic Optimization Problems: Feasible and Infeasible Path Variations", | |
| number | = | "MCS-P256-0891", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " Recently, strategies have been developed to solve dynamic simulation and optimization problems simultaneously. In this paper, the authors develop a decomposition strategy that can be used for the accurate solution of optimal control problems. Two types of algorithm are investigated: a reduced gradient approach in which the state variables are implicitly eliminated through repeated solution of the collocation equations, and an infeasible path approach that leads to much faster performance. Nonlinear problems with up to 5500 variables are solved efficiently.} |
| author | = | "W. Gropp", | |
| title | = | "Parallel Computing and Domain Decomposition", | |
| number | = | "MCS-257-0891. | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1991", | |
| Abstract | = | " This paper discusses some of the issues in designing and implementing a parallel domain decomposition algorithm. A framework for evaluating the cost of parallelism is introduced and applied to answering questions such as which and how many processors should solve global problems and what impact load balancing has on the choice of domain decomposition algorithm. The sources of performance bottlenecks are discussed. This analysis suggests that domain decomposition techniques will be effective on high-performance parallel processors and on networks of workstations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P257.ps.Z"} |
| author | = | "J. N. Lyness and T. Sorevik", | |
| title | = | "A Search Program for Finding Optimal Integration Lattices", | |
| year | = | "1991", | |
| journal | = | "Computing", | |
| volume | = | "47", | |
| pages | = | "103-120"} |
| author | = | "J. N. Lyness and T. Sorevik", | |
| title | = | "An Algorithm for Finding Optimal Integration Lattices of Composite Order", | |
| year | = | "1992", | |
| journal | = | "BIT", | |
| volume | = | "32", | |
| pages | = | "665-675"} |
| author | = | "E. L. Lusk and W. W. McCune", | |
| title | = | "An Entry in the 1992 Overbeek Theorem-Proving Contest", | |
| number | = | "ANL/MCS-TM-172", | |
| year | = | "1992"} |
| author | = | "G.-Q. Chen and J.-G. Liu", | |
| title | = | "A Nonconservative Scheme for Isentropic Gas Dynamics", | |
| number | = | "MCS-P260-0891", | |
| institution | = | "Argonne National Laboratory", | |
| address | = | "Argonne, Illinois", | |
| year | = | "1991" | |
| Abstract | = | "A second-order nonconservative scheme for the system of isentropic gas dynamics is constructed to capture the physical invariant regions, to treat the vacuum singularity, and to control the local entropy from dramatically increasing near shock waves. Convergence of this scheme to an entropy solution is established for the Cauchy problem with $L^\inf$ initial data, by analyzing the entropy dissipation measures. This scheme can be applied to general systems of conservation laws. |
| author | = | "S. J. Wright", | |
| title | = | "Identifiable Surfaces in Constrained Optimization", | |
| number | = | "MCS-P261-0891", | |
| year | = | "1991", | |
| Abstract | = | " A new concept in Euclidean space is introduced. The author shows how the smoothness of these surfaces is related to the smoothness of the projection operator, and he presents finite identification results for certain algorithms for minimization of a function over this set. The work uses a partially geometric view of constrained optimization to generalize previous finite identification results", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P261.ps.Z"> MCS-P261-0891", |
| author | = | "B. M. Averick and J. M. Ortega", | |
| title | = | "Fast Solution of Nonlinear Poisson-Type Equations", | |
| journal | = | "SIAM J. Sci. Stat. Comput.", | |
| volume | = | "14", | |
| issue | = | "1", | |
| pages | = | "44-48", | |
| year | = | "1993", | |
| Abstract | = | " This paper is concerned with the solution of nonlinear Poisson-type equations. A change of variable is made that effectively reduces the solution of such equations to solving a linear Poisson equation followed by a series of one-dimensional nonlinear equations. Comparison with other methods shows the new method to be competitive.", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P262.ps.Z"> MCS-P262-0991", |
| author | = | "C. Bischof and A. Carle and G. Corliss and A. Griewank and P. Hovland", | |
| title | = | "ADIFOR Working Note 1: ADIFOR--Generating Derivative Codes from Fortran Programs", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "14", | |
| issue | = | "1", | |
| year | = | "1993", | |
| pages | = | "231-238", | |
| Abstract | = | " The numerical methods employed in the solution of many scientific computing problems require the computation of a function f : R**n -> R**m. Both the accuracy and the computational requirements of the derivative computation are usually of critical importance for the robustness and speed of the numerical solution. Automatic Differentiation of FORtran (ADIFOR) is a source transformation tol that accepts Fortran 77 code for the computation of a function and writes portable Fortran 77 code for the computation of the derivatives. In contrast to previous approaches, ADIFOR views automatic differentiation as a source transformation problem. ADIFOR employs the data analysis capabilities of the ParaScope Parallel Programming Environment, which enables us to handle arbitrary Fortran 77 codes and to exploit the computational context in the computation of derivatives. Experimental results show that ADIFOR can handle real-life codes and that ADIFOR-generated codes are competitive with divided-difference approximations of derivatives. In addition, studies suggest that the source transformation approach to automatic differentiation may improve the time to compute derivatives by orders of magnitude", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P263.ps.Z"> MCS-P263-0991 (postscript)", |
| author | = | "I-L. Chern and I. Foster", | |
| title | = | "Design and Parallel Implementation of Two Numerical Methods for Modeling the Atmospheric Circulation", | |
| book | = | "Parallel Computational Fluid Dynamics '91", | |
| editor | = | "K. G. Reinshc et al.", | |
| publisher | = | "Elsevier", | |
| year | = | "1992"} | |
| Abstract | = | " Two methods are proposed for simulating on parallel supercomputers the time evolution of the primitive equations used in atmospheric circulation models. The first is a control volume method on an icosahedral-hexagonal grid on the sphere. This method has a number of computational advantages compared with other methods used for the same purpose, including a nearly uniform resolution on the sphere, no pole problem, and reduced global data communication requirements. The second method is a composite-mesh, second-order Godunov method. This also avoids global communication and the pole problem and, in addition, is able to handle discontinuities. The authors perform several simulations to demonstrate the convergence of the two methods. They also outline the techniques used to achieve parallel implementations and report on computational experiments that demonstrate the methods' suitability for parallel execution. |
| author | = | "D. W. Juedes", | |
| title | = | "A Taxonomy of Automatic Differentiation Tools", | |
| number | = | "MCS-P265-0991", | |
| year | = | "1991", | |
| Abstract | = | " Many of the current automatic differentiation (AD) tools have similar characteristics. Unfortunately, the similarities between these various AD tools often cannot be easily ascertained by reading the corresponding documentation. To clarify this situation, the author has devised a taxonomy of AD tools. The taxonomy places AD tools into the Elemental, Extensional, Integral, Operational, and Symbolic classes. This taxonomy is used to classify 29 AD tools. Each tool is examined individually with respect to the mode of differentiation and the degree of derivatives computed. A list detailing the availability of the surveyed AD tools is provided in the Appendix", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P265.ps.Z"> P265.ps.Z", |
| author | = | "S. J. Wright", | |
| title | = | "A Collection of Problems for Which Gaussian Elimination with Partial Pivoting Is Unstable", | |
| number | = | "MCS-P266-0991", | |
| year | = | "1991", | |
| Abstract | = | " A significant collection of two-point boundary value problems is shown to give rise to linear systems of algebraic equations on which Gaussian elimination with row partial pivoting is unstable when standard solution techniques are used", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P266.ps.Z"> P266.ps.Z", |
| author | = | "A. Griewank and S. Reese", | |
| title | = | "On the Calculation of Jacobian Matrices by the Markowitz Rule", | |
| book | = | "Automatic Differentiation of Algorithms: Theory, Implementation, and Application", | |
| editor | = | "A. Griewank and G. F. Corliss", | |
| publisher | = | "SIAM", | |
| address | = | "Philadelphia", | |
| year | = | "1991", | |
| Abstract | = | " Automatic differentiation may be applied to evaluate first and higher derivatives of any vector function that is defined as the composition of easily differentiated elementary functions, typically in the form of a computer program. The more general task of efficiently evaluating Jacobians or other derivative matrices leads to a combinatorial optimization problem, which is conjectured to be NP-hard. This paper examines this vertex elimination problem and solves it approximately, using a greedy heuristic. Numerical experiments show the resulting Markowitz scheme for Jacobian evaluation to be more efficient than column-by-column or row-by-row evaluation using the forward or reverse mode, respectively", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P267.ps.Z"> P267.ps.Z", |
| author | = | "J. D. F. Cosgrove and J. C. Diaz and A. Griewank", | |
| title | = | "Approximate Inverse Preconditioning for Sparse Linear Systems", | |
| journal | = | "Internl. J. Computer Math.", | |
| volume | = | "44", | |
| pages | = | "91-110", | |
| year | = | "1992"} | |
| note | = | "also MCS-P268-1091", | |
| Abstract | = | " This paper presents a special procedure for the adaptive construction of sparse approximate inverse preconditionings for general sparse linear systems. The approximate inverses are based on minimizing a consistent norm of the difference between the identity and the preconditioned matrix. The analysis provides positive definiteness and condition number estimates for the preconditioned system under certain circumstances. The authors show that for the 1-norm, restricting the size of the difference matrix below 1 may require dense approximate inverses. However, this requirement does not hold for the 2-norm, and similarly reducing the Frobenius norm below 1 does generally require that much fill-in. Moreover, for the Frobenius norm, the calculation of the approximate inverses yields naturally column-oriented parallelism. General sparsity can be exploited in a straightforward fashion. Numerical criteria are considered for determining which columns of the sparse approximate inverse require additional fill-in. Sparse algorithms are discussed for the location of potential fill-in within each column. Results using a minimum-residual-type iterative method are presented to illustrate the potential of the method. |
| author | = | "J. N. Lyness and P. Keast", | |
| title | = | "Application of the Smith Normal Form to the Structure of Lattice Rules", | |
| year | = | "1995", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "16", | |
| issue | = | "1", | |
| pages | = | "218-231", | |
| Abstract | = | " Two independent approaches to the theory of the lattice rule have been exploited at length in the literature. In this paper a close connection between these approaches is demonstrated. This fact may be used to provide a straightforward solution to the previously intransigent problem of identifying and removing a repetition in the general t-cycle form", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P269.ps.Z"> P269.ps.Z", |
| author | = | "W. W. McCune", | |
| title | = | "Single Axioms for Groups and Abelian Groups with Various Operations", | |
| journal | = | "J. of Automated Reasoning", | |
| volume | = | "10", | |
| year | = | "1993", | |
| pages | = | "1-13", | |
| Abstract | = | " This paper summarizes the results of an investigation into single axioms for groups, both ordinary and Abelian, with each of the following six sets of operations: {product, inverse}, {division}, {double division, identity}, {double division, inverse}, {division, identity}, and {division, inverse}. In all but two of those twelve theories, we present either the first single axioms known to us or single axioms shorter than those previously known to us. An automated theorem-proving program was used extensively to construct sets of candidate axioms and to search for and find proofs that given candidate axioms are in fact single axioms", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P270.ps.Z"> P270.ps.Z", |
| author | = | "J. N. Lyness", | |
| titel | = | "On Handling Singularities in Finite Elements", | |
| journal | = | "Numerical Integration", | |
| editor | = | "T. O. Espelid and A. Genz", | |
| publisher | = | "Kluwer Academic Publishers", | |
| year | = | "1991", | |
| pages | = | "219-233", | |
| Abstract | = | " In the practice of the Boundary Element Method, a basic task involves the quadrature over a quadrilateral or triangle of an integrand function which has a singularity of known form at a vertex. A not uncommon situation is that this quadrature has already been studied in depth for the standard triangle or the square, and all that is now necessary is to apply the known results in the context of a different triangle or parallelogram, one that has been obtained from the standard region by an affine transformatio. It can be surprising to someone who has not done it himself, how difficult this task can be. This article provides an account of how easy it is to be misled in this area. Besides describing an apparently cost effective approach which turns out to be a disaster, I discuss some of the advantages and disadvantages of using rules based on extrapolation either as an alternative to, or in conjunction with Gaussian rules. This article is anecdotal in character", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P271.ps.Z"> P271.ps.Z", |
| author | = | "G. Kirlinger and G. F. Corliss", | |
| title | = | "On Implicit Taylor Series Methods for Stiff Odes", | |
| number | = | "MCS-P272-1191", | |
| year | = | "1991", | |
| Abstract | = | " Several versions of implicit Taylor series methods (ITSM) are presented and evaluated. Criteria for the approximate solution of ODEs via ITSM are given. Some ideas, motivations, and remarks on the inclusion of the solution of stiff ODEs are outlined", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P272.ps.Z"> P272.ps.Z", |
| author | = | "R. M. Corless and G. F. Corliss", | |
| title | = | "Rationale for Guaranteed ODE Defect Control", | |
| number | = | "MCS-P273-1191", | |
| year | = | "1991", | |
| Abstract | = | " The authors introduce a modification of existing algorithms that allows easier analysis of numerical solutions of ordinary differential equations. They relax the requirement that the specified problem be solved, and instead solve a ``nearby'' problem exactly, in Wilkinson's tradition of backward error analysis. The precise meaning of ``nearby'' is left to the user. This inexpensive algorithm sublimates the well-known difficulties associated with the propagation of accumulated error and avoids the difficulty of exponential growth of inclusion widths associated with interval techniques. No claim is made for the accuracy with which the specified problem is solved. It is shown that often no such claim is necessary", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P273.ps.Z"> P273.ps.Z", |
| author | = | "C. H. Bischof and B. N. Datta and A. Purkayastha", | |
| title | = | "A Parallel Algorithm for the Multi-Input Sylvester-Observer Equation", | |
| number | = | "MCS-274-1191", | |
| year | = | "1991", | |
| Abstract | = | " This paper presents a new algorithm for solving the multi-input Sylvester-Observer equation. The algorithm embodies two main computational phases: the solution of a series of independent equation systems, and a series of matrix-matrix multiplications. As such, the algorithm is well suited for a parallel machine. By reducing the coefficient matrix to lower Hessenberg form, one can implement the algorithm efficiently, with few floating-point operations and little workspace. Experimental results on the CRAY Y-MP and the Siemens S600/10 are presented that confirm the efficiency of the algorithm", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P274.ps.Z"> P274.ps.Z", |
| author | = | "W. McCune and L. Wos", | |
| title | = | "Application of Automated Deduction to the Search for Single Axioms for Exponent Groups", | |
| book | = | "Logic Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence 624", | |
| editor | = | "A. Voronkov", | |
| publisher | = | "Springer Verlag", | |
| year | = | "1992", | |
| pages | = | "131-136"} |
| author | = | "W. McCune", | |
| title | = | "Single Axioms for Boolean Algebra", | |
| number | = | "ANL/MCS-TM-243", | |
| month | = | "June", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "R. Veroff and W. McCune", | |
| title | = | "A Short Sheffer Axiom for Boolean Algebra", | |
| number | = | "ANL/MCS-TM-244", | |
| month | = | "June", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "E. Lusk and L. Wos", | |
| title | = | "Benchmark Problems in Which Equality Plays the Major Role", | |
| booktitle | = | "Proceedings of the Eleventh International Conference on Automated Deduction (CADE-11), Lecture Notes in Artificial Intelligence 607", | |
| eidtor | = | "D. Kapur", | |
| address | = | "New York", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1992", | |
| pages | = | "781-785", | |
| Abstract | = | " To facilitate research using paramodulation and to provide test problems for evaluating other approaches to equality-oriented reasoning, this article presents a set of benchmark problems in which equality plays the dominant role. The test problems are taken from group theory, ring theory, Robbins algebra, combinatory logic, and other areas. For each problem there are included appropriate clauses and comment as to its status with regard to provability by an unaided automated reasoning program. Also included are various open questions.", |
| author | = | "J. N. Lyness and T. Sorevik", | |
| title | = | "Lattice Rules by Component Scaling", | |
| journal | = | "Math. Computation", | |
| volume | = | "61", | |
| number | = | "204", | |
| month | = | "October", | |
| year | = | "1993", | |
| pages | = | "799-820", | |
| Abstract | = | " This paper introduces a theory of rectangular scaling of integer lattices. This may be used to construct families of lattices. The authors determine the relation between the Zaremba index of various members of the same family. If one member of a family has a high order, it appears that some other family members of higher order may have extraordinarily high indices. The authors have applied a technique based on this theory to lists of good lattices. They have constructed lists of excellent, previous unknown lattices of high order in three and four dimensions", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P276.ps.Z"> P276.ps.Z, | ||
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P276.dvi.Z"> P276.dvi.Z.", |
| author | = | "C. Bischof and A. Carle and G. Corliss and A. Griewank and P. Hovland", | |
| title | = | "ADIFOR Working Note No. 4: ADIFOR: Fortran Source Translation for Efficient Derivatives", | |
| number | = | "MCS-P278-1291", | |
| year | = | "1992", | |
| Abstract | = | " The numerical methods employed in the solution of many scientific computing problems require the computation of derivatives. Both the accuracy and the computational requirements of the derivative computation are usually of critical importance for the robustness and speed of the numerical method. ADIFOR is a source translation tool implemented by using the data abstractions and program analysis capabilities of the ParaScope Parallel Programming Environment. ADIFOR accepts arbitrary Fortran 77 code defining the computation of a function and writes portable Fortran 77 code for the computation of its derivatives. In contrast to previous approaches, ADIFOR views automatic differentiation as a process of source translation that exploits computational context to reduce the cost of derivative computations. Experimental results show that ADIFOR can handle real-life codes, providing exact derivatives with a running time that is competitive with the standard divided-differences in certain cases. The computational scientist using ADIFOR is freed from worrying about the accurate and efficient computation of derivatives, even for complicated ``functions'' and hence is able to concentrate on the more important issues of algorithm design or system modeling", | |
| note | = | " | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P278.ps.Z"> P278.ps.Z", |
| author | = | "J. Zhang and L. Wos", | |
| title | = | "Automated Reasoning and Enumerative Search, with Application to Mathematics", | |
| booktitle | = | "Proceedings of the International Conference for Young Computer Scientists", | |
| editor | = | "Yongchun Liu and Xiaoming Li", | |
| publisher | = | "International Academic Publishers", | |
| year | = | "1991", | |
| pages | = | "543-545", | |
| Abstract | = | " More and more mathematical problems are being solved with the aid of computers. This paper examines the applications of reasoning and search programs to mathematics. It is also shown that the combination of these two techniques can solve mathematical problems more effectively. |
| author | = | "J. Garner and M. Spanbauer and R. Benedek and K. J. Strandburg and S. Wright and P. Plassmann", | |
| title | = | "Critical Fields of Josephson-Coupled Superconducting Multilayers", | |
| number | = | "MCS-P281-1291", | |
| year | = | "1991", | |
| Abstract | = | " The finite-element representation of the Ginzburg-Landau free-energy functional introduced by Doria, Gubernatis, and Rainer is generalized to treat Josephson-coupled superconductor-insulator multilayer materials. Numerical calculations are performed for applied field parallel to the layers. Results are presented for the upper and lower critical fields as well as the slope of the magnetization at the upper critical field. The calculations for the lower critical field are compared with the recent analytical formulation of Clem et al. No previous prediction is available for the slope of the magnetization curve in a layered system. |
| author | = | "P. T. P. Tang", | |
| title | = | "Dynamic Condition Estimation and Rayleigh-Ritz Approximation", | |
| pages | = | "331-346", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "15", | |
| issue | = | "1", | |
| year | = | "1994", | |
| Abstract | = | " It is shown that the well-known Rayleigh-Ritz approximation method is applicable in dynamic condition estimation. In fact, it can be used as a common framework from which many recently proposed dynamic condition estimators can be viewed and understood. This framework leads to natural generalizations of some existing dynamic condition estimators as well as more convenient alternatives. Numerical examples are also provided to illustrate these claims. |
| author | = | "C. H. Bischof", | |
| title | = | "A Summary of Block Schemes for Reducing a General Matrix to Hessenberg Form", | |
| number | = | "ANL/MCS-63M-175", | |
| month | = | "February", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Various strategies have been proposed for arriving at block algorithms for reducing a general matrix to Hessenberg form by means of orthogonal similarity transformations. This paper reviews and systematically categorizes the various strategies and discusses their computational characteristics.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM175.ps.Z"} |
| author | = | "C. H. Bischof and A. Griewank and P. M. Khademi", | |
| title | = | "Workshop Report on First Theory Institute on Computational Differentiation", | |
| number | = | "ANL/MCS-TM-183", | |
| month | = | "December", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " The first Theory Institute on Combinatorial Challenges in Computational Differentiation was held at Argonne National Laboratory, May 24-26, 1993. The primary purposes of the meeting were to explore the deep complexity issues that lie at the heart of the computation of derivatives from computer programs, and to provide a forum for brainstorming on future research directions, including the applications of automatic differentiation (AD) in scientific computing and the development of AD tools.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM183.ps.Z"} |
| author | = | "G. H. Chisholm", | |
| title | = | "Toward a Methodology for Complexity Management", | |
| number | = | "ANL-93/1", | |
| month | = | "December", | |
| year | = | "1992", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This report focuses on the Battle Management/Command, Control, and Communication element of the Global Protection Against Limited Strike system. The approach is based on the development and validation of a generic BM/C3 model. Central to the approach is the tenet that the design is divided into multiple layers. The critical functions make up the bottom layer, where trust is established and significant design effort is required. |
| author | = | "A. J. Conley", | |
| title | = | "Using a Transfer Function to Describe the Load-Balancing Problem", | |
| number | = | "ANL-93/40", | |
| month | = | "November", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | ' The dynamic load-balancing problem for mesh-connected parallel computers can be clearly described by introducing a function that identifies how much work is to be transmitted between neighboring processors. This function is a solution to an elliptic problem for which a wealth of knowledge exists. The nonuniqueness of the solution to the load-balancing problem is made explicit.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9340.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | "A Toolkit for Building Earth System Models", | |
| number | = | "ANL/MCS-TM-171", | |
| month | = | "March", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " An earth system model is a computer code designed to simulate the interrelated processes that determine the earth's weather and climate, such as atmospheric circulation, atmospheric physics, atmospheric chemistry, oceanic circulation, and biosphere. This paper is a proposal to develop a toolkit that would support a modular, or object-oriented, approach to the implementation of such models.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM171.ps.Z"} |
| author | = | "I. Foster and K. M. Chandy", | |
| title | = | "Fortran M Language Definition", | |
| number | = | "ANL-93/28", | |
| month | = | "August}, | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This document defines the Fortran M extensions to Fortran 77. It updates an earlier definition, dated June 1992, in several minor respects.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9328.ps.Z"} |
| author | = | "I. Foster and R. Olson and S. Tuecke", | |
| title | = | "Programming in Fortran M", | |
| number | = | "ANL-93/26", | |
| month | = | "August", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | ' Fortran M is a small set of extensions to Fortran that supports a modular approach to the construction of sequential and parallel programs. This report incorporates both a tutorial introduction to Fortran M and a users guide for the Fortran M compiler developed at Argonne.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9326.ps.Z"} |
| author | = | "I. Foster and S. Tuecke", | |
| title | = | "Parallel Programming with PCN", | |
| number | = | "ANL-91/32 (Rev. 2)", | |
| month | = | "January", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, a set of tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN. |
| author | = | "N. Galbreath and W. Gropp and D. Levine", | |
| title | = | "Applications-driven Parallel I/O", | |
| booktitle | = | "Proceedings of Supercomputing 93", | |
| year | = | "1993", | |
| pages | = | "462-471", | |
| Abstract | = | " This paper investigates the needs of some massively parallel applications running on distributed-memory parallel computers at Argonne. The authors identify some common parallel I/O operations for which routines were developed that hide the details of the actual implementation (such as the number of parallel disks) from the application, while providing good performance. An important feature is the ability for the application programmer to specify that a file be accessed either as a high-performance parallel file or as a conventional Unix file, simply by changing the value of a parameter on the file open call. these routines are examples of a parallel I/O abstraction that can enhance development, portability, and performance of I/O operations in applications. Some of the specific issues in their design and implementation in a distributed-memory toolset are discussed. |
| author | = | "M. Garbey and H. G. Kaper", | |
| title | = | "Asymptotic Analysis: Working Note No. 1: Basic Concepts and Definitions", | |
| number | = | "ANL/MCS-TM-179", | |
| month | = | "July", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this note the authors introduce the basic concepts of asymptotic analysis. After some comments of historical interest, they define order relations; introduce order functions, asymptotic sequences of order functions, and more general gauge sets of order functions; and define the concepts of an asymptotic approximation and a asymptotic expansion with respect to a given gauge set. They conclude with the asymptotic analysis of an initial value problem whose solution is obtained in the form of a regular asymptotic expansion.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM179.ps.Z"} |
| author | = | "M. Garbey and H. G. Kaper", | |
| title | = | "Asymptotic Analysis: Working Note No. 2: Approximation of Integrals", | |
| number | = | "ANL/MCS-TM-180", | |
| month | = | 'July", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this note the authors discuss the approximation of integrals that depend on a parameter. The basic tool is integration by parts. The applications discussed include Laplace integrals, generalized Laplace integrals, Fourier integrals, and Stokes's method of stationary phase for generalized Fourier integrals.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM180.ps.Z"} |
| author | = | "M. Garbey and H. G. Kaper", | |
| title | = | "Asymptotic Analysis Working Note No. 3: Boundary Layers", | |
| number | = | "ANL/MCS-TM-181", | |
| month | = | "September", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This working note discusses the asymptotic approximation of functions that display boundary-layer behavior. The purpose is to introduce the basic concepts underlying the phenomenon, to illustrate its importance, and to describe some of the fundamental tools available for its analysis. The focus here is on functions that are assumed to be given explicitly.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM181.ps.Z"} |
| author | = | "W. Gropp", | |
| title | = | "Early Experiences with the IBM SP-1", | |
| number | = | "ANL/MCS-TM-177", | |
| month | = | "June", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The IBM SP1 is IBM's newest parallel distributed-memory computer. As part of a joint project with IBM, Argonne took delivery of an early system in order to evaluate the software environment and to begin porting programming packages and applications to this machine. This report discusses the results of those early efforts. Despite the newness of the machine and the lack of a fast interprocessor switch (part of the SP1 but not available for the beta machine), every code that the Argonne researchers attempted to port ran on the SP1 with little or no modification.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM177.ps.Z"} |
| author | = | "W. Gropp", | |
| title | = | "Early Experiences with the IBM SP1 and the High-Performance Switch," | |
| number | = | "ANL-93/41", | |
| month | = | "November", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " This report discusses the results of Argonne's early experience on the IBM SP1 once the high-performance switch was installed. It updates the technical report TM-177.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9341.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "BlockSolve v1.1: Scalable Library Software for the Parallel Solution of Sparse Linear Systems", | |
| number | = | "ANL-92/46", | |
| month | = | "March", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " BlockSolve is a software library for solving large, sparse systems of linear equations on massively parallel computers. The matrices must be symmetric, but may have an arbitrary sparsity structure. BlockSolve is a portable package that is compatible with several different message-passing paradigms. This report gives detailed instructions on the use of BlockSolve in applications programs.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9246.ps.Z"} |
| author" | = | R. Overbeek and M. Price", | |
| title | = | "Accessing Integrated Genomic Data Using GenoBase: A Tutorial: Part 1", | |
| number | = | "ANL/MCS-TM-173", | |
| month | = | "January", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " GenoBase integrates genomic information from many existing databases, offering convenient access to the curated data. This document is the first part of a two-part tutorial on how to use GenoBase for accessing integrated genomic data."} |
| author | = | "M. Price and M. Muralidharan Raju and R. Taylor", | |
| title | = | "A Summary of Genomic Data Relating to E. coli Organized by Metabolic Pathways: An Initial Version", | |
| number | = | "ANL/MCS-TM-174", | |
| month | = | "January", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This report summarizes the reactions that occur in some of the principal metabolic pathways of E. coli. These pathways have been encoded as objects in GenoBase, as integrated database under development at Argonne in collaboration with researchers at the National Institutes of Health and at Harvard University. The report lists the substrates, projects, enzymes, and cofactors for each pathway as a whole, followed by a detailed description of each reaction in the pathway. In addition, for each enzyme, the report displays a description and activity as listed in the Enzyme Data Bank, followed by the corresponding Swiss Protein Data Bank entries. Separate summary lines are included for each of the E. coli genes associated with each system." |
| author | = | "G. Schlossnagle and J. M. Restrepo and G. K. Leaf", ``Periodized Wavelets", | |
| number | = | "ANL-93/34", | |
| month | = | "December", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | "The properties of periodized Daubechies wavelets on [0,1] are detailed and contrasted against their counterparts which form a basis for L**2 (R). Numerical examples illustrate the analytical estimates for convergence and demonstrate by comparison with Fourier spectral methods the superiority of wavelet projection methods for approximations. The analytical solution to inner products of periodized wavelets and their derivatives, which are known as connection coefficients, is presented, and several tabulated values are included.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9334.ps.Z"} |
| author | = | "M. Dryja and B. F. Smith and O. B. Widlund", | |
| title | = | "Schwarz Analysis of Iterative Substructuring Algorithms for Elliptic Problems in Three Dimensions" | |
| journal | = | "SIAM J. Numer. Anal.", | |
| volume | = | "34", | |
| issue | = | "6", | |
| year | = | "1994", | |
| pages | = | "1662--1694", | |
| Abstract | = | " This paper explores a number of different domain decomposition algorithms that can be built from modules that represent local and global components of the preconditioner. The authors demonstrate how Schwarz analysis can be used to design and analyze fast iterative structuring algorithms for 3D elliptic problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P250.ps.Z"} |
| author | = | "M. T. Jones and M. L. Patrick", | |
| title | = | "Factoring Symmetric Indefinite MAtrices on High-Performance Architectures", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "15", | |
| issue | = | "1", | |
| year | = | "1994", | |
| pages | = | 273-283"} |
| author | = | "I. Foster and S. Taylor", | |
| title | = | "A Compiler Approach to Scalable Concurrent Program Design", | |
| journal | = | "ACM TOMS", | |
| volume | = | "16", | |
| issue | = | "3", | |
| year | = | "1994", | |
| pages | = | "577-604"} |
| author | = | "I. Foster and M. Xu and B. Avalani and A. Choudhary", | |
| title | = | "A Compilation System That Integrates High Performance Fortran and Fortran M", | |
| book | = | "Proc. of the Scalable High-Performance Computing Conf., May 23-25, 1994", | |
| year | = | "1995", | |
| publisher | = | "IEEE Computer Soc. Press"} |
| author | = | "R. H. Chan and P. T. P. Tank", | |
| title | = | "Fast Band-Toeplitz Preconditioners for Hermitian Toeplitz jSystems", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "15", | |
| issue | = | "1", | |
| pages | = | "164-171", | |
| year | = | "1994"} |
| title | = | "Exposing Constraints", | |
| journal | = | "SIAM J. Optimization", | |
| volume | = | "4", | |
| issue | = | "3", | |
| pages | = | "573-595", | |
| year | = | "1994"} |
| author | = | "J. J. More' and D. J. Thuente", | |
| title | = | "Line Search Algorithms with Guaranteed Sufficient Decrease", | |
| journal | = | "ACM Transactions on Mathematical Software", | |
| volume | = | "20", | |
| issue | = | "3", | |
| year | = | "1994", | |
| pages | = | "286--307", | |
| Abstract | = | "The problem of finding a point that satisfies the sufficient decrease and curvature condition is formulated in terms of finding a point in a set a T(mu). This paper describes a search algorithm for this problem that produces a sequence of iterates that converge to a point in T( mu ) and that, except for pathological cases, terminates in a finite number of steps. Numerical results for an implementation of the search algorithm on a set of test functions show that the algorithm terminates within a small number of iterations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P330.ps.Z"} |
| author | = | "B. F. Smith", | |
| title | = | "A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "14", | |
| issue | = | :2:, | |
| pages | = | "406-423", | |
| year | = | "1993"} |
| author | = | "A. Griewank and C. Bischof and G. Corliss and A. Carle and K. Williamson", | |
| title | = | "Derivative Convergence for Iterative Equation Solvers", | |
| journal | = | "Optimization Methods and Software", | |
| volume | = | "2", | |
| year | = | "1993", | |
| pages | = | "321--355", | |
| Abstract | = | " This paper shows that derivative convergence can be achieved with an R-linear or possibly R-superlinear rate for a large class of memoryless contractions or secant updating methods. For a wider class of multistep contractions, the authors obtain R-linear convergence of a simplified derivative recurrence, which is more economical and can be easily generalized to second higher derivatives. The authors also formulate a constructive criterion for derivative convergence based on the implicit function theorem. All theoretical results are confirmed by numerical experiments on small test examples.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P333.ps.Z"} |
| author | = | "S. Wright", "A Path-Following Infeasible-Interior-Point Algorithm for Linear Complementarity Problems", | |
| title | = | "Optimization Methods and Software", | |
| volume | = | "2", | |
| year | = | "1993", | |
| pages | = | "79-106", | |
| Abstract | = | " This paper describes an infeasible-interior-point algorithm for monotone linear complementarity problems that has polynomial complexity, global linear convergence, and local superlinear convergence with a Q-order of 2. Only one matrix factorization is required per iteration, and the analysis assumes only that a strictly complementary solution exists.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P334.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Automated Theorem Finding", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "10", | |
| year | = | "1993", | |
| pages | = | "137--138", | |
| Abstract | = | " The problem posed for research asks one to identify appropriate properties to permit an automated reasoning program to find new and interesting theorems, in contrast to proving conjectured theorems. Such programs are now functioning in many domains as valuable reasoning assistants. A sharp increase in their value would occur if they could also be used as colleagues to (so to speak) produce research on their own.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P335.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Selecting an Approach Based on Prior Success", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "10", | |
| year | = | "1993", | |
| pages | = | "283--284", | |
| Abstract | = | " The problem posed for research asks one to find criteria for choosing from among previously answered questions a question that dictates the approach to take for attacking the problem of current interest. Especially because the better automated reasoning programs often offer a wide range of choices for representation, inference rule, and strategy, a solution to the proposed problem would materially reduce the difficulty of using these powerful aids for research.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P336.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Reasoning by Analogy", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "10", | |
| year | = | "1993", | |
| pages | = | "421--422", | |
| Abstract | = | " The problem posed for research asks one to find criteria that an automated reasoning program can apply to determine whether to attack a given question with reasoning by analogy. The imprecise term ``reasoning by analogy'' refers to a type of reasoning in which the type of proof being sought is sharply influenced by the style of proof that was successfully used to prove related theorems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P337.ps.Z"} |
| author | = | "T. E. Hull and T. F. Fairgrieve and P. T. P. Tang", | |
| title | = | "Implementing Complex Elementary Functions Using Exception Handling", | |
| journal | = | "ACM Trans. on Math. Softw.", | |
| volume | = | "20", | |
| issue | = | "2", | |
| year | = | "1994", | |
| pages | = | "215--244", | |
| Abstract | = | " The authors present algorithms for reliable and accurate evaluations of the complex elementary functions required in Fortran 77 and Fortran 90, namely, cabs, csqrt, cexp, clog, csin, and ccos. The algorithms are first presented in a pseudo-code which has convenient exception-handling facilities. A tight error bound is derived for each algorithm. Corresponding Fortran programs for an IEEE environment are also developed to illustrate the practicality of the algorithms, and these programs have been tested very carefully to help confirm the correctness of the algorithms and their error bounds."} |
| author | = | "H. G. Kaper and M. K. Kwong", | |
| title | = | "Vortex Configurations in High-Tc Superconducting Films", | |
| journal | = | "Journal of Computational Physics", | |
| volume | = | "119", | |
| year | = | "1995", | |
| pages | = | "120--131", | |
| Abstract | = | " This article address the Ginzburg-Landau (GL) model for high-temperature superconductivity in thin films (two-dimensional periodic domains). A new gauge is defined to reduce the coupling between the equations for the nonzero components of the vector potential. The GL equations are written in a novel form by means of continuous link variables; this form is symmetric and has particular advantages for numerical analysis. The continuous GL model is approximated by a discrete model, which is shown to be second-order accurate. Two methods are used for the numerical solution of the discrete model-a modified Newton's method, in combination with a sweeping algorithm for the solution of the linear system, and a time-like integration method based on gradient flow. Numerical experiments demonstrate that the discrete GL model leads to asymmetric solutions in the plane; symmetry is recovered only in the limit as the mesh size goes to zero. The results of computational experiments to find the upper critical field and establish an empirical power law for vortex interactions are given."} |
| author | = | "J. N. Lyness and S. E. Plowman", | |
| title | = | "Trapezoidal Rule Quadrature Algorithms for MIMD Distributed-Memory Computers", | |
| number | = | "MCS-P342-1292", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " An approach to multidimensional quadrature, designed to exploit parallel architectures, is described. This involves transforming the integral in such a way that an accurate result is given by the trapezoidal rule, and evaluating the resulting sum in a manner that may be efficiently implemented on parallel architectures. This approach is to be implemented in the Liverpool NAG transputer library."} |
| author | = | "M. K. Kwong", | |
| title | = | "A Review of MATLAB 4.0", | |
| journal | = | "SIAM News", | |
| volume | = | "26", | |
| issue | = | "2", | |
| year | = | " 1993", | |
| Abstract | = | " This article reviews the new features of MATLAB 4.0 and presents the author's experiences in using the new package. Upward incompatibilities are discussed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P343.ps.Z"} |
| author | = | "S. Wright and D. Ralph", | |
| title | = | "A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems", | |
| journal | = | "Mathematics of Operations Research", | |
| volume | = | "21", | |
| issue | = | "4 ", | |
| year | = | "1996", | |
| pages | = | "815--838", | |
| Abstract | = | " We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementarity problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear. Numerical experiments confirm the efficacy of the proposed approach.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P344.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | "Fortran M as a Language for Building Earth System Models", | |
| booktitle | = | "Parallel Supercomputing in Atmospheric Sciences", | |
| publisher | = | "World Scientific", | |
| address | = | "Singapore", | |
| year | = | "1993", | |
| Abstract | = | " Fortran M is a small set of extensions to Fortran 77 that supports a modular or object-oriented approach to the development of parallel programs. This paper focuses on the use of Fortran M as a tool for building earth system models on massively parallel computers. The author hypothesizes that the use of Fortran M has software engineering advantages. Experiments are outlined to investigate this hypothesis.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P345.ps.Z"} |
| author | = | "K. M. Chandy and I. T. Foster", | |
| title | = | "A Deterministic Notation for Cooperating Processes", | |
| journal | = | "IEEE Transactions on Parallel and Distributed Systems", | |
| volume | = | "6", | |
| issue | = | "8", | |
| year | = | "1995", | |
| pages | = | "863--871", | |
| Abstract | = | " This paper proposes extensions of sequential programming languages for parallel programming that have the following features: (1) dynamic structures, (2) paradigm integration, and (3) determinism. The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P346.ps.Z"} |
| author | = | "I. T. Foster and K. M. Chandy", | |
| title | = | "FORTRAN M: A Language for Modular Parallel Programming", | |
| journal | = | "J. Parallel and Distributed Computing", | |
| year | = | "1995", | |
| pages | = | "24-35", | |
| volume | = | "26"} |
| author | = | "C. Bischof and M. Marques and X. Sun", | |
| title | = | "Parallel Band Reduction and Tridiagonalization", | |
| number | = | "MCS-P347-0193", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents a parallel implementation of a blocked band reduction algorithm suggested by Bischof and Sun for symmetric matrices. The reduction to tridiagonal or block tridiagonal form is a special case of this algorithm. A blocked double torus wrap mapping is used as the underlying data distribution and the so-called WY representation is employed to represent block orthogonal transformations. Preliminary performance results on the Intel DELTA indicate that the algorithm is well suited to a MIMD computing environment and that the use of a block approach significantly improves performance.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P347.ps.Z"} |
| author | = | "B. M. Averick and J. J. More' and C. H. Bischof and A. Carle and A. Griewank", | |
| title | = | "Computing Large Sparse Jacobian Matrices Using Automatic Differentiation", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "15", | |
| issue | = | "2", | |
| year | = | "1994", | |
| pages | = | "285--294", | |
| Abstract | = | " The computation of large sparse Jacobian matrices is required in many important large-scale scientific problems. This paper considers three approaches to computing such matrices: hand-coding, difference approximations, and automatic differentiation using the ADIFOR tool. The authors compare the numerical reliability and computational efficiency of these approaches on applications from the MINPACK-2 test problem collection. The conclusion is that automatic differentiation is the method of choice, leading to results that are as accurate as hand-coded derivatives, while at the same time outperforming difference approximations in both accuracy and speed.", | |
| note | = | ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P348.ps.Z"} |
| author | = | "J. J. More'", | |
| title | = | "Generalizations of the Trust Region Method", | |
| journal | = | "Optimization Methods and Software", | |
| volume | = | "2", | |
| year | = | "1993", | |
| pages | = | "189--209", | |
| Abstract | = | " The trust region problem requires the global minimum of a general quadratic function subject to an ellipsoidal constraint. The development of algorithms for the solution of this problem has found applications in nonlinear and combinatorial optimization. This paper generalizes the trust region problem by allowing a general quadratic constraint. The main results are a characterization of the global minimizer of the generalized trust region problem and the development of an algorithm that finds an approximate global minimizer in a finite number of iterations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P349.ps.Z"} |
| author | = | "K. Mani Chandy and I. Foster", | |
| title | = | "Deterministic Parallel Fortran", | |
| booktitle | = | "Proc. 6th SIAM Conf. on Parallel Processing", | |
| publisher | = | "SIAM", | |
| year | = | "1993", | |
| Abstract | = | " This paper describes Fortran M, message-passing extensions to Fortran 77 that provide deterministic execution and information hiding while preserving desirable properties of message passing.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P350.ps.Z"} |
| author | = | "I. Foster and P. H. Worley", | |
| title | = | "Parallelizing the Spectral Transform Method: A Comparison of Alternative Parallel Algorithms", | |
| booktitle | = | "Proc. 6th SIAM Conf. on Parallel Processing", | |
| year | = | "1994", | |
| Abstract | = | " The spectral transform method is a standard numerical technique for solving partial differential equations on the sphere and is widely used in global climate modeling. This paper outlines different approaches to parallelizing the method and describes experiments that we are conducting to evaluate the efficiency of these approaches on parallel computers. The experiments are conducted using a testbed code that solves the nonlinear shallow water equations on a sphere but are designed to permit evaluation in the context of a global model. They allow one to evaluate the relative merits of the approaches as a function of problem size and number of processors. The results are guiding ongoing work on PCCM2, a parallel implementation of the Community Climate Model developed at the National Center for Atmospheric Research.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P351.ps.Z"} |
| author | = | "J. M. Boyle", | |
| title | = | "Simplification-driven Automated Partial Evaluation", | |
| number | = | "MCS-P352-0193, | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents an automated approach to partial evaluation based on simplification and implemented by program transformations. The approach emphasizes program algebra and relies on canonical forms and distributive laws to expose instances to which simplifications can be applied. The author discusses some of the considerations that led to the design of this approach. The discussion should be useful in understanding the structure of partial evaluation transformations and as an example of how to approach the design of automated program transformations in general. This approach has been applied to a number of practical examples; the chief barrier to its wider application is the growth of the intermediate program text during partial evaluation. Nevertheless, the approach has the virtues of being implemented, automated, and able to partially evaluate specifications containing implicit data."} |
| authorr | = | "H. G. Kaper and G. K. Leaf and D. M. Levine and V. Vinokur", | |
| title | = | "Glassy Motion of an Elastic String", | |
| journal | = | "Physical Review Letters", | |
| volume | = | "71", | |
| issue | = | "22", | |
| month | = | "November", | |
| year | = | "1993", | |
| pages | = | "3713--3716", | |
| Abstract | = | " Numerical simulations of the dynamics of an elastic string in a quenched random potential at finite temperatures confirm the existence of glassy motion for sufficiently weak driving forces. The results show excellent qualitative and quantitative agreement with analytical predictions and thus confirm the basic assumptions underlying the theoretical model.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P353.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | "Compositional Parallel Programming Languages", | |
| journal | = | "ACM Trans. on Programming Languages and Systems", | |
| volume | = | "18", | |
| issue | = | "4", | |
| year | = | "1996", | |
| pages | = | "454--476", | |
| Abstract | = | " In task-parallel programs, diverse activities can take place concurrently, and communication and synchronization patterns are complex and not easily predictable. Previous work has identified compositionality as an important design principle for task-parallel programs. In this paper, we discuss alternative approaches to the realization of this principle, which holds that properties of program components should be preserved when those components are composed in parallel with other program components. We review two programming languages, Strand and Program Composition Notation, that support compositionality via a small number of simple concepts, namely monotone operations on shared objects, a uniform addressing mechanism, and parallel composition. Both languages have been used extensively for large-scale application development, allowing us to provide an informed assessment of their strengths and weaknesses. We observe that while compositionality simplifies development of complex applications, the use of specialized languages hindersreuse of existing code and tools, and the specification of domain decomposition strategies. This suggests an alternative approach based on small extensions to existing sequential langauges. We conclude the paper with a discussion of two languages that realize this strategy.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P354.ps.Z"} |
| author | = | "I. T. Foster and J. L. Tilson and A. F. Wagner and R. Shepard and R. J. Harrison and R. A. Kendall and R. J. Littlefield", | |
| title | = | - "High Performance Comoputational Chemistry: (I) Scalable Fock Matrix Construction Algorithms", | |
| journal | = | "j. Comput. Chem." | |
| issue | = | "1", | |
| volume | = | "17", | |
| pages | = | "109-123", | |
| year | = | "1996"} |
| author | = | "A. Griewank", | |
| title | = | "Some Bounds on the Complexity of Gradients, Jacobians, and Hessians", | |
| number | = | "MCS-P355-0393", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The evaluation or approximation of derivatives is an important part of many nonlinear computations. The cost of evaluating first- and second-derivative matrices is often assumed to grow linearly and quadratically with the number of independent variables, respectively. It is shown here that much tighter bounds can be achieved through the exploitation of partial function- and argument-separability in combination with the forward and reverse mode of computational, or automatic, differentiation. The new separability concepts facilitate the reduction of chromatic numbers and maximal row lengths, which determine the complexity of the Curtis-Powell-Reid and Newsam-Ramsdell schemes for estimating sparse derivative matrices. Because of the duality between the forward and reverse modes, these techniques can be applied to Jacobians as well as their transposes and the associated row-intersection graphs. A key result presented in this paper is that gradients and Hessians of partially separable functions can also be obtained surprisingly cheaply in the easily implemented forward mode as well as in the more sophisticated reverse mode of computational differentiation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P355.ps.Z"} |
| author | = | "B. F. Smith and W. D. Gropp", | |
| title | = | "The Design of Data-Structure-Neutral Libraries for the Iterative Solution of Sparse Linear Systems", | |
| journal | = | "Scientific Programming", | |
| year | = | "1993", | |
| Abstract | = | " Over the past few years several proposals have been made for the standardization of sparse matrix storage formats in order to allow for the development of portable matrix libraries for the iterative solution of linear systems. Here, instead, the authors present a different approach. Rather than define one standard for matrix storage, the community should define an interface for the functions that act on the data. In addition, one must consider the interface to the vector operations since, in many applications, vectors may not be stored as consecutive elements in memory. With the acceptance of shared-memory, distributed-memory, and cluster-memory parallel machines, the flexibility of the distribution of the elements of vectors is extremely attractive.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P356.ps.Z"} |
| author | = | "R. D. C. Monteiro and S. Wright", | |
| title | = | "Local Convergence of Interior-Point Algorithms for Degenerate Monotone LCP", | |
| journal | = | "Computational Optimization and Applications", | |
| volume | = | "3", | |
| year | = | "1994", | |
| pages | = | "131-155", | |
| Abstract | = | " Most asymptotic convergence analysis of interior-point algorithms for monotone linear complementarity problems assumes that the problem is nondegenerate, that is, that the solution set contains a strictly complementary solution. Here the authors investigate the behavior of these algorithms when this assumption is removed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P357.ps.Z"} |
| author | = | "G. F. Corliss and A. Griewank", | |
| title | = | "Operator Overloading as an Enabling Technology for Automatic Differentiation", | |
| unmber | = | "MCS-P358-0493", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents an example of the science that is enabled by object-oriented programming techniques. Scientific computation often needs derivatives for solving nonlinear systems such as those arising in many PDE algorithms, optimization, parameter identification, stiff ordinary differential equations, or sensitivity analysis. Automatic differentiation computes derivatives accurately and efficiently by applying the chain rule to each arithmetic operation or elementary function. Operator overloading enables the techniques of either the forward or the reverse mode of automatic differentiation to be applied to real-world scientific problems. We illustrate automatic differentiation with an example drawn from a model of unsaturated flow in a porous medium. The problem arises from planning for the long-term storage of radioactive waste.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P358.ps.Z"} |
| author | = | "G. H. Chisholm", | |
| title | = | "Toward a Verifiable Approach to the Design of Concurrent Computations", | |
| number | = | "MCS-P359-0493", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper investigates an approach for proving correctness of distributed programs under an assumed data-exchange capability. State informally, the data-exchange assumption would be to embed an abstract model of the data communications mechanism into the program specification. The Message Passing Interface (MPI) standard provides a basis for such a model. The authors present here a high-level specification they have developed using the ASLAN specification language. The specification is based on a generalized communications model from which the MPI model may be derived. The authors also describe an approach to the specification of distributed programs with explicit message passing based on a verifiable data exchange model.} |
| author | = | "R. D. C. Monteiro and S. J. Wright", | |
| title | = | "Superlinear Primal-Dual Affine Scaling Algorithms for LCP", | |
| journal | = | "Math. Prog.", | |
| year | = | "1994", | |
| Abstract | = | " This paper describes an interior-point algorithm for monotone linear complementarity problems in which primal-dual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Q-order up to (but not including) two. The technique is shown to be consistent with a potential-reduction algorithm, yielding the first potential-reduction algorithm that is both globally and superlinearly convergent.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P360.ps.Z"} |
| author | = | "R. D. C. Monteiro and S. J. Wright", | |
| title | = | "A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP", | |
| journal | = | "SIAM J. Optimization", | |
| volume | = | "6", | |
| issue | = | " 1", | |
| year | = | "1996", | |
| pages | = | "1-18", | |
| Abstract | = | " This paper presents an infeasible-interior-point algorithm for monotone linear complementarity problems in which the search directions are affine scaling directions and the step lengths are obtained from simple formulas that ensure both global and superlinear convergence. By choosing the value of a parameter in appropriate ways, polynomial complexity and convergence with Q-order up to (but not including) two can be achieved. The only assumption made to obtain the superlinear convergence is the existence of a strictly complementary solution.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P361.ps.Z"} |
| author | = | "R. M. Butler and E. L. Lusk", | |
| title | = | "Monitors, Messages, and Clusters: The p4 Parallel Programming System", | |
| number | = | "MCS-P362-0493", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of shared-memory machines, distributed-memory machines (including heterogeneous networks of workstations), and clusters (shared-memory multiprocessors communicating via message passing). This paper discusses the design goals, history, and system architecture of p4. Also described is a diverse collection of applications that have demonstrated the utility of p4.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P362.ps.Z"} @article"Lyn91:extrap, | |
| athor | = | "J. N. Lyness", | |
| title | = | "Extrapolation-based Boundary Element Quadrature", | |
| journal | = | "Numerical Methods", | |
| year | = | "1991", | |
| pages | = | "189-203"} |
| author | = | "J. N. Lyness", | |
| title | = | "Quadrature over Curved Surfaces by | |
| journal | = | "Math. Comp.", | |
| volume | = | "63", | |
| issue | = | "208", | |
| year | = | "1994", | |
| pages | = | "727--740", | |
| Abstract | = | " This paper describes and justifies a method for integrating over curved surfaces. This method does not require that the Jacobian be known explicitly. This is a natural extension of extrapolation (or Romberg integration) for plane squares or triangles.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P363.ps.Z"} |
| author | = | "L. T. Biegler and J. Nocedal and C. Schmid", | |
| title | = | "A Reduced Hessian Method for Large-Scale Constrained Optimization", | |
| number | = | "MCS-P364-0693", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A quasi-Newton algorithm is proposed for solving large optimization problems with nonlinear equality constraints. It is designed for problems with few degrees of freedom and is motivated by the need to use sparse matrix factorizations. The algorithm can be considered to be, in some sense, a practical implementation of an algorithm of Coleman and Conn. The authors give conditions under which local and superlinear convergence is obtained.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P364.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Naming and Function Replacement", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "11", | |
| issue | = | ' 1", | |
| pages | = | "147-148", | |
| year | = | "1993", | |
| Abstract | = | " This article is the twenty-eighth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria that an automated reasoning program can profitably use to remove functions present in the representation and replace them with appropriate predicates or constants that name the entities that were named by the functions. The notation used to present a problem to a reasoning program can have a profound effect on the likelihood of the program's success.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P365.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Reasoning by Case Analysis", | |
| journal | = | "Journal of Automated Reasoning", | |
| volume | = | "11", | |
| issue | = | '2", | |
| year | = | "1993", | |
| pages | = | "289-291", | |
| Abstract | = | ' The problem posed for research asks one to find criteria that an automated reasoning program can apply to decide when to conduct a case analysis argument and to decide which cases are appropriate. When the choice of employing a case analysis argument is wise and the cases are well chosen, the likelihood that the reasoning program-or, for that matter, a person-will find an answer to the given question is sharply increased.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P366.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Induction", | |
| journal | = | "Journal of Automated Reasoming", | |
| volume | = | "11", | |
| issue | = | "3", | |
| year | = | "1993", | |
| pages | = | "433-434", | |
| Abstract | = | " The problem posed for research asks for criteria for accurately determining when an induction argument is the appropriate form of argument for an automated reasoning program to use. This research problem also asks for criteria for choosing well the property on which to conduct the induction argument.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P367.ps.Z"} |
| author | = | "T. Gaasterland", | |
| title | = | "Restricting Query Relaxation through User Constraints", | |
| booktitle | = | "Proc. International Conf. on Cooperative and Intelligent Information Systems", | |
| address | = | "Rotterdam", | |
| year | = | "1993", | |
| Abstract | = | " This paper describes techniques to restrict and to heuristically control relaxation of deductive database queries. The process of query relaxation provides a user with a means to automatically identify new queries that are related to the user's original query. However, for large databases, many relaxations may be possible. The methods to control and restrict the relaxation process introduced in this paper focus on the relaxation process and make it more efficient. User restrictions over the database domain may be expressed as user constraints. This paper describes how user constraints can restrict relaxed queries. Also, a set of heuristics based on cooperative answering techniques are presented for controlling the relaxation process. Finally, the interaction of the methods for relaxing queries, processing user constraints, and applying the heuristic rules is described. } |
| author | = | "T. Gaasterland and J. Lobo", | |
| title | = | "Processing Negation and Disjunction in Logic Programming through Integrity Constraints", | |
| journal | = | "J. Intelligent Inf. Syst.", | |
| volume | = | "2", | |
| issue | = | "3", | |
| pages | = | "225-243", | |
| year | = | "1993" | |
| Abstract | = | " Integrity constraints play an important role in many applications. An example is the semantic query optimization method developed by Chakravarthy, Grant, and Minker for definite deductive databases. They use integrity constraints during query processing to prevent the exploration of search space that is bound to fail. This paper generalizes the semantic query optimization method to apply to negated atoms. The generalized method is referred to as semantic compilation. The authors show that semantic compilation provides an alternative search space for negative query literals. They also show how semantic compilation can be used to transform a disjunctive database with or without functions and denial constraints without negation into a new disjunctive database that complies with the integrity constraints.} |
| author | = | "T. Gaasterland and J. Lobo", | |
| title | = | "Processing Negation and Disjunction in Logic Programs through Integrity Constraints", | |
| number | = | "MCS-P370-0693", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " This paper generalizes the semantic query optimization method developed by Chakravarthy, Grant, and Minker to apply to negated atoms. The generalized method is referred to as semantic compilation. This exploration has led to two significant results. First, semantic compilation provides an alternative search space for negative query literals. The alternative search space can find answers in cases for which negation-as-finite-failure and constructive negation cannot. Second, semantic compilation can be used to transform a disjunctive database with or without functions and denial constraints without negation into a new disjunctive database that complies with the integrity constraints.} |
| author | = | "C. Y. Chang and M. K. Kwong", | |
| title | = | "Proceedings of the Organized Session `Nonlinear Problems in Superconductivity", | |
| booktitle | = | "First World Congress of Nonlinear Analysts", | |
| year | = | "1993", | |
| Abstract | = | " These papers represent recent efforts by mathematicians to study the Ginzburg-Landau model. The most current findings in experimental physics indicate that modifications to the original Ginzburg-Landau theory is needed to adequately describe the phenomena exhibited by the new superconductors, which have a layered structure at the atomic level and possess high anisotropy. Impurities in the material act as pinning centers for vortices and random thermal noise tends to depin them. Theoretical physicists have even suggested the existence of more phases: the vortex-liquid and vortex-glass phases, but the debate is still going on. The papers presented here give a better understanding of the classical model and will surely shed some light on how to modify it to accommodate the newer theories.", | |
| noteHREF | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P371.ps.Z"} |
| author | = | "E. L. Lusk and S. Mudambi and R. Overbeek and P. Szeredi", | |
| title | = | "Applications of the Aurora Parallel Prolog System to Computational Molecular Biology", | |
| book | = | "Logic Programming: Proceedings of the 1993 International Symposium", | |
| editor | = | "D. Miller", | |
| year | = | "1993", | |
| pages | = | "353-369", | |
| publisher | = | "MIT Press", | |
| Abstract | = | " The computational requirements were large because of the nature of the applications and were carried out on a scalable parallel computer (the BBN TC2000). Results demonstrate that logic programming can be effective in the context of demanding applications on large-scale parallel machines. Some insights into parallel programming in Prolog are also provided.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P372.ps.Z"} |
| author | = | "L. V. Curfman", | |
| title | = | "A New Finite Element Formulation for Incompressible Flow", | |
| number | = | "MCS-P373-0793", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A basic objective in computational fluid dynamics is the efficient solution of nonlinear systems of equations that arise in finite element modeling of convective-diffusive flow. The use of implicit Newton-like schemes to solve the coupled system of Navier-Stokes and continuity equations enables rapid convergence, although the well-known difficulty of indirect pressure linkage requires attention when forming the Jacobian matrices. This paper presents a primitive variable finite-element formulation that uses an auxiliary pressure equation derived from the Navier-Stokes and continuity equations. This formulation extends the work of Rice and Schnipke, where a similar equation was developed in the context of a segregated solution method. Approximate Newton methods using the new finite element formulation are evaluated in terms of accuracy, convergence rate, and overall efficiency for flow problems with varying degrees of linearity.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P373.ps.Z"} |
| author | = | "R. M. Butler and A. L. Leveton and E. L. Lusk", | |
| title | = | "p4-Linda: A Portable Implementation of Linda", | |
| number | = | "MCS-P374-0793", | |
| year | = | "1993", | |
| institution | = | "Argonne national Laboratory", | |
| Abstract | = | ' Facilities such as interprocess communication and protection of shared resources have been added to operating systems to support multiprogramming and have since been adapted to exploit explicit multiprocessing within the scope of two models: the shared-memory model and the distributed (message-passing) model. When multiprocessors (or networks of heterogeneous processors) are used for explicit parallelism, the difference between these models is exposed to the programmer. The p4 tool set was originally developed to buffer the programmer from synchronization issues while offering an added advantage in portability; however, two models are often still needed to develop parallel algorithms. Here the authors provide two implementations of Linda in an attempt to support a single high-level programming model on top of the existing paradigms. The result is a consistent semantics regardless of the underlying model. Linda's fundamental properties associated with generative communication eliminate the distinction between shared and distributed memory.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P374.ps.Z"} |
| author | = | "C. Bischof and S. Huss-Lederman and X. Sun and A. Tsao", | |
| title | = | "The PRISM Project: Infrastructure and Algorithms for Parallel Eigensolvers", | |
| booktitle | = | "Proc. of the Scalable Parallel Libraries Conf.", | |
| publisher | = | "IEEE", | |
| year | = | "1994", | |
| pages | = | "123--131", | |
| Abstract | = | " The goal of the PRISM project is the development of infrastructure and algorithms for the parallel solution of eigenvalue problems. The authors are investigating a complete eigensolver based on the invariant subspace decomposition algorithm for dense symmetric matrices (SYISDA). After reviewing SYISDA, they discuss the algorithmic highlights of a distributed-memory implementation of this approach. These include a fat matrix-matrix multiplication algorithm, a new approach to parallel band reduction and tridiagonalization, and a harness for coordinating the divide-and-conquer parallelism in the problem. Also presented are performance results of these kernels as well as the overall SYISDA implementation on the Intel DELTA.", noteftp://info.mcs.anl.gov/pub/tech\_reports/reports/P383.dvi.Z"] |
| author | = | "M. Chandy and I. Foster and K. Kennedy and C. Koebel and C.-W. Tseng", | |
| title | = | "Integrated Support for Task and Data Parallelism", | |
| journal | = | "The International Journal of Supercomputer Applications", | |
| volume | = | "8", | |
| issue | = | "2", | |
| year | = | "1994", | |
| pages | = | "80-98", | |
| Abstract | = | " This paper discusses CRPC research designed to provide an efficient, portable programming model for scientific applications possessing both task and data parallelism. The authors present an interface for using a task-parallel language to coordinate concurrent data-parallel computations. A key concept is the integration of Fortran M resource management constructs and Fortran D data decomposition constructs.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P384.ps.Z"} |
| author | = | "C. Zhu", | |
| title | = | "Inexact Proximal Point Algorithm for Minimization", | |
| number | = | "MCS-P385-0993", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " All of the existing variants of the proximal point algorithm (PPA) require that the inner loop subproblem be solved exactly or asymptotically accurately, an approach that is computationally expensive in most cases. The author here develops an inexact PPA for minimization, where the inner loop can be restricted to only a few iterations. He proves that, under mild conditions, the sequence of the objective values generated by the inexact PPA converges linearly to the optimal value if the inner loop iteration has a linear rate on the regularized subproblems. Also discussed are applications of the inexact PPA on hemiquadratic extended linear-quadratic programming, and on minimization of functions with singular Hessian matrices.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P385.ps.Z"} |
| author | = | "P. Padmanabhan and W. McCune", | |
| title | = | "Single Identities for Ternary Boolean Algebras", | |
| journal | = | "Computers and Mathematics with Applications", | |
| volume | = | "29", | |
| issue | = | "2", | |
| pages | = | "13--16", | |
| year | = | "1995", | |
| Abstract | = | ' This paper presents the first known single axioms for ternary Boolean algebra. The first single axiom was found algebraically by a previous technique of Padmanabhan and Quackenbush; then simpler single axioms were found by using the automated reasoning program OTTER.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P386.ps.Z"} |
| author | = | "L. Wos:, | |
| title | = | "The Resonance Strategy", | |
| journal | = | "Computers and Mathematics with Applications", | |
| volume | = | "29", | |
| issue | = | "2", | |
| pages | = | "133-178", | |
| year | = | "1995", | |
| Abstract | = | ' This article focuses on the concept of resonator and on the resonance strategy that keys on resonators to direct the search for the information needed for assignment completion. Various examples from group theory, Robbins algebra, and logic calculi are discussed in which the resonance strategy played a role.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P387.ps.Z"} |
| author | = | "R. C. Brown and D. B. Hinton and M. K. Kwong", | |
| title | = | "A Remark on a Weighted Landau Inequality of Kwong and Zettl", | |
| journal | = | " Can. Math. Bull.", | |
| year | = | "1994", | |
| Abstract | = | ' This paper extends a weighted Landau inequality of Kwong and Zettl introduced in 1981.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P388.ps.Z"} |
| author | = | "J. Drake and I. Foster and J. J. Hack and J. Michalakes and B. D. Semeraro and B. Toonen and D. L. Williamson and P. Worley", | |
| title | = | "PCCM2: A CGCM Adapted for Scalable Parallel Computers", | |
| number | = | "MCS-P389-1093", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " This paper reviews the various parallel algorithms used in PCCM2 and the work done to arrive at a validated model.} |
| author | = | "R. Stevens", | |
| title | = | "High-Performance Computing and Communications", | |
| journal | = | "Future Generation Computer Systems", | |
| volume | = | "10", | |
| yeaer | = | "1994", | |
| pages | = | "159--167", | |
| Abstract | = | " This paper discusses the U.S. HPCC program-its goals, funding, progress, revisions, and research. The paper then turns to specific work conducted under this program at Argonne.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P389.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | "Language Constructs for Modular Parallel Programs", | |
| booktitle | = | "Proc. PARCO 93,", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1993", | |
| Abstract | = | " This paper describes programming language constructs that facilitate the application of modular design technique in parallel programming. These constructs allow one to isolate resource management and processor scheduling decisions from the specification of individual modules, which can themselves encapsulate design decisions concerned with concurrency, communication, process mapping, and data distribution. This approach permits development of libraries of reusable parallel program components and the reuse of these components in different contexts. In particular, alternative mapping strategies can be explored without modifying other aspects of program logic. The paper describes how these constructs are incorporated in PCN and Fortran M. Compilers have been developed for both languages, allowing experimentation in substantial applications.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P391.ps.Z"} |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "An Abstract Device Definition to Support the Implementation of a High-Level Point-to-Point Message-Passing Interface", | |
| number | = | "MCS-P392-1193", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " In this paper we describe an abstract device interface (ADI) that may be used to efficiently implement message-passing systems. This work was done to provide an implementation of the Message Passing Interface (MPI); however, the interface is appropriate for many message-passing systems. The ADI provides for both simple devices and those capable of significant processing. We discuss some of the issues in the implementation and provide a sample implementation for a "device" that is capable of message-passing." | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P392.ps.Z"} |
| author | = | "C. Bischof and X. Sun and A. Tsao and T. Turnbull" | |
| title | = | "`A Study of the Invariant Subspace Decomposition Algorithm for Banded Symmetric Matrices", | |
| year | = | "1993", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "MCS-P394-1193", | |
| Abstract | = | " This paper gives an overview of the invariant subspace decomposition algorithm for banded symmetric matrices and describes a sequential implementation of this algorithm. The implementation uses a specialized routine for performing banded matrix multiplication together with successive band reduction, yielding a sequential algorithm that is competitive for large problems with the LAPACK QR code in computing all of the eigenvalues and eigenvectors of a dense symmetric matrix. Performance results are given on a variety of machines.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P394.ps.Z"} |
| author | = | "J. S. Rowlan and B. T. Wightman", | |
| title | = | "PORTAL: Communication Library for Run-Time Visualization of Distributed, Asynchronous Data", | |
| booktitle | = | "Proc. Scalable High Performance Computing Conference", | |
| year | = | "1994", | |
| Abstract | = | " This paper presents a method for collecting and visualizing data generated by a parallel computational simulation during run time. Data distributed across multiple processes is sent across parallel communication lines to a workstation, which sorts and queues the data for visualization. The method has been implemented in a set of tools called PORTAL. The tools comprise generic routines for sending data from a parallel program and a run-time connection to the scientific visualization program AVS. The method is most valuable when used to examine large datasets that can be efficient generated and do not need to be stored on disk.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P395.ps.Z"} |
| author | = | "K. W. Dritz", | |
| title | = | "The Numerics Annex and Related Material", | |
| booktitle | = | "Ada Yearbook 1994", | |
| editor | = | "C. Loftus", | |
| publisher | = | "IOS Press", | |
| address | = | "Amsterdam", | |
| year | = | "1994", | |
| pages | = | "129--140", | |
| Abstract | = | " This paper presents an overview of the numerical features of Ada 9X."} |
| author | = | "K. M. Chandy and I. T. Foster", | |
| title | = | "Parallel Language Constructs for Paradigm Integration and Deterministic Computations", | |
| booktitle | = | " Proc. PARCO 93", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1993", | |
| Abstract | = | " This paper describes parallel extensions of sequential programming languages for writing programs that integrate different programming paradigms and that execute in heterogeneous environments comprising both distributed and shared memory. The extensions can be used to write programs with dynamic process and communicate ion structures. Programs can use shared-memory, message passing, and data-parallel programming paradigms, and can be written in a way that permits the compiler and run-time system to verify that they are deterministic. The extensions also provide the programmer with control over how data and processes are mapped to processors, and hence how computational resources are allocated to different parts of a program. A subset of these ideas has been incorporated in Fortran M; however, the underlying sequential notation is not central to the ideas.", | |
| note | = | ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P397.ps.Z"} |
| author | = | "J. B. Drake and R. E. Flanery and I. T. Foster and J. J. Hack and J. G. Michalakes and R. L. Stevens and D. W. Walker and D. L. Williamson and P. H. Worley", | |
| title | = | "The Message-passing Version of the Parallel Community Climate Model", | |
| booktitle | = | "Parallel Supercomputing in Atmospheric Sciences", | |
| publisher | = | "World Scientific", | |
| year | = | "1993", | |
| pages | = | "500--513", | |
| Abstract | = | " This paper is a brief overview o a parallel version of the NCAR Community Climate Model CCM2, implemented for MIMD massively parallel computers using a message-passing programming paradigm. The parallel implementation was developed on an Intel iPSC/860 with 128 processors and on the Intel DELTA with 512 processors; the initial target for the production code i the Intel Paragon with 2048 processors. The code can be easily ported to other multiprocessors supporting a message-passing programming paradigm, or run on machines distributed across network.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P398.ps.Z"} |
| author | = | "W. McCune", | |
| title | = | "Otter 3.0", | |
| editors | = | "C. Suttner and G. Sutcliffe", | |
| booktitle | = | "Proceedings of the CADE-12 Workshop on Evaluation of Automated Theorem Proving Systems", | |
| year | = | "1994", | |
| Abstract | = | " This brief note summarizes the important features of Otter 3.0, Argonne's most powerful general-purpose automated reasoning system.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P399.ps.Z"} |
| author | = | "S. J. Wright", | |
| title | = | "Stability of Linear Equations Solvers in Interior-Point Methods", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "16", | |
| issue | = | "4", | |
| year | = | "1995", | |
| pages | = | "1184-1196", | |
| Abstract | = | "Primal-dual interior-point methods for linear complementarity and linear programming problems solve a linear system of equations to obtain a modified Newton step at each iteration. These linear systems become increasingly ill conditioned in the later stages of the algorithm, but the computed steps are often sufficiently accurate to be useful. The author uses error analysis technique tailored to the special structure of the linear systems to explain this observation. He examines how theoretically superlinear convergence of a path-following algorithm is affected by the roundoff errors.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P400.ps.Z"} |
| author | = | "S. J. Wright", | |
| title | = | "A Path-Following Interior-Point Algorithm for Linear and Quadratic Problems", | |
| journal | = | "Annals of Operations Research", | |
| year | = | "1993", | |
| Abstract | = | " This paper describes an algorithm for the monotone linear complementarity problem that converges from any positive, not necessarily feasible, starting point and exhibits polynomial complexity if some additional assumptions are made on the starting point. If the problem has a strictly complementary solution, the method converges subquadratically. The author shows that the algorithm and its convergence properties extend readily to the mixed monotone linear complementarity problem and hence to all the usual formulations of the linear programming and convex quadratic programming problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P401.ps.Z"" |
| author | = | "G. J. Olsen and C. R. Woese and R. A. Overbeek", | |
| title | = | "The Winds of (Evolutionary) Change: Breathing New Life into Microbiology", | |
| journal | = | " J. Bacteriology", | |
| volume | = | "176", | |
| issue | = | "1", | |
| year | = | " 1994", | |
| pages | = | "1--6", | |
| Abstract | = | " This paper reports on the construction of a phylogenetic tree of over 1500 prokaryotes characterized by small subunit rRNA sequencing. The importance of this tree on scientists' understanding of the relationship between eukaryotes and prokaryotes and between archaea and bacteria is discussed. The paper also discusses broader evolutionary questions about the origins of parts of the eukaryotic genome and the nature of the most recent common ancestor of present-day life. |
| author | = | "R. H. Byrd and P. Lu and J. Nocedal", | |
| title | = | "A Limited-Memory Algorithm for Bound-Constrained Optimization", | |
| number | = | "MCS-P404-1293", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited-memory BFGS matrix to approximate the Hessian of the objective function. The authors show how to take advantage of the form of the limited-memory approximation to implement the algorithm efficiently. The results of numerical tests on a set of large problems are reported.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P404.ps.Z"} |
| author | = | "J. M. Restrepo and J. L. Bona", | |
| title | = | "Model for the Formation of Longshore Sand Ridges on the Continental Shelf", | |
| number | = | "MCS-P406-1293", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " A model is proposed for the formation and evolution of three-dimensional sedimentary structures such as longshore sand ridges on the continental shelf in water deeper than that of the shoaling region. Owing to the striking similarity between the bar spacing and the length scales in which interactions among the most energetic modes of shallow water waves take place, the author argue that these bars are formed slowly by flows in the turbulent boundary layer generated by weakly nonlinear, dispersive waves. Hence, the model is based on the interaction between surficial, weakly nonlinear shallow water waves, having weak spanwise spatial dependence, and the bottom topography.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P406.ps.Z"] |
| author | = | "J. M. Restrepo and J. L. Bona", | |
| title | = | "Model for the Formation of Longshore Sand Ridges on the Continental Shelf: The Interaction of Internal Waves and the Bottom Topography", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| number | = | " MCS-P407-1293", | |
| Abstract | = | " Longshore sand ridges are frequently observed to occur on the continental shelf where the overlying ocean is stratified. This study formulates a model for the formation and evolution of three-dimensional longshore sand ridges on the continental shelf. The model is based on the interaction of interfacial, weakly nonlinear waves in a stratified ocean with the sedimentary bottom topography.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P407.ps.Z"} |
| author | = | "J. M. Restrepo and J. L. Bona", | |
| title | = | "Discretization of a Model for the Formation of Longshore Sand Ridges", | |
| number | = | "MCS-P408-1293", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " This paper presents and evaluates the numerical solution of a coupled system of equations that arises in a model for the formation and evolution of three-dimensional longshore sand ridges. The model is based on the interaction between surficial or internal weakly nonlinear shallow-water waves, having weak spanwise spatial dependence, and the deformable bottom topography.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P408.ps.Z"} |
| author | = | "J. M. Restrepo and J. L. Bona", | |
| title | = | "Structure and Behavior of Triad Interactions for a Boussinesq System Arising in a Model for the Formation of Sand Ridges", | |
| number | = | "MCS-409-1293", | |
| nstitution | = | "Argonne National Laboratory", | |
| year | = | "1993", | |
| Abstract | = | " The Boussinesq system describes weakly nonlinear dispersive long waves in plasmas and incompressible irrotational fluids. this study presents some results regarding the structure and behavior of a system of equations that yield the spatial structure of triad interactions in the Boussinesq system. Such a system forms part of a model for the formation and evolution of sand ridges on the continental shelf. The aims of this study are to provide some insight into the behavior of the triad system and into the sand ridge model in particular.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P409.ps.Z"} |
| author | = | "C. Bischof and P. Khademi and T. Knauff" | |
| title | = | "ADIFOR Working Note No. 11: ADIFOR Strategies Related to POINTER Usage in MM5", | |
| number | = | "ANL/MCS-TM-187", | |
| month | = | "March", | |
| year | = | "1994", | |
| Abstract | = | " | |
| institution | = | "Argonne National Laboratory", POINTERs are nonstandard Fortran statements which cannot be processed by ADIFOR. The authors were interested in generating derivative code for MM5, a mesoscale model code that uses POINTERS extensively and in a particular structured manner. This paper reports on POINTERS and their role in MM5 and, for their particular usage in MM5, describes the three-step code transformation scheme consisting of pre-ADIFOR, ADIFOR, and post-ADIFOR transformations that result in the generation of correct derivative code for MM5.", note://info.mcs.anl.gov/pub/tech\_reports/reports/TM187.ps.Z"} |
| author | = | "C. Bischof and S. Huss-Lederman and E. Jacobson and X. Sun and A. Tsao", | |
| title | = | "The Impact of HPF Data Layout on the Design of Efficient and Maintainable Parallel Linear Algebra Libraries", | |
| number | = | "ANL/MCS-TM-184", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "March", | |
| year | = | "1994", | |
| Abstract | = | " In this document, we are concerned with the effects of data layouts for nonsquare processor meshes on the implementation of common dense linear algebra kernels such as matrix-matrix multiplication, LU factorizations, or eigenvalue solvers. In particular, we address ease of programming and tunability of the resulting software. We introduce a generalization of the torus wrap data layout that results in a decoupling of "local" and ``global'' data layout view. As a result, it allows for intuitive programming of linear algebra algorithms and for tuning of the algorithm for a particular mesh aspect ratio or machine characteristics. This layout is as simple as the proposed HPF layout but, in our opinion, enhances ease of programming as well as ease of performance tuning. We emphasize that we do not advocate that all users need be concerned with these issues. We do, however, believe that, for the foreseeable future, "assembler coding" (as message-passing code is likely to be viewed from a HPF programmers' perspective) will be needed to deliver high performance for computationally intensive kernels. As a result, we believe that the adoption of this approach not only would accelerate the generation of efficient linear algebra software libraries but also would accelerate the adoption of HPF as a result. We point out, however, that the adoption of this new layout would necessitate that an HPF compiler ensure that data objects are operated on in a consistent fashion across subroutine and function calls.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM184.ps.Z"} |
| author | = | "I. Foster and C. Kesselman and R. Olson and S. Tuecke", | |
| title | = | "Nexus: An Interoperability Layer for Parallel and Distributed Computer Systems", | |
| number | = | "ANL/MCS-TM-189", | |
| month | = | "May", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Nexus is a set of services that can be used to implement various task-parallel languages, data-parallel languages, and message-passing libraries. Nexus is designed to permit the efficient, portable implementation of individual parallel programming systems and the interoperability of programs developed with different tools. Nexus supports lightweight threading and active message technology, allowing integration of message passing and threads.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM189.ps.Z"} |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "Users Guide for the ANL IBM SPx," | |
| number | = | "ANL/MCS-TM-199", | |
| month | = | "December", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This guide presents the features of the IBM SPx installed in the Mathematics and Computer Science Division at Argonne National Laboratory. The guide describes the available hardware and software, access policies, and hints for using the system productively.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM199.ps.Z"} |
| author | = | "W. Gropp and E. Lusk and S. C. Pieper", | |
| title | = | "Users Guide for the ANL IBM SP1", | |
| number | = | "ANL/MCS-TM-198", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "October", | |
| year | = | "1994", | |
| Abstract | = | " This guide presents the features of the IBM SP1 installed in the Mathematics and Computer Science Division at Argonne National Laboratory. The guide describes the available hardware and software, access policies, and hints for using the system productively.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P198.ps.Z"} |
| author | = | "D. Levine", | |
| title | = | "A Parallel Genetic Algorithm for the Set Partitioning Problem", | |
| number | = | "ANL-94/23", | |
| month | = | "May", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This dissertation reports on efforts to develop a parallel genetic algorithm and apply it to the solution of the set partitioning problem--a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. The author developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set partitioning problem. The algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their own subpopulation and occasionally fit strings migrate between the subpopulations. Tests on 40 real-world set partitioning problems were carried out on up to 128 nodes of an IBM SP1 parallel computer.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9423.ps.Z"} |
| author | = | "A. Mauer", | |
| title | = | "A Collection of Tools in Support of Automatic Differentiation", | |
| number | = | "ANL/MCS-TM-185", | |
| month | = | "February", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This document contains a collection of notes about tools that ANL researchers have found useful in work on automatic differentiation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM185.ps.Z"} |
| author | = | "W. W. McCune", | |
| title | = | "OTTER 3.0 Reference Manual and Guide", | |
| number | = | "ANL-94/6", | |
| month | = | "January", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " OTTER (Organized Techniques for Theorem-proving and Effective Research) is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, evaluable functions and predicates, and Knuth-Bendix completion. OTTER is coded in C, is free, and is portable to many different kinds of computer.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL946.ps.Z"} |
| author | = | "W. McCune", | |
| title | = | "A Davis-Putnam Program and Its Application to Finite First-Order Model Search: Quasigroup Existence Problems", | |
| number | = | "ANL/MCS-TM-194", | |
| month | = | "September", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This document describes the implementation and use of a Davis-Putnam procedure for the propositional satisfiability problem. It also describes code that takes statements in first-order logic with equality and a domain size n then searches for models for size n. The first-order model-searching code transforms the statements into set of propositional clauses such that the first-order statements have a model of size n if and only if the propositional clauses are satisfiable. The propositional set is then given to the Davis-Putnam code; any propositional models that are found can be translated to models of the first-order statements. The first-order model-searching program accepts statements only in a flattened relational clause form without function symbols. Additional code was written to take input statements in the language of OTTER 3.0 and produce the flattened relational form. The program was successfully applied to several open questions on the existence of orthogonal quasigroups.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM194.ps.Z"} |
| author | = | "J. G. Michalakes and R. S. Nanjundiah", | |
| title | = | "Computational Load in Model Physics of the Parallel NCAR Community Climate Model", | |
| number | = | "ANL/MCS-TM-186", | |
| month | = | "November", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Maintaining a balance of computational load over processors is a crucial issue in parallel computing. For efficient parallel implementation, complex codes such as climate models need to be analyzed for load imbalances. In the present study we focus on the load imbalances in the physics portion of the community climate model's (CCM2) distributed-memory parallel implementation on the Intel Touchstone DELTA computer. We note that the major source of load imbalance is the diurnal variation in the computation of solar radiation. Convective weather patterns also cause some load imbalance. Land-ocean contrast is seen to have little effect on computational load in the present version of the model.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM186.ps.Z"} |
| author | = | "G. W. Pieper", | |
| title | = | "The QED Workshop", | |
| "number | = | "ANL/MCS-TM-191", | |
| month | = | "July ", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " On May 18-20, 1994, Argonne National Laboratory hosted the QED Workshop. The purpose of the workshop was to assemble a group of researchers to consider whether it is desirable and feasible to build a proof-checked encyclopedia of mathematics, with an associated facility for theorem proving and proof checking. Among the projects represented were Coq, Eves, HOL, ILF, Imps, MathPert, Mizar, NQTHM, NuPrl, OTTER, Proof Pad, Qu-Prolog, and RRL. Discussions focused primarily on political, sociological, practical, and aesthetic questions such as, Why do it? Who are the customers? How can we get mathematicians interested? What sort of interfaces are desirable?", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM191.ps.Z"} |
| author | = | "K. D. Rayl and T. Gaasterland", | |
| title | = | "Overview of Selected Molecular Biological Databases", | |
| number | = | "ANL/MCS-TM-200", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "November", | |
| year | = | "1994", | |
| Abstract | = | " This paper presents an overview of the purpose, contents, and design of a subset of the currently available biological databases, with an emphasis on protein databases. Databases included in this summary are 3D\_ALI, Berlin RNA databank, Blocks, DSSP, EMBL Nucleotide Database, EMP, ENZYME, FSSP, GDB, GenBank, HSSP, LiMB, PDB, PIR, PKCDD, ProSite, and SWISS-PROT. The goal is to provide a starting point for researchers who wish to take advantage of the myriad available databases. Rather than providing a complete explanation of each database, we present its content and form by explaining the details of typical entries. Pointers to more complete "user guides" are included, along with general information on where to search for a new database.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM200.ps.Z"} |
| author | = | "B. Smith", | |
| title | = | "Extensible PDE Solvers Package Users Manual", | |
| number | = | "ANL-94/40", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1994", | |
| Abstract | = | " This manual describes the design and use of the Extensible PDE Solvers package for the solution of elliptic PDEs. Currently, the package supports the solution of elliptic PDEs using either finite elements or finite differences in two or three dimensions on either structured or unstructured grids. The package is easily extended to new discretizations or classes of PDEs. Several classical direct and iterative methods, as well as several multigrid variants, may be used to solve the resulting linear systems.", note://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9440.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Scalable Iterative Solution of Sparse Linear Systems", | |
| journal | = | "Parallel Computing", | |
| volume | = | "20", | |
| year | = | "1994", | |
| pages | = | "753-773", | |
| Abstract | = | " This paper compares the performance of the preconditioned conjugate gradient method using coloring orderings with a number of standard orderings on matrices arising from finite element models. Because optimal colorings for these systems may not be known a priori, the authors use a graph coloring heuristic to obtain consistent colorings. Based on lower bounds obtained from the local structure of these systems, the colorings determined by the heuristic are nearly optimal. The increase in parallelism afforded by the coloring-based orderings more than offsets any increase in the number of iterations required for the convergence of the conjugate gradient algorithm Results from the Intel iPSC/860 are given.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P277.ps.Z"} |
| author | = | "J. N. Lyness and R. Cools", | |
| title | = | "A Survey of Numerical Cubature over Triangles", | |
| booktitle | = | "Proceedings of Symposia in Applied Mathematics 48", | |
| year | = | "1994", | |
| publisher | = | "AMS", | |
| Abstract | = | " This survey collects theoretical results in the area of numerical cubature over triangles and is a vehicle for a current bibliography. The pare first treats the theory relating to regular integrands, and then the corresponding theory for singular integrands with emphasis on the full corner singularity. Within these two sections, the author treats approaches based on transforming the triangle into a square, formulas based on polynomial moment fitting, and extrapolation techniques. Within each category, key theoretical results are cited without proof and are related to other results and references. The survey is theoretical and does not include recent work in adaptive and automatic integration.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P410.ps.Z"} |
| author | = | "J. N. Lyness", | |
| title | = | "Finite-Part Integrals and The Euler-Maclaurin Expansion", | |
| journal | = | "International Series of Numerical Mathematics", | |
| volume | = | " 119", | |
| year | = | "1994", | |
| pages | = | "397-407", | |
| Abstract | = | " The context of this note is the discretization error made by the m-panel trapezoidal rule when | |
| the integrand has an algebraic singularity at one end, say x | = | 0, of the finite integration interval. In the absence of a singularity, this error is described by the classical Euler-Maclaurin summation formula, which is an asymptotic expansion in inverse integer powers of m. When an integrable singularity (x**alpha with alpha > -1) is present, Navot's generalization is valid. This introduces negative fractional powers of m into the expansion. Ninham has generalized this result to noninteger alpha satisfying alpha less than -1. In this note, we extend these results to all alpha by providing the nontrivial extension to negative integer alpha. This expansion differs from the previous expansions by the introduction of a term log m.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P411.ps.Z"} |
| author | = | "C. Bischof and X. Sun and B. Lang", | |
| title | = | "Parallel Tridiagonalization through Two-Step Band Reduction", | |
| booktitle | = | " Proc. 1994 Scalable High-Performance Computing Conference", | |
| month | = | "May", | |
| year | = | "1994", | |
| pages | = | "23-27", | |
| Abstract | = | " The authors present a two-step variant of the successive band reduction paradigm for the tridiagonalization of symmetric matrices. They reduce a full matrix first to narrow-banded form and then to tridiagonal form. The first step allows easy exploitation of block orthogonal transformations. In the second step, they use a blocked version of a banded matrix tridiagonalization algorithm by Lang. They are able to express the update of the orthogonal transformation matrix in terms of block transformations. This expression leads to an algorithm that is almost entirely based on BLAS-3 kernels and has greatly improved data movement and communication characteristics. Results on the Delta and SP1 are given.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P412.ps.Z"} |
| author | = | "C. Bischof and S. Huss-Lederman and X. Sun and A. Tsao and T. Turnbull", | |
| title | = | "Parallel Performance of a Symmetric Eigensolver based on the Invariant Subspace Decomposition Approach", | |
| booktitle | = | "Proc. 1994 Scalable High-Performance Computing Conf.", | |
| publisher | = | "IEEE Computer Society Press", | |
| year | = | "1994", | |
| pages | = | "32--39", | |
| Abstract | = | " This paper discusses work on a complete eigensolver based on the Invariant Subspace Decomposition Algorithm for dense symmetric matrices. The authors describe a recently developed acceleration technique that substantially reduces the overall work required by this algorithm. They also review the algorithmic highlights of a distributed-memory implementation of this approach, including a fast matrix-matrix multiplication algorithm, a new approach to parallel band reduction and tridiagonalization, and a harness for coordinating the divide-and-conquer parallelism in the problem. Performance results are presented for the dominant kernel as well as for the overall implementation on the Delta and Paragon.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P413.ps.Z"} |
| author | = | "C. H. Bischof and G. J. Whiffen and C. A. Shoemaker and A. Carle and A. A. Ross", | |
| title | = | "Application of Automatic Differentiation to Groundwater Transport Models", | |
| booktitle | = | " Computational Methods in Water Resources X" | |
| editor | = | " A. Peters and others", | |
| publisher | = | "Kluwer Academic Publishers", | |
| year | = | "1994", | |
| pages | = | "173--182", | |
| Abstract | = | " Automatic differentiation (AD) is a technique for generating efficient and reliable derivative codes from computer programs with a minimum of human effort. Derivatives of model output wit respect to input are obtained exactly. No intrinsic limits to program length or complexity exist for this procedure. Calculation of derivatives of complex numerical models is required in systems optimization, parameter identification, and systems identification. We report on our experiences with the ADIFOR (Automatic Differentiation in Fortran) tool on a two-dimensional groundwater flow and contaminant transport finite-element model, ISOQUAD, and a three-dimensional contaminant transport finite-element model, TLS3D. Derivative values and computational times for the automatic differentiation procedure are compared with values obtained from the divided differences and handwritten analytic approaches. We found that the derivative codes generated by ADIFOR provided accurate derivatives and ran significantly faster than divided-differences approximations, typically in a tenth of the CPU time required for the imprecise divided-differences method for both codes. We also comment on the benefit of automatic differentiation technology with respect to accelerating the transfer of general techniques developed for using water resource computer models, such as optimal design, sensitivity analysis, and inverse modeling problems, to field problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P414.ps.Z"} |
| author | = | "L. Freitag and M. Jones and P. Plassmann", | |
| title | = | "New Advances in the Modeling of High-Temperature Superconductors", Proc. 1994 Scalable High-Performance Computing Conference", | |
| year | = | "1994", | |
| Abstract | = | " This paper presents a new discrete formulation that maintains discrete invariance and is suitable for use on nonorthogonal meshes. The formulation, unlike its predecessors, allows one to easily use adaptive mesh refinement to concentrate grid points where error contributions are large (near vortex centers). In this way the total number of grid points required to accurately capture vortex configurations is reduced. The authors have developed scalable libraries for adaptive mesh refinement and partitioning on two-dimensional triangular grids. They also present a new geometric partitioning algorithm that strives to minimize communication cost by ensuring good partition aspect ratios. The paper includes computational results showing the efficiency of these adaptive techniques for a superconductor application.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P415.ps.Z"} |
| author | = | "J. M. Boyle", | |
| title | = | "Automatic, Self-adaptive control of Unfold-Fold Transformations", | |
| booktitle | = | "Proc. PROCOMET '94: IFIP Working Conference on Programming Concepts, Methods, and Calculi", | |
| year | = | "1994", | |
| pages | = | "83--103", | |
| Abstract | = | " I describe an automated approach to partial evaluation based transformations for elementary simplifications and unfolding and folding. The approach emphasizes program algebra and relies on canonical forms and distributive laws to expose instances to which the elementary simplifications apply. This approach to partial evaluation has been applied to a number of practical examples of moderate complexity, including eliminating a data structure from a partial-differential-equation solver.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P416.ps.Z"} |
| author | = | "K. D. Rayl and T. Gaasterland and R. Overbeek", | |
| title | = | "Automating the Determination of 3D Protein Structure", | |
| number | = | " MCS-417-0294", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The creation of an automated method for determining 3D protein structure would be invaluable to the field of biology and presents an interesting challenge to computer science. Unfortunately, given the present level of protein knowledge, a completely automated solution method is not feasible; therefore, the Argonne group has decided to integrate existing databases and theories to create a software system that assists X-ray crystallographers in specifying a particular protein structure.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P417.ps.Z"} |
| author | = | "S. Wright and Y. Zhang", | |
| title | = | "A Superquadratic infeasible-interior-Point Method for Linear Complementarity Problems", | |
| journal | = | "Mathematical Programming", | |
| year | = | "to appear", | |
| Abstract | = | " This paper presents a modification of a path-following infeasible-interior-point algorithm described by Wright. The new algorithm improves each new iterate by reusing the coefficient matrix factors from the latest step. The authors show that the modified algorithm has similar theoretical global convergence properties to the earlier algorithm, while its asymptotic convergence rate can be made superquadratic by an appropriate parameter choice.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P418.ps.Z"} |
| author | = | "C. H. Bischof and L. L. Green and K. J. Haigler and T. L. Knauff Jr.", | |
| title | = | "Parallel Calculation of Sensitivity Derivatives for Aircraft Design Using Automatic Differentiation", | |
| booktitle | = | "Proc. 5th AIAA/NASA/USAF/ISSMO Symposium on Multidisciplinary Analysis and Optimization 94-4261", | |
| year | = | "1994", | |
| pages | = | "73--84", | |
| Abstract | = | " Sensitivity derivative (SD) calculation via automatic differentiation typical of that required for the aerodynamic design of a transport-type aircraft is considered. Two ways of computing SDs via code generated by the ADIFOR automatic differentiation tool are compared for efficiency and applicability to problems involving large numbers of design variables. A vector implementation on a CRAY Y-MP computer is compared with a coarse-grained parallel implementation on an IBM SP1 computer, employing a Fortran M wrapper. The SDs are computed for a swept transport wing in turbulent, transonic flow; the number of geometric design variables varies from 1 to 60, with coupling between a wing grid generation program and a state-of-the-art, 3-D computational fluid dynamics program, both augmented for derivative computation via AD. For a small number of design variables, the CRAY Y-MP implementation is much faster. As the number of design variables grows, however, the SP1 becomes an attractive alternative in terms of compute speed, job turnaround time, and total memory available for solutions with large numbers of design variables. The coarse-grained parallel implementation also can be moved easily to a network of workstations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P419\_part1.ps.Z"} |
| author | = | "C. Bischof and A. Griewank", | |
| title | = | "Computational Differentiation and Multidisciplinary Design", | |
| booktitle | = | " Proc. Symposium on Inverse Problems and Optimal Design in Industry", | |
| editor | = | " H. Engl and J. McLaughlin", | |
| publisher | = | "Teubner Verlag", | |
| address | = | "Stuttgart", | |
| year | = | "1994", | |
| pages | = | "187--211", | |
| Abstract | = | " Multidisciplinary design optimization (MDO) by means of formal sensitivity analysis requires that each single-discipline analysis code supply not only the output functions for the (usually constrained) optimization process and other discipline analysis inputs, but also the derivatives of all of these output functions with respect to its input variables. Computational differentiation techniques and automatic differentiation tools enable MDO by providing accurate and efficient derivatives of computer programs with little human effort. This paper discusses the principles behind automatic differentiation and gives an overview of AD tools and how they can be used for sparse Jacobians and for exploiting parallelism. The authors show hos AD applied to iterative solvers delivers the mathematically desired derivatives. They then show how derivatives that can be feasibly obtained by computational differentiation techniques can lead to improved solution schemes for nonlinear coupled systems and multidisciplinary design optimization.", | |
| note | = | "="ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P420.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Parallel Algorithms for Adaptive Mesh Refinement", | |
| journal | = | "SIAM J. Scientific Computing", | |
| volume | = | " 18", | |
| issue | = | "3 ", | |
| month | = | "May ", | |
| year | = | "1997", | |
| pages | = | "686-708", | |
| Abstract | = | " Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientific calculations. The adaptive construction of such nonuniform meshes is an important part of these methods. In this paper, we present a parallel algorithm for adaptive mesh refinement that is suitable for implementation on distributed-memory parallel computers. Experimental results obtained on the Intel DELTA are presented to demonstrate that, for scientific computations involving the finite element method, the algorithm exhibits scalable performance and has a small run time in comparison with other aspects of the scientific computations examined. It is also shown that the algorithm has a fast expected running time under the P-RAM computation model.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P421.ps.Z"} |
| author | = | "I. Foster and M. Xu", | |
| title | = | "Libraries for Parallel Paradigm Integration", | |
| booktitle | = | "Toward Teraflop Computing and New Grand Challenge Applications", | |
| editor | = | " R. Kalia and P. Vashista", | |
| publisher | = | "Nova Science Publishers", | |
| yeaer | = | "1994", | |
| Abstract | = | " Most existing programming languages and tools are designed to support either task parallelism or data parallelism. Yet many applications can benefit from a combination of both. This paper presents a small set of extensions to Fortran, called Fortran M, that provides a framework on which portable, reusable libraries can be built to implement programming paradigms. Here the authors illustrate the approach by showing how it is used to implement libraries for file I/O, message passing, and data-parallel computation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P422.ps.Z"} |
| author | = | "J. M. Restrepo and G. K. Leaf", | |
| title | = | "Inner Product Computations Using Periodized Daubechies Wavelets", | |
| booktitle | = | "International Journal for Numerical Methods in Engineering", | |
| volume | = | "40", | |
| year | = | "1997", | |
| pages | = | "3557-3578", | |
| Abstract | = | " Inner properties of wavelets and their derivatives are presently known as connection coefficients. The numerical calculation of inner products of periodized Daubechies wavelets and their derivatives is reviewed, with the aim at providing potential users of the publicly-available numerical scheme, details of its operation. The numerical scheme for the calculation of connection coefficients is evaluated in the context of approximating differential operators, information which is useful in the solution of partial differential equations using wavelet-Galerkin techniques. Specific details of the periodization of inner products in the solution differential equations are included in this presentation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P423.ps.Z"} |
| author | = | "I. Foster and J. Michalakes", | |
| title | = | "MPMM: A Massively Parallel Mesoscale Model", | |
| booktitle | = | " Parallel Supercomputing in the Atmospheric Sciences", | |
| publisher | = | "World Scientific", | |
| year | = | "1994", | |
| pages | = | "354--363", | |
| Abstract | = | " In this paper we report on a project at Argonne National Laboratory to parallelize the Penn State/NCAR Mesoscale Model version 5 using a fine grain decomposition dynamically mapped and managed under PCN.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P424.ps.Z"} |
| author | = | "M. Henderson and B. Nickless and R. Stevens", | |
| title | = | "A Scalable High-Performance I/O System", | |
| number | = | " MCS-P425-0494", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A significant weakness of many existing parallel supercomputers is their lack of high-performance parallel I/O. This weakness has prevented, in many cases, the full exploitation of the true potential of MPP systems. As part of a joint project wit IBM, we have designed a parallel I/O system for an IBM SP system that can provide sustained I/O rates of greater than 160 MB/s from collections of compute nodes to archival disk and peak transfer rates that should exceed 400 MB/s from compute nodes to I/O servers. This testbed system will be used for a number of projects. First, it will provide a high-performance experimental I/O system for traditional computational science applications; second, it will be used as an I/O software and development environment for new parallel I/O algorithms and operating systems support; and third, it will be used as the foundation for a number of new projects designed to develop enabling technology for the National Information Infrastructure. This report describes the system under development at Argonne National Laboratory, provides some preliminary performance results, and outlines future experiments and directions.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P425.ps.Z"} |
| author | = | "I. T. Foster and P. H. Worley", | |
| title | = | "Parallel Algorithms for the Spectral Transform Method", | |
| journla | = | "SIAM J. Sci. Comput.", | |
| volume | = | "18", | |
| issue | = | "3", | |
| month | = | "May", | |
| year | = | "1997", | |
| pages | = | "806-837", | |
| Abstract | = | " The spectral transform method is a standard numerical technique for solving partial differential equations on a sphere and is widely used in atmospheric circulation models. Recent research has identified several promising algorithms for implementing this method on massively parallel computers; however, no detailed comparison of the different algorithms has previously been attempted. In this paper, we describe these different parallel algorithms and report on computational experiments that we have conducted to evaluate their efficiency on parallel computers. The experiments used a testbed code that solves the nonlinear shallow water equations on a sphere; considerable care was taken to ensure that the experiments provide a fair comparison of the different algorithms and that the results are relevant to global models. We focus on hypercube- and mesh-connected multicomputers with cut-through routing, such as the Intel iPSC/860, DELTA, and Paragon, and the nCUBE/2, but also indicate how the results extend to other parallel computer architectures. The results of this study are relevant not only to the spectral transform method but also to multidimensional FFTs and other parallel transforms.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P426.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Strategy and Hyperresolution", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "12", | |
| issue | = | "1", | |
| pages | = | "133-134", | |
| year | = | "1994", | |
| Abstract | = | " The problem proposed for research asks one to find a strategy that can be couple d with the inference rule hyperresolution to control the behavior of an automate d reasoning program as effectively as does paramodulation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P427.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Hyperparamodulation", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "12", | |
| year | = | "1994", | |
| pages | = | "265-271", | |
| Abstract | = | " The problem for research asks one to establish criteria for allowing certain---but not all---new clauses to become nuclei when using the inference rule hyperparamodulation or hyperresolution.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P428.ps.Z"} |
| author | = | "J. J. More' ", | |
| title | = | "Global Methods for Nonlinear Complementarity Problems", | |
| number | = | "MCS-P429-0494", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Global methods for nonlinear complementarity problems formulate the problem as a system of nonsmooth nonlinear equations approach or use continuation to trace a path defined by a smooth system of nonlinear equations. This paper formulates the nonlinear complementarity problem as a bound-constrained nonlinear least squares problem. Algorithms based on this formulation are applicable to general nonlinear complementarity problems and can be started from any nonnegative starting point. Each iteration requires the solution of systems of linear equations. Convergence to a solution of the nonlinear complementarity problem is guaranteed under reasonable regularity assumptions. The converge rate is Q-linear, Q-superlinear, or Q-quadratic, depending on the tolerances used to solve the subproblems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P429.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "The Field of Automated Reasoning", | |
| journal | = | "Computers and Mathematics with Applications", | |
| volume | = | "29", | |
| issue | = | "2", | |
| pages | = | "xi-xiv", | |
| month | = | "February", | |
| year | = | "1995", | |
| Abstract | = | " This article is the introduction to a special issue on automated reasoning, to appear in Computers and Mathematics with Applications in late 1994.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P430.ps.Z"} |
| author | = | "X. Sun and C. Bischof", | |
| title | = | "A Basis-Kernel Representation of Orthogonal Matrices", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "16", | |
| issue | = | "4", | |
| month | = | "October", | |
| year | = | "1995", | |
| pages | = | "1184-1196", | |
| Abstract | = | " In this paper we introduce a new representation of orthogonal matrices. We show that any | |
| orthogonal matrix can be represented in the form $Q | = | I - YSY^T$, which we call the basis-kernel representation of Q. We show that the kernel S can be chosen to be triangular and show how the familiar representation of an orthogonal matrix as a product of Householder matrices can be directly derived from a representation with triangular kernel. We also show that there exists an, in some sense, minimal orthogonal transformation for solving the block elimination problem. We explore how the basis Y determines the subspaces that Q acts on in a nontrivial fashion, and how S determines the way Q acts on this subspace. We derive a canonical representation that explicitly shows how Q partitions $ R^n$ into three invariant subspaces in which it acts as the identity, a reflector, and a rotator, respectively. We also derive a generalized Cayley representation for arbitrary orthogonal matrices, which illuminates the degrees of freedom we have in choosing orthogonal matrices acting on a predetermined subspace.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P431.ps.Z"} |
| author | = | "I. T. Foster and D. W. Walker", | |
| title | = | "Paradigms and Strategies for Scientific Computing on Distributed-Memory Concurrent Computers", | |
| booktitle | = | " Proc. 1994 High Performance Computing Conf.", Society for Computer Simulation", | |
| year | = | "1994", | |
| Abstract | = | " This paper examines recent advances in parallel languages and abstractions that have the potential for improving the programmability and maintainability of large-scale parallel scientific applications running on high-performance architectures and networks. This paper focuses on a Fortran M implementation of a particle-in-cell plasma simulation application and discusses issues in the optimization of the code. The use of two other methodologies for parallelizing the PIC application are considered. The first is based on the shared object abstraction as embodied in the Orca language. The second is the Split-C language. in Fortran M, Orca, and split-C, the ability of the programmer to control the granularity of communication is important in designing an efficient implementation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P432.ps.Z"} |
| author | = | "I. Foster and M. Xu and B. Avalani and A. Choudhary", | |
| title | = | "A Compilation System That Integrates High Performance Fortran and Fortran M", | |
| booktitle | = | "Proc. 1994 Scalable High-Performance Computing Conf.", | |
| publisher | = | "IEEE", | |
| year | = | "1995", | |
| pages | = | "293--300", | |
| Abstract | = | " This paper describes a system under develop to explore the integration of task parallelism and data parallelism. The system builds on previous work on task-parallel and data-parallel Fortran compilers to provide an environment in which the task-parallel language Fortran M can be used to coordinate data-parallel High Performance Fortran. An image-processing problem is used to illustrate issues that arise when building an integrated system of this sort.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P433.ps.Z"} |
| author | = | "S. K. Park and K. K Droegemeier and C. Bischof and T. Knauff", | |
| title | = | "Sensitivity Analysis of Numerically Simulated Convective Storms Using Direct and Adjoint Methods", | |
| booktitle | = | " 10th Conference on Numerical Weather Prediction", | |
| publisher | = | "American Meteorological Society", | |
| year | = | "1994", | |
| pages | = | "457--459", | |
| Abstract | = | " This paper describes an alternative, essentially automated method (ADIFOR) for obtaining the solution gradient that bypasses the adjoint altogether yet provides even more information about the gradient. The paper assesses the utility of ADIFOR relative to the brute force approach applied to a 1-D moist cloud model. Also evaluated is the validity of the tangent linear approximation in the context of deep convection. |
| author | = | "A. Carle and L. L. Green and C. H. Bischof and P. A. Newman", | |
| title | = | "Applications of Automatic Differentiation in CFD", | |
| booktitle | = | "Proc. 25th AIAA Fluid Dynamics Conference: AIAA 94-2197", | |
| year | = | "1994", | |
| pages | = | "1--13", | |
| Abstract | = | " This paper discusses the use of automatic differentiation as a means of extending iterative CFD codes with sensitivity derivatives. In particular, the ADIFOR automatic differentiator has been applied to the 3D, thin-layer Navier-Stokes multigrid flow solver TLNS3D coupled with the WTCO wing grid generator. Results of a sequence of efforts in which TLNS3D have been successfully augmented to compute a variety of sensitivities are presented. It is shown that sensitivity derivatives can be obtained accurately and efficiently using ADIFOR, although significant advances are necessary for the efficiency of ADIFOR-generated derivative code to become truly competitive with hand-differentiated code.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P435.ps.Z"} |
| author | = | "W. R. McKinney and J. M. Restrepo and J. L. Bona", | |
| title | = | "Unstable Solitary-Wave Solutions of the Generalized Benjamin-Bona-Mahony Equation", | |
| number | = | "MCS-P436-0594", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The evolution of solitary waves of the gBBM equation is investigated computationally. The experiments confirm previously derived theoretical stability estimates and, more importantly, yield insights into their behavior. For example, highly energetic unstable solitary waves, when perturbed, are shown to evolve into several stable solitary waves.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P436.ps.Z"} |
| author | = | "J. N. Lyness and I. H. Sloan", | |
| title | = | "Cubature Rules of Prescribed Merit", | |
| journal | = | "SIAM J. Numer. Anal." | |
| volume | = | "34", | |
| issue | = | "2", | |
| month | = | "April", | |
| year | = | "1997", | |
| pages | = | "586-602", | |
| Abstract | = | " This paper introduces a criterion for the evaluation of multidimensional quadrature, or cubature, rules for the hypercube: this is the merit of a rule, which is closely related to its trigonometric degree, and which reduces to the Zaremba figure of merit in the case of a lattice rule. The authors derive a family of rules Q sub k sup s having dimension s and merit 2 sup k. These rules seem to be competitive with lattice rules with respect to the merit that can be achieved with a given number of abscissas.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P437.ps.Z"} |
| author | = | "P. H. Worley and I. T. Foster", | |
| title | = | "Parallel Spectral Transform Shallow Water Model: A Runtime-Tunable Parallel Benchmark Code", | |
| booktitle | = | "Proc. Scalable High-Performance Comp. Conf. '94", | |
| publisher | = | "IEEE", | |
| year | = | "1994", | |
| Abstract | = | " This paper describes a code, PSTSWM, in which algorithmic options were embedded, allowing it to be tuned for a particular machine without requiring code modifications. PSTSWM was developed for evaluating parallel algorithms for the spectral transform method in atmospheric circulation models. Many levels of runtime-selectable algorithmic options are supported. The paper discusses these options and the evaluation methodology. Also provided are empirical results from a number of parallel machines, indicating the importance of tuning for each platform before making a comparison.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P438.ps.Z"} |
| author | = | "I. T. Foster and B. R. Toonen", | |
| title | = | "Load-Balancing Algorithms for Climate Models", | |
| booktitle | = | "Proc. Scalable High-Performance Comp. Conf. '94", | |
| publisher | = | "IEEE", | |
| year | = | "1994", | |
| Abstract | = | " Implementations of climate models on scalable parallel computer systems can suffer from load imbalances resulting from temporal and spatial variations in the amount of computation required for physical parameterizations such as solar radiation and convective adjustment. The authors have developed specialized techniques for correcting such imbalances. These techniques are incorporated in a general-purpose, programmable load-balancing library that allows the mapping of computation to processors to be specified as a series of maps generated by a programmer-supplied load-balancing module. The communication required to move from one map to another is performed automatically by the library, without programmer intervention. The authors describe this work, discuss specific load-balancing algorithms they have developed for PCCM2, and present experimental results that demonstrate the effectiveness of these algorithms on parallel computers.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P439.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | "Task Parallelism and High-Performance Languages", | |
| booktitle | = | "IEEE Parallel and Distributed Technology", | |
| volume | = | "2", | |
| issue | = | "3", | |
| year | = | "1994", | |
| pages | = | "39-48", | |
| Abstract | = | " This paper examines and illustrates the considerations that motivate the use of task parallelism. Also described is one particular approach to task parallelism in Fortran, namely, the Fortran M extensions. Finally, the authors contrast Fortran M with other proposed approaches and discuss the implications of this work for task parallelism and high-performance languages.", note://info.mcs.anl.gov/pub/tech\_reports/reports/P440.ps.Z"} |
| author | = | "G. J. Whiffen and C. A. Shoemaker and C. H. Bischof and A. A. Ross and A. Carle", | |
| title | = | "Application of Automatic Differentiation to Groundwater Transport Models", | |
| number | = | "MCS-P441-0594", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation is a technique for generating efficient and reliable derivative codes from computer programs with minimal human effort. Derivatives of model output with respect to input are obtained exactly. No intrinsic limits to program length or complexity exist for this procedure. Calculation of derivatives of complex numerical models is required in system optimization, parameter identification, and systems identification. We report on our experiences with the ADIFOR (automatic Differentiation of Fortran) tool on a two-dimensional groundwater flow and contaminant transport finite-element model, ISOQUAD, and a three-dimensional contaminant transport finite-element model, TLS3D. Derivative values and computational times for the automatic differentiation procedure are compared with values obtained from the divided differences and handwritten analytic approaches. The automatic differentiation tool ADIFOR produced derivative codes that calculated exact derivatives in typically almost an order of magnitude less CPU time than what is required for the imprecise divided differences method for both the two- and three-dimensional codes. We also comment on the benefit of automatic differentiation technology with respect to accelerating the transfer of general techniques developed for using water resource computer models (such as optimal design, sensitivity analysis, and inverse modeling problems) to field applications.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P441.ps.Z"} |
| author | = | "Z. Wu", | |
| title | = | "The Effective Energy Transformation Scheme as a Special Continuation Approach to Global Optimization with Application to Molecular Conformation", | |
| number | = | "MCS-P442-0694", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper discusses a generalization of the function transformation scheme for global energy minimization applied to the molecular conformation problem. A mathematical theory for the method as a special continuation approach to global optimization is established. We show that the method can transform a nonlinear objective function into a class of gradually deformed, but smoother or easier functions. an optimization procedure can then be applied to the new functions successively, to trace their solutions back to the original function. Two types of transformation are defined: isotropic and anisotropic. We show that both transformations can be applied to a large class of nonlinear partially separable functions including energy functions for molecular conformation. methods to compute the transformation for these functions are given.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P442.ps.Z"} |
| author | = | "T. F. Coleman and Z. Wu", | |
| title | = | "Parallel Continuation-Based Global Optimization for Molecular Conformation and Protein Folding", | |
| number | = | "MCS-P443-0694", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents recent work on parallel algorithms and software for solving the global minimization problem for molecular conformation, especially protein folding. To avoid directly minimizing a difficult function, the authors use a special integral transformation to transform the function into a class of gradually deformed, but smoother functions. An optimization procedure is then applied to the new functions successively, to trace their solutions back to the original function. Mathematical theory for the method is established. Different levels of parallelism are exploited for the implementation of the algorithms on massively parallel architectures.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P443.ps.Z"} |
| author | = | "L. Freitag and M. Jones and P. Plassmann", | |
| title | = | "New Techniques for Parallel Simulation of High-Temperature Superconductors", | |
| number | = | "MCS-P444-0594", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The authors discuss several new techniques used for the simulation of high-temperature superconductors on parallel computers. They introduce an innovative methodology to study the effects of temperature fluctuations on the vortex lattice configuration of these materials. They find that the use of uniform orthogonal meshes results in several limitations. To address these, they consider nonorthogonal meshes and describe a new discrete formulation that solves the difficult problem of maintaining gauge invariance on nonorthogonal meshes. With this discretization, adaptive refinement strategies are used to concentrate grid points where error contributions are large (in this case, near vortex cores). They describe the algorithm used for the parallel implementation of this refinement strategy, and they present computational results on the Intel DELTA.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P444.ps.Z"} |
| author | = | "L. Freitag and M. T. Jones and P. E. Plassmann", | |
| title | = | ""Parallel Algorithms for the Adaptive Refinement and Partitioning of Unstructured Meshes", | |
| booktitle | = | "Proc. Scalable High Performance Computing Conference", | |
| publisher | = | "IEEE Computer Society Press", | |
| year | = | "1994", | |
| pages | = | "478--485", | |
| Abstract | = | " The efficient solution of many large-scale scientific calculations depends on adaptive mesh strategies. This paper presents new parallel algorithms to solve two significant problems that arise in this context: the generation of the adaptive mesh and the mesh partitioning. The crux of the refinement algorithm presented here is the identification of independent sets of elements that can be refined in parallel. Runtime results on the DELTA are given, demonstrating that the algorithms exhibit scalable performance and have run times that are small in comparison with other aspects of the computation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P445.ps.Z"} |
| author | = | "S. Wright", | |
| title | = | "Stability of Augmented System Factorizations in Interior-Point Methods", | |
| journal | = | "SIAM J. Matric Anal. Appl.", | |
| volume | = | "18", | |
| number | = | "1", | |
| month | = | "January", | |
| year | = | "1997", | |
| pages | = | "191--222", | |
| Abstract | = | " Some implementations of interior-point algorithms obtain their search directions by solving symmetric indefinite systems of linear equations. The conditioning of the coefficient matrices in these so-called augmented systems deteriorates on later iterations, as some of the diagonal elements grow without bound. Despite this apparent difficulty, the steps produced by standard factorization procedures are often accurate enough to allow the interior-point method to converge to high accuracy. When the underlying linear program is nondegenerate, we show that convergence to arbitrarily high accuracy occurs, at a rate that closely approximates the theory. We also explain and demonstrate what happens when the linear program is degenerate, where convergence to acceptable accuracy (but not arbitrarily high accuracy) is usually obtained.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P446.ps.Z"} |
| author | = | "R. C. Brown and M. K. Kwong", | |
| title | = | "On the Best Constant for the Inequality", | |
| number | = | "MCS-P447-0694", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper identifies the best constant for a specific integro-differential inequality. The approach consists of reducing the problem to various equivalent inequalities on a finite interval and determining necessary conditions on the extremals. The best constant is shown to satisfy an algebraic equation that is solved exactly with the help of MAPLE. The best constants for several similar inequalities are also determined.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P447.ps.Z"} |
| author | = | "J. M. Restrepo and G. K. Leaf", | |
| title | = | "Wavelet-Galerkin Discretization of Hyperbolic Equations", | |
| journal | = | "J. Comp. Phys.", | |
| volume | = | "122", | |
| year | = | "1995", | |
| pages | = | "118-128", | |
| Abstract | = | " The relative merits of the wavelet-Galerkin solution of hyperbolic partial differential equations, typical of geophysical problems, are quantitatively and qualitatively compared with traditional finite difference and Fourier-pseudo-spectral methods. The wavelet-Galerkin solution presented here is found to be a viable alternative to the two conventional techniques.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P448.ps.Z"} |
| author | = | "M. K. Kwong and P. T. P. Tang", | |
| title | = | "W-Matrices, Nonorthogonal Multiresolution Analysis, and Finite Signals of Arbitrary Length", | |
| number | = | "MCS-P449-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper proposes a new class of discrete transforms. The transforms treat the endpoints of a signal in a different manner from that of conventional techniques. This new approach enables one to efficiently handle signals of any length; thus, one is not restricted to work with signal or image sizes that are multiples of a power of 2. Moreover, the method does not lengthen the output signal and does not require an additional bookkeeping vector.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P449.ps.Z"} |
| author | = | "C. Bischof and X. Sun", | |
| title | = | "On Orthogonal Block Elimination", | |
| number | = | "MCS-P450-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper considers a block elimination problem using a basis kernel representation as the main tool. The approach presented holds great promise for more efficient strategies to compute sparse orthogonal factorizations. Moreover, since the canonical basis and kernel can be computed faster than the compact WY accumulation procedure, and in a much more block-oriented fashion, the approach should be advantageous in cache-based systems or parallel processors.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P450.ps.Z"} |
| author | = | "A. Bouaricha", | |
| title | = | "STENMIN: A Software Package for Large, Sparse Unconstrained Optimization Using Tensor Methods", | |
| num ber | = | "MCS-P451-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper describes a new package for minimizing an unconstrained nonlinear function where the Hessian is large and sparse. The software allows the user to select between a tensor method and a standard method based on a quadratic model. The package uses an entirely new way of minimizing the tensor model that makes it suitable for solving large, sparse optimization problems efficiently. Test results indicate that in general the tensor method is significantly more efficient and more reliable than the standard Newton method for solving large, sparse unconstrained optimization problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P451.ps.Z"} |
| author | = | "A. Bouaricha", | |
| title | = | "Tensor Methods for Large, Sparse Unconstrained Optimization", | |
| number | = | "MCS-P452-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper extends traditional tensor methods to large, sparse, unconstrained optimization problems. The extension requires an entirely new way of solving the tensor model that makes the methods suitable for solving large, sparse optimization problems efficiently. Test results are presented for sets of problems where the Hessian at the minimizer is nonsingular and where it is singular. The results show that tensor methods are significantly more efficient and more reliable than standard methods based on Newton's method.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P452.ps.Z"} |
| author | = | "B. Avalani and A. Choudhary and I. Foster and R. Krishnaiyer and M. Xu", | |
| title | = | "A Data Transfer Library for Communication Data-Parallel Tasks", | |
| number | = | "MCS-P453-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper describes a communicating data-parallel tasks (CDT) library being developed for constructing applications of this sort. The paper outlines the techniques used to implement the library, as well as a range of data transfer strategies and several algorithms based on these strategies. Performance results for several algorithms are presented. The CDT library is being used as a compiler target for an HPF compiler augmented with Fortran M extensions.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P453.ps.Z"} |
| author | = | "Z. Wu", | |
| title | = | "A Subgradient Algorithm for Nonlinear Integer Programming", | |
| number | = | "MCS-P454-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper describes a subgradient approach to nonlinear integer programming and, in particular, nonlinear 0-1 integer programming. In this approach, the objective function for a nonlinear integer program is considered as a nonsmooth function over the integer points. The subgradient and the supporting plane for the function are defined, and a necessary and sufficient condition for the optimal solution is established, based on the theory of nonsmooth analysis. A new algorithm, called the subgradient algorithm, is developed that searches for a solution iteratively among the integer points. A solution is found when the optimality condition is satisfied or an iterate is repeated. In either case, the algorithm terminates in finite steps. The theory and the algorithm are presented, as well as test results for a small set of problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P454.ps.Z"} |
| author | = | "C. Zhu", | |
| title | = | "Solving Large-Scale Minimax Problems with the Primal-Dual Steepest Descent Algorithm", | |
| number | = | "MCS-P455-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper shows that the primal-dual steepest descent algorithm developed by Zhu and Rockafellar for large-scale extended linear-quadratic programming can be used in solving constrained minimax problems related to a general saddle function. It is proved that the algorithm converges linearly from the very beginning of the iteration if the related saddle function is strongly convex-concave uniformly and the cross elements between the convex part and the concave part of the variables in its Hessian are bounded on the feasible region. Better bounds for the asymptotic rates of convergence are also obtained.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P455.ps.Z"} |
| author | = | "C. Zhu", | |
| title | = | "On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming", | |
| journal | = | "SIAM J. Optimization", | |
| volume | = | "5", | |
| issue | = | " 1", | |
| month | = | "February", | |
| year | = | "1995", | |
| pages | = | "114-128", | |
| Abstract | = | " The aim of this paper is twofold. First, it proposes new variants for the primal-dual steepest descent algorithm as one in the family of primal-dual projected gradient algorithms developed by Zhu and Rockafellar for large-scale extended linear-quadratic programming. Second, it provides a proof of new linear convergence results for all these variants of the algorithm, including the original version as a special case, without the additional assumptions used by Zhu and Rockafellar. For the variants with the second update scheme, a much sharper estimation for the rate of convergence is obtained as a result of the new primal-dual feedback pattern.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P456.ps.Z"} |
| author | = | "C. Zhu", | |
| title | = | "Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm", | |
| number | = | "MCS-P457-0794", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The asymptotic convergence of the forward-backward splitting algorithm is analyzed, and two special cases are discussed. New results are presented for | |
| the case in which h | = | 0; the results complement those of Rockafellar and Luque on the proximal point algorithm.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P457.ps.Z"} |
| author | = | "D. Levine", | |
| title | = | "A Parallel Genetic Algorithm for the Set Partitioning Problem", | |
| booktitle | = | "Proc. Fifth International Conf. on Genetic Algorithms", | |
| year | = | "1994", | |
| pages | = | "481--487", | |
| Abstract | = | " This paper describes a parallel genetic algorithm developed for the solution of the set partitioning problem--a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their own subpopulation and occasionally fit strings migrate between the subpopulations. Tests on 40 real-world problems were carried on on up to 128 nodes of an IBM SP parallel computer. The performance improved as additional subpopulations were added. In two cases, high-quality integer feasible solutions were found for problems with 36,699 and 43,749 integer variables.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P458.ps.Z"} |
| author | = | "L. Kettunen and K. Forsman and D. Levine and W. Gropp", | |
| title | = | "Solutions of TEAM Problems 13 and 20 Using a Volume Integral Formulation", | |
| booktitle | = | " Proc. Aix-les-Bains TEAM Workshop", | |
| address | = | "Aix-les-Bains", | |
| year | = | "1994", | |
| Abstract | = | " This paper presents a brief discussion of h-type volume integral formulations implemented in CFUNET/CORAL code. CFUNET/CORAL is a general-purpose code for 2D and 3D magnetostatics. Solutions of TEAM problem no. 13 are computed by using both a sequential and a parallel version the code.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P459.ps.Z"} |
| author | = | "L. Kettunen and K. Forsman and D. Levine and W. Gropp", | |
| title | = | "Volume Integral Equation in Nonlinear 3D Magnetostatics", | |
| journal | = | "Int. J. Numer. Methods Eng.", | |
| volume | = | "38", | |
| year | = | "1995", | |
| pages | = | "2655-2675", | |
| Abstract | = | " This paper discusses volume integral formulations in three-dimensional nonlinear magnetostatics. Integral formulations are examined in connection with Whitney's elements in order to find new approaches. A numerical algorithm based on an h-formulation is introduced. Results of demanding application problems are shown. In addition, the parallelized version the code is discussed, along with numerical results illustrating the advantages of combining integral formulations with concurrent computing.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P460.ps.Z"} |
| author | = | "L. Kettunen and K. Forsman and D. Levine and W. Gropp", | |
| title | = | "Volume Integral Equations in Non-Linear 3-D Magnetostatics", | |
| journal | = | "International J. for Num. Methods in Engineering", | |
| volume | = | "38", | |
| year | = | "1995", | |
| pages | = | "2655-2675"} |
| author | = | "L. Wos", | |
| title | = | "The Problem of Hyperparamodulation and Nuclei", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "12", | |
| issue | = | "3" | |
| pages | = | "407-409", | |
| year | = | "1994", | |
| Abstract | = | " This paper discusses an open research problem in automated reasoning. Specifically, one is asked to establish criteria for allowing certain--but not all--new clauses to become nuclei when using the inference rule hyperparamodulation or hyperresolution.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P461.ps.Z"} |
| author | = | "M. K. Kwong", | |
| title | = | "MATLAB Implementation of W-Matrix Multiresolution Analyses", | |
| number | = | "MCS-P462-0894", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper presents a MATLAB toolbox on multiresolution analysis based on the W-transform introduced by Kwong and Tang. The toolbox contains basic commands to perform forward and inverse transforms on finite 1D and 2D signals of arbitrary length, to perform multiresolution analysis of given signals to a specified number of levels, to visualize the wavelet decomposition, and to do compression. Examples of numerical experiments are also discussed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P462.ps.Z"} |
| author | = | "A. Bouaricha and R. B. Schnabel", | |
| title | = | "TENSOLVE: A Software Package for Solving Systems of Nonlinear Equations and Nonlinear Least Squares Problems Using Tensor Methods", | |
| number | = | "MCS-P463-0894", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper describes a modular software package for solving systems of nonlinear equations and nonlinear least squares problems, using a new class of methods called tensor methods. It is intended for small to medium-sized problems, say with up to 100 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix or approximate it by finite differences at each iteration. The software allows the user to select between a tensor method and a standard method based on a linear model. Moreover, the software proves two different global strategies, a line search and a 2D trust region approach. Test results indicate that, in general, tensor methods are significantly more efficient and robust than standard methods on small and medium-sized problems in iterations and function evaluations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P463.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Software for the Generalized Eigenproblem on Distributed-Memory Architectures", | |
| booktitle | = | "Proc. of the Cornelius Lanczos International Centenary Conference", | |
| editor | = | "R. P. M. Chu and D. Brown and D. Ellison", | |
| publisher | = | "SIAM", | |
| year | = | "1994", | |
| pages | = | "322-325", | |
| Absract | = | " The generalized eigenproblem is of significant importance in several fields. Generalized eigenproblems can be very large, with matrices of order greater than one million for problems arising from three-dimensional finite element models. To solve such problems, we are proposing a flexible software system for parallel distributed-memory architectures. This software is based on the Lanczos algorithms with a shift-and-invert transformation. This paper briefly describes the prototype version the software, presents computational results, and indicates the status of the project.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P464.ps.Z"} |
| author | = | "M. T. Jones and P. E. Plassmann", | |
| title | = | "Computational Results for Parallel Unstructured Mesh Computations", | |
| journal | = | "Computing Systems in Engineering", | |
| volume | = | "5", | |
| issue | = | "4-6", | |
| yeaer | = | "1994", | |
| pages | = | "297-309", | |
| Abstract | = | " The majority of finite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require significant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been developed. Unfortunately, many of the other aspects of parallel unstructured mesh computation have gone largely ignored. We present a set of algorithms that allow the entire unstructured mesh computation process to execute in parallel---including adaptive mesh refinement, equation reordering, mesh partitioning, and sparse linear system solution. We briefly describe these algorithms and state results regarding their running time and performance. We then give results from the 512-processor Intel DELTA for a large-scale structural analysis problem. These results demonstrate that the new algorithms are scalable and efficient. The algorithms are able to achieve up to 2.2 gigaflops for this unstructured mesh problem.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P466.ps.Z"} |
| author | = | "M. K. Kwong", | |
| title | = | "On the One-Dimensional Ginzburg-Landau BVPs", | |
| journal | = | "Differential and Integral Equations", | |
| volume | = | "8", | |
| issue | = | "6", | |
| month | = | "July", | |
| year | = | "1995", | |
| pages | = | "1395-1405", | |
| Abstract | = | " We study the one-dimensional system of Ginzburg-Landau equations that models a thin film of superconductor subjected to a tangential magnetic field. We prove that the bifurcation curve for the symmetric problem is the graph of a continuous function of the supremum of the order parameter. We also prove the existence of a critical magnetic field. In general, there is more than one positive solution to the symmetric boundary value problem. Our numerical experiments have shown cases with three solutions. It is still an open question whether only one of these corresponds to the physical solution that minimizes the Gibbs free energy. We establish uniqueness for a related boundary value problem.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P467.ps.Z"} |
| author | = | "T. R. Canfield and P. B. Dobrin", | |
| title | = | "Mechanics of Blood Vessels", | |
| number | = | "MCS-P468-0894", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This is a chapter to be published in the Chemical Rubber Corp. Handbook on biomechanics. The chapter is concerned with the mechanical behavior of blood vessels under static loading conditions and the methods required to analyze this behavior.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P468.ps.Z"} |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "Scalable Unix Tools on Parallel Processors", | |
| booktitle | = | "Proc. 1994 Scalable High Performance Computing Conference" | |
| publisher | = | "IEEE Computer Society Press", | |
| year | = | "1994", | |
| pages | = | " 55-62", | |
| Abstract | = | " The introduction of parallel processors that run a separate copy of Unix on each process has introduced new problems in managing the user's environment. This paper discusses some generalizations of common Unix commands for managing files (e.g., ls) and processes (e.g., ps) that are convenient and scalable. These basic tools, just like their Unix counterparts, are text based. We also discuss a way to use these with a graphical user interface (GUI). some notes on the implementation are provided. Prototypes of these commands are publically available.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P469.ps.Z"} |
| author | = | "L. Kettunen and K. Forsman and D. Levine and W. Gropp", | |
| title | = | "Solutions of TEAM Problem \#13 Using Integral Equations in a Sequential and Parallel Computing Environment", MCS-P470-0994. Solutions for TEAM benchmark problems 13 and 20, obtained with an h-type volume integral formulation, are presented. Results computed with an increasing number of unknowns are shown in order to study the convergence of the numerical calculations. Some theoretical questions and aspects of parallelism are also highlighted.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P470.ps.Z"} |
| author | = | "C. Bischof", | |
| title | = | "Automatic Differentiation, Tangent Linear Models, and (Pseudo)Adjoints", | |
| number | = | "MCS-P472-1094", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper provides a brief introduction to automatic differentiation and relates it to the tangent linear model and adjoint approaches commonly used in meteorology. After a brief review of the forward and reverse mode of automatic differentiation, the ADIFOR automatic differentiation tool is introduced, and initial results of a sensitivity-enhanced version of the MM5 PSU/NCAR mesoscale weather model are presented. We also present a novel approach to the computation of gradients that uses a reverse mode approach at the time loop level and a forward mode approach at every time step. The resulting "pseudoadjoint" shares the characteristic of an adjoint code that the ratio of gradient to function evaluation does not depend on the number of independent variables. In contrast to a true adjoint approach, however, the nonlinearity of the model plays no role in the complexity of the derivative code.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P472.ps.Z"} |
| author | = | "A. Bouaricha and R. B. Schnabel", "Tensor Methods for Large Sparse Systems of Nonlinear Equations", | |
| number | = | "MCS-P473-1094", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper introduces tensor methods for solving large sparse systems of nonlinear equations. Tensor methods for nonlinear equations were developed in the context of solving small to medium-sized dense problems. They base each iteration on a quadratic model of the nonlinear equations, where the second-order term is selected so that the model requires no more derivative or function information per iteration than standard linear model-based methods, and hardly more storage or arithmetic operations per iteration. Computational experiments on small to medium-sized problems have shown tensor methods to be considerably more efficient than standard Newton-based methods, with a particularly large advantage on singular problems. This paper considers the extension of this approach to solve large sparse problems. The key issue that must be considered is how to make efficient use of sparsity in forming and solving the tensor model problem at each iteration. Accomplishing this turns out to require an entirely new way of solving the tensor model that successfully exploits the sparsity of the Jacobian, whether the Jacobian is nonsingular or singular. We develop such an approach and, based upon it, an efficient tensor method for solving large sparse systems of nonlinear equations. Test results indicate that this tensor method is significantly more efficient and robust than an efficient sparse Newton-based method, in terms of iterations, function evaluations, and execution time.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P473.ps.Z"} |
| author | = | "P. Ciarlet Jr. and F. Lamour and B. F. Smith", | |
| title | = | "On the Influence of Partitioning Schemes on the Efficiency of Overlapping Domain Decomposition Methods", | |
| booktitle | = | " Proc. Fifth Symposium on the Frontiers of Massively Parallel Computation", | |
| publisher | = | "IEEE Press", | |
| year | = | "1995", | |
| pages | = | "375--383", | |
| Abstract | = | " One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization of block Jacobi preconditioning. The effect of the number of blocks and the amount of overlapping between blocks on the convergence rate is well understood. This paper considers the related issue of the effect of the scheme used to partition the matrix into blocks on the convergence rate of the preconditioned iterative method. Numerical results for Laplace and linear elasticity problems in two and three dimensions are presented. The tentative conclusion is that using overlap tends to decrease the differences between the rates of convergence for different partitioning schemes.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P474.ps.Z"} |
| author | = | "K. Forsman and W. Gropp and L. Kettunen and D. Levine", | |
| title | = | "Computational Electromagnetics and Parallel Dense Matrix Computations", | |
| booktitle | = | " Proc. SIAM Parallel Processing for Scientific Computing", | |
| year | = | " 1995", | |
| Abstract | = | " We present computational results using CORAL, a parallel, three-dimensional, nonlinear magnetostatic code based on a volume integral equation formulation. A key feature of CORAL is the ability to solve, in parallel, the large, dense systems of linear equations that are inherent in the use of integral equation methods. Using the Chameleon and PSLES libraries ensures portability and access to the latest linear algebra solution technology.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P475.ps.Z"} |
| author | = | "W. D. Gropp and H. G. Kaper and G. K. Leaf and D. M. Levine and M. Palumbo and V. M. Vinokur", | |
| title | = | "Numerical Simulation of Vortex Dynamics in Type-II Superconductors", | |
| journal | = | "J. Computational Physics", | |
| volume | = | "123", | |
| year | = | "1996", | |
| pages | = | "254-266", | |
| Abstract | = | " This article describes the results of several numerical simulations of vortex dynamics in type-II superconductors. The underlying mathematical model is the time-dependent Ginzburg-Landau model. The simulations concern vortex penetration in the presence of twin boundaries, interface patterns between regions of opposite vortex orientation, and magnetic-flux entry patterns in superconducting samples.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P476.ps.Z"} |
| author | = | "J. L. Tilson", | |
| title | = | "Massively Parallel Self-Consistent-Field Calculations", | |
| journal | = | "I and EC Research", | |
| volume | = | "34", | |
| year | = | "1995", | |
| pages | = | "4161--4165", | |
| Abstract | = | " The advent of supercomputers with many computational nodes each with its own independent memory makes possible extremely fast computations. Our work, as part of the U.S. High Performance Computing and Communications Program (HPCCP), is focused on the development of electronic structure techniques for the solution of Grand Challenge-size molecules containing hundreds of atoms. Our efforts have resulted in a fully scalable Direct-SCF program that is portable and efficient. This code, named NWCHEM, is built around a distributed-data model. This distributed data is managed by a software package called Global Arrays developed within the HPCCP. We present performance results for Direct-SCF calculations of interest to the consortium.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P477.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "Searching for Circles of Pure Proofs", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "15", | |
| year | = | "1995", | |
| pages | = | "279--315", | |
| Abstract | = | " When given a set of properties or conditions (say, three) that are claimed to be equivalent, the claim can be verified by supplying what we call a circle of proofs. In the case in point, one proves the second property or condition from the first, the third from the second, and the first from the third. If the proof that 1 implies 2 does not rely on 3, then we say that the proof is pure with respect to 3, or simply say the proof is pure. If one can remember the three properties or conditions in such a way that one can find a circle of three pure proofs---technically, each proof pure with respect the condition that is neither the hypothesis nor the conclusion---then we say that a circle of pure proofs has been found. Here we study the specific question of the existence of a circle of pure proofs for the thirteen shortest single axioms for equivalential calculus, subject to the requirement that condensed detachment be used as the rule of inference. For an indication of the difficulty of answering the question, we note that a single application of condensed detachment to the (shortest single) axiom known as P4 (also known as UM) with itself yields the (shortest single) axiom P5 (also known as XGF), and two applications of condensed detachment beginning with P5 as hypothesis yields P4. Therefore, except for P5, one cannot find a pure proof of any of the twelve shortest single axioms when using P4 as hypothesis or axiom, for the first application of condensed detachment must focus on two copies of P4, which results in the deduction of P5, forcing P5 to be present in all proofs that use P4 as the only axiom. Further, the close proximity in the proof sense of P4 when using as the only axiom P5 threatens to make impossible the discovery of a circle of pure proofs for the entire set of thirteen shortest single axioms. Perhaps more important than our study of pure proofs, and of a more general nature, we also present the methodology used to answer the cited specific question, a methodology that relies on various strategies and features offered by W. McCune's automated reasoning program OTTER. The strategies and features of OTTER we discuss here offer researchers the needed power to answer deep questions and solve difficult problems. We close this article with some challenges and some topics for research and with a sample input file and some proofs for study.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P479.ps.Z">} |
| author | = | "V. E. Taylor and R. L. Stevens and K. E. Arnold", | |
| title | = | "Parallel Molecular Dynamics: Communication Requirements for Massively Parallel Machines", | |
| journal | = | "Frontiers 95", | |
| month | = | "February", | |
| year | = | "1995", | |
| Abstract | = | " Molecular mechanics and dynamics are becoming widely used to perform simulations of molecular systems from large-scale computations of materials to the design and modeling of drug compounds. In this paper we address two major issues: a good decomposition method that can take advantage of future massively parallel processing systems for modest-sized problems in the range of 50,000 atoms and the communication requirements needed to achieve 30 to 40% efficiency of MPPs. We analyzed a scalable benchmark molecular dynamics program executing on the Intel Touchstone Delta parallelized with an interaction decomposition method. Using a validated analytical performance model of the code, we determined that for an MPP with a four-dimensional mesh topology and 400 MHz processors the communication startup time must be at most 30 clock cycles and the network bandwidth must be at least 2.3 GB/s. This configuration results in 30 to 40% efficiency of the MPP for a problem with 50,000 atoms executing on 50,000 processors.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P480.ps.Z"} |
| author | = | "C. Bischof and A. Carle and P. Khademi and A. Mauer", | |
| title | = | "The ADIFOR 2.0 System for the Automatic Differentiation of Fortran 77 Programs", | |
| number | = | "MCS-P481-1194", | |
| Abstract | = | " Automatic Differentiation is a technique for augmenting computer programs with statements for the computation of d erivatives based on the chain rule of differential calculus. The ADIFOR 2.0 system provides automatic differentiation of Fortran 77 programs for first-order derivatives. The ADIFOR 2.0 system consists of three main components: The ADIFOR 2.0 preprocessor, the ADIntrinsics Fortran 77 exception-handling system, and the SparsLinC library. The combination of these tools provides the ability to deal with arbitrary Fortran 77 syntax, to handle codes containing single- and double-precision real- or complex-valued data, to fully support and easily customize the translation of Fortran 77 intrinsics, and to transparently exploit sparsity in derivative computations. ADIFOR 2.0 has been successfully applied to a 60,000-line code, which we believe to be a new record in automatic differentiation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P481.ps.Z"} |
| author | = | "A. Bouaricha", | |
| title | = | ""Tensor-Krylov Methods for Large Nonlinear Equations", | |
| journal | = | "Computational Optimization and Applications", | |
| volume | = | "5", | |
| year | = | "1996", | |
| pages | = | "207-232", | |
| Abstract | = | " In this paper, we describe tensor methods for large systems of nonlinear equations based on Krylov subspace techniques for approximately solving the linear systems that are required in each tensor iteration. We refer to a method in this class as a tensor-Krylov algorithm. We describe comparative testing for a tensor-Krylov implementation versus an analogous implementation based on a Newton-Krylov method. The test results show that tensor-Krylov methods are much more efficient and robust than Newton-Krylov methods on hard nonlinear equations problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P482.ps.Z"} |
| author | = | "J. Michalakes and T. Canfield and R. Nanjundiah and S. Hammond and G. Grell", | |
| title | = | "Parallel Implementation, Validation, and Performance of MM5", | |
| number | = | "MCS-P483-1194", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We describe a parallel implementation of the nonhydrostatic version of the Penn State/NCAR Mesoscale Model, MM5, that includes nesting capabilities. This version of the model can run on many different massively parallel computers (including a cluster of workstations). The model has been implemented and run on the IBM SP and Intel multiprocessors using a columnwise decomposition that supports irregularly shaped allocations of the problem to processors. This strategy will facilitate dynamic load balancing for improved parallel efficiency and promotes a modular design that simplifies the nesting problem. All data communication for finite differencing, inter-domain exchange of data, and I/O is encapsulated within a parallel library, RSL. Hence, there are no sends or receives in the parallel model itself. The library is generalizable to other, similar finite difference approximation codes. The code is validated by comparing the rate of growth in error between the sequential and parallel models with the error growth rate when the sequential model input is perturbed to simulate floating point rounding error. Series of runs on increasing numbers of parallel processors demonstrate that the parallel implementation is efficient and scalable to large numbers of processors.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P483.ps.Z"} |
| author | = | "Christian H. Bischof and Alan Carle and Peyvand M. Khademi and Gordon Pusch", | |
| title | = | "Automatic Differentiation: Obtaining Fast and Reliable Derivatives---Fast", | |
| number | = | "MCS-P484-1194", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this paper, we introduce automatic differentiation as a method for computing derivatives of large computer codes. After a brief discussion of methods of differentiating codes, we review automatic differentiation and introduce the ADIFOR automatic differentiation tool. We highlight some applications of ADIFOR to large industrial and scientific codes, and discuss the effectiveness and performance of our approach. Finally, we discuss sparsity in automatic differentiation and introduce the SparsLinC library,", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P484.ps.Z"} |
| author | = | "F. Jarre and S. Wright", | |
| title | = | "On the Role of the Objective Function in Barrier Methods", | |
| number | = | "MCS-P485-1294", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " To simplify the analysis of interior-point methods, one commonly formulates the problem so that the objective function is linear, by introducing a single extra variable if necessary. Here we show that a linear objective function makes the Newton direction for a barrier function a useful search direction if the current iterate is sufficiently close to the central path. Hence, there are two advantages to using a linear objective and staying close to the central path. First, the Newton direction (which coincides with the affine scaling direction on the central path) gives a very accurate approximation to the direction to the minimum. Second, a long step along the Newton direction is possible without violating the inequality constraints.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P485.ps.Z"} |
| author | = | "K. W. Dritz", | |
| title | = | "Random Number Generation in Ada 9X", | |
| booktitle | = | "Ada Yearbook 1995", | |
| editor | = | "M. Ratcliffe", | |
| publisher | = | "IOS Press", | |
| address | = | "Amsterdam", | |
| year | = | "1995", | |
| pages | = | "119--126", | |
| Abstract | = | " This paper presents an overview of the random number generation features of Ada 9X.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P486.ps.Z"} |
| AUTHOR | = | "A. K. Bansal", | |
| title | = | "Establishing a Framework for Comparative Analysis of Genome Sequences", | |
| number | = | "ANL/MCS-TM-209", | |
| month | = | "June", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This report describes a framework and a high-level language toolkit for comparative analysis of genome sequence alignment. The framework integrates the information derived from multiple sequence alignment and phylogenetic tree (hypothetical tree of evolution) to derive new properties about sequences. Multiple sequence alignments are treated as an abstract data type. Abstract operations have been described to manipulate a multiple sequence alignment and to derive mutation related information from a phylogenetic tree by superimposing parsimonious analysis. The framework has been applied on protein alignments to derive constrained columns (in a multiple sequence alignment) that exhibit evolutionary pressure to preserve a common property in a column despite mutation. A Prolog toolkit based on the framework has been implemented and demonstrated on alignments containing 3000 sequences and 3904 columns.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM209.ps.Z"} |
| author | = | "C. Bischof and A. Carle and P. Khademi", | |
| title | = | "Fortran 77 Interface Specification to the SparsLinC 1.0 Library", | |
| number | = | "ANL/MCS-TM-196", | |
| month | = | "May", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The SparsLinC library, written in C, has been developed for exploiting sparsity in automatic differentiation of codes. Issues pertaining to the proper interface to the library from Fortran programs are discussed, including the interpretation of Fortran INTEGERs as C pointers, and the representation of Fortran precisions in C. The Appendix contains the full set of Fortran Interfaces to the SparsLinC library.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM196.ps.Z"} |
| title | = | "ADIFOR Working Note No. 2: Using ADIFOR to Compute Dense and Sparse Jacobians", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-TM-158", | |
| year | = | "1992"} |
| title | = | "ADIFOR Working Note No. 3: Using ADIFOR to Compute Dense and Sparse Jacobians", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-TM-159", | |
| year | = | "1992"} |
| title | = | "ADIFOR Working Note No. 7: Extending Compile-Time Reverse Mode and Exploiting Partial Separability in ADIFOR", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-TM-163", | |
| year | = | "1992"} |
| author | = | "C. Bischof and A. Carle and P. Khademi and A. Mauer and P. Hovland", | |
| title | = | "ADIFOR 2.0 User's Guide (Rev. C)", | |
| number | = | "ANL/MCS-TM-192", | |
| month | = | "August", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation is a technique for computing the derivatives of functions described by computer programs. ADIFOR implements automatic differentiation by transforming a collection of FORTRAN 77 subroutines that compute a function f into new FORTRAN 77 subroutines that compute the derivatives of the outputs of f with respect to a specified set of inputs of f. This guide describes step by step how to use version 2.0 of ADIFOR to generate derivative code. Familiarity with UNIX and FORTRAN 77 is assumed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM192.ps.Z"] |
| author | = | "D. W. Braun and G. W. Crabtree and H. G. Kaper and A. E. Koshelev and G. K. Leaf and D. M. Levine and V. M. Vinokur", | |
| title | = | "The Structure of a Moving Vortex Lattice", | |
| number | = | "ANL/MCS-TM-211", | |
| month | = | "November", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Numerical solutions of the time-dependent Ginzburg-Landau equations show a new mechanism for plastic motion of a driven vortex lattice in a clean superconductor. The mechanism, which involves the creation of a defect superstructure, is intrinsic to the moving vortex lattice and is independent of bulk pinning. Other structural features found in the solutions include a reorientation of the vortex lattice and a gradual healing of lattice defects under the influence of a transport current.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM211.ps.Z"} |
| author | = | "E. Coskun and M. K. Kwong", | |
| title | = | "Parallel Solution of the Time-dependent Ginzburg-Landau Equations and Other Experiences Using BlockComm-Chameleon and PCN on the IBM SP, Intel iPSC/860, and Clusters of Workstations", | |
| number | = | "ANL-95/49", | |
| month | = | "September", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Time-dependent Ginzburg-Landau (TDGL) equations are considered for modeling a thin-film finite size superconductor placed under magnetic field. the problem then leads to the use of so-called natural boundary conditions. Computational domain is partitioned into subdomains and bond variables are used in obtaining the corresponding discrete system of equations. An efficient time-differencing method based on the Forward Euler method is developed. Finally, a variable strength magnetic field resulting in a vortex motion in Type II High T\_c superconducting films is introduced. We tackled our problem using two different state-of-the-art parallel computing tools: BlockComm/Chameleon and PCN. We had access to two high-performance distributed memory supercomputers: the Intel iPSC/860 and IBM SP1. We also tested the codes using, as a parallel computing environment, a cluster of Sun Sparc workstations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9549.ps.Z"} |
| author | = | "I. T. Foster and B. R. Toonen", | |
| title | = | "Load-Balancing Algorithms for the Parallel Community Climate Model", | |
| number | = | "ANL/MCS-TM-190", | |
| month | = | "January", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Implementations of climate models on scalable parallel computer systems can suffer from load imbalances resulting from temporal and spatial variations in the amount of computation required for physical parameterizations such as solar radiation and convective adjustment. We have developed specialized techniques for correcting such imbalances. These techniques are incorporated in a general-purpose, programmable load-balancing library that allows the mapping of computation to processors to be specified as a series of maps generated by a programmer-supplied load-balancing module. The communication required to move from one map to another is performed automatically by the library, without programmer intervention. In this paper, we describe the load-balancing problem and the techniques that we have developed to solve it. We also describe specific load-balancing algorithms that we have developed for PCCM2, a scalable parallel implementation of the Community Climate Model, and present experimental results that demonstrate the effectiveness of these algorithms on parallel computers. The load-balancing library developed in this work is available for use in other climate models.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM190.ps.Z"} |
| author | = | "I. Foster and J. Garnett and S. Tuecke", | |
| title | = | "Nexus User's Guide", | |
| number | = | "ANL/MCS-TM-204", | |
| month | = | "February", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This document describes the command line arguments and other features that are common to any program that incorporates the Nexus runtime library. It is divided into sections describing the execution, debugging, tuning, and profiling of such programs. It is not intended as a compiler writer's guide, and does not include any information on the Nexus interface or other internal details.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM204.ps.Z"} |
| author | = | "I. Foster and C. Kesselman and S. Tuecke", | |
| title | = | "Nexus: Runtime Support for Task-Parallel Programming Languages", | |
| number | = | "ANL/MCS-TM-205", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A runtime system provides a parallel language compiler with an interface to the low-level facilities required to support interaction between concurrently executing program components. Nexus is a portable runtime system for task-parallel programming languages. Distinguishing features of Nexus include its support for multiple threads of control, dynamic processor acquisition, dynamic address space creation, a global memory model via interprocessor references, and asynchronous events. In addition, it supports heterogeneity at multiple levels, allowing a single computation to utilize different programming languages, executables, processors, and network protocols. Nexus is currently being used as a compiler target for two task-parallel languages: Fortran M and Compositional C++. In this report, we present the Nexus design, outline techniques used to implement Nexus on parallel computers, show how it is used in compilers, and compare its performance with that of another runtime system.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM205.ps.Z"> |
| author | = | "The PORTS Consortium", | |
| title | = | "The PORTS0 Interface", | |
| number | = | "ANL/MCS-TM-203", | |
| month | = | "Feb.", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The PORTS (POrtable RunTime System) group was established to address the problems of constructing a common runtime system to be used as a compiler target for various task- and data-parallel languages. One result of this group's efforts is the definition of an applications programming interface, the PORTS level-zero interface (PORTS0). This interface comprises lightweight thread functions and a core set of reentrant library routines. This report describes the PORTS0 interface.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM203.ps.Z"} |
| author | = | "W. Gropp", | |
| title | = | "Users Manual for doctext: Producing Documentation from C Source Code", | |
| number | = | "ANL/MCS-TM-206", | |
| month | = | "March", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " One of the major problems that software library writers face, particularly in a research environment, is the generation of documentation. Producing good, professional-quality documentation is tedious and time consuming. Often, no documentation is produced. For many users, however, much of the need for documentation may be satisfied by a brief description of the purpose and use of the routines and their arguments. Even for more complete, hand-generated documentation, this information provides a convenient starting point. We describe here a tool that may be used to generate documentation about programs written in the C language. It uses a structured comment convention that preserves the original C source code and does not require any additional files. The markup language is designed to be an almost invisible structured comment in the C source code, retaining readability in the original source. Documentation in a form suitable for the Unix man program (nroff), LaTeX, and the World Wide Web (WWW) can be produced.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM206.ps.Z"} |
| author | = | "W. Gropp", | |
| title | = | "Users Manual for tohtml: Producing True Hypertext Documents from LaTeX", | |
| number | = | "ANL/MCS-TM-207", | |
| month | = | "March", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The World Wide Web has made it possible to use and disseminate documents as "hypertext." One of the major advantages of hypertext over conventional text is that references to other documents or items can be linked directly into the document, allowing the easy retrieval of related information. A collection of documents can also be read this way, jumping from one document to another based on the interests of the reader. This does require that the hypertext documents be extensively cross-linked. Unfortunately, most existing documents are designed as linear documents. Even worse, most authors still think of documents as linear structures, to be read from front to back. To deal with this situation, a number of tools have been created that take documents in an existing word-processing system or markup language and generate "HTML," the hypertext markup language used on the Web. While this process makes a single document available in a convenient form on the Web, it does not give access to cross-document linking, a major advantage of hypertext. This manual describes a program, tohtml, that takes LaTeX input files, as well as files of link information, and produces a hypertext document that can contain extensive cross-links. A related program, doctext, aids in the generation of manual pages that can be referenced by a LaTeX document.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM207.ps.Z"} |
| author | = | "W. Gropp", | |
| title | = | ""Users Manual for bfort: Producing Fortran Interfaces to C Source Code", | |
| number | = | " ANL/MCS-TM-208", | |
| month | = | "March", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In many applications, the most natural computer language to write in may be different from the most natural language to provide a library in. For example, many scientific computing applications are written in Fortran, while many software libraries---particularly those dealing with complicated data structures or dynamic memory management---are written in C. Providing an interface so that Fortran programs can call routines written in C can be a tedious and error-prone process. We describe here a tool that automatically generates a Fortran-callable wrapper for routines written in C, using only a small, structured comment and the declaration of the routine in C. This tool has been used on two large software packages, PETSc and the MPICH implementation of MPI.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM208.ps.Z"} |
| author | = | "Paul Hovland", | |
| title | = | ""Using ADIFOR 1.0 to Compute Hessians", | |
| number | = | "ANL/MCS-TM-195", | |
| month | = | "April", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " ADIFOR provides a simple means to produce code for the first derivatives of functions through the technique of automatic differentiation. However, the fact that ADIFOR currently cannot produce code to compute second derivatives limits its usefulness for certain applications. This paper describes how ADIFOR and related tools can be used to produce code that does compute second derivatives and discusses how to use this code. Conclusions are presented about the limitations of this method and how it might compare with second-derivative code produced directly by ADIFOR.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM195.ps.Z"] |
| author | = | "David Levine", | |
| title | = | "Users Guide to the PGAPack Parallel Genetic Algorithm Library", | |
| number | = | "ANL-95/18", | |
| month | = | "January", | |
| year | = | "1996", | |
| nstitution | = | "Argonne National Laboratory", | |
| Abstract | = | " PGAPack is a parallel genetic algorithm library that is intended to provide most capabilities desired in a genetic algorithm package, in an integrated, seamless, and portable manner. Key features of PGAPack are the ability to be called from Fortran or C, that it is executable on uniprocessors, multiprocessors, multicomputers, and workstation networks, and that it has binary-, integer-, real-, and character-valued native data types. Moreover, it has object-oriented data structure neutral design, parameterized population replacement, and multiple choices for selection, crossover, and mutation operators. It is easy to integrate hill-climbing heuristics and has an easy-to-use interface for novice and application users. It also has multiple levels of access for expert users, full extensibility to support custom operators and new data types, extensive debugging facilities, and a large set of example problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9518.ps.Z"} |
| author | = | "David A. Lifka and Mark W. Henderson and Karen Rayl", | |
| title | = | "Users Guide to the Argonne SP Scheduling System", | |
| number | = | "ANL/MCS-TM-201", | |
| imonth | = | "May ", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " During the past five years scientists discovered that modern UNIX workstations connected with ethernet and fiber networks could provide enough computational performance to compete with the supercomputers of the day. As this concept became increasingly popular, the need for distributed queuing and scheduling systems became apparent. Today, supercomputers, such as Argonne National Laboratory's IBM SP system, can provide more CPU and networking speed than can be obtained from these networks of workstations. These modern supercomputers look like clusters of workstations, however, so developers felt that the scheduling systems that were previously used on clusters of workstations should still apply. After trying to apply some of these scheduling systems to Argonne's SP environment, it became obvious that these two computer environments have very different scheduling needs. Recognizing this need and realizing that no one has addressed it, we developed a new scheduling system. The approach taken in creating this system was unique in that user input and interaction were encouraged throughout the development process. Thus, a scheduler was built that actually worked the way the users wanted it to work. This document serves a dual purpose. It is both a user's guide and an administrator's guide for the ANL SP scheduling system.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM201.ps.Z"} |
| author | = | "W. McCune", | |
| title | = | "A Case Study in Automated Theorem Proving: A Difficult Problem about Commutators", | |
| Abstract | = | " This paper shows how the automated deduction system OTTER was used to prove the group theory theorem | |
| x**3 | = | e => [[[y,z],u],v] = e, where e is the identity, and [x,y] is the commutator x'y'xy. This is a difficult problem for automated provers, and several lengthy searches were run before a proof was found. Problem formulation and search strategy played a key role in the success. I believe that ours is the first automated proof of the theorem.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM202.ps.Z"] |
| author | = | "Michael Paul Mesnier", | |
| title | = | "The Network-Enabled Optimization System Server", | |
| number | = | "ANL/MCS-TM-210", | |
| month | = | "August", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Mathematical optimization is a technology under constant change and advancement, drawing upon the most efficient and accurate numerical methods to date. Further, these methods can be tailored for a specific application or generalized to accommodate a wider range of problems. This perpetual change creates an ever growing field, one that is often difficult to stay abreast of. Hence, the impetus behind the Network-Enabled Optimization System (NEOS) server, which aims to provide users, both novice and expert, with a guided tour through the expanding world of optimization. The NEOS server is responsible for bridging the gap between users and the optimization software they seek. More specifically, the NEOS server will accept optimization problems over the Internet and return a solution to the user either interactively or by e-mail. This paper discusses the current implementation of the server.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM210.ps.Z"} |
| author | = | "G. D. Pusch and C. Bischof and A. Carle", | |
| title | = | "On Automatic Differentiation of Codes with COMPLEX Arithmetic with Respect to Real Variables", | |
| number | = | "ANL/MCS-TM-188", | |
| month | = | "June", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We explore what it means to apply automatic differentiation with respect to a set of real variables to codes containing complex arithmetic. That is, both dependent and independent variables with respect to differentiation are real variables, but in order to exploit features of complex mathematics, part of the code is expressed by employing complex arithmetic. We investigate how one can apply automatic differentiation to complex variables if one exploits the homomorphism of the complex numbers C onto R**2. It turns out that, by and large, the usual rules of differentiation apply, but subtle differences in special cases arise for sqrt(), abs(), and the power operator.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM188.ps.Z"} |
| author | = | "Christian H. Bischof and Alan Carle and Peyvand M. Khademi and Gordon Pusch", | |
| title | = | "Automatic Differentiation: Obtaining Fast and Reliable Derivatives---Fast", | |
| number | = | "MCS-P484-1194", | |
| month | = | "November", | |
| year | = | "1994", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this paper, we introduce automatic differentiation as a method for computing derivatives of large computer codes. After a brief discussion of methods of differentiating codes, we review automatic differentiation and introduce the ADIFOR automatic differentiation tool. We highlight some applications of ADIFOR to large industrial and scientific codes, and discuss the effectiveness and performance of our approach. Finally, we discuss sparsity in automatic differentiation and introduce the SparsLinC library.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P484.ps.Z"} |
| author | = | "Ali Bouaricha and Jorge J. More", | |
| title | = | "Impact of Partial Separability on Large-Scale Optimization", | |
| journal | = | "J. Comput. Optimization Appl.", | |
| volume | = | "7", | |
| issue | = | "1", | |
| year | = | "1997", | |
| pages | = | "27-40", | |
| Abstract | = | " ELSO is an environment for the solution of large-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partial separability structure of the function to compute the gradient efficiently using automatic differentiation. We demonstrate ELSO's efficiency by comparing the various options available in ELSO. Our conclusion is that the hybrid option in ELSO provides performance comparable to the hand-coded option, while having the significant advantage of not requiring a hand-coded gradient or the sparsity pattern of the partially separable function. In our test problems, which have carefully coded gradients, the computing time for the hybrid AD option is within a factor of two of the hand-coded option.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P487.ps.Z"} |
| author | = | "C. Bischof and A. Bouaricha and P. M. Khademi and J. J. More' ", | |
| title | = | "Computing Gradients in Large-Scale Optimization Using Automatic Differentiation", | |
| journal | = | "INFORMS J. on Computing", | |
| volume | = | "9", | |
| issue | = | "2", | |
| yeaer | = | " 1997", | |
| Abstract | = | " The accurate and efficient computation of gradients for partially separable functions is central to the solution of large-scale optimization problems, since these functions are ubiquitous in large-scale problems. We describe two approaches for computing gradients of partially separable functions via automatic differentiation. In our experiments we employ the ADIFOR (Automatic Differentiation of Fortran) tool and the SparsLinC (Sparse Linear Combination) library. We use applications from the MINPACK-2 test problem collection to compare the numerical reliability and computational efficiency of these approaches with hand-coded derivatives and approximations based on differences of function values. Our conclusion is that automatic differentiation is the method of choice, providing code for the efficient computation of the gradient without the need for tedious hand coding.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P488.ps.Z"} |
| author | = | "M. K. Kwong and B. Lin", | |
| title | = | "W-Transform Method for Feature-oriented Multiresolution Image Retrieval", | |
| number | = | "MCS-P489-0195", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We present a local-feature-oriented image indexing and retrieval method based on Kwong and Tang's W-transform. Multiresolution histogram comparison is an effective method for content-based image indexing and retrieval. However, most recent approaches perform multiresolution analysis for whole images but do not exploit the local features present in the images. Since W_transform is featured by its ability to handle images of arbitrary size, with no periodicity assumptions, it provides a natural tool for analyzing local image features and building indexing systems based on such features. In our approach, the histograms of the local features of images are used in the indexing system. The system not only can retrieve images that are similar or identical to the query images but also can retrieve images that contain features specified in the query images, even if the retrieved images as a whole might be very different from the query images. The local-feature-oriented method also provides a speed advantage over the global multiresolution histogram comparison method. The feature-oriented approach is expected to be applicable in managing large-scale image systems such as video databases and medical image databases.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P489.ps.Z"} |
| author | = | "I. Foster and C. Kesselman", | |
| title | = | "Language Constructs and Runtime Systems for Compositional Parallel Programming", | |
| booktitle | = | "Proc. CONPAR~94, LNCS 854", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1994", | |
| pages | = | " 5--16", | |
| Abstract | = | " In task-parallel programs, diverse activities can take place concurrently, and communication and synchronization patterns are complex and not easily predictable. Previous work has identified compositionality as an important design principle for task-parallel programs. In this paper, we discuss alternative approaches to the realization of this principle. We first provide a review and critical analysis of Strand, an early compositional programming language. We examine the strengths of the Strand approach and also its weaknesses, which we attribute primarily to the use of a specialized language. Then, we present an alternative programming language framework that overcomes these weaknesses. This framework uses simple extensions to existing sequential languages (C++ and Fortran) and a common runtime system to provide a basis for the construction of large, task-parallel programs. We also discuss the run-time system techniques required to support these languages on parallel and distributed computer systems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P490.ps.Z"} |
| author | = | "P. Hovland and C. Bischof and D. Spiegelman and M. Casella", | |
| title | = | "Efficient Derivative Codes through Automatic Differentiation and Interface Contraction: An Application in Biostatistics", | |
| journal | = | "SIAM J. Sci. Comput.", | |
| volume | = | "18", | |
| issue | = | "4", | |
| year | = | "1997", | |
| pages | = | "1056-1066", | |
| Abstract | = | " Developing code for computing the first- and higher-order derivatives of a function by hand cn be very time-consuming and is prone to errors. Automatic differentiation has proven capable of producing derivative codes with very little effort on the part of the user. Automatic differentiation avoids the truncation errors characteristic of divided-difference approximations. However, the derivative code produced by automatic differentiation can be significantly less efficient than one produced by hand. This shortcoming may be overcome by utilizing insight into the high-level structure of a computation. This paper focuses on how to take advantage of the fact that the number of variables passed between subroutines frequently is small compared with the number of the variables wit respect to which we wish to differentiate. Such an "interface contraction," coupled with the associativity of the chain rule for differentiation, allows us to apply automatic differentiation in a more judicious fashion, resulting in much more efficient code for the computation of derivatives. A case study involving a program for maximizing a logistic-normal likelihood function developed from a problem in nutritional epidemiology is examined, and performance figures are presented. We conclude with some directions for future study.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P491.ps.Z"} |
| author | = | "J. N. Lyness and S. Joe", | |
| title | = | "Triangular Canonical Forms for Lattice Rules of Prime-Power Order", | |
| journal | = | "Math. Comp.", | |
| volume | = | "65", | |
| month | = | "January", | |
| year | = | "1996", | |
| pages | = | "165--178", | |
| Abstract | = | " In this paper we develop a theory of t-cycle D-Z representations for s-dimensional lattice rules of prime-power order. Of particular interest are canonical forms that, by definition, have a D>-matrix consisting of the nontrivial invariants. Among these is a family of triangular forms, which, besides being canonical, have the defining property that their Z-matrix is a column-permuted version of a unit upper-triangular matrix. Triangular forms may be obtained constructively by using sequences of elementary transformations ased on elementary matrix algebra. Our main result is to define a unique canonical form for prime-power rules. This ultratriangular form is a triangular form, is easy to recognize, and may be derived in a straightforward manner.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P492.ps.Z"} |
| author | = | "W. McCune and R. Padmanabhan", | |
| title | = | "Single Identities for Lattice Theory and for Weakly Associative Lattices", | |
| journal | = | "Algebra Universalis", | |
| volume | = | "36", | |
| year | = | "1996", | |
| pages | = | "436-449", | |
| Abstract | = | " We present a single identity for the variety of all lattices that is much simpler than those previously known to us. We also show that the variety of weakly associative lattices is one-based, and we present a generalized one-based theorem for subvarieties of weakly associative lattices that can be defined with absorption laws. The automated theorem-proving program Otter was used in a substantial way to obtain the results.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P493.ps.Z"} |
| author | = | "A. J. Conley and H. B. Keller", | |
| title | = | "Wavy Taylor Vortices in Plane Couette Flow", | |
| number | = | "MCS-P495-0195", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Path-following techniques applied to a spectral approximation of the solution of the Navier-Stokes Equations have revealed the existence of a new class of solutions to the plane Couette flow problem.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P495.ps.Z"} |
| title | = | "Virtual Reality Visualization of Accelerator Magnets (MCS-P496-0295)", | |
| booktitle | = | " Proc. High Performance Computing Multiconference", | |
| year | = | "to appear", | |
| Abstract | = | " We describe the use of the CAVE virtual reality visualization environment as an aid to the design of accelerator magnets. We have modeled an elliptical multipole wiggler magnet being designed for use at the Advanced Photon Source at Argonne National Laboratory. The CAVE environment allows us to explore and interact with the 3-D visualization of the magnet. Capabilities include changing the number of periods of the magnet displayed, changing the icons used for displaying the magnetic field, and changing the current in the electromagnet and observing the effect on the magnetic field and particle beam trajectory through the field.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P496.ps.Z"} |
| author | = | "E. T. Olsen and B. Lin", | |
| title | = | "A Wavelet Phase Filter for Emission Tomography", | |
| number | = | "MCS-P497-0295", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The presence of a high level of noise is a characteristic in some tomographic imaging techniques such as positron emission tomography. Wavelet methods can smooth out noise while preserving significant features of images. Mallat et al. proposed a wavelet-based denoising scheme exploiting wavelet modulus maxima, but the scheme is sensitive to noise. In this study, we explore the properties of wavelet phase, with a focus on reconstruction of emission tomography images. Specifically, we show that the wavelet phase of regular Poisson noise under a Haar-type wavelet transform converges in distribution to a random variable uniformly distributed on [0, 2 pi). We then propose three wavelet-phase-based denoising schemes which exploit this property: edge tracking, local phase variance thresholding, and scale phase variation thresholding. Numerical results are also presented. The numerical experiments indicate that wavelet-phase techniques show promise for wavelet based denoising methods.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P497.ps.Z"} |
| author | = | "D. A. Lifka", | |
| title | = | "The ANL/IBM SP Scheduling System", | |
| number | = | "MCS-P498-0395", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " During the past five years scientists discovered that modern UNIX workstations connected with ethernet and fibre networks could provide enough computational performance to compete with the supercomputers of the day. As this concept became increasingly popular, the need for distributed queuing and scheduling systems became apparent. Systems such as DQS from Florida State were developed and worked very well. Today, supercomputers, like Argonne National Laboratory's IBM SP system, can provide more CPU and networking speed than can be obtained from these networks of workstations. These modern supercomputers look like clusters of workstations, however, so developers felt that the scheduling systems that were previously used on clusters of workstations should still apply. After trying to apply some of these scheduling systems to Argonne's SP environment, it became obvious that these two computer environments have very different scheduling needs. Recognizing this need and realizing that no one has addressed it, I developed a new scheduling system. The approach taken in creating this system was unique in that user input and interaction were encouraged throughout the development process. Thus, a scheduler was built that actually "worked" the way the users wanted it to work.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P498.ps.Z"} |
| author | = | "William Gropp", | |
| title | = | "An Introduction to Performance Debugging for Parallel Computers (MCS-P500-0295)", | |
| booktitle | = | " Proc. of the ICASE/LaRC Workshop on Parallel Numerical Algorithms", | |
| year | = | "to appear", | |
| Abstract | = | " Programming parallel computers for performance is a difficult task that requires careful attention to both single-node performance and data exchange between processors. This paper discusses some of the sources of poor performance, ways to identify them in an application, and a few ways to address these issues.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P500.ps.Z"} |
| author | = | "Shannon Bradshaw and Thomas Canfield and John Kokinis and Terrence Disz", | |
| title | = | "An Interactive Virtual Environment for Finite Element Analysis", | |
| booktitle | = | " Proc. High Performance Computing 1995 Grand Challenges in Computer Simulation", | |
| year | = | "1995", | |
| pages | = | " 477--482", | |
| Abstract | = | " Virtual environments (VE) provide a powerful human-computer interface that opens the door to exciting new methods of interaction with high-performance computing applications in several areas of research. We are interested in the use of virtual environments as a user interface to real-time simulations used in rapid prototyping procedures. Consequently, we are developing methods for coupling finite element models of complex mechanical systems with a VE interface for real-time interaction.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P501.ps.Z"} |
| author | = | "Terrence Disz and Michael Papka and Rick Stevens and Michael Pellegrino and Valerie Taylor", | |
| title | = | "Virtual Reality Visualization of Parallel Molecular Dynamics Simulation", | |
| booktitle | = | "Proc. High-Performance Computing '95", | |
| year | = | "1995", | |
| pages | = | "483--487", | |
| Abstract | = | " When performing communications mapping experiments for massively parallel processors, it is important to be able to visualize the mappings and resulting communications. In a molecular dynamics model, visualization of the atom to atom interaction and the processor mappings provides insight into the effectiveness of the communications algorithms. The basic quantities available for visualization in a model of this type are the number of molecules per unit volume, the mass, and velocity of each molecule. The computational information available for visualization is the atom to atom interaction within each time step, the atom to processor mapping, and the energy rescaling events. We use the CAVE (CAVE Automatic Virtual Environment) to provide interactive, immersive visualization experiences.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P502.ps.Z"} |
| author | = | "Valerie E. Taylor and Rick Stevens and Thomas Canfield", | |
| title | = | "Performance Models of Interactive, Immersive Visualization for Scientific Applications", | |
| booktitle | = | "Proc. High Performance for Computer Graphics and Visualization Conference", | |
| year | = | "1995", | |
| editor | = | "M. Chen and P. Townsend and J. A. Vince", | |
| publisher | = | "Springer-Verlag", | |
| year | = | "1995", | |
| pages | = | "238--252", | |
| Abstract | = | " In this paper we develop a performance model for analyzing the end-to-end lag in a combined supercomputer/virtual environment. We first present a general model and then use this model to analyze the end-to-end lag of a finite element simulation that a user interacts in real time via the CAVE Automatic Virtual Environment. The simulation is executed on an IBM SP-2 parallel supercomputer. Our model decouples the viewpoint lag (not involving the simulation) from the interaction lag (using the results of the simulations). This model allows one to understand the relative contributions to end-to-end lag of the following components: rendering, tracking, network latency, simulation time, and various types of synchronization lags. The results of the study indicate that the rendering and network latency are the major contributors of the end-to-end lag.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P503.ps.Z"} |
| author | = | "S. A. Gabriel and A. S. Kydes", | |
| title | = | "A Nonlinear Complementarity Approach for the National Energy Modeling System", | |
| number | = | "MCS-P504-0395", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The National Energy Modeling System (NEMS) is a large-scale mathematical model that computes equilibrium fuel prices and quantities in the U.S. energy sector. At present, to generate these equilibrium values, NEMS sequentially solves a collection of linear programs and nonlinear equations. The NEMS solution procedure then incorporates the solutions of these linear programs and nonlinear equations in a nonlinear Gauss-Seidel approach. We describe how the current version of NEMS can be formulated as a particular nonlinear complementarity problem (NCP), thereby possibly avoiding current convergence problems. In addition, we show that the NCP format is equally valid for a more general form of NEMS. We also describe several promising approaches for solving the NCP form of NEMS based on recent Newton type methods for general NCPs. These approaches share the feature of needing to solve their direction-finding subproblems only approximately. Hence, they can effectively exploit the sparsity inherent in the NEMS NCP.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P504.ps.Z"} |
| author | = | "J. More' and Z. Wu", | |
| title | = | "Global Continuation for Distance Geometry Problems", | |
| journal | = | "SIAM J. Optim.", | |
| volume | = | "7", | |
| issue | = | " 3", | |
| year | = | "1997", | |
| pages | = | "814-836", | |
| Abstract | = | " Distance geometry problems arise in the interpretation of NMR data and in the determination of protein structure. We formulate the distance geometry problem as a global minimization problem with special structure, and show that global smoothing techniques and a continuation approach for global optimization can be used to determine solutions of distance geometry problems with a nearly 100% probability of success.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P505.ps.Z"} |
| author | = | "Man Kam Kwong and P. T. Peter Tang and Biquan Lin", | |
| title | = | "A Real-Time MPEG Software Decoder Using a Portable Message-Passing Library", | |
| number | = | "MCS-P506-0395", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We present a real-time MPEG software decoder that uses message-passing libraries such as MPL, p4, and MPI. the parallel MPEG decoder currently runs on the IBM SP system but can be easily ported to other parallel machines. This paper discusses our parallel MPEG decoding algorithm as well as the parallel programming environment under which it uses. Several technical issues are discussed, including balancing of decoding speed, memory limitation, I/O capacities, and optimization of MPEG decoding components. This project shows that a real-time portable software MPEG decoder is feasible in a general-purpose parallel machine.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P506.ps.Z"" |
| author | = | "Christian H. Bischof", | |
| title | = | "On the Automatic Differentiation of Computer Programs", | |
| number | = | "MCS-P507-0495", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation (AD) is a methodology for developing sensitivity-enhanced versions of arbitrary computer programs. In this paper, we provide some background information on AD and address some frequently asked questions. We introduce the ADIFOR and ADIC tools for the automatic differentiation of Fortran 77 and ANSI-C programs, respectively, and give an example of applying ADIFOR in the context of the optimization of multibody systems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P507.ps.Z"} |
| author | = | "Steven A. Gabriel", | |
| title | = | "An NE/SQP Method for the Bounded Nonlinear Complementarity Problem", | |
| number | = | "MCS-P508-0695", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of the nonlinear complementarity problem (NCP). NE/SQP is robust in the sense that its direction-finding subproblems are always solvable; in addition, the convergence rate of this method is Q-quadratic. In this paper we consider a generalized version of NE/SQP proposed by Pang and Qi that is suitable for the bounded NCP. We extend their work by demonstrating a stronger convergence result and then test a proposed method on several numerical problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P508.ps.Z"} |
| author | = | "I. T. Foster and B. Toonen and P. H. Worley", | |
| title | = | "Performance of Massively Parallel Computers for Spectral Atmospheric Models", | |
| journal | = | "J. Atmospheric and Oceanic Technology", | |
| volume | = | "13", | |
| issue | = | "5", | |
| year | = | "1996", | |
| pages | = | "1031-1045", | |
| Abstract | = | " Massively parallel processing (MPP) computer systems use high-speed interconnection networks to link hundreds or thousands of RISC microprocessors. With each microprocessor having a peak performance of 100 or more Mflops/sec, there is at least the possibility of achieving very high performance. However, the question of exactly how to achieve this performance remains unanswered. MPP systems and vector multiprocessors require very different coding styles. Different MPP systems have widely varying architectures and performance characteristics. For most problems, a range of different parallel algorithms is possible, again with varying performance characteristics. In this paper, we provide a detailed, fair evaluation of MPP performance for a weather and climate modeling application. Using a specially designed spectral transform code, we study performance on three different MPP systems: Intel Paragon, IBM SP2, and Cray T3D. We take great care to control for performance differences due to varying algorithmic characteristics. The results yield insights into MPP performance characteristics, parallel spectral transform algorithms, and coding style for MPP systems. We conclude that it is possible to construct parallel models that achieve multi-Gflops/sec performance on a range of MPPs, if the models are constructed to allow runtime selection of appropriate algorithms.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P509.ps.Z"} |
| author | = | "M. Garbey and H. G. Kaper", | |
| title | = | "Heterogeneous Domain Decomposition for Singularly Perturbed Elliptic Boundary Value Problems", | |
| journal | = | "SIAM J. Numer. Anal.", | |
| volume | = | "34", | |
| issue | = | "4 ", | |
| month | = | "August", | |
| year | = | "1997", | |
| pages | = | "1513-1544", | |
| Abstract | = | " A heterogeneous domain-decomposition method is presented for the numerical solution of singularly perturbed elliptic boundary value problems. The method, which is parallelizable at various levels, uses several ideas of asymptotic analysis. The subdomains match the domains of validity of the local ("inner" and "outer") asymptotic expansions, and cut-off functions are used to match solutions in neighboring subdomains. The positions of the interfaces, as well as the mesh widths, depend on the small parameter, e. On the subdomains, iterative solution techniques are used, which may vary from one subdomain to another. The global convergence rate depends on e. The method is illustrated on several two-dimensional singular perturbation problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P510.ps.Z"} |
| author | = | "A. J. Conley", | |
| title | = | "Centrifugal Destabilization and Restabilization of Plane Shear Flows", | |
| number | = | "MCS-P511-0395", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The flow of an incompressible viscous fluid between parallel plates becomes unstable when the plates are tumbled. As the tumbling rate increases, the flow restabilizes. This phenomenon is elucidated by path-following techniques. The solution of the Navier-Stokes equations is approximated by spectral techniques. The linear stability of these solutions is studied.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P511.ps.Z"} |
| author | = | "Christian H. Bischof and William T. Jones and Andrew Mauer and Jamshid Samareh-Abolhassani", | |
| title | = | "Experiences with the Application of the ADIC Automatic Differentiation Tool to the CSCMDO 3-D Volume Grid Generation Code", | |
| booktitle | = | "34th AIAA Aerospace Sciences Meeting and Exhibit", | |
| pages | = | "AIAA 96-0716", | |
| Abstraxt | = | ' Automatic differentiation (AD) is a methodology for developing reliable sensitivity-enhanced versions of arbitrary computer programs with little human effort. It can vastly accelerate the use of advanced simulation codes in multidisciplinary design optimization, since the time for generating and verifying derivative codes is greatly reduced. In this paper, we report on the application of the recently developed ADIC automatic differentiation tool for ANSI C programs to the CSCMDO multiblock three-dimensional volume grid generator. The ADIC-generated code can easily be interfaced with Fortran derivative codes generated with the ADIFOR AD tool for FORTRAN 77 programs, thus providing efficient sensitivity-enhancement techniques for multilanguage, multidiscipline problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P512.ps.Z"} |
| author | = | "Robert K. Gjertsen Jr. and Mark T. Jones and Paul E. Plassmann", | |
| title | = | "Parallel Heuristics for Improved, Balanced Graph Colorings", | |
| number | = | "MCS-P513-0595. | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The computation of good, balanced graph colorings is an essential part of many algorithms required in scientific and engineering applications. Motivated by an effective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under the P-RAM computational model as the scalable coloring heuristic introduced by Jones and Plassmann (JP). We present experimental results performed on the Intel DELTA that demonstrate that this new heuristic consistently generates better colorings and requires only slightly more time than the JP heuristic. In the second part of the paper we introduce two new parallel color-balancing heuristics, PDR(k) and PLF(k). We show that these heuristics have the desirable property that they do not increase the number of colors used by an initial coloring during the balancing process. We present experimental results that show that these heuristics are very effective in obtaining balanced colorings and, in addition, exhibit scalable performance.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P513.ps.Z"} |
| author | = | "Juan Mario Restrepo and Gary K. Leaf and Andreas Griewank", | |
| title | = | "Circumventing Storage Limitations in Variational Data Assimilation Studies", | |
| number | = | "MCS-P515-0595", | |
| Abstract | = | " The aim of data assimilation is to infer the state of a system from a geophysical model and possibly incomplete or nonuniformly distributed spatiotemporal observational data. Used extensively in engineering control theory applications, data assimilation has relatively recently been introduced into meteorological forecasting, natural-resource recovery modeling, and climate dynamics. Variational data assimilation is a promising assimilation technique in which it is assumed that the state of the system is an extrema of a carefully chosen objective function. Provided that an adjoint model is available, the required model gradients can be computed by integrating the model forward and its adjoint backward. The gradients are then used to extremize the cost function with a suitable iterative or conjugate gradient solver. The problem we address in this study is the explosive growth in both on-line computer memory and remote storage requirements of large-scale assimilation studies. This imposes a severe physical limitation on the size of assimilation studies, even on the largest computers. By using a recursive strategy, a schedule can be constructed that enables the forward/adjoint model runs to be performed in such a way that storage requirements can be traded for longer computational times. This generally applicable strategy enables data assimilation studies on significantly larger domains than would otherwise be possible given particular hardware constraints. We show that this tradeoff is indeed viable and that when the schedule is optimized, the storage and computational times grow at most logarithmically.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P515.ps.Z"} |
| author | = | "J. N. Lyness and L. M. Delves", | |
| title | = | "On the Implementation of a Modified Sag-Szekeres Quadrature Method", | |
| number | = | "MCS-P516-0595", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We describe a modified Sag-Szekeres multidimensional quadrature algorithm and discuss its implementation as a general-purpose library procedure on serial and parallel architectures. Examples illustrate its effectiveness for both smooth and singular integrands.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P516.ps.Z"} |
| author | = | "R. Padmanabhan and W. McCune", | |
| title | = | "Automated Reasoning about Cubic Curves", | |
| journal | = | "Computers Math. Applic.", | |
| volume | = | :29", | |
| issue | = | "2", | |
| pages | = | "17-26", | |
| year | = | "1995"} |
| author | = | "W. McCune and R. Padmanabhan", | |
| title | = | "An Equational Characterization of the Conic Construction on Cubic Curves", | |
| number | = | "MCS-P517-0595", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this paper, we prove that if f and g are two 5-ary Steiner laws on an elliptic curve Gamma sharing a common | |
| idempotent, then f | = | g. | |
| We use a new rule of inference rule | = | (gL)=>, extracted from a powerful local-to-global principle in algebraic geometry. This rule is implemented in the theorem-proving program OTTER. Then we use OTTER to automatically prove the uniqueness of the 5-ary Steiner law on an elliptic curve. Very much like the binary case, this theorem provides an algebraic characterization of a geometric construction process involving conics and cubics. The well-known theorem of the uniqueness of the group law on such a curve is shown to be a consequence of this result.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P517.ps.Z"} |
| author | = | "Tomasz Bieleck and Li M. Song and Stephen S. T. Yau and and Man Kam Kwong", | |
| title | = | "Random Wavelet Transforms, Algebraic Geometric Coding, and Their Applications in Signal Compression and De-Noising", | |
| booktitle | = | " Proc. International Conference on Control and Information", | |
| year | = | "1995", | |
| publisher | = | "Chinese University Press", | |
| pages | = | "283--289", | |
| Abstract | = | " The concepts of random wavelet transforms and discrete random wavelet transforms are introduced. It is shown that these transforms can lead to simultaneous compression and de-noising of signals that have been corrupted with fractional noises. Potential applications of algebraic geometric coding theory to encode the ensuing data are also discussed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P518.ps.Z"} |
| author | = | "Christian H. Bischof and Peyvand M. Khademi and Ali Bouaricha and Alan Carle", | |
| title | = | "Efficient Computation of Gradients and Jacobians by Transparent Exploitation of Sparsity in Automatic Differentiation", | |
| journal | = | "Optimization Methods and Software", | |
| volume | = | "7", | |
| year | = | "1996", | |
| pages | = | "1-39", | |
| Abstract | = | " Automatic differentiation (AD) is a technique that augments computer codes with statements for the computation of derivatives. The computational workhorse of AD-generated codes for first-order derivatives is the linear combination of vectors. For many large-scale problems, the vectors involved in this operation are inherently sparse. If the underlying function is a partially separable one (e.g., if its Hessian is sparse), many of the intermediate gradient vectors computed by AD will also be sparse, even though the final gradient is likely to be dense. For large Jacobians computations, every intermediate derivative vector is usually at least as sparse as the least sparse row of the final Jacobian. In this paper, we show that transparent exploitation of the sparsity inherent in derivative computation can result in dramatic gains in runtime and memory savings. For a set of gradient problems exhibiting implicit sparsity, we report on the runtime and memory requirements of computing the gradients with the ADIFOR (Automatic D/fferentiation of FORtran) tool, both with and without employing the SparsLinC (Sparse Linear Combinations) library, and show that SparsLinC can reduce runtime and memory costs by orders of magnitude. We also compute sparse Jacobians using the SparsLinC-based approach---in the process, automatically detecting the sparsity structure of the Jacobian---and show that these Jacobian results compare favorably with those of previous techniques that require a priori knowledge of the sparsity structure of the Jacobian.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P519.ps.Z"] |
| author | = | "Jorge J. More' and Zhijun Wu", | |
| title | = | "Epsilon-Optimal Solutions to Distance Geometry Problems via Global Continuation", | |
| booktitle | = | "Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding", | |
| editor | = | "P. M. Pardalos and D. Shalloway and G. Xue", | |
| publisher | = | "American Mathematical Society", | |
| year | = | "1995", | |
| pages | = | "151--168", | |
| Abstract | = | " We show that a continuation approach to global optimization with global smoothing techniques can be used to obtain e-optimal solutions to distance geometry problems. We show that determining an e-optimal solution is still an NP-hard problem when e is small. A discrete form of the Gaussian transform is proposed based on the Hermite form of Gaussian quadrature. We show that the modified transform can be used whenever the transformed functions cannot be computed analytically. Our numerical results show that the discrete Gauss transform can be used to obtain e-optimal solutions for general distance geometry problems, and in particular, to determine the three-dimensional structure of protein fragments.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P520.ps.Z"} |
| author | = | "Paul Hovland and Steve Altus and Christian Bischof and Ilan Kroo", | |
| title | = | "Using Automatic Differentiation with the Quasi-Procedural Method for Multidisciplinary Design Optimization",c | |
| booktitle | = | "Proc. 34th AIAA Aerospace Sciences Meeting" | |
| year | = | "1996", | |
| pages | = | "AIAA 96-0090", | |
| Abstract | = | " As computers have become increasingly powerful, the field of design optimization has moved toward higher fidelity models in the early stages of design. One way in which this movement is manifested is in the increasing popularity of multidisciplinary design optimization (MDO). Because the models used in MDO are large and complicated, a modular design is desirable. There are many design parameters to optimize, and the robustness of the method requires that derivatives be computed accurately and efficiently. This paper describes how the quasi-procedural program architecture developed by Takai and Kroo and the technique of automatic differentiation can be combined to address these needs effectively. The two techniques are explained, the manner in which they were integrated into a single framework is described, and the result of using this framework for an optimization problem in airplane design is presented.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P521.ps.Z"} |
| author | = | "Larry Wos", | |
| title | = | "The Power of Combining Resonance with Heat", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "17", | |
| issue | = | "1", | |
| pages | = | "23-81", | |
| year | = | "1996", | |
| Abstract | = | " In this article, I present experimental evidence of the value of combining two strategies each of which has proved powerful in various contexts. The resonance strategy gives preference (for directing a program's reasoning) to equations or formulas that have the same shape (ignoring variables) as one of the patterns supplied by the researcher to be used as a resonator. The hot list strategy rearranges the order in which conclusions are drawn, the rearranging caused by immediately visiting and, depending on the value of the heat parameter, even immediately revisiting a set of input statements chosen by the researcher; the chosen statements are used to complete applications of inference rules rather than to initiate them. Combining these two strategies often enables an automated reasoning program to attack deep questions and hard problems with far more effectiveness than using either alone. The use of this combination in the context of cursory proof checking produced most unexpected and satisfying results, as I show here. I present the material (including commentary) in the spirit of excerpts from an experimenter's notebook, thus meeting the frequent request to illustrate how a researcher can make wise choices from among the numerous options offered by McCune's automated reasoning program OTTER. I include challenges and topics for research and, to aid the researcher, in the Appendix a sample input file and a number of intriguing proofs.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P522.ps.Z"} |
| author | = | "William D. Reynolds Jr.", | |
| title | = | "Image Compression Using the W-Transform", | |
| number | = | "MCS-P524-0695", | |
| month | = | "October", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We present the W-transform for a multiresolution signal decomposition. One of the differences between the wavelet transform and W-transform is that the W-transform leads to a nonorthogonal signal decomposition. Another difference between the two is the manner in which the W-transform handles the endpoints (boundaries) of the signal. This approach does not restrict the length of the signal to be a power of two. Furthermore, it does not call for the extension of the signal; thus, the W-transform is a convenient tool for image compression. We present the basic theory behind the W-transform and include experimental simulations to demonstrate its capabilities.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P524.ps.Z"} |
| author | = | "S. Zafar and Y-Q. Zhang and B. Jabbari", | |
| title | = | "Block-Classified Motion Compensation Scheme for Digital Video", | |
| number | = | "MCS-P525-0695", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A novel scheme for block-based motion compensation is introduced in which a block is classified according to the energy that is directly related to the motion activity it represents. This classification allows more flexibility in controlling the bit rate and the signal-to-noise ratio and results in a reduction in motion search complexity. The method introduced is not dependent on the particular type of motion search algorithm implemented and can thus be used with any method assuming that the underlying matching criteria used is minimum absolute difference. It has been shown that the method is superior to a simple motion compensation algorithm where all blocks are motion compensated regardless of the energy resulting after the displaced difference.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P525.ps.Z"} |
| author | = | "J. Chen and M. Griem and J. Aarsvold and C.-T. Chen and T. Disz and R. Hudson and M. K. Kwong and B. Lin", | |
| title | = | "A High-Performance Image Analysis and Visualization Engine for Three-dimensional Microscopy Imaging", MCS-P526-0695. | |
| booktitle | = | "Proc. IASTED Conf. on Signal and Image Processing", | |
| year | = | "1995", | |
| Abstract | = | " Three-dimensional microscopy imaging is important for understanding complex biological assemblies. Computers and digital image acquisition systems have made possible the three-dimensional reconstruction of images obtained from optical microscopes. However, since processing such images requires tremendous CPU, storage, and I/O capacities, a high-performance computing facility is necessary in order to achieve real-time performance. But it is uneconomical (if not impossible) for a medical center or a biological research institution to operate a large computer system at the present time. The advent of high-speed networks such as asynchronous transfer mode (ATM) enables biologists and radiologists to use remote high-performance computers to process such images and visualize reconstructed 3D images in real time. In this paper, we present such a prototype system that integrates microscopy image acquisition, parallel deblurring, 3D image visualization, and high-speed networks.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P526.ps.Z"} |
| author | = | "Jacqueline Fleckinger-Pelle' and Hans G. Kaper", | |
| title | = | "Gauges for the Ginzburg-Landau Equations of Superconductivity", | |
| booktitle | = | "ZAMM - Z. angew. Math. Mech.", | |
| volume | = | "76", | |
| year | = | "1996", | |
| pages | = | "345-348", | |
| Abstract | = | " This note discusses some gauge choices for the time-dependent Ginzburg-Landau equations of superconductivity. The equations model the state of a superconducting sample in a magnetic field near the critical temperature. Any two solutions related through a "gauge transformation" describe the same state and are physically indistinguishable. This "gauge invariance" can be exploited for analytical and numerical purposes.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P527.ps.Z"} |
| author | = | "Man Kam Kwong", | |
| title | = | "Orthogonally Compensated W-Multiresolution Analysis and Signal Processing", | |
| number | = | "MCS-P528-0795", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The concept of a W-matrix is used to give an elementary interpretation of a biorthogonal wavelet decomposition of signals. We also give a method to modify the decomposition to gie an orthogonal projection on the space spanned by the scaling vectors. Roughly speaking, our treatment is a finite-length analog of the well-known theory of multiresolution analysis of Meyer and Mallat. Our approach differs in that it deals directly with the discrete case, it takes care of the boundary elements without explicit padding, and it uses a notion similar to that of semiorthogonality introduced by Chui. Our algorithm has flexibility in the choice of filter coefficients. The decomposition, orthogonalization, and restoration algorithms are computationally fast.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P528.ps.Z"" |
| author | = | "Rajeev Thakur and Alok Choudhary", | |
| title | = | "An Extended Two-Phase Method for Accessing Sections of Out-of-Core Arrays", | |
| number | = | "MCS-P530-0595", | |
| month | = | "Sept.", | |
| year | = | "1995", | |
| Abstract | = | " A number of applications on parallel computers deal with very large data sets that cannot fit in main memory. In such applications, data must be stored in files on disks and fetched into memory during program execution. Parallel programs with large out-of-core arrays stored in files must read/write smaller sections of the arrays from/to files. In this paper, we describe a method for accessing sections of out-of-core arrays efficiently. Our method, the extended two-phase method, uses collective I/O: Processors cooperate to combine several I/O requests into fewer larger granularity requests, reorder requests so that the file is accessed in proper sequence, and eliminate simultaneous I/O requests for the same data. In addition, the I/O workload is divided among processors dynamically, depending on the access requests. We present performance results obtained from two real out-of-core parallel applications---matrix multiplication and a Laplace's equation solver---and several synthetic access patterns, all on the Intel Touchstone Delta. These results indicate that the extended two-phase method significantly outperformed a direct (non-collective) method for accessing out-of-core array sections.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P530.ps.Z"} |
| author | = | "Christian H. Bischof and Gordon D. Pusch and Ralf Knoesel", | |
| title | = | "Sensitivity Analysis of the MM5 Weather Model Using Automatic Differentiation", | |
| journal | = | "Computers in Physics", | |
| volume | = | "10", | |
| issue | = | " 6", | |
| year | = | "1996", | |
| pages | = | "605-612", | |
| Abstract | = | " We present a general method for using automatic differentiation to facilitate model sensitivity analysis. Automatic differentiation techniques augment, in a completely mechanical fashion, an existing code such that it also simultaneously and efficiently computes derivatives. Our method allows the sensitivities of the code's outputs to its parameters and inputs to be determined with minimal human effort by exploiting the relationship between differentiation and formal perturbation theory. Employing this method, we performed a sensitivity study of the MM5 code, a mesoscale weather model jointly developed by Penn State University and the National Center for Atmospheric Research, comprising roughly 40,000 lines of Fortran 77 code. Our results show that AD-computed sensitivities exhibit superior accuracy compared with divided differences approximations computed from finite-amplitude perturbations, while consuming comparable or less CPU time and less human labor. We also comment on a numerically induced precursor wave that would almost certainly have been undetectable if one used a divided difference method.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P532.ps.Z"} |
| author | = | "Rajeev Thakur and Ewing Lusk and William Gropp", | |
| title | = | "I/O Characterization of a Portable Astrophysics Application on the IBM SP and Intel Paragon", | |
| number | = | "MCS-P534-0895", | |
| month | = | "August", | |
| year | = | "1995", | |
| Abstract | = | " Many large-scale applications on parallel machines are bottlenecked by the I/O performance rather than the CPU or communication performance of the system. To improve the I/O performance, it is first necessary for system designers to understand the I/O requirements of various applications. This paper presents the results of a study of the I/O characteristics and performance of a real, I/O-intensive, portable, parallel application in astrophysics, on two different parallel machines---the IBM SP and the Intel Paragon. We instrumented the source code to record all I/O activity and analyzed the resulting trace files. Our results show that, for this application, the I/O consists of fairly large writes, and writing data to files is faster on the Paragon, whereas opening and closing files are faster on the SP. We also discuss how the I/O performance of this application could be improved; particularly, we believe that this application would benefit from using collective I/O.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P534.ps.Z"} |
| author | = | "S. Zafar and Y-Q. Zhang and B. Jabbari", | |
| title | = | "Block-Classified Bidirectional Motion Compensation Scheme for Wavelet-Decomposed Digital Video", | |
| number | = | "MCS-P535-0895", | |
| month | = | "November", | |
| year | = | "1995", | |
| Abstract | = | " In this paper we introduce a block-classified bidirectional motion compensation scheme for our previously developed wavelet-based video codec, where multiresolution motion estimation is performed in the wavelet domain. The frame classification structure described in this paper is similar to that used in the MPEG standard. Specifically, the I-frames are intraframe coded, the P-frames are interpolated from a previous I- or a P-frame, and the B-frames are bidirectional interpolated frames. We apply this frame classification structure to the wavelet domain with variable block sizes and multiresolution representation. We use a symmetric bidirectional scheme for the B-frames and classify the motion blocks as intraframe, compensated either from the preceding or the following frame, or bidrectional (i.e., compensated based on which type yields the minimum energy). We also introduce the concept of F-frames, which are analogous to P-frames but are predicted from the following frame only. This improves the overall quality of the reconstruction in a group of pictures (GOP) but at the expense of extra buffering. We also study the effect of quantization of the I-frames on the reconstruction of a GOP, and we provide intuitive explanation for the results.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P535.ps.Z"} |
| author | = | "John Drake and Ian Foster and John Michalakes and Brian Toonen and Patrick Worley", | |
| title | = | "Design and Performance of a Scalable Parallel Community Climate Model", | |
| number | = | "MCS-P536-0895", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "September", | |
| year | = | "1995", | |
| Abstract | = | " We describe the design of a parallel global atmospheric circulation model, PCCM2. This parallel model is functionally equivalent to the National Center for Atmospheric Research's Community Climate Model, CCM2, but is structured to exploit distributed memory multicomputers. PCCM2 incorporates parallel spectral transform, semi-Lagrangian transport, and load balancing algorithms. We represent detailed performance results on the IBM SP2 and Intel Paragon. These results provide insights into the scalability of the individual parallel algorithms and of the parallel model as a whole.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P536.ps.Z"} |
| author | = | "D. W. Braun and G. W. Crabtree and H. G. Kaper and A. E. Koshelev and G. K. Leaf and D. M. Levine and V. M. Vinokur", | |
| title | = | "The Structure of a Moving Vortex Lattice", | |
| journal | = | "Physical Review Letters", | |
| volume | = | "76", | |
| issue | = | "5 ", | |
| month | = | "January", | |
| year | = | "1996", | |
| pages | = | "831-834", | |
| Abstract | = | " Numerical solutions of the time-dependent Ginzburg-Landau equations show a new mechanism for plastic motion of a driven vortex lattice in a clean superconductor. The mechanism, which involves the creation of a defect superstructure, is intrinsic to the moving vortex lattice and is independent of bulk pinning. Other structural features found in the solutions include a re-orientation of the vortex lattice and a gradual healing of lattice defects under the influence of a transport current.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P537.ps.Z"} |
| author | = | "K. Forsman and W. Gropp and L. Kettunen and D. Levine and J. Salonen", | |
| title | = | "Solution of Dense Systems of Linear Equations Arising from Integral Equation Formulations", | |
| number | = | "MCS-P538-0895", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper discusses efficient solution of dense systems of linear equations arising from integral equation formulations. Several preconditioners in connection with Krylov iterative solvers are examined and compared with LU factorization. Results are shown demonstrating practical aspects and issues we have encountered in implementing iterative solvers on both parallel and sequential computers.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P538.ps.Z"} |
| author | = | "Jorge J. More' and Zhijun Wu", | |
| title | = | "Global Smoothing and Continuation for Large-Scale Molecular Optimization", | |
| number | = | "MCS-P539-1095", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We discuss the formulation of optimization problems that arise in the study of distance geometry, ionic systems, and molecular clusters. We show that continuation techniques based on global smoothing are applicable to these molecular optimization problems, and we outline the issues that must be resolved in the solution of large-scale molecular optimization problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P539.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "OTTER and the Moufang Identity Problem", | |
| journal | = | "Journal of Automated Reasoning", | |
| ivolume | = | "17", | |
| issue | = | "2", | |
| pages | = | "215-257", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " This article provides additional evidence of the value of using an automated reasoning program as a research assistant. Featured is the use of Bill McCune's program OTTER to find proofs of theorems taken from the study of Moufang loops, but not just any proofs. Specifically, the proofs satisfy the property of purity. In particular, when given, say, four equivalent identities (which is the case in this article), one is asked to prove the second identity from the first, the third from the second, the fourth from the third, and the first from the fourth. If the proof that 1 implies 2 does not rely on 3 or 4, then by definition the proof is pure with respect to 3 and 4, or simply the proof is pure. If for the four identities one finds four pure proofs showing that 1 implies 2, 2 implies 3, 3 implies 4, and 4 implies 1, then by definition one has found a circle of pure proofs. By finding the needed twelve pure proofs, this article shows that there does exist a circle of pure proofs for the four equivalent identities for Moufang loops and for all orderings of the identities; however, for much of this article, the emphasis is on the first three identities. In addition--in part to promote the use of automated reasoning programs and to answer questions concerning the choice of options--featured here is the methodology that was employed and a discussion of some of the obstacles, some of which are subtle. The approach relies on paramodulation (with generalizes equality substitution), on demodulation, and--so crucial for attacking deep questions and hard problems--on various strategies, most important of which are the hot list strategy, the set of support strategy, and McCune's ratio strategy. To permit verification of the results presented here, extension of them, and application of the methodology to other unrelated fields, a sample input file and four proofs (relevant to a circle of pure proofs for the four identities) are included. Research topics and challenges are offered at the close of this article.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P540.ps.Z"} |
| author | = | "Steven A. Gabriel and Jorge J. More'", | |
| title | = | "Smoothing of Mixed Complementarity Problems", | |
| number | = | "MCS-P541-0995", | |
| month | = | 'September", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1995", | |
| Abstract | = | " We introduce a smoothing approach to the mixed complementarity problem, and study the limiting behavior of a path defined by approximate minimizers of a nonlinear least squares problem. Our main result guarantees that, under a mild regularity condition, limit points of the iterates are solutions to the mixed complementarity problem. The analysis is applicable to a wide variety of algorithms suitable for large-scale mixed complementarity problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P541.ps.Z"} |
| author | = | "Jorge J. More' and Zhijun Wu", | |
| title | = | "Smoothing Techniques for Macromolecular Global Optimization", | |
| number | = | "MCS-P542-0995", | |
| month | = | 'September", | |
| year | = | "1995", | |
| institution | = | "Argonne National Laboratory", | |
| Abstrtact | = | " We study global optimization problems that arise in macromolecular modeling, and the solution of these problems via continuation and smoothing. Our results unify and extend the theory associated with the use of the Gaussian transform for smoothing. We show that the Gaussian transform can be viewed as a special case orf a generalized transform and that these generalized transforms share many of the properties of the Gaussian transform. We also show that the smoothing behavior of the generalized transform can be studied in terms of the Fourier transform and that these results indicate that the Gaussian transform has superior smoothing properties.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P542.ps.Z"} |
| title | = | "High Performance Computational Chemistry: (I) Scalable Fock Matrix Construction Algorithms", | |
| journal | = | "J. Computational Chemistry", | |
| volume | = | "7", | |
| issue | = | " 1", | |
| year | = | "1996", | |
| pages | = | "109-123", | |
| Abstract | = | { Several parallel algorithms for Fock matrix construction are described. The algorithms calculate only the unique integrals, distribute the Fock and density matrices over the processors of a massively parallel computer, use blocking techniques to construct the distributed data structures, and use clustering techniques on each processor to maximize data reuse. Algorithms based on both square and row blocked distributions of the Fock and density matrices are described and evaluated. Variants of the algorithms are discussed that use either triple-sort or canonical ordering of integrals, and dynamic or static task clustering schemes. The algorithms are shown to adapt to screening, with communication volume scaling down with computation costs. Modeling techniques are used to characterize algorithm performance. Given the characteristics of existing massively parallel computers, all the algorithms are shown to be highly efficient on problems of moderate size. The algorithms using the row blocked data distribution are the most efficient.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P543.ps.Z"} |
| author | = | "R. J. Harrison and M. F. Guest and R. A. Kendall and D. E. Bernholdt and A. T. Wong and M. Stave and J. L. Anchell and A. C. Hess and R. J. Littlefield and G. L. Fann and J. Nieplocha and G. S. Thomas and D. Elwood and J. Tilson and R. L. Shepard and A. F. Wagner and I. T. Foster and E. Lusk and R. Stevens", | |
| title | = | "High Performance Computational Chemistry: (II) A Scalable SCF Program", | |
| journal | = | "J. Comp. Chem.", | |
| volume | = | "17", | |
| issue | = | "1", | |
| year | = | "1996", | |
| pages | = | "124-132", | |
| Abstract | = | " We discuss issues in developing scalable parallel algorithms and focus in particular on the distribution, as opposed to the replication, of key data structures. Replication of large data structures limits the maximum calculation size by imposing a low ratio of processors to memory. Only applications which distribute both data and computation across processors are truly scalable. The use of shared data structures that may be independently accessed by each process even in a distributed-memory environment greatly simplifies development and provides a significant performance enhancement. We describe tools we have developed to support this programming paradigm. These tools are used to develop a highly efficient and scalable algorithm to perform self-consistent field calculations on molecular systems. A simple and classical strip-mining algorithm suffices to achieve an efficient and scalable Fock-Matrix construction in which all matrices are fully distributed. By stripmining over atoms we also exploit all available sparsity and pave the way to adopting more sophisticated methods for summation of the Coulomb and exchange interactions.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P544.ps.Z"} |
| author | = | "C. H. Bischof and X. Sun", | |
| title | = | "On Tridiagonalizing and Diagonalizing Symmetric Matrices with Repeated Eigenvalues", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "17", | |
| issue | = | "4", | |
| month | = | "October", | |
| year | = | "1996", | |
| pages | = | "869-885", | |
| Abstract | = | " We describe a divide-and-conquer tridiagonalization approach for matrices with repeated eigenvalues. Our algorithm hinges on the fact that, under easily constructively verifiable conditions, a symmetric matrix with bandwidth b and k distinct eigenvalues must be block diagonal with diagonal blocks of size at most bk. A slight modification of the usual orthogonal band-reduction algorithm allows us to reveal this structure, which then leads to potential parallelism in the form of independent diagonal blocks. Compared with the usual Householder reduction algorithm, the new approach exhibits improved data locality, significantly more scope for parallelism, and the potential to reduce arithmetic complexity by close to 50 percent for matrices that have only two numerically distinct eigenvalues. The actual improvement depends to a large extend on the number of distinct eigenvalues and a good estimate thereof. However, at worst the algorithms behave like a successive bandreduction approach to tridiagonalization. Moreover, we provide a numerically reliable and effective algorithm for computing the eigenvalue decomposition of a symmetric matrix with two numerically distinct eigenvalues. Such matrices arise, for example, in invariant subspace decomposition approaches to the symmetric eigenvalue problem.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P545.ps.Z"} |
| author | = | "Yu Kuo and Sohail Zafar and Bijan Jabbari", | |
| title | = | "Traffic Characterization and Modeling of Wavelet-based VBR Encoded Video", | |
| number | = | "MCS-P546-1195", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Wavelet-based video codecs provide a hierarchical structure for the encoded data, which can cater to a wide variety of applications such as multimedia systems. The characteristics of such an encoder and its output, however, have not been well examined. In this paper, we investigate the output characteristics of a wavelet-based video codec and develop a composite model to capture the traffic behavior of its output video data. Wavelet decomposition transforms the input video in a hierarchical structure with a number of subimages at different resolutions and scales. The top-level wavelet in this structure contains most of the signal energy. We first describe the characteristics of traffic generated by each subimage and the effect of dropping various subimages at the encoder on the signal-to-noise ratio at the receiver. We then develop an N-state Karkov model to describe the traffic behavior of the top wavelet. The behavior of the remaining wavelets are then obtained through estimation, based on the correlations between these subimages at the same level of resolution and those wavelets located at an immediate higher level. In our paper, a three-state Karkov model is developed. The resulting traffic behavior described by various statistical properties, such as moments and correlations, etc., are then utilized to validate our model.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P546.ps.Z"} |
| author | = | "R. B. Lehoucq and J. A. Scott", | |
| title | = | "An Evaluation of Software for Computing Eigenvalues of Sparse Nonsymmetric Matrices", | |
| number | = | "MCS-P547-1195", | |
| month | = | "January", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The past few years have seen a significant increase in research into numerical methods for computing selected eigenvalues of large sparse nonsymmetric matrices. This research has begun to lead to the development of high-quality mathematical software. The software includes codes that implement subspace iteration methods, Arnoldi-based algorithms, and nonsymmetric Lanczos methods. The aim of the current study is to evaluate this state-of-the-art software. In this study we consider subspace iteration and Arnoldi codes. We look at the key features of the codes and their ease of use. Then, using a wide range of test problems, we compare the performance of the codes in terms of storage requirements, execution times, accuracy, and reliability. We also consider their suitability for solving large-scale industrial problems. Base don our findings, we suggest how improved software should be designed.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P547.ps.Z"} |
| author | = | "Robert Almgren and Andrea Bertozzi and Michael P. Brenner", | |
| title | = | "Stable and Unstable Singularities in the Unforced Hele-Shaw Cell", | |
| journal | = | "Phys. Fluids", | |
| volume | = | "8", | |
| issue | = | " 6", | |
| month | = | "June", | |
| year | = | "1996", | |
| pages | = | "1356-1370", | |
| Abstract | = | " We study singularity formation in the lubrication model for the unforced Hele-Shaw system, describing the breaking in two of a fluid droplet confined between two narrowly spaced glass plates. By varying the initial data, we exhibit four different scenarios: (1) the droplet breaks in finite time, with two pinch points moving toward each other and merging at the singular time; (2) the droplet breaks in finite time, with two asymmetric pinch points propagating away from each other; (3) the droplet beaks in finite time, with a single symmetric pinch point; or (4) the droplet relaxes to a stable equilibrium shape without a finite time breakup. Each of the three singular scenarios has a self-similar structure with different scaling laws; the first scenario has not been observed before in other Hele-Shaw studies. We demonstrate instabilities of the second and third scenarios, in which the solution changes its behavior at a thickness that can be arbitrarily small depending on the initial condition. These transitions can be identified by examining the structure of the solution in the intermediate scaling region", | |
| note | = | "http://www.cs.uchicago.edu/camp/preprints/AlmBertBren96.ps.gz"} |
| author | = | "E. Selkov et al.", | |
| title | = | "The Metabolic Pathway Collection from EMP: The Enzymes and Metabolic Pathways Database", | |
| journal | = | "Nucleic Acids Res.", | |
| volume | = | "24", | |
| year | = | "1996", | |
| Abstract | = | " The Enzymes and Metabolic Pathways database (EMP) is an encoding of the contents of over 10,000 original publication on the topics of enzymology and metabolism. This large body of information has been transformed into a queryable database. An extraction of over 1400 pictorial representations of metabolic pathways from this collection is freely available on the World Wide Web. We believe that this collection will play an important role in the interpretation of genetic sequence data, as well as offering a meaningful framework for the integration of many other forms of biological data.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P550.ps.Z"} |
| author | = | "G. Quintana-Orti' and X. Sun and C. H. Bischof", | |
| title | = | "A BLAS-3 Version of the QR Factorization with Column Pivoting", | |
| number | = | "MCS-P551-1295", | |
| month | = | "January", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1996", | |
| Abstract | = | " The QR factorization with column pivoting (QRP), originally suggested by Golub and Businger in 1965, is a popular approach to computing rank-revealing factorizations. It was implemented in LINPACK with the Level 1 BLAS and in LAPACK with the Level 2 BLAS. While the Level 2 BLAS version generally delivers superior performance, it may result in worse performance for large matrix sizes due to cache effects. We introduce a modification of the QRP algorithm that allows the use of Level 3 BLAS kernels while maintaining the numerical behavior of the LINPACK and LAPACK implementations. Experimental comparisons of this approach with the LINPACK and LAPACK implementations on IBM RS/6000, SGI R8000, and DEC Alpha platforms show considerable performance improvements.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P551.ps.Z"} |
| author | = | "Ali Bouaricha and Robert B. Schnabel", | |
| title | = | "Tensor Methods for Large, Sparse Nonlinear Least Squares Problems", | |
| number | = | "MCS-P552-1295" | |
| month | = | " February", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by finite difference approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor methods to large, sparse nonlinear least squares problems. This involves an entirely new way of solving the tensor model that is efficient for sparse problems. A number of interesting linear algebraic implementation issues are addressed. The test results of the tensor method applied to a set of sparse nonlinear least squares problems compared with those of the standard Gauss-Newton method reveal that the tensor method is significantly more robust and efficient than the standard Gauss-Newton method.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P552.ps.Z"} |
| author | = | "L. Krusin-Elbaum and A. D. Marwick and R. Wheeler and C. Feidl and V. M. Vinokur and G. K. Leaf and M. Palumbo", | |
| title | = | "Enhanced Pinning with Controlled Splay Configurations of Columnar Defects; Rapid Vortex Motion at Large Angles", | |
| journal | = | "Physical Review Letters", | |
| year | = | "to appear", | |
| Abstract | = | " Orders-of-magnitude enhancements of persistent currents J are reported in YB2Cu3O7-delta with columnar defects arranged in a variety of splayed configurations. The largests J is obtained for a planar distribution P_pl Theta, with a splay angle | |
| Theta_opt | = | +-5 deg. A comparison of with other distributions suggests that pinning by the latter is controlled by large-angle tails of the Gaussian, which appear to enhance thermal creep rate. Numerical simulations confirm the existence of other regimes where vortex motion is promoted rather than suppressed by splay.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P554.ps.Z"} |
| author | = | "Carl F. Ollivier-Gooch", | |
| title | = | "Quasi-ENO Schemes for Unstructured Meshes Based on Unlimited Data-Dependent Least-Squares Reconstruction", | |
| number | = | "MCS-P555-1295", | |
| month | = | "January", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A crucial step in obtaining high-order accurate steady-state solutions to the Euler and Navier-Stokes equations is the high-order accurate reconstruction of the solution from cell-averaged values. Only after this reconstruction has been completed can the flux integral around a control volume be accurately assessed. In this work, a new reconstruction scheme is presented that is conservative, uniformly accurate with no overshoots, easy to implement on arbitrary meshes, has good convergence properties, and is computationally efficient. The new scheme, called DD-L_2, uses a data-dependent weighted least-squares reconstruction with a fixed stencil. The weights are chosen to strongly emphasize smooth data in the reconstruction. Because DD-L_2 is designed in the framework of k-exact reconstruction, existing techniques for implementing such reconstructions on arbitrary meshes can be used. The new scheme satisfies a relaxed version of the ENO criteria. Local accuracy of the reconstruction is optimal except in the case on functions that are continuous but have discontinuous low-order derivatives. The total variation of the reconstruction is bounded by the total variation of the function to within O (\Delta x). The asymptotic behavior of the scheme in reconstructing smooth and piecewise smooth functions is demonstrated. DD-L_2 produces uniformly high-order accurate reconstructions, even in the presence of discontinuities. Two-dimensional flow solutions obtained using DD-L_2 reconstruction are compared with solutions using limited elast-squares reconstruction. The solutions are virtually identical. The absence of a limiter reduces the CPU time required for DD-L_2 solutions by 15-20% as compared to limited reconstruction, even though the DD-L_2 gradient computation is slightly more expensive than ordinary least-squares reconstruction.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P555.ps.Z"} Publications 1996 |
| author | = | "Christian H. Bischof and Ron L. Shepard and Steven Huss-Lederman", | |
| title | = | "Workshop Report on Large-Scale Matrix Diagonalization Methods in Chemistry Theory Institute, held at Argonne National Laboratory, May 20--22, 1996", | |
| number | = | "ANL/MCS-TM-219", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " This interdisciplinary institute brought together 41 computational chemists and numerical analysts. The goal was to understand the needs of the computational chemistry community in problems that utilize matrix diagonalization techniques. This was accomplished by reviewing the current state of the art and looking toward future directions in matrix diagonalization techniques. This institute occurred about 20 years after a related meeting of similar size (see Report on the Workshop August 9-11, 1978, University of California, at Santa Cruz, edited by Cleve Moler and I. Shavitt and sponsored by National Resource for Computation in Chemistry). During those 20 years the Davidson method continued to dominate the problem of finding a few extremal eigenvalues for many computational chemistry problems. Work on non-diagonally dominant and non-Hermitian problems as well as parallel computing has also brought new methods to bear. The changes and similarities in problems and methods over the past two decades offered an interesting viewpoint for the success in this area. ", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM219.ps.Z"} |
| author | = | "William Gropp and Ewing Lusk", | |
| title | = | ""Creating a New MPICH Device Using the Channel Interface", | |
| number | = | "ANL/MCS-TM-213", | |
| month | = | "July", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The MPICH implementation of MPI uses a powerful and efficient layered approach to simplify porting MPI to new systems. One interface that can be used is the channel interface; this interface defines a collection of simple data-transfer operations. This interface can adapt to additional functionality, such as asynchronous or nonblocking transfers or remote memory operations. This paper describes this interface, some of the special issues, and gives instructions on creating a new MPICH implementation by implementing just a few routines.", | |
| not | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM213.ps.Z"} |
| author | = | "David Levine and Michael Facello and Philip Hallstrom and Greg Reeder an Brian Walenz and Fred Stevens", | |
| title | = | ""STALK Users Guide", | |
| number | = | "ANL/MCS-TM-214", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | July", | |
| year | = | "1996 ", | |
| Abstract | = | " STALK is a system that models molecular docking between two proteins. A problem is posed as an optimization problem where the objective is to minimize the free energy of the molecular system by maximizing the intermolecular interaction energy between the two molecules. The possible number of conformations between the two molecules can be very large. A parallel genetic algorithm (GA) is used to explore the conformation space and identify the low-energy molecular configurations. The DAVE, a virtual reality environment, can be used to visualize and interact with the system while it is executing. STALK consists of two programs: stalk.ga the docking program that runs the GA, and stalk.cave the visualization program> The visualization component is optional.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM214.ps.Z"} |
| author | = | "David Levine and Michael Facello and Philip Hallstrom and Greg Reeder and Brian Walenz and Fred Stevens", | |
| title | = | "STALK Programmers Guide", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-TM-215", | |
| month | = | "July", | |
| year | = | "1996", | |
| Abstract | = | " STALK is a system that models molecular docking between two proteins> A problem is posed as an optimization problem where the objective is to minimize the intermolecular interaction energy between the two molecules. The possible number of conformations between the two molecules can be very large. A parallel genetic algorithm (GA) is used to explore the conformation space and identify the low-energy molecular configurations. The CAVE, a virtual reality environment, can be used to visualize and interact with the system while it is executing. STALK consists of two programs: stalk.ga the docking program that runs the GA, and stalk.dave the visualization program. The visualization component is optional.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM215.ps.Z"} |
| author | = | "Brian P. Walenz", | |
| title | = | ""MolView Users Guide", | |
| number | = | "ANL/MCS-TM-216", | |
| month | = | "June", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " A system for viewing molecular data in a CAVE virtual reality environment is presented. The system, called MolView, consists of a frontend driver program that prepares the data and a backend CAVE program that displays the data. Both are written so that modifications and extensions are relatively easy to accomplish.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM216.ps.Z"} |
| author | = | "I. Foster", | |
| title | = | `Compositional Parallel Programming Languages", | |
| note | = | "MCS-P354-0293, Rev. 1", | |
| journal | = | "ACM Trans. on Programming Languages and Systems", | |
| year | = | "to appear", | |
| Abstract | = | " In task-parallel programs, diverse activities can take place concurrently, and communication and synchronization patterns are complex and not easily predictable. Previous work has identified compositionality> as an important design principle for task-parallel programs. In this paper, we discuss alternative approaches to the realization of this principle, which holds that properties of program components should be preserved when those components are composed in parallel with other program components. We review two programming languages, Strand and Program Composition Notation, that support compositionality via a small number of simple concepts, namely monotone operations on shared objects, a uniform addressing mechanism, and parallel composition. Both languages have been used extensively for large-scale application development, allowing us to provide an informed assessment of their strengths and weaknesses. We observe that while compositionality simplifies development of complex applications, the use of specialized languages hinders reuse of existing code and tools, and the specification of domain decomposition strategies. This suggests an alternative approach based on small extensions to existing sequential languages. We conclude the paper with a discussion of two languages that realize this strategy.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P354.ps.Z"} |
| author | = | "Daniel Ralph and Stephen Wright", | |
| title | = | "Superlinear Convergence of an Interior-Point Method for Monotone Variational Inequalities", | |
| number | = | "MCS-P556-0196", | |
| month | = | "January", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We describe an infeasible-interior-point algorithm for monotone variational inequality problems and prove that it converges globally and superlinearly under standard conditions plus a constant rank constraint qualification. The latter condition represents a generalization of the two types of assumptions made in existing superlinear analyses; namely, linearity of the constraints and linear independence of the active constraint gradients.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P556.ps.Z"} |
| author | = | "David Levine", | |
| title | = | "Application of a Hybrid Genetic Algorithm to Airline Crew Scheduling (MCS-P557-0196)", | |
| journal | = | "Computer and Operations Research", | |
| volume | = | "23", | |
| issue | = | "6", | |
| year | = | "1996", | |
| pages | = | "547--558", | |
| Abstract | = | " This paper discusses the development and application of a hybrid genetic algorithm to airline crew scheduling problems. The hybrid algorithm consists of a steady-state genetic algorithm and a local search heuristic. The hybrid algorithm was tested on a set of forty real-world problems. It found the optimal solution for half the problems, and good solutions for nine others. The results were compared to those obtained with branch-and-cut and branch-and-bound algorithms. The branch-and-cut algorithm was significantly more successful than the hybrid algorithm, and the branch-and-bound algorithm slightly better.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P557.ps.Z"} |
| author | = | "David Levine and William Gropp and Kimmo Forsman and Lauri Kettunen", | |
| title | = | "Parallel Computation of Three-Dimensional Nonlinear Magnetostatic Problems", | |
| number | = | "MCS-P558-0196", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | 'February", | |
| year | = | "1996", | |
| Abstract | = | " We describe a general-purpose parallel electromagnetic code for computing accurate solutions to large computationally demanding, 3D, nonlinear magnetostatic problems. The code, CORAL, is based on a volume integral equation formulation. Using an IBM SP parallel computer and iterative solution methods, we successfully solved the dense linear systems inherent in such formulations. A key component of our work was the use of the PETSc library, which provides parallel portability and access to the latest linear algebra solution technology.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P558.ps.Z"} |
| author | = | "Christian H. Bischof and Gregorio Quintana-Orti'", | |
| title | = | ""Computing Rank-Revealing QR Factorizations of Dense Matrices", MCS-P559-0196, | |
| month | = | "March", | |
| year | = | "1996", | |
| Abstract | = | " We develop algorithms and implementations for computing rank-revealing QR factorizations (RRQR factorizations) of dense matrices. First, we develop an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Businger/Golub pivoting strategy, safeguarded by incremental condition estimation. Second, we develop efficiently implementable variants of guaranteed reliable RRQR algorithms for triangular matrices originally suggested by Chandrasekaran and Ipsen and by Pan and Tang. We suggest algorithmic improvements with respect to condition estimation, termination criteria, and Givens updating. By combining the block algorithm with one of the triangular postprocessing steps, we arrive at an efficient and reliable algorithm for computing an RRQR factorization of a dense matrix. Experimental results on IBM RS/6000 and SGI R8000 platforms show that this approach performs up to three times faster than the less reliable QR factorization with column pivoting as it is currently implemented in LAPACK, and comes within 15\% of the performance of the LAPACK block algorithm for computing a QR factorization without any column exchanges. Thus, we expect this routine to be useful in many circumstances where numerical rank deficiency cannot be ruled out but currently has been ignored because of the computational cost of dealing with it.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P559.ps.Z"} |
| author | = | "C. H. Bischof and G. Quintana-Orti' ", | |
| title | = | "Codes for Rank-Revealing QR Factorizations of Dense Matrices", | |
| number | = | "MCS-P560-0196", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "March", | |
| year | = | "1996", | |
| Abstract | = | " This paper describes a suite of codes as well as associated testing and timing drivers for computing rank-revealing QR factorizations (RRQR factorizations) of dense matrices. The main contribution is an efficient block algorithm for approximating an RRQR factorization, employing a windowed version of the commonly used Businger/Golub pivoting strategy, and improved versions of the RRQR algorithms for triangular matrices originally suggested by Chandrasekaran and Ipsen, and Pan and Tang, respectively. We highlight usage and features of these codes, and give an example of their use in the context of solving rank-deficient least-squares systems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P560.ps.Z"} |
| author | = | "Stephen J. Wright", | |
| title | = | "Applying New Optimization Algorithms to Model Predictive Control (MCS-P561-0196)", | |
| journal | = | "Chemical Process Control-V", | |
| year | = | "to appear", | |
| Abstract | = | " The connections between optimization and control theory have been explored by many researchers, and optimization algorithms have been applied with success to optimal control. The rapid pace of developments in model predictive control has given rise to a host of new problems to which optimization has yet to be applied. Concurrently, developments in optimization, and especially in interior-point methods, have produced a new set of algorithms that may be especially helpful in this context. In this paper, we reexamine the relatively simple problem of control of linear processes subject to quadratic objectives and general linear constraints. We show how new algorithms for quadratic programming can be applied efficiently to this problem. The approach extends to several more general problems in straightforward ways.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P561.ps.Z"} |
| author | = | "Mark T. Jones and Paul E. Plassmann", | |
| title | = | "Adaptive Refinement of Unstructured Finite-Element Meshes", | |
| journal | = | "Finite Elements in Analysis and Design", | |
| note | = | "MCS-P562-0296", | |
| volume | = | "25", | |
| year | = | "1997", | |
| [ages | = | "41-60", | |
| Abstract | = | " The finite element method used in conjunction with adaptive mesh refinement algorithms can be an efficient tool in many scientific and engineering applications. In this paper we review algorithms for the adaptive refinement of unstructured simplicial meshes (triangulations and tetrahedralizations). We discuss bounds on the quality of the meshes resulting from these refinement algorithms. Unrefinement and refinement along curved surfaces are also discussed. Finally, we give an overview of recent developments in parallel refinement algorithms.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P562.ps.Z"} |
| author | = | "Gregorio Quintana-Orti and Enrique S. Quintana-Orti", | |
| title | = | "Guaranteeing Termination of Chandrasekaran and Ipsen's Algorithm for Computing Rank-Revealing QR Factorizations", | |
| number | = | "MCS-P564-0196", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "May", | |
| year | = | " 1996", | |
| abstract | = | " Many problems from science and engineering require the computation of a rank-revealing QR factorization of a matrix. We have developed a new algorithm based on Chandrasekaran and Ipsen's algorithm, with two advantages over it: First, our algorithm is much faster since we modify the main loop to accelerate its convergence, avoid the useless steps, and use faster subalgorithms. Second, we apply a technique, suggested by Pan and Tang, that ensures termination, achieves the desired bounds, and fits into our theoretical studies.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P564.ps.Z"} |
| author | = | "Jacqueline Fleckinger-Pelle' and Hans G. Kaper and Peter Takac", | |
| title | = | "Dynamics of the Ginzburg-Landau Equations of Superconductivity", | |
| journal | = | "Nonlinear Anal., Theory, Methods \& Applic.", | |
| year | = | "to appear", | |
| note | = | "MCS-P565-0296", | |
| Abstract | = | " This article is concerned with the dynamical properties of solutions of the time-dependent Ginzburg-Landau (TDGL) equations of superconductivity. It is shown that the TDGL equations define a dynamical process when the applied magnetic field varies with time, and a dynamical system when the applied magnetic field is stationary. The dynamical system describes the large-time asymptotic behavior: Every solution of the TDGL equations is attracted to a set of stationary solutions, which are divergence free.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P565.ps.Z"} |
| author | = | "D. Diachin and L. Freitag and D. Heath and J. Herzog and W. Michels and and P. Plassmann", | |
| title | = | "Remote Engineering Tools for the Design of Pollution Control Systems for Commercial Boilers", | |
| number | = | "MCS-P566-0296", | |
| month | = | "March", | |
| year | = | "1996"' | |
| Abstract | = | " We discuss a pilot project involving a collaboration between Nalco Fuel Tech (NFT), a small company that has developed state-of-the-art emission reduction systems for commercial boilers, and the computational science group at Argonne National Laboratory (ANL). The key objective of this project is the development of a real-time, interactive capability that allows the user to drive the computational model from within the virtual environment. In this case, the required interaction involves the placement of chemical injection systems in the boiler and a quick evaluation of their effectiveness in reducing undesirable emissions from the combustion process.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P566.ps.Z"} |
| author | = | "W. Gropp and E. Lusk and N. Doss and A. Skjellum", | |
| title | = | "A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard", | |
| journal | = | "Parallel Computing", | |
| volume | = | "22", | |
| year | = | "1996", | |
| pages | = | "789--828", | |
| note | = | "MCS-P567-0296", | |
| Abstract | = | " MPI (Message Passing Interface) is a specification for a standard library for message passing that was defined by the MPI Forum, a broadly based group of parallel computer vendors, library writers, and applications specialists. Multiple implementations of MPI have been developed. In this paper, we describe MPICH, unique among existing implementations in its design goal of combining portability with high performance. We document its portability and performance and describe the architecture by which these features are simultaneously achieved. We also discuss the set of tools that accompany the free distribution of MPICH, which constitute the beginnings of a portable parallel programming environment. A project of this scope inevitably imparts lessons about parallel computing, the specification being followed, the current hardware and software environment for parallel computing, and project management; we describe those we have learned. Finally, we discuss future developments for MPICH, including those necessary to accommodate extensions to the MPI Standard now being contemplated by the MPI Forum." | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P567.ps.Z"} |
| author | = | "A. Geist and W. Gropp and S. Huss-Lederman and A. Lumsdaine and E. Lusk and W. Saphir and T. Skjellum and M. Snir", | |
| title | = | "MPI-2: Extending the Message-Passing Interface", | |
| booktitle | = | "Proc. Euro-Par '96 Parallel Processing, Lecture Notes in Computer Science 1123", | |
| editor | = | " Luc Bouge' and Pierre Fraigniaud and Anne Mignotte and Yves Robert", | |
| publisher | = | "Springer-Verlag", | |
| pages | = | "128-135", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " This paper describes current activities of the MPI-2 Forum. The MPI-2 Forum is a group of parallel computer vendors, library writers, and application specialists working together to define a set of extensions to MPI (Message Passing Interface). MPI was defined by the same process and now has many implementations, both vendor-proprietary and publicly available, for a wide variety of parallel computing environments. In this paper we present the salient aspects of the evolving MPI-2 document as it now stands. We discuss proposed extensions and enhancements to MPI in the areas of dynamic process management, one-sided operations, collective operations, new language binding, real-time computing, external interfaces, and miscellaneous topics.", | |
| note | = | ="ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P568.ps.Z"} |
| author | = | "R. Thakur and W. Gropp and E. Lusk", | |
| title | = | "An Experimental Evaluation of the Parallel I/O Systems of the IBM SP and Intel Paragon Using a Production Application (ANL/MCS-P569-0296)", | |
| booktitle | = | "Proc. 3rd Int'l Conf. of the Austrian Center for Parallel Computation, with special emphasis on Parallel Databases and Parallel I/O", | |
| month | = | "Sept.", | |
| year | = | "to appear", | |
| Abstract | = | " We present the results of an experimental evaluation of the parallel I/O systems of the IBM SP and Intel Paragon using a real three-dimensional parallel application code. This application, developed by scientists at the University of Chicago, simulates the gravitational collapse of self-gravitating gaseous clouds. It performs parallel I/O by using library routines that we developed and optimized separately for the SP and Paragon. The I/O routines perform two-phase I/O and use the parallel file systems PIOFS on the SP and PFS on the Paragon. We studied the I/O performance for two different sizes of the application. In the small case, we found that I/O was much faster on the SP. In the large case, open, close, and read operations were only slightly faster, and seeks were significantly faster, on the the SP; whereas, writes were slightly faster on the Paragon. The communication required within our I/O routines was faster on the Paragon in both cases. The highest read bandwidth obtained was 48 Mbytes/sec., and the highest write bandwidth obtained was 31.6 Mbytes/sec., both on the SP.", | |
| note | = | "http://www.mcs.anl.gov/home/thakur/io-eval.ps"} |
| author | = | "C. H. Bischof and M. R. Haghighat", | |
| title | = | "Hierarchical Approaches to Automatic Differentiation", | |
| number | = | "ANL/MCS-P571-0396", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "June", | |
| year | = | "1996", | |
| Abstract | = | " A mathematical function, specified by a computer program, can be differentiated efficiently through the exploitation of its program structure. The important properties of a program for an efficient derivative code are the asymmetries between the number of inputs and outputs of program components at various levels of abstraction and the mathematical complexity of the involved operators. Automatic generation of efficient derivative codes thus requires analysis of programs for detection of such properties and systematic methods for their exploitation in composing the derivative codes. We suggest a hierarchical approach based on a partitioning of the computational or program graph as a means to deduce workable solutions to this hard problem. Each partition corresponds to a localized scope for derivative computation, and hierarchical partitions provide a mechanism for exploiting program structure at various levels. As a particular example, we discuss dynamic programming approaches for finding good one-dimensional partitions and generalizations to arbitrary directed acyclic graphs that, by recycling substructure information, allow one to determine the optimal elimination ordering for a graph with n nodes with complexity O(2**n), as compared with the O(n!) complexity of a naive search. Lastly, we give a concrete example illustrating the hierarchical approach on the driven cavity problem from the MINPACK-2 optimization test set collection.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P571.ps.Z"} |
| author | = | "C. H. Bischof and P.-T. Wu", | |
| title | = | "Exploiting Intermediate Sparsity in Computing Derivatives for a Leapfrog Scheme", | |
| number | = | "ANL/MCS-P572-0396", | |
| month | = | "February", | |
| yeaer | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The leapfrog scheme is a commonly used second-order method for solving differential equations. Letting Z denote the state of the system, we compute the state | |
| at the next time step as Z(t+1) | = | H(Z(t),Z(t-1),W), where t denotes a particular time step, H is the nonlinear timestepping operator, and W are parameters that are not time dependent. In this article, we show how the associativity of the chain rule of differential calculus can be used to expose and exploit intermediate derivative sparsity arising from the typical localized nature of the operator H. We construct a computational harness that capitalizes on this structure while employing automatic differentiation tools to automatically generate the derivative code corresponding to the evaluation of one time step. Experimental results with a 2-D shallow water equation model on IBM RS/6000 and Sun SPARCstations illustrate these issues.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P572.ps.Z"} |
| author | = | "D. Diachin and L. Freitag and D. Heath and J. Herzog and P. Plassmann and W. Michels", | |
| title | = | "Interactive Simulation and Analysis of Emission Reduction Systems in Commercial Boilers", | |
| number | = | "ANL/MCS-P573-0396", | |
| month | = | "March", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In this paper we describe an interactive virtual environment developed to model an emission reduction system for commercial boilers. The interactive environment is used to optimize the performance of the reduction system through the spatial adjustment and spray reconfiguration of reagent injectors. We describe the three principal components of the system: a computational model for the particle dynamics, a three-dimensional display device and graphics environment, and the communication layer that allows the interaction of the user in the visualization environment with the computational model. Timing results for each component are given for three hardware configurations that demonstrate the real-time performance of this tool.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P573.ps.Z"} |
| author | = | "T. Gaasterland and B. Dorr", | |
| title | = | "Selecting Tense, Aspect, and Connecting Words in Language Generation (ANL/MCS-P574-0296)", | |
| booktitle | = | "Proc. International Joint Conf. on Artificial Intelligence", | |
| year | = | "to appear", | |
| Abstract | = | " Generating language that reflects the temporal organization of represented knowledge requires a language generation model that integrates contemporary theories of tense and aspect, temporal representations, and methods to plan text. This paper presents a model that produces complex sentences that reflect temporal relations present in underlying temporal concepts. The main result of this work is the successful application of constrained linguistic theories of tense and aspect to a generator which produces meaningful event combinations and selects appropriate connecting words that relate them.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P574.ps.Z"} |
| number | = | "ANL/MCS-P576-0296", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1996", | |
| month | = | "February", The year 1995 heralded the sequencing of the first whole microbial genomes. The end of 1996 will see at least four more. The entire yeast genome will also be submitted to the public databases. At this rate, we can expect to have access to the complete genomes of at least 25-30 organisms within five years. While most problems of automated sequence generation and assembly have been solved, the automated analysis of genomic sequences has scarcely been addressed. Consequently, most genome sequences submitted to the publicly accessible databases are either poorly or not at all annotated. Sequence interpretation "by hand" presents an overwhelming challenge to researchers. To address this situation we are developing a prototype for a UNIX-based integrated environment for automated genome sequence interpretation.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P576.ps.Z"} |
| author | = | "T. A. DeFanti and I. Foster and M. E. Papka and R. Stevens and T. Kuhfuss", | |
| title | = | "Overview of the I-WAY: Wide Area Visual Supercomputing", | |
| journal | = | "International Journal of Supercomputing Applications", | |
| volume | = | "10", | |
| issue | = | "2-3", | |
| year | = | "1996", | |
| pages | = | "123-131", | |
| Abstract | = | " This paper discusses the I-WAY project and provides an overview of the papers in this issue of IJSA. The I-WAY is an experimental environment for building distributed virtual reality applications and for exploring issues of distributed wide area resource management and scheduling. The goal of the I-WAY project is to enable researchers use of multiple internetworked supercomputers and advanced visualization systems to conduct very large-scale computations. By connecting a dozen ATM testbeds, seventeen supercomputer centers, five virtual reality research sites, and over sixty applications groups, the I-WAY project has created an extremely diverse wide area environment for exploring advanced applications. This environment has provided a glimpse of the future for advanced scientific and engineering computing.", | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P579.ps.Z"} |
| author | = | "I. Foster and C. Kesselman and S. Tuecke", | |
| title | = | "The Nexus Task-parallel Runtime System", | |
| booktitle | = | "Proc. 1st Intl. Workshop on Parallel Processing", | |
| publisher | = | "Tata McGraw Hill", | |
| year | = | "1994", | |
| Abstract | = | " A runtime system provides a parallel language compiler with an interface to the low-level facilities required to support interaction between concurrently executing program components. Nexus is a portable runtime system for task-parallel programming languages. Distinguishing features of Nexus include its support for multiple threads of control, dynamic processor acquisition, dynamic address space creation, a global memory model via interprocessor references, and asynchronous events. In addition, it supports heterogeneity at multiple levels, allowing a single computation to utilize different programming languages, executables, processors, and network protocols. Nexus is currently being used as a compiler target for two task-parallel languages: Fortran M and Compositional C++. In this paper, we present the Nexus design, outline techniques used to implement Nexus on parallel computers, show how it is used in compilers, and compare its performance with that of another runtime system.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P581.ps.Z"} |
| author | = | "S. K. Park and K. K. Droegemeier and C. H. Bischof", | |
| title | = | "Automatic Differentiation as a Tool for Sensitivity Analysis of a Convective Storm in a 3-D Cloud Model (ANL/MCS-P582-0496)", | |
| booktitle | = | "Proc. 2nd International Symposium on Computational Differentiation", | |
| year | = | "to appear", | |
| Abstract | = | " The ADIFOR automatic differentiation tool is applied to a 3-D storm-scale meteorological model to generate a sensitivity-enhanced code capable of providing derivatives of all model output variables and related diagnostic (derived) parameters as a function of specified control parameters. The tangent linear approximation, applied to a deep convective storm by the first of its kind using a full-physics compressible model, is valid up to 50 min for a 1% water vapor perturbations. The result is very encouraging considering the highly nonlinear and discontinuous properties of solutions. The ADIFOR-generated code has provided valuable sensitivity information on storm dynamics. Especially, it is very efficient and useful for investigating how a perturbation inserted at earlier time propagates through the model variables at later times. However, it is computationally very expensive to be applied to the variational data assimilation, especially for 3-D meteorological models, which have a large number of input variables.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P582.ps.Z"} |
| author | = | "I. Foster and J. Geisler and B. Nickless and W. Smith and S. Tuecke", | |
| title | = | "Software Infrastructure for the I-WAY High-Performance Distributed Computing Experiment", | |
| booktitle | = | "Proc. 5th IEEE Symp. on High Performance Distributed Computing", | |
| pages | = | "562-571", | |
| publisher | = | "IEEE Computer Society Press", | |
| year | = | "1996", | |
| Abstract | = | " High-speed wide area networks are expected to enable innovative applications that integrate geographically distributed, high-performance computing, database, graphics, and networking resources. However, there is as yet little understanding of the higher-level services required to support these applications, or of the techniques required to implement these services in a scalable, secure manner. We report on a large-scale prototyping effort that has yielded some insights into these issues. Building on the hardware base provided by the I-WAY, a national-scale Asynchronous Transfer Mode (ATM) network, we developed an integrated management and application programming system, called I-Soft. This system was deployed at most of the 17 I-WAY sites and used by many of the 60 applications demonstrated on the I-WAY network. In this article, we describe the I-Soft design and report on lessons learned from application experiments.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P583.ps.Z"} |
| author | = | "I. Foster and C. Kesselman and S. Tuecke", | |
| title | = | "The Nexus Approach to Integrating Multithreading and Communication", | |
| journal | = | "J. Parallel and Distributed Computing", | |
| volume | = | "37", | |
| year | = | "1996", | |
| pages | = | " 70-82", | |
| Abstract | = | " Lightweight threads have an important role to play in parallel systems: they can be used to exploit shared-memory parallelism, to mask communication and I/O latencies, to implement remote memory access, and to support task-parallel and irregular applications. In this paper, we address the question of how to integrate threads and communication in high-performance distributed-memory systems. We propose an approach based on global pointer and remote service request mechanisms, and explain how these mechanisms support dynamic communication structures, asynchronous messaging, dynamic thread creation and destruction, and a global memory model via interprocessor references. We also explain how these mechanisms can be implemented in various environments. Our global pointer and remote service request mechanisms have been incorporated in a runtime system called Nexus that is used as a compiler target for parallel languages and as a substrate for higher-level communication libraries. We report the results of performance studies conducted using a Nexus implementation; these results indicate that Nexus mechanisms can be implemented efficiently on commodity hardware and software systems.",, | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P584.ps.Z"} |
| author | = | "A. K. Sinha and C. H. Bischof and D. Shiriaev", | |
| title | = | "Application of Automatic Differentiation to Reservoir Design Models", | |
| number | = | "ANL/MCS-P585-0496", | |
| month | = | "April", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation is a technique for computing derivatives accurately and efficiently with minimal human effort. Calculation of derivatives of numerical models is necessary for the optimization of reservoir systems to determine optimal sizes for reservoirs. For the computational experiments reported in the present investigation, the ADIFOR (Automatic Differentiation in FORtran) precompiler is employed for computing derivatives. Given the Fortran 77 source code for the function, ADIFOR generates code that computes derivatives of the model output with respect to the input parameters. Strategies to postoptimize the ADIFOR-generated derivative code and their impact on the computational requirements for evaluating derivatives and model solution are also discussed. We report on the use of automatic differentiation and divided difference approaches for computing derivatives for a single- and multiple-reservoir yield model. The results show that, for both the single- or multiple-reservoir model, automatic differentiation computes derivatives exactly and more efficiently than the divided difference implementation. Postoptimization of the generated d erivative code results in computation of derivatives in orders of magnitude less CPU time than with the ADIFOR-generated derivative code. It is also observed that the availability of exact derivatives significantly benefits the convergence of optimization algorithm. Thus, the solution of the multireservoir problem, which took 10.5 hours with divided difference derivatives, is decreased to less than two hours with ``ADIFOR out of the box'' derivatives, and to less than an hour using the postoptimized ADIFOR derivative code.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P585.ps.Z"} |
| author | = | "C. H. Bischof and B. Lang and X. Sun", | |
| title | = | "A Framework for Symmetric Band Reduction", | |
| number | = | "ANL/MCS-P586-0496", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We develop an algorithmic framework for reducing the bandwidth of symmetric matrices. This framework includes the reduction of full matrices to banded or tridiagonal form and the reduction of banded matrices to narrower banded or tridiagonal form, possibly in multiple steps. Our framework leads to algorithms that require fewer floating point operations than do standard algorithms. In addition, it allows for space-time tradeoffs and enables or increases the use of blocked transformations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P586.ps.Z"} |
| institution | = | "Argonne National Laboratory", | |
| author | = | "C. H. Bischof and B. Lang and X. Sun", | |
| title | = | "The SBR Toolbox -- Software for Successive Band Reduction", | |
| number | = | "ANL/MCS-P587-0496", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " We present a software toolbox for symmetric band reduction, together with a set of testing and timing drivers. The toolbox contains routines for the reduction of full symmetric matrices to banded form and the reduction of banded matrices to narrower banded or tridiagonal form, with optional accumulation of the orthogonal transformations, as well as repacking routines for storage rearrangements. The functionality and the calling sequences of the routines are described, with a detailed discussion of the ``control'' parameters that allow adaptation of the codes to particular machine and matrix characteristics. We also briefly describe the testing and timing drivers included in the toolbox.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P587.ps.Z"} |
| author | = | "H. G. Kaper and P. Takac", | |
| title | = | "An Equivalence Relation for the Ginzburg-Landau Equations of Superconductivity", | |
| number | = | "ANL/MCS-P588-0496", | |
| month | = | "June", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1996", | |
| Abstract | = | " Gauge invariance is used to establish an equivalence relation between solutions of the stationary and time-dependent Ginzburg-Landau equations describing the same physical state of a superconductor. The equivalence relation shows how equilibrium configurations are obtained as large-time asymptotic limits of solutions of the time-dependent Ginzburg-Landau equations.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P588.ps.Z"} |
| author | = | "C. Bischof and A. Carle", | |
| title | = | "Users' Experience with ADIFOR 2.0", | |
| number | = | "ANL/MCS-P589-0496", | |
| month | = | "June", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1996", | |
| Abstract | = | " In July 1995, the ADIFOR 2.0 system for automatic differentiation of Fortran was made available to the academic and commercial communities via the World Wide Web. By January 1996, we had received and processed over one hundred requests for ADIFOR 2.0. In this paper, we describe some of the experiences of users of the system that should be interesting to developers of automatic differentiation tools.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P589.ps.Z"} | |
| @techreport | = | {CrabLeaKapBra:dynam96, | |
| author | = | "G. W. Crabtree and G. K. Leaf and H. G. Kaper and D. W. Braun V. M. Vinokur and A. E. Koshelev", | |
| title | = | "Dynamic Vortex Phases in Superconductors with Correlated Disorder", | |
| number | = | "ANL/MCS-P590-0496", | |
| month | = | "April", | |
| year | = | "1996", | |
| Abstract | = | " The nature of driven motion of a vortex solid in the presence of a planar pinning defect is investigated by large-scale simulations based on the time-dependent Ginzburg-Landau equations. Three dynamic phases are identified and characterized by their relative positional and velocity correlations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P590.ps.Z"} |
| author | = | "R. B. Lehoucq", | |
| title | = | "Restarting an Arnoldi Reduction", | |
| number | = | "ANL/MCS-P591-0496", | |
| month | = | "May", | |
| year | = | "1996", | |
| Abstract | = | " The Arnoldi reduction is an efficient procedure for approximating a subset of the eigensystem of a large sparse matrix A of order n. At each step, a partial orthogonal reduction of A into an upper Hessenberg matrix is produced. The eigenvalues of this Hessenberg matrix are used to approximate a subset of the eigenvalues of the large matrix A. The approximation to the eigenvalues of A generally improves as the order of the Hessenberg matrix increases. Unfortunately, so do the cost and storage of the reduction. A popular alternative is to define an iteration by restarting the reduction with information in a length m < n Arnoldi reduction. The hope is that this restarted reduction has improved estimates to the eigenvalues of A. This paper considers the various approaches used to restart a reduction. Analysis and numerical examples are presented that explain and exhibit the generally superior properties of Sorensen's implicitly restarted Arnoldi iteration. The analysis exploits the fact that an IRA iteration is mathematically equivalent to a curtailed QR iteration.", | |
| = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P591.ps.Z"} |
| author | = | "Rajeev Thakur and William Gropp and Ewing Lusk", | |
| title | = | "An Abstract-Device Interface for Implementing Portable Parallel-I/O Interfaces", | |
| booktitle | = | "Proc. 6th Symp. on the Frontiers of Massively Parallel Computation", | |
| month | = | "October", | |
| year | = | "1996", | |
| pages | = | "180-187", | |
| publisher | = | "IEEE", | |
| Abstract | = | " In this paper, we propose a strategy for implementing parallel-I/O interfaces portably and efficiently. We have defined an abstract-device interface for parallel I/O, called ADIO. Any parallel-I/O API can be implemented on multiple file systems by implementing the API portably on top of ADIO, and implementing only ADIO on different file systems. This approach simplifies the task of implementing an API and yet exploits the specific high-performance features of individual file systems. We have used ADIO to implement the Intel PFS interface and subsets of MPI-IO and IBM PIOFS interfaces on PFS, PIOFS, Unix, and NFS file systems. Our performance studies indicate that the overhead of using ADIO as an implementation strategy is very low.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P592.ps.Z"} |
| author | = | "I. Foster and D. R. Kohr Jr. and R. Krishnaiyer and A. Choudhary", | |
| title | = | "Double Standards: Bringing Task Parallelism to HPF via the Message Passing Interface", | |
| number | = | "ANL/MCS-P593-0596", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " High Performance Fortran (HPF) does not allow efficient expression of mixed task/data-parallel computations or the coupling of separately compiled data-parallel modules. In this paper, we show how a coordination library implementing the Message Passing Interface (MPI) can be used to represent these common parallel program structures. This library allows data-parallel tasks to exchange distributed data structures using calls to simple communication functions. We present microbenchmark results that characterize the performance of this library and that quantify the impact of optimizations that allow reuse of communication schedules in common situations. In addition, results from two-dimensional FFT, convolution, and multiblock programs demonstrate that the HPF/MPI library can provide performance superior to that of pure HPF. We conclude that this synergistic combination of two parallel programming standards represents a useful approach to task parallelism in a data-parallel framework, increasing the range of problems addressable in HPF without requiring complex compiler technology.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P593.ps.Z"} |
| author | = | "D. Abramson and I. Foster and J. Giddy and A. Lewis and R. Sosic and R. Sutherst and N. White", | |
| title | = | "The Nimrod Computational Workbench: A Case Study in Desktop Metacomputing", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P594-0596", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " The coordinated use of geographically distributed computers, or metacomputing can in principle provide more accessible and cost-effective supercomputing than conventional high-performance systems. However, we lack evidence that metacomputing systems can be made easily usable, or that there exist large numbers of applications able to exploit metacomputing resources. In this paper, we present work that addresses both these concerns. The basis for this work is a system called Nimrod that provides a desktop problem-solving environment for parametric experiments. We describe how Nimrod has been extended to support the scheduling of computational resources located in a wide-area environment, and report on an experiment in which Nimrod was used to schedule a large parametric study across the Australian Internet. The experiment provided both new scientific results and insights into Nimrod capabilities. We relate the results of this experiment to lessons learned from the I-WAY distributed computing experiment, and draw conclusions as to how Nimrod and I-WAY--like computing environments should be developed to support desktop metacomputing.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P594.ps.Z"} |
| author | = | "I. Foster and J. Geisler and S. Tuecke", | |
| title | = | "MPI on the I-WAY: A Wide-Area, Multimethod Implementation of the Message Passing Interface", | |
| number | = | "ANL/MCS-P595-0596", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " High-speed wide-area networks enable innovative applications that integrate geographically distributed computing, database, graphics, and networking resources. The Message Passing Interface (MPI) can be used as a portable, high-performance programming model for such systems. However, the wide-area environment introduces challenging problems for the MPI implementor, because of the heterogeneity of both the underlying physical infrastructure and the authentication and software environment at different sites. In this article, we describe an MPI implementation that incorporates solutions to these problems. This implementation, which was developed for the I-WAY distributed-computing experiment, was constructed by layering MPICH on the Nexus multithreaded runtime system. Nexus provides automatic configuration mechanisms that can be used to select and configure authentication, process creation, and communication mechanisms in heterogeneous systems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P595.ps.Z"} |
| author | = | "I. Foster and C. Kesselman and M. Snir", | |
| title | = | "Generalized Communicators in the Message Passing Interface", | |
| number | = | "ANL/MCS-P596-0596", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We propose extensions to the Message Passing Interface (MPI) that generalize the MPI communicator concept to allow multiple communication endpoints per process, dynamic creation of endpoints, and the transfer of endpoints between processes. The generalized communicator construct can be used to express a wide range of interesting communication structures, including collective communication operations involving multiple threads per process, communications between dynamically created threads, and object-oriented applications in which communications are directed to specific objects. Furthermore, this enriched functionality can be provided in a manner that preserves backward compatibility with MPI. We describe the proposed extensions, illustrate their use with examples, and discuss implementation issues.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P596.ps.Z"} |
| author | = | "I. Foster and D. Kohr and R. Krishnaiyer and A. Choudhary", | |
| title | = | "MPI as a Coordination Layer for Communicating HPF Tasks", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P597-0596", | |
| month | = | "October", | |
| year | = | "1996", | |
| Abstract | = | " Data-parallel languages such as High Performance Fortran (HPF) represent a simple execution model is which a single thread of control performs high-level operations on distributed arrays. These languages can greatly ease the development of parallel programs. Yet there are large classes of applications for which a mixture of task and data parallelism is most appropriate. Such applications can be structured as collections of data-parallel tasks that communicate by using explicit message passing. Because he Message Passing Interface (MPI) defines standardized, familiar mechanisms for this communication model, we propose that HPF tasks communicate by making calls to a coordination library that provides an HPF binding for MPI. The semantics of a communication interface for sequential languages can be ambiguous when the interface is invoked from a parallel language; we show how these ambiguities can be resolved by describing one possible HPF binding for MPI. We then present the design of a library that implements this binding, discuss issues that influenced our design decisions, and evaluate the performance of a prototype HPF/MPI library using a communications microbenchmark and application kernel. Finally, we discuss how MPI features might be incorporated into our design framework.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P597.ps.Z"} |
| author | = | "W. D. Reynolds Jr. and R. V. Kenyon", | |
| title | = | "The Wavelet Transform and the Suppression Theory of Binocular Vision for Stereo Image Compression", | |
| number | = | "ANL/MCS-P598-0596", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "July", | |
| year | = | "1996", | |
| Abstract | = | " In this paper we present a method for compression of stereo images. The proposed scheme is a frequency domain approach based on the suppression theory of binocular vision. By using the information in the frequency domain, complex disparity estimation techniques can be avoided. The wavelet transform is used to obtain a multiresolution analysis of the stereo pair by which the subbands convey the necessary frequency domain information.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P598.ps.Z"} |
| author | = | "M. Huang and D. Levine and L. Turner and L. Kettunen and M. Papka", | |
| title | = | "Virtual Reality Visualization of 3-D Electromagnetic Fields", | |
| number | = | "ANL/MCS-P599-0596", | |
| month | = | "August", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " One of the major problems in three-dimensional (3-D) electromagnetic field computation is visualizing the calculated field. Virtual reality techniques can be used as an aid to this process by providing multiple viewpoints, allowing immersion within the field, and taking advantage of the human ability to process 3-D spatial information. In this paper we present an example of 3-D electromagnetic field visualization in the CAVE virtual-reality environment.", | |
| notef | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P599.ps.Z"} |
| author | = | "S. Wright", | |
| title | = | "Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming", | |
| note | = | "ANL/MCS-P600-0596", | |
| booktitle | = | "Foundations of Computer-Aided Process Design: AIChE Symposium Series", | |
| publisher | = | "CACHE Publications", | |
| year | = | "1990", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We investigate a modified Cholesky algorithm similar to those used in current interior-point codes for linear programming. Cholesky-based interior-point codes are popular for three reasons: their implementation requires only minimal changes to standard sparse Cholesky codes (allowing us to take full advantage of software written by specialists in that area); they tend to be more efficient than competing approaches that use different factorizations; and they perform robustly on most practical problems, yielding good interior-point steps even when the coefficient matrix is ill conditioned. We explain the surprisingly good performance of the Cholesky-based approach by using analytical tools from matrix perturbation theory and error analysis, illustrating our results with computational experiments. Finally, we point out the limitations of this approach.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P600.ps.Z" |
| author | = | "I. Foster and J. Geisler and C. Kesselman and S. Tuecke", | |
| title | = | ""Multimethod Communications for High-Performance Metacomputing Applications", | |
| number | = | "ANL/MCS-P601-0596", | |
| month | = | "October", | |
| year | = | "1996", Metacomputing systems use high-speed networks to connect | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " supercomputers, mass storage systems, scientific instruments, and display devices with the objective of enabling parallel applications to access geographically distributed computing resources. However, experience shows that high performance often can be achieved only if applications can integrate diverse communication substrates, transport mechanisms, and protocols, chosen according to where communication is directed, what is communicated, or when communication is performed. In this article, we describe a software architecture that addresses this requirement. This architecture allows multiple communication methods to be supported transparently in a single application, with either automatic or user-specified selection criteria guiding the methods used for each communication. We describe an implementation of this architecture, based on the Nexus communication library, and use this implementation to evaluate performance issues. The implementation supported a wide variety of applications in the I-WAY metacomputing experiment at Supercomputing 95; we use one of these applications to provide a quantitative demonstration of the advantages of multimethod communication in a heterogeneous networked environment.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P601.ps.Z"} |
| author | = | "J. Czyzyk and T. J. Wisniewski", | |
| title | = | "The Diet Problem: A WWW-based Interactive Case Study in Linear Programming", | |
| number | = | "ANL/MCS-P602-0796", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "July", | |
| year | = | "1996", | |
| Abstract | = | " The Diet Problem is an interactive WWW-based case study that introduces users (particularly students and practitioners) to the mathematics of optimization. Users select foods for their menus, edit a set of nutritional constraints, and solve the linear program simply by clicking some buttons and making simple entries. A detailed analysis of the diet, complete with graphs and tables, is returned to the user. The Diet Problem utilizes a simple, yet interesting, linear program to introduce the concepts of model planning, data gathering, optimal solutions, and dual variables. The power of the World Wide Web makes the case study accessible to a wide variety of users in many different countries.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P602.ps.Z"} |
| author | = | "D. Levine and M. Facello and P. Hallstrom and G. Reeder and B. Walenz and F. Stevens", | |
| title | = | "STALK: An Interactive Virtual Molecular Docking System", | |
| number | = | "ANL/MCS-P603-0796", | |
| month | = | "August", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Several recent technologies--genetic algorithms, parallel and distributed computing, virtual reality, and high-speed networking--provide the foundation for a new approach to the computational study of molecular interactions. Parallel genetic algorithms are an efficient and effective means to explore the large search spaces typical of these problems, while virtual reality provides an immersive environment for visualizing the interactions. In this paper we discuss the STALK system, which uses high-speed networking to couple a parallel genetic algorithm to a virtual reality environment. This combination allows a local or remote user to interact in real-time with the simulation through the virtual reality environment. Molecular docking experiments using an IBM SP parallel computer and a CAVE virtual reality environment are discussed.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P603.ps.Z"} |
| author | = | "N. T. Karonis", | |
| title | = | "An Alternative Method to Remove Duplicate Tuples Resulting from Operations in the Relational Algebra in a Cube-Connected Multicomputer System", | |
| number | = | "ANL/MCS-P604-0796", | |
| month | = | "August", | |
| year | = | "1996", | |
| Abstract | = | " The problem of performing database operations on parallel architectures has received much attention, both as applied and theoretical areas of research. Much of the attention has been focused on performing these operations on distributed-memory architectures, for example, a hypercube. Algorithms that perform, in particular, relational database operations on a hypercube typically exploit the hypercube's unique interconnectivity to not only process the relational operators efficiently but also perform dynamic load balancing. Certain relational operators (e.g., projection and union) can produce interim relations that contain duplicate tuples. As a result, an algorithm for a relational database system must address the issue of removing duplicate tuples from these interim relations. The algorithms accomplish this by compacting the relation into hypercubes of smaller and smaller dimensions. We present an alternative method for removing duplicate tuples from a relation that is distributed over a hypercube by using the embedded ring found in every hypercube. Through theoretical analysis of the algorithm and empirical observation, we demonstrate that using the ring to remove the duplicate tuples is significantly more efficient than using the hypercube.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P604.ps.Z"} |
| author | = | "R. B. Lehoucq", | |
| title | = | "The Computation of Elementary Unitary Matrices", | |
| number | = | "ANL/MCS-P605-0796", | |
| month | = | "August", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The construction of elementary unitary matrices that transform a complex vector to a multiple of e_1, the first column of the identity matrix, are studied. We present four variants and their software implementation, including a discussion on the LAPACK subroutine CLARFG. Comparisons are also given.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P605.ps.Z"} |
| author | = | "C. H. Bischof", | |
| title | = | "Automatic Differentiation and Numerical Software Design", | |
| number | = | "ANL/MCS-P606-0896", | |
| month | = | "January", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation (AD) tools can generate accurate and efficient derivative code for computer programs of arbitrary length. In some cases, however, the developer of the code to be differentiated may be required to provide additional information to an AD tool to ensure the desired solution. We illustrate these issues with nondifferentiable language intrinsics such as max() in the context of computing the Euclidean norm and numerical integrators. In both cases, very little additional information is required to ensure that AD computes the ``do-what-I-mean'' derivatives. In addition, the provision of such information makes it easy to derive ``derivative-enhanced'' versions of these codes.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P606.ps.Z"} |
| author | = | "L. A. Freitag and C. Ollivier-Gooch", | |
| title | = | "A Comparison of Tetrahedral Mesh Improvement Techniques", | |
| number | = | "ANL/MCS-P607-0896", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic meshs generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face-swapping techniques that change local connectivity and optimization-based mesh smoothing methods that adjust grid point location. We consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. The highest quality meshes are obtained by using a combination of swapping and smoothing techniques.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P607.ps.Z"} |
| author | = | "C. Bischof and A. Griewank", | |
| title | = | "Tools for the Automatic Differentiation of Computer Programs", | |
| number | = | "ANL/MCS-P608-0896", | |
| month | = | "January", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Automatic differentiation (AD) is a methodology for developing sensitivity-enhanced versions of arbitrary computer programs. In this paper, we provide some background information on AD and basic implementation issues for the design of general purpose tools that can deal with codes from the Fortran and C family, address some frequently asked questions, and provide pointers for further study.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P608.ps.Z"} |
| author | = | "T. Canfield, D. Diachin, L. Freitag, D. Heath, J. Herzog, W. Michels, | |
| title | = | "Interactive Computational Models of Particle Dynamics Using Virtual Reality", | |
| booktitle | = | "Proc. Symp. on Virtual Reality in Manufacturing Research and Education", | |
| year | = | "to appear", | |
| Abstract | = | " We discuss an interactive environment for the visualization, analysis, and modification of computational models used in industrial settings. In particular, we focus on interactively placing massless, massed, and evaporating particulate matter in computational fluid dynamics applications. We discuss the numerical model used to compute the particle pathlines in the fluid flow for display and analysis. We briefly describe the toolkits developed for vector and scalar field visualization, interactive particulate source placement, and a three-dimensional GUI interface. This system is currently used in two industrial applications, and we present our tools in the context of these applications. We summarize the current state of the project and offer directions for future research.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P609.ps.Z"} |
| author | = | "S.-J. Wu and Y.-J. J. Wu and J. J. Shaw" | |
| title | = | "DNA Solutions to Searching for the Hamiltonian Cycle and the Traveling-Salesman Cycle", | |
| numb er | = | "ANL/MCS-P610-0996", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Computational problems for which an algorithm cannot be determined by polynomial time are classified as NP complete problems. Taking advantage of their great capacity to conduct parallel reactions, DNA molecules and their experimental protocols have been proposed to solve such problems which otherwise are time consuming for electronic computers. Based on a working archetype, models are presented here to compute two NP-complete problems: searching for the Hamiltonian cycle and the traveling-salesman cycle.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P620.ps.Z"} |
| author | = | "S. Carr and R. B. Lehoucq" | |
| title | = | "Compiler Blockability of Dense Matrix Factorizations", | |
| number | = | "ANL/MCS-P611-0996", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The goal of the LAPACK project is to provide efficient and portable software for dense numerical linear algebra computations. By recasting many of the fundamental dense matrix computations in terms of calls to an efficient implementation of the BLAS (Basic Linear Algebra Subprograms), the LAPACK project has, in large part, achieved its goal. Unfortunately, the efficient implementation of the BLAS often results in machine-specific code that is not portable across multiple architectures without a significant loss in performance or a significant effort to re-optimize them. This paper examines whether most of the hand optimizations performed on matrix factorization codes are unnecessary because they can (and should) be performed by the compiler. We believe that it is better for the programmer to express algorithms in a machine-independent form and allow the compiler to handle the machine-dependent details. This gives the algorithms portability across architectures and removes the error-prone, expensive, and tedious process of hand optimization. Although there currently exist no production compiler that can perform all the loop transformations discussed in this paper, a description of current research in compiler technology is provided that will prove beneficial to the numerical linear algebra community. We show that the Cholesky and LU factorizations may be optimized automatically by a compiler to be as efficient as the same hand-optimized version found in LAPACK. We also show that the QR factorization may be optimized by the compiler to perform comparably with the hand-optimized LAPACK version on modest matrix sizes. Our approach allows us to conclude that with the advent of the compiler optimizations discussed in this paper, matrix factorizations may be efficiently implemented in a machine-independent form.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P611.ps.Z"} |
| author | = | "R. B. Lehoucq and K. Meergengen", | |
| title | = | ""The Inexact Rational Krylov Sequence Method", | |
| number | = | "ANL/MCS-P612-1096", | |
| month | = | "October", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The rational Krylov sequence (RKS) method is a generalization of Arnoldi's method. It constructs an orthogonal reduction of a matrix pencil into an upper Hessenberg pencil. The RKS method is useful when the matrix pencil may be efficiently factored. However, it requires the solution of a linear system at every step. This article considers solving the resulting linear systems in an inexact manner by using an iterative method. We show that a Cayley transformation used within the RKS method is more efficient and robust than the usual shift-and-invert transformation. A relationship with the recently introduced Jacobi-Davidson method of Sleijpen and van der Vorst is also established.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P612.ps.Z"} |
| author | = | "I. Foster and N. T. Karonis and C. Kesselman and G. Koenig and S. Tuecke", | |
| title | = | "A Secure Communications Infrastructure for High-Performance Distributed Computing (ANL/MCS-P613-0996)", | |
| booktitle | = | "Proc. Sixth IEEE Int'l Symp. on High Performance Distributed Computing", | |
| year | = | "to appear", | |
| Abstract | = | " Applications that use high-speed networks to connect geographically distributed supercomputers, databases, and scientific instruments may operate over open networks and access valuable resources. Hence, they can require mechanisms for ensuring integrity and confidentiality of communications and for authenticating both users and resources. Security solutions developed for traditional client-server applications do not provide direct support for the program structures, programming tools, and performance requirements encountered in these applications. We address these requirements via a security-enhanced version of the Nexus communications library, which we use to provide secure versions of parallel libraries and languages, including the Message Passing Interface. These tools permit a fine degree of control over that, where, and when security mechanisms are applied. In particular, a single application can mix secure and nonsecure communication, allowing the programmer to make fine-grained security/performance tradeoffs. We present performance results that quantify the performance of our infrastructure.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P613.ps.Z"} |
| author | = | "I. Foster and C. Kesselman", | |
| title | = | "Globus: A Metacomputing Infrastructure Toolkit", | |
| number | = | "ANL/MCS-P614-0996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputes, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments to form networked virtual supercomputers or metacomputers. While the physical infrastructure to build such systems is becoming widespread, the heterogeneous and dynamic nature of the metacomputing environment poses new challenges for developers of system software, parallel tools, and applications. In this article, we introduce Globus, a system that we are developing to address these challenges. The Globus system is intended to achieve a vertically integrated treatment of application, middleware, and network. A low-level toolkit provides basic mechanisms such as communication, authentication, network information, and data access. These mechanisms are used to construct various higher-level metacomputing services, such as parallel programming tools and schedulers. Our long-term goal is to build an Adaptive Wide Area Resource Environment (AWARE), an integrated set of higher-level services that enable application to adapt to heterogeneous and dynamically changing metacomputing environments. Preliminary versions of Globus components were deployed successfully as part of the I-WAY networking experiment.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P614.ps.Z"} |
| author | = | "J. Czyzyk and M. P. Mesnier and J. J. More' ", | |
| title | = | "The Network-Enabled Optimization System (NEOS) Server", | |
| number | = | "ANL/MCS-P615-1096", | |
| month | = | "March", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " The Network-Enabled Optimization System (NEOS) is an environment for solving optimization problems over the Internet. Users submit optimization problems to the NEOS Server via e-mail, the World Wide Web, or the NEOS Submission Tool. The NEOS Server locates the appropriate optimization solver, computes all additional information (for example, derivatives and sparsity patterns) required by the solver, links the optimization problem with the solver, and returns a solution. This article discusses the design and implementation of the NEOS Server.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P615.ps.Z"} |
| author | = | "W. McCune and A. D. Sands", | |
| title | = | "Computer and Human Reasoning: Single Implicative Axioms for Groups and for Abelian Groups", | |
| jounrla | = | " American Mathematical Monthly", | |
| volume | = | "103", | |
| issue | = | "10", | |
| pages | = | "888--892", | |
| month | = | "December", | |
| year | = | "1996", | |
| Abstract | = | " The search for single axioms for groups has long interested mathematicians. In 1938, Tarski presented the following single equational axiom (in terms of subtraction) for Abelian groups: | |
| x-(y-(z-(x-y))) | = | z. In 1952, Higman and Neumann presented the following single equational axiom (in terms of division) for ordinary groups: | |
| (x/((((x/x)/y)/z)/(((x/x)/x)/z))) | = | y. ", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P617.ps.Z"} |
| author | = | "W. McCune", | |
| title | = | "33 Basic Test Problems: A Practical Evaluation of Some Paramodulation Strategies", | |
| booktitle | = | "Automated Reasoning and Its Applications: Essays in Honor of Larry Wos". | |
| editor | = | " Robert Veroff", | |
| publisher | = | "MIT Press", | |
| year | = | "1997", | |
| Abstract | = | " Many researchers who study the theoretical aspects of inference systems believe that if inference rule A is complete and more restrictive than inference rule B, then the use of A will lead more quickly to proofs than will the use of B. The literature contains statements of the sort ``our rule is complete and it heavily prunes the search space; therefore it is efficient". [This is a very general statement. We are not referring in particular to the paramodulation strategies on which we focus in this paper.] These positions are highly questionable and indicate that the authors have little or no experience with the practical use of automated inference systems. Restrictive rules (1) can block short, easy-to-find proofs, (2) can block proofs involving simple clauses, the type of clause on which many practical searches focus, (3) can require weakening of redundancy control such as subsumption and demodulation, and (4) can require the use of complex checks in deciding whether such rules should be applied. The only way to determine the practical value of inference rules and search strategies is to experiment on problems in which long-term target users are interested. In this paper we present a new theorem prover for equational logic, a set of 33 equational theorems for evaluating paramodulation strategies, a large set of experiments with several paramodulation strategies, and two equational proofs in Robbins algebra.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P618.ps.Z"} |
| author | = | "W. McCune and L. Wos", | |
| title | = | "Otter: The CADE-13 Competition Incarnations", | |
| journal | = | "JJ. Autmated Reasoning", | |
| volume | = | "18", | |
| issue | = | "2", | |
| pages | = | "211-220", | |
| year | = | "1997", | |
| Abstract | = | " This article discusses the two incarnations of Otter entered in the CADE-13 Automated Theorem Proving Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P619.ps.Z"} |
| author | = | "H. G. Kaper and P. Takac", | |
| title | = | "Ginzburg-Landau Dynamics with a Time-dependent Magnetic Field", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P620-1196", | |
| month | = | "November", | |
| yeaer | = | "1996", | |
| Abstract | = | " The time-dependent Ginzburg-Landau equations of superconductivity define a dynamical process when the applied magnetic field varies with time. Sufficient conditions (in terms of the time rate of change of the applied field) are given that, if satisfied, guarantee that this dynamical process is asymptotically autonomous. As time goes to infinity, the dynamical process asymptotically approaches a dynamical system whose attractor coincides with the omega-limit set of the dynamical process.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P620.ps.Z"} |
| author | = | "P. Eberhard and C. Bischof", | |
| title | = | "Automatic Differentiation of Numerical Integration Algorithms", | |
| journal | = | "Mathematics of Computation", | |
| volume | = | 68, | |
| pages | = | "717-731", | |
| mynote | = | "ANL/MCS-621-1196", | |
| year | = | 1999 | |
| Abstract | = | " Automatic differentiation (AD) is a technique for automatically augmenting computer programs with statements for the computation of derivatives. This article discusses the application of automatic differentiation to numerical integration algorithms for ordinary differential equations (ODEs), in particular, the ramifications of the fact that AD is applied not only to the solution of such an algorithm, but to the solution procedure itself. This subtle issue can lead to surprising results when AD tools are applied to variable-stepsize, variable-order ODE integrators. The computation of the final time step plays a special role in determining the computed derivatives. We investigate these issues using various integrators and suggest constructive approaches for obtaining the desired derivatives.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P621.ps.Z"} |
| author | = | "W. Gropp and E. Lusk and D. Swider", | |
| title | = | "Improving the Performance of MPI Derived Datatypes", | |
| booktitle | = | " Proceedings of the 3rd Annual MPI Developers and Users Conference", | |
| editor | = | "A. Skjellum and P. V. Bangalore and Y. S. Dandass", | |
| address | = | "Starkville, Mississippi", | |
| year | = | "1999", | |
| pages | = | "25-30"} |
| author | = | "J. J. More' and C.-J. Lin, | |
| title | = | "Incomplete Cholesky Factorizations with Limited Memory", | |
| journal | = | "SIAM Journal on Scientific Computing", | |
| volume | = | "21", | |
| year | = | "1999", | |
| pages | = | "24-45"} |
| author | = | "C. E. Siewert and S. J. Wright", | |
| title | = | "Efficient Eigenvalue Calculations in Radiative Transfer", | |
| journal | = | "J. Quantitative Spectroscopy and Radiative Transfer", | |
| volume | = | "62", | |
| year | = | "1999", | |
| pages | = | "685-688"} |
| author | = | "M. D. D'Souza and J. Huan and S. Sutton and M. Romine and N. Maltsev", | |
| title | = | "PUMA2 -- An Environment for Comparative Analysis of Metabolic Subsystems and Automated Reconstructino of Metabolism of Microbial Consortia and Individual Organisms from Sequence Data", | |
| number | = | "ANL/MCS-TM-240", | |
| month | = | "December +, | |
| year | = | "1999"} |
| author | = | "J. Taylor", | |
| title | = | "Workshop Report: Bridging the Climate Information Gap", | |
| number | = | "ANL/CGC-001-0200", | |
| month | = | "February", | |
| year | = | "2000"} |
| title | = | "A Brief Survey of Extrapolation Quadrature", | |
| author | = | "J. N. Lyness", | |
| journal | = | "ANZIAM J.", | |
| volume | = | "42", | |
| year | = | "2000", | |
| pages | = | "181-184"} |
| author | = | "S. J. Wright and D. Orban", | |
| title | = | "Properties of the Log-Barrier on Degenerate Nonlinear Programs", | |
| number | = | "ANL/MCS-P772-0799", | |
| month | = | "July", | |
| year | = | "1999", | |
| institution | = | "Argonne National Laboratory" |
| author | = | "J. L. Tilson and R. Shepard and C. Naleway and A. F. Wagner and W. C. Ermler", | |
| title | = | "Ab Initio Determination of Americium Ionization Potentials", | |
| month | = | "August", | |
| year | = | "1999", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P780-0899"} |
| title | = | "Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming", | |
| author | = | "S. J. Wright", | |
| journal | = | "SIAM Journal on Optimization", | |
| volume | = | "9", | |
| year | = | "1999", | |
| pages | = | "1159-1191"} |
| title | = | "Interior-Point Methods", | |
| author | = | "F. A. Potra and S. J. Wright", | |
| journal | = | "Journal of Computational and Applied Mathematics", | |
| year | = | "to appear"} |
| title | = | Parallel Spin-Orbit Coupled Configuration Interaction", | |
| author | = | "J. L. Tilson and W. C. Ermler and P. M. Pitzer", | |
| journal | = | "Computer Physics Comm.", | |
| volume | = | "128", | |
| pages | = | "128-138", | |
| year | = | "2000"} |
| author | = | J. G. Kaper and H. Nordborg", | |
| title | = | "The Ginzburg-Landau Euations of Superconductivity in the Limit of Weak Coupling near the Upper Critical Field", | |
| number | = | "ANL/MCS-P786-0100", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "January", | |
| year | = | "2000"} |
| author | = | N. Karonis and B de Supinski and I. Foster and W. Gropp and E. Lusk and J. Bresnahan", | |
| title | = | "Exploiting Hierarchy in Parallel Computer Networks to Optimize Collective Operation Performance", | |
| book | = | "Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS2000)", | |
| year | = | "2000 (to appear)"} |
| author | = | "E. A. Yildirim and S. J. Wright", | |
| title | = | "Warm-start Strategies in Interior-Point Methods for Linear Programming", | |
| number | = | "ANL/MCS-P799-0300", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech_reports/reports/P799.ps.Z">ANL/MCS-P799-0300", | |
| month | = | "March", | |
| year | = | "2000"} |
| author | = | "P. H. Carns and W. B. Ligon III and R. B. Ross and R. Thakur", | |
| title | = | "PVFS: A Parallel File System for Linux Clusters", | |
| number | = | "ANL/MCS-P804-0400", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech_reports/reports/P804.ps.Z">ANL/MCS-P804-0400", | |
| month | = | "April", | |
| year | = | "2000"} |
| author | = | "T. R. Canfield and T.-H. Chien and H. M. Domanus and A. M. Tentner and C. P. Tzanos and R. A. Valentin and D. P. Weber", | |
| title | = | "A Coupled Newton-Krylov Solver for Improved CHAD Cache Utlization", | |
| number | = | "ANL/MCS-P800-0300", | |
| month | = | "March", | |
| year | = | "2000"} |
| title | = | "A Mathematical Tumor Model with Immune Resistance and Drug Therapy: An Optimal Control Approach", | |
| author | = | "L. G. de Pillis and A. Radunskaya", | |
| number | = | "ANL/MCS-P805-0400", | |
| month | = | "April", | |
| year | = | "2000"} |
| author | = | "L. G. de Pillis and E. G. de Pillis", | |
| title | = | "A Mathematical Framework for Understanding Continuum Effects of Budget Fluctuations on a University", | |
| number | = | "ANL/MCS-P806-0400", | |
| note | = | "Preprint < ahref="ftp://info.mcs.anl.gov/pub/tech_reports/reports/P806.ps.Z">ANL/MCS-P806-0400", | |
| month | = | "April", | |
| year | = | "2000"} |
| author | = | "I. Foster and A. Roy and V. Sander", | |
| title | = | "A Quality of Service Architecture That Combines Resource Reservation and Application Adaptation", | |
| month | = | "April", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P807-00"} |
| author | = | "L. A. Freitag and R. M. Loy", | |
| title | = | "Using Desktop Graphics Workstations for Interactive Remote Exploration of Large Data Sets", | |
| note | = | "Preprint ftp://info.mcs.anl.gov/pub/tech_reports/reports/P809.doc">ANL/MCS-P809-0400", | |
| number | = | "ANL/MCS-P809-0400", | |
| month | = | "April", | |
| year | = | "2000"} |
| author | = | "L. Wos and B. Fitelson", | |
| title | = | "The Automation of Sound Reasoning and Successful Proof Finding", | |
| number | = | "ANL/MCS-P811-0500", | |
| month | = | "May", | |
| year | = | "2000"} |
| author | = | "L. Wos", | |
| title | = | "A Milestone Reached and a Secret Revealed", | |
| number | = | "ANL/MCS-P814-0500", | |
| month | = | "May", | |
| year | = | "2000"} |
| author | = | "L. Wos", | |
| title | = | "Conquering the Meredith Single Axiom", | |
| number | = | "ANL/MCS-P815-0500", | |
| month | = | "May", | |
| year | = | "2000"} |
| author | = | "L. Wos", | |
| title | = | "Missing Proofs Found", | |
| number | = | "ANL/MCS-P816-00", | |
| month | = | "May", | |
| year | = | "2000"} |
| title | = | "The Long-Term Impact of University Budget Cuts: A Mathematical Model", | |
| author | = | "E. G. de Pillis and L. G. de Pillis", | |
| number | = | "ANL/MCS-P817-0500", | |
| month | = | "May", | |
| year | = | "2000"} |
| author | = | "L. Freitag and R. M. Loy", | |
| title | = | "Comparison of Remote Visualization Strategies for Interactive Explorat ion of Large Data Sets", | |
| number | = | "ANL/MCS-P803-0300", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech_reports/reports/P803.ps.Z">ANL/MCS-P803-0300", | |
| month | = | "March", | |
| year | = | "2000"} |
| author | = | "W. McCune and O. Shumsky", | |
| title | = | "System Description: IVY", | |
| number | = | "ANL/MCS-P787-0100", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "January", | |
| year | = | "2000"} |
| author | = | "W. D. Gropp and D. E. Keyes and L. C. McInnes and M. D. Tidriri", | |
| title | = | "Globalized Newton-Krylov-Schwarz Algorithms and Software for Parallel Implicit CFD", | |
| note | = | "also ANL/MCS-P788-0100", | |
| journal | = | "Int. J. High Perform. Comput. Appl.", | |
| year | = | "2000"} |
| author | = | "J. Bresnahan and J. Insley and M. E. Papka", | |
| title | = | "Interacting with Scientific Visualizations: User-Interface Tools within Spatially Immersive Displays", | |
| number | = | "ANL/MCS-P789-0100", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "January", | |
| year | = | "2000"} |
| author | = | "D. Ralph and S. J. Wright", | |
| title | = | "Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints", | |
| number | = | "ANL/MCS-P622-1196", | |
| month | = | "December", | |
| year | = | "1996", | |
| Abstract | = | " We show that an interior-point method for monotone variational inequalities exhibits superlinear convergence on condition that all the standard assumptions hold except for the well known assumption that the Jacobian of the active constraints has full rank at the solution. Weshow that superlinear convergence occurs even when the constant rank condition on the Jacobian assumed in our earlier paper does not hold, thereby extending the main result of that paper.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P622.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "Automating the Search for Elegant Proofs (ANL/MCS-P623-1196)", | |
| journal | = | "J. Automated Reasoning", | |
| year | = | "to appear", | |
| Abstract | = | " The research reported in this article was spawned by a colleague's request to find an elegant proof (of a theorem from Boolean algebra) to replace his proof consisting of 816 deduced steps. The request was met by finding a proof consisting of 100 deduced steps. The methodology used to obtain the far shorter proof is presented in detail through a sequence of experiments. Although clearly not an algorithm, the methodology is sufficiently general to enable its use for seeking elegant proofs regardless of the domain of study. In addition to (usually) being more elegant, shorter proofs often provide the needed path to constructing a more efficient circuit, a more effective algorithm, and the like. The methodology relies heavily on the assistance of McCune's automated reasoning program OTTER. Of the aspects of proof elegance, the main focus here is on proof length, with brief attention paid to the type of term present, the number of variables required, and the complexity of deduced steps. The methodology is iterative, relying heavily on the use of three strategies: the resonance strategy, the hot list strategy, and McCune's ratio strategy. These strategies, as well as other features on which the methodology relies, do exhibit tendencies that can be exploited in the search for shorter proofs and for other objectives. To provide some insight regarding the value of the methodology, I discuss its successful application to other problems from Boolean algebra and to problems from lattice theory. Research suggestions and challenges are also offered.", | |
| notec | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P623.ps.Z"} |
| author | = | "J. N. Lyness and U. Ruede", | |
| title | = | "Cubature of Integrands Containing Derivatives", | |
| number | = | "ANL/MCS-P625-1196", | |
| month | = | 'November", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We present a new technique for the numerical integration over R, a square or triangle. This uses only function values of u, B, and v, avoiding explicit differentiation, but is suitable only when the integrand function is regular over R. The technique is analogous to Romberg integration. A general approach to the problem of constructing discretizations is given. We provide specific cost-effective discretizations satisfying familiar, but somewhat arbitrary guidelines. As in Romberg integration, when each component function in the integrand is a polynomial, this technique leads to an exact result.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P625.ps.Z"} |
| author | = | "C. Bischof and L. Roh and A. Mauer", | |
| title | = | "ADIC: An Extensible Automatic Differentiation Tool for ANSI-C", | |
| number | = | "ANL/MCS-P626-1196", | |
| month | = | "March", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " In scientific computing, we often require the derivatives df/dx of a function f expressed as a program with respect to some input parameter(s), x, say. Automatic differentiation (AD) techniques augment the program with derivative computation by applying the chain rule of calculus to elementary operations in an automated fashion. Due to the associativity of the chain rule, there are many ways for accumulating these derivatives. This article introduces ADIC (Automatic Differentiation of C), a new AD tool for ANSI-C programs. ADIC is currently the only tool for ANSI-C that employs a source-to-source program transformation approach; that is, it takes a C code and produces a new C code that computes the original results as well as thee derivatives. We first present ADIC ``by example'' to illustrate the functionality and ease of use of ADIC and then describe in detail the architecture of ADIC. ADIC incorporates a modular design that provides a foundation for both rapid prototyping of better AD algorithms and their sharing across AD tools for different languages. A component architecture called AIF (AD Interface Form) separates core AD concepts from their language-specific implementation and allows the development of generic AD modules that can be directly reused in other AIF-based AD tools. The language-specific ADIC front-end and backend canonicalize C programs to make them fir for semantic augmentation and manage, for example, the association of a program variable with its associated derivative object. We also report on applications of ADIC to a semiconductor device simulator, 3-D CFD grid generator, vehicle simulator, and neural network code.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P626.ps.Z"} |
| author | = | " S.-J. Wu and Y.-J. J. Wu and J. J. Shaw", | |
| title | = | "A Comprehensive SNA Arithmetic Calculator", | |
| number | = | "ANL/MCS-P630-0996", | |
| month | = | "December", | |
| year | = | "1996", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " Developing a generalized useful DNA computer has been one of the main interests since the inception of molecular computation. Toward that goal it is important to equip DNA with the ability to perform mathematical calculations. Here, a simple procedure that allows DNA-based bit arithmetic calculations is presented. Oligonucleotides encoding input bit numbers serve as primers for PCR to carry out the arithmetic operations. Amplified DNA fragments encoding output bit numbers are subsequently modified to assume the same format as the input. Thus, either iterative or parallel operations are permissible. ", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P630.ps.Z"} |
| author | = | "C. F. Ollivier-Gooch", | |
| title | = | "High-Order ENO Schemes for Unstructured Meshes Based on Least-Squares Reconstruction", | |
| number | = | "ANL/MCS-P631-1296", | |
| month | = | "February ", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " High-orer accurate schemes for conservation laws for unstructured meshes are not nearly so well advanced as such schemes for structured meshes. Consequently, little or nothing is known about the possible practical advantages of high-order discretization on unstructured meshes. This article is part of an ongoing effort to develop high-order schemes for unstructured meshes to the point where meaningful information can be obtained about the trade-offs involved in using spatial discretizations of higher than second-order accuracy on unstructured meshes.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P631.ps.Z"} |
| author | = | "S. A. Mitchell and S. A. Vavasis", | |
| title | = | "Quality Mesh Generation in Higher Dimensions", | |
| number | = | "ANL/MCS-P633-1296", | |
| month | = | "February", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to overrefine the domain, in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P633.ps.Z"} | |
| note | = | "1997 |
| author | = | "S. Balay and W. Gropp and L. C. McInnes and B. Smith", | |
| title | = | "PETSc 2.0 Users Manual, Rev. 2.0.16", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL-95/11", | |
| month | = | "February", | |
| year | = | "1997", | |
| Abstract | = | " This manual describes the use of PETSc 2.0 for the numerical solution of partial differential equations and related problems on high-performance computers. | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/ANL9511.ps.Z" |
| author | = | "Joseph Czyzyk and Sanjay Mehrotra and Stephen J. Wright", | |
| title | = | "PCx User Guide", | |
| number | = | 'ANL/MCS-TM-217", | |
| month | = | "March", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " We describe the code PCx, a primal-dual interior-point code for linear programming. Information is given about problem formulation and the underlying algorithm, along with instructions for installing, invoking, and using the code. Computational results on standard test problems are tabulated. The current version is 1.0. | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM217.ps.Z" |
| author | = | "John M. Herbert", | |
| title | = | "A General Formula for Rayleigh-Schrodinger Perturbation Energy Utilizing a Power Series Expansion of the Quantum Mechanical Hamiltonian", | |
| number | = | "ANL/MCS-TM-222", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "February", | |
| year | = | "1997", | |
| Abstract | = | " Perturbation theory has long been utilized by quantum chemists as a method for approximating solutions to the Schrodinger equation. Perturbation treatments represent a system's energy as a power series in which each additional term further corrects the total energy; it is therefore convenient to have an explicit formula for the nth-order energy correction term. If all perturbations are collected into a single Hamiltonian operator, such a closed-form expression for the nth-order energy correction is well known; however, use of a single perturbed Hamiltonian often leads to divergent energy series, while superior convergence behavior is obtained by expanding the perturbed Hamiltonian in a power series. This report presents a closed-form expression for the nth-order energy correction obtained using Rayleigh-Schrodinger perturbation theory and a power series expansion of the Hamiltonian.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM222.ps.Z" |
| author | = | "John Michalakes", | |
| title | = | "FLIC: A Translator for Same-Source Parallel Implementation of Regular Grid Applications", | |
| number | = | "ANL/MCS-TM-223", | |
| month | = | "February", | |
| year | = | "1997", | |
| Abstract | = | " FLIC, a Fortran loop and index converter, is a parser-based source translation tool that automates the conversion of program loops and array indices for distributed-memory parallel computers. This conversion is important in the implementation of gridded models on distributed memory because it allows for decomposition and shrinking of model data structures. FLIC does not provide the parallel services itself, but rather provides an automated and transparent mapping of the source code to calls or directives of the user's choice of run-time systems or parallel libraries. The amount of user-supplied input required by FLIC to direct the conversion is small enough to fit as command line argument for the tool. The tool requires no additional statements, comments, or directives in the source code, thus avoiding the pervasiveness and intrusiveness imposed by directives-based preprocessors and parallelizing compilers. FLIC is lightweight and suitable for use as a precompiler and facilitates a same-source approach to operability on diverse computer architectures. FLIC is targeted to new or existing applications that employ regular gridded domains, such as weather models, that will be parallelized by data-domain decomposition.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM223.ps.Z"} |
| author | = | "M. Wenzel and J. Czyzyk and S. Wright", | |
| title | = | "Computational Experience with a Dense Column Feature for Interior-Point Methods", | |
| number | = | "ANL/MCS-TM-227", | |
| month | = | "August", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1997", | |
| Abstract | = | " Most software that implements interior-point methods for linear programming formulates the linear algebra at each iteration as a system of normal equations. This approach can be extremely inefficient when the constraint matrix has dense columns, because the density of the normal equations matrix is much greater than the constraint matrix and the system is expensive to solve. In this report we describe a more efficient approach for this case, that involves handling the dense columns by using a Schur-complement method and conjugate gradient iteration. We report numerical results with the code PCx, into which our technique now has been incorporated.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM227.ps.Z"} |
| author | = | "Larry Wos", | |
| title | = | "Experiments Concerning the Automated Search for Elegant Proofs", | |
| number | = | "ANL/MCS-TM-221", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " The research reported in this technical report was spawned by the request to find an elegant proof (of a theorem from Boolean algebra) to replace the known proof consisting of 816 deduced steps. The request was met by finding a proof consisting of 100 deduced steps. The methodology used to obtain the far shorter proof is presented in detail through a sequence of experiments. Although clearly not an algorithm, the methodology is sufficiently general to enable its use for seeking elegant proofs regardless of the domain of study. The methodology relies heavily on the assistance of McCune's automated reasoning program OTTER. Of the aspects of proof elegance, the main focus here is on proof length, with brief attention paid to the type of term present, the number of variables required, and the complexity of deduced steps. The methodology is iterative, relying heavily on the use of three strategies: the resonance strategy, the hotlist strategy, and McCune's ratio strategy. To provide some insight regarding the value of the methodology, I discuss its successful application to other problems from Boolean algebra and to problems from lattice theory. Research suggestions and challenges are also offered.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/TM221.ps.Z"} |
| author | = | "J. Abate and C. Bischof and L. Roh and A. Carle", | |
| title | = | "Algorithms and Design for a Second-Order Automatic Differentiation Module", | |
| booktitle | = | "Proc. Int. Symp. on Symbolic and Algebraic Computing (ISSAC) '97", | |
| pages | = | "149-155", | |
| publisher | = | "ACM", | |
| address | = | "New York", | |
| year | = | "1997", | |
| number | = | " ANL/MCS-P636-0197", | |
| Abstract | = | " This article describes approaches to computing second-order derivatives with automatic differentiation (AD) based on the forward mode and the propagation of univariate Taylor series. Performance results are given that show the speedup possible with these techniques relative to existing approaches. We also describe a new source transformation AD module for computing second-order derivatives of C and Fortran codes and the underlying infrastructure used to create a language-independent translation tool.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P636.ps.Z"} |
| title | = | "Solution of the Robbins Problem", | |
| journal | = | "J. Automated Reasoning", | |
| volume | = | "19", | |
| issue | = | "3", | |
| month | = | "December", | |
| year | = | "1997", | |
| pages | = | " 263-276", | |
| Abstract | = | " In this article we show that the three equations known as commutativity, associativity, and the Robbins equation are a basis for the variety of Boolean algebras. The problem was posed by Herbert Robbins in the 1930s. The proof was found automatically by EQP, a theorem-proving program for equational logic. We present the proof and the search strategies that enabled the program to find the proof.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P642.ps.Z"} |
| author | = | "C. H. Bischof and P.-T. Wu", | |
| title | = | "Time-Parallel Computation of Pseudo-Adjoints for a Leapfrog Scheme", | |
| number | = | "ANL/MCS-P639-0197", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1997", | |
| Abstract | = | " The leapfrog scheme is a commonly used second-order difference scheme or solving differential equations. If Z(t) denotes the state of the system at time t, the leapfrog scheme computes the state at the next time step as | |
| Z(t+1) | = | H(Z(t),Z(t-1),W), where H is the nonlinear timestepping operator and W are parameters that are not time dependent. In this article, we show how the associativity of the chain rule of differential calculus can be used to compute a so-called adjoint $x^T$ * (dZ(t)/d[Z(0),W]) efficiently in a parallel fashion. to this end, we (1) employ the reverse mode of automatic differentiation at the outermost level, (2) use a sparsity-exploiting incarnation of the forward mode of automatic differentiation to compute derivatives of H at every time step, and (3) exploit chain rule associativity to compute derivatives at individual time steps in parallel. We report on experimental results with a 2-D shallow-water equation model problem on an IBM SP parallel computer and a network of Sun SPARCstations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P639.ps.Z"} |
| author | = | "T. Disz and M. E. Papka and R. Stevens", | |
| title | = | "UbiWorld: An Environment Integrating Virtual Reality, Supercomputing, and Design", | |
| note | = | "ANL/MCS-P641-0197", | |
| booktitle | = | "Proc. Fifth IEEE International Symposium on High Performance Distributed Computing (HPDC-5)", | |
| year | = | "to appear", | |
| Abstract | = | " UbiWorld is a concept being developed by the Futures Laboratory group at Argonne National Laboratory that ties together the notion of ubiquitous computing (Ubicomp) with that of using virtual reality for rapid prototyping. The goal is to develop an environment where one can explore Ubicomp-type concepts without having to build real Ubicomp hardware. The basic notion is to extend object models in a virtual world by using distributed wide area heterogeneous computing technology to provide complex networking and processing capabilities to virtual reality objects.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P641.ps.Z"} |
| author | = | "S. J. Wright", | |
| title | = | "Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P643-0297", | |
| month | = | "March", | |
| year | = | "1997", | |
| Abstract | = | " We describe a slight modification of the well-known sequential quadratic programming method for nonlinear programming that attains superlinear convergence to a primal-dual solution even when the Jacobian of the active constraints is rank deficient at the solution. We show that rapid convergence occurs even in the presence of the roundoff errors that are introduced when the algorithm is implemented in floating-point arithmetic.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P643.ps.Z"} |
| author | = | " E. Y. Bobrovnikova and S. A. Vavasis", | |
| title | = | "Accurate Solution of Weighted Least Squares by Iterative Methods", | |
| number | = | "ANL/MCS-P644-0297", | |
| month | = | "February", | |
| year | = | "1997", | |
| Abstract | = | " We consider the weighted least-squares (WLS) problem with a very ill-conditioned weight matrix. Weighted least-squares problems arise in many applications including linear programming, electrical networks, boundary value problems, and structures. Because of roundoff errors, standard iterative methods for solving a WLS problem with ill-conditioned weights may not give the correct answer. Indeed, the difference between the true and computed solution (forward error) may be large. We propose an iterative algorithm, called MINRES-L, for solving WLS problems. The MINRES-L method is the application of MINRES, a Krylov-space method due to Paige and Saunders, to a certain layered linear system. Using a simplified model of the effects of roundoff error, we prove that MINRES-L gives answers with small forward error. We present computational experiments for some applications.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P644.ps.Z"} |
| author | = | "T. Disz and R. Olson and R. Stevens", | |
| title | = | "Performance Model of the Argonne Voyager Multimedia Server", | |
| booktitle | = | "Proc. 11th International Conference on Application-Specific Systems, Architectures, and Processors (ASAP'97)", | |
| year | = | "to appear", | |
| Abstract | = | " The Argonne Voyager Multimedia Server is being developed in the Futures Lab of the Mathematics and Computer Science Division at Argonne National Laboratory. As a network-based service for recording and playing multimedia streams, it is important that the Voyager system be capable of sustaining certain minimal levels of performance in order for it to be a viable system. In this article, we examine the performance characteristics of the server. As we examine the architecture of the system, we try to determine where bottlenecks lie, show actual vs potential performance, and recommend areas for improvement through custom architectures and system tuning.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P647.ps.Z"} |
| author | = | "R. B. Lehoucq", | |
| title | = | "Truncated QR Algorithms and the Solution of Large-Scale Eigenvalue Problems", | |
| number | = | "ANL/MCS-P648-0297", | |
| year | = | "1997", | |
| Abstract | = | " The QR algorithm has emerged as the general-purpose method of choice for computing the Schur decomposition of a matrix. For most large eigenvalue problems, however, the QR algorithm cannot be used because of the explicit storage of the matrix and because often only the action of the matrix upon a vector (or group of vectors) is available. Typically, only a small number of eigenvalues and the associated invariant subspace are required. This article considers a truncated QR algorithm. We show that a truncated QR algorithm is a generalization of Sorensen's implicitly restarted Arnoldi method to block Arnoldi reductions. Moreover, implicitly restarting an Arnoldi reduction is simultaneous iteration with an implicit projection step to accelerate convergence to the invariant subspace of interest. This is a generalization of the Rayleigh-Ritz procedure on a block Krylov subspace for a non-Hermitian matrix. The moral of our storage is that the large scale eigenvalue problem is intimately involved with the dense one.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P648.ps.Z"} | |
| autohr | = | "W. Gropp and E. Lusk", | |
| title | = | "Sowing MPICH: A Case Study in the Dissemination of a Portable Environment for Parallel Scientific Computing", | |
| journal | = | International Journal of Supercomputer Applications", | |
| year | = | "to appear", | |
| note | = | "ANL/MCS-P650-0297", | |
| Abstract | = | " MPICH is an implementation of the MPI specification for a standard message-passing library interface. In this article we focus on the lessons learned from preparing MPICH for diverse parallel computing environments. These lessons include how to prepare software for configuration in unknown environments; how to structure software to absorb contributions by others; how to automate the preparation of man pages, Web Pages, and other documentation; how to automate prerelease testing for both correctness and performance; and how to manage the inevitable problem reports with a minimum of resources for support.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P650.ps.Z"} |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "A High-Performance MPI Implementation on a Shared-Memory Vector Supercomputer", | |
| journal | = | "Parallel Computing", | |
| year | = | "to appear", | |
| Abstract | = | " In this article we recount the sequence of steps by which MPICH, a high-performance, portable implementation of the Message-Passing Interface (MPI) standard, was ported to the NEC SX-4, a high-performance parallel supercomputer. Each step in the sequence raised issues that are important for shared-memory programming in general and shed light on both MPICH and the SX-4. The result is a low-latency, very high bandwidth implementation of MPI for the NEC SX-4. In the process, MPICH was also improved in several general ways.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P651.ps.Z" |
| author | = | "T. L. Disz and R. Olson and M. E. Papka and R. Stevens and M. Szymanski and R. J. Firby", | |
| title | = | "Two Implementations of Shared Virtual Space Environments, ANL/MCS-P652-0297", | |
| booktitle | = | "Proc. Sixth IEEE International Symposium on High Performance Distributed Computing", | |
| year | = | "to appear", | |
| Abstract | = | " While many issues in the area of virtual reality (VR) research have been addressed in recent years, the constant leaps forward in technology continue to push the field forward. VR research no longer is focused only on computer graphics, but instead has become even more interdisciplinary, combining the fields of networking, distributed computing, and even artificial intelligence. In this article we discuss some of the issues associated with distributed, collaborative virtual reality, as well as lessons learned during the development of two distributed virtual reality applications.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P652.ps.Z" |
| author | = | "T. Disz and I. Judson and R. Olson and R. Stevens", | |
| title | = | "The Argonne Voyager Multimedia Server ANL/MCS-P653-0397", | |
| year | = | "to appear", | |
| booktitle | = | " Proc. HPDC-6", | |
| Abstract | = | " With the growing presence of multimedia-enabled systems, we will see an integration of collaborative computing concepts into the everyday environments of future scientific and technical workplaces. Desktop teleconferencing is in common use today, while more complex desktop teleconferencing technology that relies on the availability of multipoint (greater than two nodes) enabled tools is now starting to become available on PCs. A critical problem when using these collaboration tools is the inability to easily archive multistream, multipoint meetings and make the content available to others. Ideally one would like the ability to capture, record, playback, index, annotate, and distribute multimedia stream data as easily as we currently handle text or still image data. While the ultimate goal is still some years away, the Argonne Voyager project is aimed at exploring and developing media server technology needed to provide a flexible virtual multipoint recording/playback capability. In this article we describe the motivating requirements, architecture, implementation, operation, performance, and related work.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P653.ps.Z"} |
| author | = | "W. Gropp and J. J. More' ", | |
| title | = | "Optimization Environments and the NEOS Server ANL/MCS-P654-0397", | |
| Abstract | = | " The Network-Enabled Optimization System (NEOS) is an Internet-based service for optimization providing information, software, and problem-solving services for optimization. The main components of NEOS are the NEOS Guide and the NEOS Server. Additional information on the various services provided by NEOS can be obtained from the home page of the Optimization Technology Center http://www.mcs.anl.gov/home/otc/.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P654.ps.Z"} |
| author | = | "L. Wos", | |
| title | = | "Programs That Offer Fast, Flawless, Logical Reasoning (ANL/MCS-P655-0397)", | |
| journal | = | "Communication of the ACM", | |
| year | = | "to appear", | |
| Abstract | = | " Sherlock Holmes and Mr. Spock of Star Trek could reason logically and flawlessly, always. Some people you know that that ability, sometimes. Unfortunately, without perfect reasoning, diverse problems arise: (1)Bugs in computer programs. If a sort program places Sun before Intel, more than disappointment is experienced. (2) Flaws in chip design. One Pentium chip became famous because of a flaw. (3) Errors in mathematical proofs. Papers having a title of the form ``On an Error by MacLane'' are well remembered, but not with pleasure (at least by MacLane). How can the likelihood of the various cited disasters be reduced? One answer is automated reasoning.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P655.ps.Z"} |
| author | = | "V. E. Taylor and M. Huang and T. Canfield and R. Stevens and D. Reed and S. Lamm", | |
| title | = | "Performance Modeling of Interactive, Immersive Virtual Environments for Finite Element Simulations", | |
| journal | = | "Intl. J. Supercomputing Applications", | |
| volume | = | "10", | |
| issue | = | "2", | |
| month | = | "spring/fall", | |
| year | = | "1996", | |
| pages | = | "145--156", | |
| note | = | "ANL/MCS-P656-0397", | |
| Abstract | = | " Interactive, immersive virtual environments allow observers to move freely about computer generated 3D objects and to explore new environments. The effectiveness of these environments is dependent upon the graphics used to model reality and the end-to-end lag time (i.e., the delay between a user's action and the display of the result of that action). In this paper we focus on the latter issue, which has been found to be equally important as frame rate for interactive displays. In particular, we analyze the components of lag time resulting from executing a finite element simulation on a multiprocessor system located in Argonne, Illinois connected via ATM to the interactive visualization display located in San Diego, California. The primary application involves the analysis of a disk brake system that was demonstrated at the Supercomputing 1995 conference as part of the Information Wide Area Year (IWAY) project, which entailed the interconnection of various supercomputing centers via a high-bandwidth, limited-access ATM network. The results of the study indicate that the major components of the end-to-end lag are simulation, synchronization, and rendering times; the use of the ATM network resulted in the network time comprising only a small fraction of the end-to-end lag time.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P656.ps.Z"} |
| author | = | "L. Freitag and C. Ollivier-Gooch", | |
| title | = | "Tetrahedral Mesh Improvement Using Swapping and Smoothing", | |
| number | = | "ANL/MCS-P657-0497", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1997", | |
| Abstract | = | " Automatic mesh generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. these methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face- and edge-swapping techniques, which change local connectivity, and optimization-based mesh smoothing methods, which adjust mesh point location. We consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. High-quality meshes are obtained in a computationally efficient manner by using optimization-based smoothing to improve only the worst elements and a smart variant of Laplacian smoothing on the remaining elements. Based on our experiments, we offer several recommendations for the improvement of tetrahedral meshes.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P657.ps.Z"} |
| author | = | "Yuan-Jye Jason Wu", | |
| title | = | "Downdating a Rank-Revealing URV Decomposition", | |
| number | = | "ANL/MCS-P658-0597", | |
| month | = | "May", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1997", | |
| Abstract | = | " The rank-revealing URV decomposition is a useful tool for the subspace-tracking problem in digital signal processing. Updating the decomposition is a stable process. However, downdating a rank-revealing URV decomposition can be unstable because the R factor is ill-conditioned. In this article, we review some existing downdating algorithms for the full-rank URV decomposition in the absence of the U factor and develop a new combined algorithm. The combined algorithm has the merits of low cost and no intermediate breakdown, so the down date is always computable in floating-point arithmetic. For the rank-revealing URV decomposition, we develop a two-step method that applies full-rank downdating algorithms to the signal and noise parts separately without using hyperbolic rotations. We prove that Park and Olden's reduction algorithm and the combined algorithm have relational stabilities for both full-rank and rank-revealing cases. We demonstrate the efficiency and accuracy of our combined algorithm on ill-conditioned problems.", | |
| notte | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P658.ps.Z"} |
| author | = | "J. Michalakes", | |
| title | = | "MM90: A Scalable Parallel Implementation of the Penn State/NCAR Mesoscale Model (MM5)", | |
| number | = | "ANL/MCS-P659-0597", | |
| month | = | "May", | |
| year | = | "1997", | |
| Abstract | = | " This paper describes MM90, a parallel regional weather model based on the Penn State/NCAR MM5. Parallelization of finite differencing, horizontal interpolation, and nesting on distributed-memory (message-passing) computers is handled transparently by using the RSL library package. Fortran90 modules, derived data types, dynamic memory allocation, pointers, and recursion are used, making the code modular, flexible, extensible, and run-time configurable. The model can dynamically sense and correct load imbalances. The paper provides performance, scaling, and load-balancing data collected on the IBM SP2 computers at Argonne National Laboratory and NASA Ames Laboratory. Future work will address the impact of parallel modifications on existing modeling software; an approach using commercially available source translation software is described.", | |
| note | = | " ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P659.ps.Z"} |
| autohr | = | "D. P. Diachin and J. A. Herzog", | |
| title | = | "Analytic Streamline Calculations on Linear Tetrahedra (ANL/MCS-P660-0597)", | |
| booktitle | = | "13th AIAA Computational Fluid Dynamics Conference", | |
| year | = | "to appear", | |
| Abstract | = | " Analytic solutions for streamlines within tetrahedra are used to define operators that accurately and efficiently compute streamlines. The method presented here is based on linear interpolation, and therefore produces exact results for linear velocity fields. In addition, the method requires less computation than the forward Euler numerical method. Results are presented that compare accuracy measurements of the method with forward Euler and fourth-order Runge-Kutta applied to both a linear and a nonlinear velocity field.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P660.ps.Z"] |
| author | = | "S. Fitzgerald and I. Foster and C. Kesselman and G. von Laszewski and W. Smith and S. Tuecke", | |
| title | = | "A Directory Service for Configuring High-Performance Distributed Computations (ANL/MCS-P662-0597)", | |
| booktitle | = | "Proc. Sixth IEEE International Symposium on High Performance Distributed Computing", | |
| year | = | "to appear", | |
| Abstract | = | " High-performance execution in distributed computing environments often requires careful selection and figuration not only of computers, networks, and other resources but also of the protocols and algorithms used by applications. Selection and configuration in turn require access to accurate, up-to-date information on the structure and state of available resources. Unfortunately, no standard mechanism exists for organizing or accessing such information. Consequently, different tools and applications adopt ad hoc mechanisms, or they compromise their portability and performance by using default configurations. We propose a Metacomputing Directory Service that provides efficient and scalable access to diverse, dynamic, and distributed information about resource structure and state. We define an extensible data model to represent required information and present a scalable, high-performance, distributed implementation. The data representation and application programming interface are adopted from the Lightweight Directory Access Protocol; the data model and implementation are new. We use the Globus distributed computing toolkit to illustrate how this directory service enables the development of more flexible and efficient distributed computing services and applications.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P662.ps.Z"} |
| author | = | "J. G. Michalakes", | |
| title | = | "RSL: A Parallel Runtime System Library for Regional Atmospheric Models with Nesting", | |
| number | = | "ANL/MCS-P663-0597", | |
| montn | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " RSL is a parallel runtime system library developed at Argonne National Laboratory that is tailored to regular-grid atmospheric models with mesh refinement in the form of two-way interacting nested grids. RSL provides high-level stencil and interdomain communication, irregular domain decomposition, automatic local/global index translation, distributed I/O, and dynamic load balancing. RSL was used with Fortran90 to parallelize a well-known and widely used regional weather model, the Penn State/NCAR Mesoscale Model.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P663.ps.Z"} |
| author | = | " C. V. Rao and S. J. Wright and J. B. Rawlings", | |
| title | = | "Application of Interior-Point Methods to Model Predictive Control", | |
| number | = | "ANL/MCS-P664-0597", | |
| month | = | "July", | |
| yeaer | = | "1997", | |
| Abstract | = | " We present a structured interior-point method for the efficient solution of the optimal control problem in model predictive control (MPC). The cost of this approach is linear in the horizon length, compared with cubic growth for a naive approach. We use a discrete Riccati recursion to solve the linear equations efficiently at each iteration of the interior-point method, and shows that we can expect this recursion to be numerically stable although it was motivated originally by structural rather than numerical considerations. We demonstrate the effectiveness of our approach by solving three process control problems.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P664.ps.Z"} |
| author | = | "T. L. Disz and M. Henderson and W. Nickless and R. Olson and M. E. Papka and R. Stevens", | |
| title | = | "Argonne's Computing and Communications Infrastructure Futures Laboratory: Designing the Future", | |
| number | = | "ANL/MCS-P665-0597", | |
| month | = | "July", | |
| year | = | " 1997", | |
| Abstract | = | " The Futures Lab was founded within the Mathematics and Computer Science Division of Argonne National Laboratory in the fall of 1994. The goal of the lab is to develop new technology and systems to support collaborative science. In order to meet this goal, the lab is organized around three research areas: advanced networking, multimedia, and virtual environments.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P665.ps.Z"} |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "Why Are PVM and MPI So Different?", | |
| number | = | "ANL/MCS-P667-0697", | |
| institution | = | "Argonne National Laboratory", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " PVM and MPI are often compared. These comparisons usually start with the unspoken assumption that PVM and MPI represent different solutions to the same problem. In this paper we show that, in fact, the two systems often are solving different problems. In cases where the problems do match but the solution chosen by PVM and MPI are different, we explain the reasons for the differences. Usually such differences can be traced to explicit differences in th goals of the two systems, their origins, or the relationship between their specifications and their implementations.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P667.ps.Z"} |
| author | = | "L. Freitag and M. Jones and P. Plassmann", | |
| title | = | "A Parallel Algorithm for Mesh Smoothing", | |
| institution | = | "Argonne National Laboratory", | |
| number | = | "ANL/MCS-P668-0697", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " Maintaining good mesh quality during the generation and refinement of unstructured meshes in finite-element application is an important aspect in obtaining accurate discretizations and well-conditioned linear systems. In this article, we present a mesh-smoothing algorithm based on nonsmooth optimization techniques and a scalable implementation of this algorithm. We prove that the parallel algorithm has a provably fast runtime bound and executes correctly for a PRAM computational model. We extend the PRAM algorithm to distributed memory computers and report results for two- and three-dimensional simplicial meshes that demonstrate the efficiency and scalability of this approach for a number od different test cases. We also examine the effect of different architectures on the parallel algorithm and present results for the IBM SP supercomputer and an ATM-connected network of SPARC Ultras.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P668.ps.Z"} |
| author | = | "J. N. Lyness and S. Joe", | |
| title | = | "A Nonabstract Approach to Lattice Rule Canonical Forms", | |
| number | = | "ANL/MCS-P669-0697", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " The rank and invariants of a general lattice rule conventionally are defined in terms of the group-theoretic properties of the rule. Here we give a nonabstract definition of the rank and invariants by exploiting what we term the Sylow p-decomposition of a lattice rule. This decomposition allows a canonical D-Z form to be calculated for any lattice rule. A new set of necessary and sufficient conditions for recognizing a canonical form is given.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P669.ps.Z"} |
| author | = | "M. Batdorf and L. A. Freitag and C. Ollivier-Gooch", | |
| title | = | "A Computational Study of the Effect of Unstructured Mesh Quality on Solution Efficiency", | |
| number | = | "ANL/MCS-P672-0697", | |
| month | = | "July", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "1997", | |
| Abstract | = | " It is well known that mesh quality affects both efficiency and accuracy of CFD solutions. Meshes with distorted elements make solutions both more difficult to compute and less accurate. We review a recently proposed technique for improving mesh quality as measured by element angle (dihedral angle in three dimensions) using a combination of optimization-based smoothing techniques and local reconnection schemes. Typical results that quantify mesh improvement for a number of application meshes are presented. We then examine effects of mesh quality as measured by the maximum angle in the mesh on the convergence rates of two commonly used CFD solution techniques. Numerical experiments are performed that quantify the cost and benefit of using mesh optimization schemes for incompressible flow over a cylinder and weakly compressible flow over a cylinder.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P672.ps.Z"} |
| author | = | "P. Hovland and M. Heath", | |
| title | = | "Adaptive SOR: A Case Study in Automatic Differentiation of Algorithm Parameters", | |
| number | = | "ANL/MCS-P673-0797", | |
| month | = | "July", | |
| year | = | "1997", | |
| Abstract | = | " Many algorithms make use of one or more parameters to control the behavior of the algorithm. Examples include the damping factor alpha in a damped Newton method or the relaxation parameter omega in a successive over-relaxation (SOR) iterative solver. The optimal value of such parameters is problem dependent and difficult to determine for most problems. We describe the use of automatic differentiation (AD) to adjust algorithm parameters toward optimal behavior. We demonstrate how AD can be used to transform an SOR solver with fixed omega into an adaptive SOR solver that adjusts omega toward its optimal value. We provide experimental evidence that for large problems with lax convergence criteria such an adaptive solver may converge faster than a solver using an optimal, but fixed, value for omega. These are exactly the conditions that apply when SOR is used as a preconditioner, its most common use in modern scientific computing.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P673.ps.Z"} |
| author | = | "A. C. Morlet", | |
| title | = | "Further Properties of a Continuum of Model Equations with Globally Defined Flux", | |
| number | = | "ANL/MCS-P678-0897", | |
| month | = | "August", | |
| year | = | "1997", | |
| institution | = | "Argonne National Laboratory", | |
| Abstract | = | " To develop an understanding of singularity formation in vortex sheets, we consider model equations that exhibit shared characteristics with the vortex sheet equation but are slightly easier to analyze. A model equation is obtained by replacing the flux term in Burgers' equation by alternatives that contain contributions depending globally on the solution.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P678.ps.Z"} |
| author | = | "Hans G. Kaper and Bixiang Wang and Shouhong Wang", | |
| title | = | "Determining Nodes for the Ginzburg-Landau Equations of Superconductivity", | |
| number | = | "ANL/MCS-P683-0897", | |
| month | = | "September", | |
| year | = | "1997", | |
| Abstract | = | " It is shown that a solution of the time-independent Ginzburg-Landau equations of superconductivity is determined completely and exactly by its values at a finite but sufficiently dense set of determining nodes in the domain. If the applied magnetic field is time dependent and asymptotically stationary, the large-time asymptotic behavior of a solution of the time-dependent Ginzburg-Landau equations of superconductivity is determined similarly by its values at a finite set of determining nodes, whose positions may vary with time.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P683.ps.Z"} |
| author | = | "L. Wos with G. W. Pieper", | |
| title | = | "The Hot List Strategy (ANL/MCS-P684-0897)", | |
| journal | = | "J. Automated Reasoning", | |
| year | = | "to appear", | |
| Abstract | = | " Experimentation strongly suggests that, for attacking deep questions and hard problems with the assistance of an automated reasoning program, the more effective paradigms rely on the retention of deduced information. A significant obstacle ordinarily presented by such a paradigm is the deduction and retention of one or more needed conclusions whose complexity sharply delays their consideration. To mitigate the severity of the cited obstacle, I formulated and feature in this article the hot list strategy. The hot list strategy asks the researcher to choose, usually from among the input statements characterizing the problem under study, one or more statements that are conjectured to play a key role for assignment completion. The chosen statements---conjectured to merit revisiting, again and again---are placed in an input list of statements, called the hot list. When an automated reasoning program has decided to retain a new conclusion C---before any other statement is chosen to initiate conclusion drawing---the presence of a nonempty hot list (with an appropriate assignment of the input parameter known as heat) causes each inference rule in use to be applied to C together with the appropriate number of members of the hot list. Members of the hot list are used to complete> applications of inference rules and not to initiate applications. The use of the hot list strategy thus enables an automated reasoning program to briefly consider a newly retained conclusion whose complexity would otherwise prevent its use for perhaps many CPU-hours. To give evidence of the value of the strategy, I focus on four contexts: (1) dramatically reducing the CPU time required to reach a desired goal, (2) finding a proof of a theorem that had previously resisted all but the more inventive automated attempts, (3) discovering a proof that is more elegant than previously known, and (4) answering a question that had steadfastly eluded researchers relying on an automated reasoning program. I also discuss a related strategy, the dynamic hot list strategy (formulated by my colleague W. McCune), that enables the program during a run to augment the contents of the hot list. In the Appendix, I give useful input files and interesting proofs. Because of frequent requests to do so, I include challenge problems to consider, commentary on my approach to experimentation and research, and suggestions to guide one in the use of McCune's automated reasoning program OTTER.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P684.ps.Z"} |
| author | = | "Anne C. Morlet", | |
| title | = | "An Improved Model Equation with Globally Defined Flux for the Vortex Sheet Equation: Analytical Results", | |
| number | = | "ANL/MCS-P685-0997", | |
| month | = | "September", | |
| year | = | "1997", | |
| Abstract | = | " We present an improved model for the vortex sheet equation, that combines some of the features of the models of Beale and Schaeffer, Dhanak, and Baker et al. We regularize the Beale-Schaeffer equation with a second-order viscous regularizing term, and we add a globally defined flux term in conservative form. We derive bounds for the solution of the equation obtained. We analyze the results.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P685.ps.Z"] |
| author | = | "P. Hovland and B. Mohammadi and C. Bischof", | |
| title | = | " Automatic Differentiation and Navier-Stokes Computations", | |
| number | = | "ANL/MCS-P687-0997", | |
| month | = | "October", | |
| year | = | "1997", | |
| Abstract | = | " We describe the use of automatic differentiation (AD) to enhance a compressible Navier-Stokes model. Within the solver, AD is used to accelerate convergence by more than an order of magnitude. Outside the solver, AD is used to compute the derivatives needed for optimization. We emphasize the potential for performance gains if the programmer does not treat AD as a black box, but instead utilizes high-level knowledge about the nature of the application.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P687.ps.Z"} |
| author | = | "R. B. Lehoucq and S. K. Gray and D.-H. Zhang and J. C. Light", | |
| title | = | "Vibrational Eigenstates of Four-Atom Molecules: A Parallel Strategy Employing the Implicitly Restarted Lanczos Method", | |
| number | = | "ANL/MCS-P689-0997", | |
| month | = | "September", | |
| year | = | "1997", | |
| Abstract | = | " We present an approach for determining the vibrational eigenstates of four-atom molecules. The primary representation of the (six-dimensional) eigenstates involves a finite basis or quantum number representation, whereas Hamiltonian matrix-vector products are evaluated with the aid of certain grid or discrete variable representations. This approach leads to computational and memory demands that are within acceptable limits. The implicitly restarted Lanczos method, as implemented in the ARPACK suites of codes, is then applied to determine some of the corresponding vibrational eigenstates. A distributed-memory parallel implementation of the method allows very large symmetric matrix eigenvalue problems to be tackled. | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P689.ps.Z"} |
| author | = | "H. G. Kaper and S. Tipei and E. Wiebel", | |
| title | = | "High-Performance Computing, Music Composition, and the Sonification of Scientific Data", | |
| number | = | "ANL/MCS-P690-0997", | |
| month | = | "September", | |
| year | = | "1997", | |
| Abstract | = | " Music composition and scientific computing are usually considered separate and unrelated fields of intellectual activity. The thought of a musical piece being the result of involved calculations is not a familiar one; nor is that of using sound objects to present the results of large-scale scientific computations. However, an unusual collaboration centered on the high-performance computing capabilities at Argonne National Laboratory pursues precisely these two ideas.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P690.ps.Z"] |
| author | = | "M. Tobis and I. T. Foster and C. M. Schafer and R. L. Jacob and J. R. Anderson", | |
| title | = | "FOAM: Expanding the Horizons of Climate Modeling", | |
| number | = | "ANL/MCS-P691-0997", | |
| month | = | "October", | |
| year | = | " 1997", | |
| Abstract | = | " We report here on a project that expands the applicability of dynamic climate modeling to very long time scales. The FAst Ocean Atmosphere Model (FOAM) is a coupled ocean atmosphere model that incorporates physics of interest in understanding decade to century time scale variability. It addresses the high computational cost of this endeavor with a combination of improved ocean model formulation, low atmosphere resolution, and efficient coupling. It also uses message passing parallel processing techniques, allowing for the use of cost effective distributed memory platforms. The resulting model runs over 6000 times faster than real time with good fidelity, and has yielded significant results." |
| author | = | "R. Sheng and F. A. Potra", | |
| title | = | "Nonsymmetric Search Directions for Semidefinite Programming", | |
| number | = | "ANL/MCS-P692-0997", | |
| month | = | "September", | |
| year | = | "1997", | |
| Abstract | = | " Two nonsymmetric search directions for semidefinite programming, the XZ and ZX search directions, are proposed. They are derived from a nonsymmetric formulation of the semidefinite programming problem. We present an algorithm using the XZ and ZX directions alternately following the Mehrotra predictor-corrector framework. Numerical results show that the XZ/ZX algorithm is, in most cases, faster than the XZ+ZX method of Alizadeh, Overton, and Haeberly (AHO) while achieving similar accuracy.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P692.ps.Z"} |
| author | = | "R. Overbeek and N. Larsen and N. Maltsev and G. D. Pusch and E. Selkov", | |
| title | = | "Metabolic Reconstruction Using the WIT/WIT2 Systems (ANL/MCS-P694-0997)", | |
| booktitle | = | " Biology Databases", | |
| editor | = | " Stan Letovsky', | |
| publisher | = | "Kluwer Academic", | |
| Abstract | = | " For the past few years, we have been developing metabolic reconstructions for organisms that have been sequenced, and we have made a number of these working models available. By the term metabolic reconstruction we mean the process of inferring the metabolism of an organism from its genetic sequence data supplemented by known biochemical and phenotypic data. Our initial software system to support metabolic reconstruction was called WIT (for "What Is There?") and has been in use since mid-1995. Recently, a second system, which we have called WIT2, has been made available. In this chapter we discuss the central design issues in constructing such systems, along with the basic steps that must be supported by any such system.", | |
| note | = | "ftp://info.mcs.anl.gov/pub/tech\_reports/reports/P694.html"} |
| author | = | "W. McCune", | |
| title | = | "Automatic Proofs and Counterexamples for Some Ortholattice Identities", | |
| journal | = | "Information Processing Letters", | |
| volume | = | " 65", | |
| year | = | "1998", | |
| pages | = | "285-291", |
| author | = | "R. B. Lehoucq and Krl Meergergen", | |
| title | = | "Using Generalized Cayley Transformations within an Inexaact Rational Krylov Sequence Method", | |
| journal | = | "SIAM J. Matrix Anal. Appl.", | |
| volume | = | "20", | |
| number | = | 1, | |
| year | = | 1998, | |
| pages | = | "131-148", |
| author | = | "B. F. Smith", | |
| title | = | "An Interface for Efficient Vector Scatters and Gathers on Parallel Machines", | |
| number | = | "ANL/MCS-P701-1197", | |
| year | = | "1998", |
| author | = | "J. Michalakes", | |
| title | = | "Same-Source Parallel Implementation of the PSU/NCAR MM5", | |
| number | = | "ANL/MCS-P702-1297", | |
| year | = | "1998", |
| author | = | "J. Czyzyk and T. Wisniewski and S. J. Wright", | |
| title | = | "Optimization Case Studies in the NEOS Guide", | |
| journal | = | "SIAM Review", | |
| volume | = | " 41", | |
| number | = | "1", | |
| year | = | " 1999," | |
| pages | = | "148-163" |
| author | = | "S. J. Wright", | |
| title | = | "Algorithms and Software for Linear and Nonlinear Programming", | |
| booktitle | = | "Foundations of Computer-Aided Process Design, AIChE Symposium Series", | |
| publisher | = | "CACHE Publications", | |
| year | = | "1999"} |
| author | = | "M. Anitescu and R. Serban", | |
| title | = | ""A Sparse Superlinearly Convergent SQP with Applications to Two-dimensional Shape Optimization", | |
| number | = | "ANL/MCS-P706-0198", | |
| year | = | "1998", |
| author | = | "M. E. Papka and R. Stevens and M. Szymanski", | |
| title | = | ""Collaborative Virtual Reality Environments for Computational Science and Design", | |
| booktitle | = | "Computer Aided Design of High Temperature Materials", | |
| editor | = | "A. Pechenik and R. K. Kalia and P. Vashishta", | |
| publisher | = | "Oxford University Press", | |
| year | = | "1998", |
| author | = | "M. C. Ferris and M. P. Mesnier and J. J. More'", | |
| title | = | "NEOS and CONDOR: Solving Optimization Problems over the Internet", | |
| number | = | "ANL/MCS-P708-0398", | |
| year | = | "1998", |
| author | = | B. M. Averick and J. J More'", | |
| title | = | "Evaluation of Large-Scale Optimizaiton Problems on Vector and Parallel Architectures", | |
| journal | = | "SIAM J. Optimization", | |
| volume | = | "4", | |
| issue | = | "4", | |
| year | = | "1994", | |
| pages | = | "708-721"} |
| author | = | "P. Verlinden and D. M. Potts and J. N. Lyness", | |
| title | = | "Error Expansions for Multidimensional Trapezoidal Rules with Sidi Transformations", | |
| journal | = | "Numerical Algorithms", | |
| volume | = | "16", | |
| year | = | "1997," | |
| pages | = | "321-348", |
| author | = | "W. L. Wan and T. F. Chan and B. Smith", | |
| title | = | "An Energy-Minimizing Interpolation for Robust Multigrid Methods", | |
| number | = | "ANL/MCS-P710-0298", | |
| year | = | "1998", | |
| note | = | "P710.ps.Z", |
| author | = | "B. F. Smith", | |
| title | = | "The Transition of Numerical Software: From Nuts-and-Bolts to Abstraction", | |
| journal | = | "SIGNUM Newsletter", | |
| month | = | "January", | |
| year | = | "1998", | |
| note | = | "P713.ps.Z", |
| author | = | "D. Diachin and L. Freitag and M. Heath and L. Herzog and W. Michels", | |
| title | = | "Interactive Simulation and Visualization of Massless, Massed, and Evaporating Particles", | |
| journal | = | "IIE Transactions", | |
| volume | = | "30", | |
| number | = | "7", | |
| year | = | "1998", | |
| pages | = | "621-628", |
| author | = | "T. R. Canfield", | |
| title | = | "Simulation and Visualization of Mechanical Systems in Immersive Virtual Environments", | |
| booktitle | = | "Proc. Engineering Mechanics: A Force for the 21st Century" | |
| address | = | "LaJolla, CA", | |
| year | = | "1998", |
| author | = | "M. Anitescu and F. A. Potra and D. E. Stewart", | |
| title | = | "Time-Stepping for Three-Dimensional Rigid Body Dynamics", | |
| number | = | "ANL/MCS-P716-0498", | |
| year | = | "1998", | |
| note | = | "P716.html", |
| author | = | "R. Thakur and W. Gropp and E. Lusk", | |
| title | = | "A Case for Using MPI's Derived Datatypes to Improve I/O Performance", | |
| booktitle | = | "Proceedings of SC98: High Performance Networking and Computing", | |
| year | = | "1998", | |
| note | = | "P717.ps.Z", |
| author | = | "S. Brunett and K. Czajkowski and I. Foster and C. Kesselman and J. Leigh and S. Tuecke", | |
| title | = | ""Application Experiences with the Globus Toolkit", | |
| number | = | "ANL/MCS-P718-0698", | |
| year | = | "1998", | |
| note | = | "P718.ps.Z", |
| author | = | "P. Stelling and I. Foster and C. Kesselman and C. Lee and G. von Laszewski", | |
| title | = | "A Fault Detection Service for Wide Area Distributed Computations", | |
| number | = | "ANL/MCS-P719-0698", | |
| year | = | "1998", | |
| note | = | "P719.ps.Z", |
| author | = | "H. G. Kaper and S. Tipei", | |
| title | = | "Manifold Compositions, Music Visualization, and Scientific Sonification in an Immersive Virtual-Reality Environment", | |
| booktitle | = | "Proc. Int'l Computer Music Conference '98", | |
| year | = | "1998", | |
| pages | = | "399-405", | |
| note | = | "P720.ps.Z", |
| author | = | "M. Garbey and H. G. Kaper", | |
| title | = | "Asymptotic-Numerical Study of Supersensitivity for Generalized Burgers Equations", | |
| number | = | "ANL/MCS-P721-0798", | |
| year | = | "1998", | |
| note | = | "P721.ps.Z", |
| author | = | "L. A. Freitag and C. Ollivier-Gooch", | |
| title | = | "A Cost/Benefit Analysis of Simplicial Mesh Improvement Techniques as Measured by Solution Efficiency", | |
| note | = | "P722.ps.Z", |
| author | = | "R. Thakur and W. Gropp and E. Lusk", | |
| title | = | "Data Sieving and Collective I/O in ROMIO", | |
| number | = | "ANL/MCS-P723-0898", | |
| year | = | "1998", | |
| note | = | "P723.ps.Z", |
| author | = | "C.-J. Lin and J. J. More'", | |
| title | = | "Newton's Method for Large Bound-Constrained Optimization Problems", | |
| journal | = | "SIAM Journal on Optimization", | |
| year | = | "1999", | |
| volume | = | "9", | |
| issue | = | "4", | |
| pages | = | "1100-1127", | |
| note | = | "P724.ps.Z", |
| author | = | "H. G. Kaper and P. Takac", | |
| title | = | "Bifurcating Vortex Solutions of the Complex Ginzburg-Landau Equation", | |
| journal | = | "Discrete and Continuous Dynamical Systems", | |
| volume | = | "5", | |
| number | = | "4", | |
| year | = | "1999", | |
| pages | = | "871-880", | |
| note | = | "P725.ps.Z", |
| author | = | "L. Freitag and M. Jones and P. Plassmann", | |
| title | = | "Mesh Component Design and Software Integration within SUMAA3d", | |
| booktitle | = | "Proceedings of the SIAM Workshop on Interoperable Scientific Computing", | |
| publisher | = | IBM T. J. Watson Research Center", | |
| address | = | "New York", | |
| year | = | "1998", | |
| pages | = | "215-224", |
| author | = | " S. Balay and B. Gropp and L. C. McInnes and B. Smith", | |
| title | = | "A Microkernel Design for Component-based Parallel Numerical Software Systems", | |
| number | = | "ANL/MCS-P727-0998", | |
| year | = | "1998", | |
| note | = | "P727.ps.Z", |
| author | = | "J. L. Tilson and M. Minkoff and A. F. Wagner and R. Shepard and P. Sutton and R. J. Harrison and R. A. Kendall and A. T. Wong", | |
| title | = | "High-Performance Computational Chemistry: Hartree-Fock Electronic Structure Calculations on Massively Parallel Processors", | |
| journal | = | "International J. High Peformance Computing Applications"< | |
| volume | = | "13", | |
| number | = | "4", | |
| year | = | "1999", | |
| pages | = | "291-302" |
| author | = | "R. R. Meyer and G. Zakeri", | |
| title | = | "Multicoordinatino Methods for Solving Convex Block-Angular Programs", | |
| journal | = | "SIAM J. Optim.", | |
| volume | = | "10", | |
| number | = | "1", | |
| pages | = | "121-131", | |
| year | = | "1999"} |
| author | = | "J. A. Taylor and J. C. Orr", | |
| title | = | "The Natural Latitudinal Distribution of Atmospheric CO2", | |
| number | = | "ANL/CGC-002-0400", | |
| month | = | "April", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. S. Mullen and P. F. Fischer", | |
| title | = | "Filtering Techniques for Complex Geometry Fluid Flows", | |
| journal | = | "Comm. in Num. Meth. in Eng.", | |
| volume | = | "15", | |
| year | = | "1999", | |
| pages | = | "9-18", | |
| note | = | "P729.ps.Z", |
| author | = | "P. F. Fischer and N. I. Miller and H. M. Tufo", | |
| title | = | "An Overlapping Schwarz Method for Spectral Element Simulation of Three-Dimensional Incompressible Flows", | |
| number | = | "ANL/MCS-P730-1098", | |
| year | = | "1998", | |
| note | = | "P730.ps.Z", |
| author | = | "P. Hovland and B. Norris and L. Roh and B. Smith", | |
| title | = | "Developing a Derivative-Enhanced Object-Oriented Toolkit for Scientific Computations", | |
| number | = | "ANL/MCS-P731-1098", | |
| year | = | "1998", | |
| note | = | "P731.ps.Z", |
| author | = | "R. Thakur and W. Gropp and E. Lusk", | |
| title | = | "On Implementing MPI-IO Portably and with High Performance", | |
| booktitle | = | "Proceedings of the 6th Workshop on I/O in Parallel and Distributed Systems", | |
| year | = | "1999", | |
| pages | = | "23-32"} | |
| note | = | " P732.ps.Z", |
| author | = | "R. Overbeek and M. Fonstein and M. D'Souza and N. Maltsev and G. D. Pusch", | |
| title | = | "The Use of Gene Clusters to Infer Functional Coupling", | |
| journal | = | "Proc. Natl. Acad. Sci.", | |
| volume | = | "96", | |
| year | = | "1999", | |
| pages | = | "2896-2901", | |
| note | = | "P733.ps.Z", |
| author | = | "H. M. Tufo and P. F. Fischer", | |
| title | = | "Fast Parallel Direct Solvers for Coarse Grid Problems", | |
| number | = | "ANL/MCS-P734-1198", | |
| year | = | "1998", | |
| number | = | "P735.pdf", |
| author | = | "J. Michalakes and J. Dudhia and D. Gill and J. Klemp and W. Skamarock", | |
| title | = | "Design of a Next-Generation Regional Weather Research and Forecast Model", | |
| number | = | "ANL/MCS-P735-1198", | |
| year | = | "1998", | |
| note | = | "P735.ps.Z", |
| author | = | "H. G. Kaper and S. Tipei and E. Wiebel", | |
| title | = | "Data Sonification and Sound Visualization", | |
| hournal | = | "Computing in Science and Engineering", | |
| volume | = | "1", | |
| number | = | "4", | |
| year | = | "1999", | |
| pages | = | "48-58", | |
| note | = | "P738.ps.Z", |
| author | = | "W. Benger and I. Foster and J. Novotny and E. Seidel and J. Shalf and W. Smith and P. Walker", | |
| title | = | "Numerical Relativity in a Distributed Environment", | |
| number | = | "ANL/MCS-P739-0199", | |
| year | = | "1999", | |
| note | = | "P739.ps.Z", |
| author | = | "Z. Ren and R. Sheng and S. J. Wright", | |
| title | = | "Advanced Computational Techniques for Laue Diffraction", | |
| number | = | "ANL/MCS-P740-0199", | |
| year | = | "1999", | |
| note | = | "P740.ps.Z", |
| author | = | "I. Foster and N. T. Karonis and C. Kesselman and S. Tuecke", | |
| title | = | "Managing Security in High-Performance Distributed Computations", | |
| journal | = | " Cluster Computing", | |
| volume | = | "1", | |
| number | = | "1", | |
| year | = | "1998", | |
| pages | = | "95-107", | |
| note | = | "P741.ps.Z", |
| author | = | "R. Thakur and W. Gropp and E. Lusk", | |
| title | = | "Achieving High Performance with MPI-IO", | |
| number | = | "ANL/MCS-P742-0299", | |
| year | = | "1999", | |
| note | = | "P742.pdf", |
| author | = | "P. Wang, and S. Balay and K. Sepehrnoori and J. Wheeler and J. Abate and B. Smith and G. A. Pope", | |
| title | = | "A Fully Implicit Parallel EOS Compositional Simulator for Large Scale Reservoir Simulation", | |
| booktitle | = | "Proc. 1999 Soc. of Petroleum Engineers, 15th Reservoir Simulation Symposium", | |
| year | = | "1998", | |
| note | = | "ANL/MCS-P743-1298, P743.ps.Z", |
| author | = | "L. Freitag and T. Urness", | |
| title | = | "Analyzing Industrial Furnace Efficiency Using Comparative Visualization in a Virtual Reality Environment", | |
| number | = | "ANL/MCS-P744-0299", | |
| year | = | "1999", | |
| note | = | "P744.ps.Z", |
| author | = | "D. K. Kaushik and D. E. Keyes and B. F. Smith", | |
| title | = | "Newton-Krylov-Schwarz Methods for Aerodynamics Problems: Compressible and Incompressible Flows on Unstructured Grids", | |
| booktitle | = | "Proc. 11th International Conference on Domain Decomposition Methods", | |
| editor | = | "C-H. Lai and P. Bjorstad and M. Cross and O. Widlunch", | |
| publisher | = | "DDM.org", | |
| year | = | "1998", | |
| note | = | " ANL/MCS-P745-1298, P745.html", |
| author | = | "R. Overbeek and M. Fonstein and M. D'Souza and G. D. Pusch and N. Maltsev", | |
| title | = | "Use of Contiguity on the Chromosome to Predict Functional Coupling", | |
| journal | = | "In Silico Biology", | |
| volume | = | "1", | |
| year | = | "1999", | |
| pages | = | "93-108", | |
| note | = | "ANL/MCS-P746-0299, P746.html", | |
| year | = | "1999", |
| author | = | "J.-P. Navarro", | |
| title | = | "IBM SP High-Performance Networking with a GRF", | |
| year | = | "1998", | |
| note | = | "ANL/MCS-P747-1298, P747.ps.Z", |
| author | = | "H. G. Kaper and S. Tipei", | |
| title | = | "Formalizing the Concept of Sound", | |
| number | = | "ANL/MCS-P748-0499", | |
| year | = | "1999", | |
| note | = | " P748.ps.Z", |
| author | = | "L. A. Freitag and P. Plassmann", | |
| title | = | "Local Optimization-Based Simplicial Mesh Untangling and Improvement", | |
| number | = | "ANL/MCS-P749-0399", | |
| year | = | " 1999", | |
| note | = | "P749.ps.Z", |
| author | = | "J. Bresnahan and I. Foster and J. Insley and B. Toonen and S. Tuecke", | |
| title | = | "Communication Services for Advanced Network Applications", | |
| number | = | "ANL/MCS-P750-0599", | |
| year | = | "1999", | |
| note | = | "P750.ps.Z", |
| author | = | "L. A. Freitag and W. D. Gropp and P. D. Hovland and L. C. McInnes and B. F. Smith", | |
| title | = | "Infrastructure and Interfaces for Large-Scale Numerical Software", | |
| booktitle | = | "1999 International Confernece on Parallel and Distriubted Processing Techniques and Applications", | |
| year | = | "1999", | |
| address | = | "Las Vegas", | |
| note | = | "ANL/MCS-P751-0599, P751.ps.Z", |
| author | = | "L. A. Freitag and R. M. Loy", | |
| title | = | "Adaptive, Multiresolution Visualization of Large Data Sets Using Parallel Octrees", | |
| booktitle | = | "Fifth U.S. Congress on Computational Mechanics", | |
| address | = | "Boulder", | |
| year | = | "1999", | |
| note | = | "ANL/MCS-P752-0599, P752.ps.Z", |
| author | = | "J. Cownie and W. Gropp", | |
| title | = | "A Standard Interface for Debugger Access to Message Queue Information in MPI", | |
| number | = | "ANL/MCS-P754-0699", | |
| year | = | "1999", | |
| note | = | "P754.ps.Z", |
| author | = | "W. Gropp and E. Lusk", | |
| title | = | "Reproducible Measurements of MPI Performance Characteristics", | |
| number | = | "ANL/MCS-P755-0699", | |
| year | = | "1999", | |
| note | = | "P755.ps.Z", |
| author | = | "M. Gomberg and C. Stacey and J. Sayre", | |
| title | = | "Scalable, Remote Administration of Windows NT", | |
| number | = | "ANL/MCS-P756-0699", | |
| year | = | "1999", | |
| note | = | "P756.pdf", |
| author | = | "S. Bittner", | |
| title | = | "Selecting and Implementing the PBS Scheduler on an SGI Onyx 2/Origin 2000", | |
| number | = | "ANL/MCS-P758-0699", | |
| year | = | "1999", | |
| note | = | " P758.ps.Z", |
| author | = | "R. Armstrong and D. Gannon and A. Geist and K. Keahey and S. Kohn and L. McInnes and S. Parker and B. Smolinski", | |
| title | = | "Toward a Common Component Architecture for High-Performance Scientific Computing", | |
| number | = | "ANL/MCS-P759-0699", | |
| year | = | "1999", | |
| note | = | "P759.ps.Z", |
| author | = | "M. Anitescu", | |
| title | = | "On the Rate of Convergence of Sequential Quadratic Programming with Nondifferentiable Exact Penalty Function in the Presence of Constaint Degeneracy", | |
| number | = | "ANL/MCS-P760-0699", | |
| year | = | "1999", | |
| note | = | " P760.ps.Z", |
| author | = | "M. Anitescu", | |
| title | = | "Degenerate Nonlinear Programming with a Quadratic Growth Condition", | |
| number | = | "ANL/MCS-P761-0699", | |
| year | = | "1999", | |
| note | = | "P761.ps.Z", |
| author | = | "H. M. Tufo and P. F. Fischer", | |
| title | = | "Terascale Spectral Element Algoritihms and Implementations", | |
| number | = | "ANL/MCS-P762-0699", | |
| year | = | "1999", | |
| note | = | "P762.ps.Z", |
| author | = | "O. Zaki and E. Lusk and W. Gropp and D. Swider", | |
| title | = | "Toward Scalable Performance Visualization with Jumpshot", | |
| journal | = | "Int'l J. of High Performance Computing Applications", | |
| year | = | "1999", | |
| note | = | "ANL/MCS-P763-0699, P763.ps.Z", |
| author | = | "G. W. Crabtree and D. O. Gunter and H. G. Kaper and A. E. Koshelev and G. K. Leaf and V. M. Vinokur", | |
| title | = | ""Numerical Simulations of Driven Vortex Systems", | |
| number | = | "ANL/MCS-P764-0699", | |
| year | = | "1999" | |
| note | = | "P764.ps.Z", |
| author | = | "M. K. Mihçak, and P. Moulin and M. Anitescu and K. Ramchandran", | |
| title | = | ""Rate-Distortion-Optimal Subband Coding without Perfect-Reconstruction Constraints", | |
| number | = | "ANL/MCS-P766-0699", | |
| year | = | "1999", | |
| note | = | "P766.ps.Z", |
| author | = | "J. G. Michalakes and R. J. Purser and R. Swinbank", | |
| title | = | "Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid", | |
| booktitle | = | "Proc. Numerical Weather Prediction Conf.", | |
| address | = | "Denver", | |
| year | = | "1999 (to appear)", | |
| note | = | "ANL/MCS-P767-0699, P767.ps.Z", |
| author | = | "L. A. Freitag and P. M. Knupp", | |
| title | = | "Tetrahedral Element Shape Optimization via the Jacobian Determinant and Condition Number", | |
| number | = | "ANL/MCS-P769-0799, | |
| year | = | "1999", | |
| note | = | "P769.ps.Z", |
| author | = | "H. G. Kaper and S. Tipei", | |
| title | = | "Formalizing the Concept of Sound", | |
| number | = | "ANL/MCS-P771-0799", | |
| year | = | "1999", | |
| note | = | "P771.ps.Z", |
| author | = | "J. E. Flaherty and R. M. Loy and M. S. Shephard and J. D. Teresco", | |
| title | = | "Software for the Parallel Adaptive Solution of Conservation Laws by Discontinuous Galerkin Methods", | |
| number | = | "ANL/MCS-P773-0799", | |
| year | = | "1999", | |
| note | = | "P773.ps.Z", |
| author | = | "H. M. Tufo and P. F. Fischer and M. E. Papka and M. Szymanski", | |
| title | = | ""Hairpin Vortex Formation, a Case Study for Unsteady Visualization", | |
| number | = | " ANL/MCS-P774-0799", | |
| year | = | "1999", | |
| note | = | "P774.ps.Z", |
| authors | = | "W. McCune and O. Shumsky", | |
| title | = | "Ivy: A Preprocessor and Proof Checker for Frist-Order Logic", | |
| booktitle | = | "Using the ACL2 Theorem Prover: A Tutorial Introduction and Case Studies", | |
| editor | = | "M. Kaufmann and P. Manolios and J Moore", | |
| publisher | = | "Kluwer Academic Publishers", | |
| year | = | "1999 (to appear)", | |
| note | = | "ANL/MCS-P775-0899, P775.ps.Z", |
| author | = | "P. F. Fischer and J. S. Mullen", | |
| title | = | "Filter-based Stabilization of Spectral Element Methods", | |
| number | = | "ANL/MCS-P777-0899", | |
| year | = | "1999", |
| title | = | "Achieving High Sustained Performance in an Unstructured Mesh CFD Application", | |
| author | = | "W. K. Anderson and W. D. Gropp and D. K. Kaushik and D. E. Keyes and B. F. Smith", | |
| booktitle | = | "Proceedings of SC '99", | |
| note | = | "ANL/MCS-P776-0899", | |
| year | = | "1999"} |
| author | = | "W. Gropp and D. Kaushik and D. Keyes and B. Smith", | |
| title | = | "Toward Realistic Performance Bounds for Implicit CFD Codes", | |
| booktitle | = | "Proceedings of Parallel CFD '99", | |
| year | = | "1999", | |
| publisher | = | "Elsevier"} |
| title | = | "High-Performance Spectral Element Algorithms and Implementations", | |
| number | = | "ANL/MCS-P778-0899", | |
| author | = | "P. F. Fischer and H. M. Tufo", | |
| month | = | "August", | |
| year | = | "1999"} |
| title | = | "Numerical Simulation and Immersive Visualization of Hairpin Vortices", | |
| number | = | "ANL/MCS-P770-0899", | |
| author | = | "H. M. Tufo and P. F. Fischer and M. E. Papka and K. Blom", | |
| month | = | "August", | |
| year | = | "1999"} |
| author | = | "M. D'Souza and M. F. Romine and N. Maltsev"< | |
| title | = | "SENTRA, a Database of Signal Transduction Proteins", | |
| number | = | "ANL/MCS-P781-0999", | |
| month | = | "September", | |
| year | = | "1999"} |
| author | = | "S. J. Wright", | |
| title | = | "Recent Developments in Interior-Point Methods", | |
| number | = | "ANL/MCS-P783-0999", | |
| month | = | "September", | |
| year | = | "1991"} |
| author | = | "M. Hereld and B. Nickless and R. Stevens", | |
| title | = | "Implementation of a Distributed Multi-Terabyte Storage System", | |
| number | = | "ANL/MCS-TM-235", | |
| year | = | "1998", |
| author | = | "C. H. Bischof and P. Eberhard and P. D. Hovland", | |
| title | = | "Second Argonne Theory Institute on Differentiation of Computational Approximations to Functions", | |
| number | = | "ANL/MCS-TM-236", | |
| month | = | "June", | |
| year | = | "1998", |
| author | = | "Lori Freitag", | |
| title | = | "Users Manual for Opt-MS: Local Methods for Simplicial Mesh Smoothing and Untangling", | |
| number | = | "ANL/MCS-TM-239", | |
| month | = | "April", | |
| year | = | 1999, |
| author | = | "C. H. Bischof and H. M. Bucker and P. D. Hovland", | |
| title | = | "On Combining Computational Differentiation and Toolkits for Parallel Scientific Computing", | |
| number | = | "ANL/MCS-P797-0200", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "C. H. Bischof and H. M. Bucker", | |
| title | = | "Computing Derivatives of Computer Programs", | |
| number | = | "ANL/MCS-P813-0400", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "A. Choudhary and M. Kandemir and J. No and G. Memik and X. Shen and W. Liao and H. Nagesh and S. More and V. Taylor and R. Thakur and R. Stevens", | |
| title | = | "Data Management for Large-Scale Scientific Computations in High Performance Distributed Systems" | |
| journal | = | "Cluster Computing", | |
| year | = | "to appear"} |
| author | = | "P. Dickens and R. Thakur", | |
| title | = | "Improving Collective I/O Performance Using Threads", | |
| booktitle | = | "Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing", | |
| year | = | "1999", | |
| pages | = | "38-45"} | |
| number | = | "ANL/MCS-P813-0400", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. No and R. Thakur and A. Choudhary", | |
| title | = | "Integrating Parallel File I/O and Database Support for High-Performanc e Scientific Data Management", | |
| number | = | "ANL/MCS-P798-0300", | |
| institution | = | "Argonne National Laboratory", | |
| year | = | "2000"} |
| author | = | "P. Dickens and R. Thakur", | |
| title | = | "An Evaluation of Java's I/O Capabilities for High-Performance Computing", | |
| number | = | "Preprint", | |
| year | = | "2000"} |
| author | = | "P. Dickens and R. Thakur", | |
| title | = | "On Implementing High-Performance Collective I/O", | |
| number | = | "Preprint", | |
| year | = | "2000"} |
| author | = | "H. M. Tufo and P. F. Fischer and M. E. Papka and K. Blom", | |
| title | = | "Numerical Simulation and Immersive Visualization of Hairpin Vortices", | |
| number | = | "ANL/MCS-P779-0899", | |
| year | = | "1999", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "J. Nocedal and S. J. wright", | |
| title | = | "Numerical Optimization", | |
| publisher | = | "Springer", | |
| year | = | "1999"} |
| author | = | "Stephen J. Wright", | |
| title | = | "Primal-Dual Interior-Point Methods", | |
| publisher | = | "SIAM", | |
| year | = | "1996"} |
| author | = | "B. Smith and P. Bjorstad and W. Gropp", | |
| title | = | "Domain Decomposition", | |
| publisher | = | "Cambridge University Press", | |
| year | = | "1996"} |
| author | = | "S. J. Wright", | |
| title | = | "On Reduced Convex QP Formulations of Monotone LCP Problems", | |
| number | = | "ANL/MCS-P808-0400", | |
| year | = | "2000", | |
| institution | = | "Argonne National Laboratory"} |
| author | = | "S. J. Wright", | |
| title | = | "Optimzation Software Packages", | |
| booktitle | = | "Handbook of Applied Optimization", | |
| editor | = | "M. Resende and P. Pardalos", | |
| publisher | = | "Oxford University Press", | |
| year | = | "to appear"} |
| author | = | "A. S. Bondarenko and D. M. Bortz and J. J. More'", | |
| title | = | "COPS: Large-Scale Nonlinearly Constrained Optimization Problems", | |
| number | = | "ANL/MCS-TM-237", | |
| institution | = | "Mathematics and Computer Science Division, Argonne National Laboratory", | |
| year | = | "1998, revised 1999"} |
| author | = | "S. Balay and W. Gropp and L. McInnes and B. Smith", | |
| title | = | "Software for the Scalable Solution of PDEs", | |
| booktitle | = | "The CRPC Handbook of Parallel Computing", | |
| publisher | = | "Morgan-Kaufmann", | |
| year | = | "to appear"} |
| title | = | "Using MPI", | |
| author | = | "William Gropp and Ewing Lusk and Anthony Skjellum", | |
| edition | = | "second", | |
| publisher | = | "MIT Press", | |
| year | = | "1999"} |
| title | = | "Using MPI-2", | |
| author | = | "William Gropp and Ewing Lusk and Rajeev Thakur", | |
| publisher | = | "MIT Press", | |
| year | = | "1999"} |
| title | = | "MPI: The Complete Reference - 2nd Edition, Volume 2", | |
| publisher | = | "MIT Press", | |
| year | = | "1998", | |
| author | = | "William Gropp and Steven Huss-Lederman and Andrew Lumsdaine and Ewing Lusk and Bill Nitzberg and William Saphir and Marc Snir"} |
| title | = | "Using MPI: Portable Parallel Programming with the Message Passing Interface", | |
| author | = | "William Gropp and Ewing Lusk and Anthony Skjellum", | |
| publisher | = | "MIT Press", | |
| year | = | "1994"} |
| author | = | "L. Childers and T. Disz and R. Olson and M. E. Papka and R. Stevens and T. Udeshi", | |
| title | = | "Access Grid: Immersive Group-to-Group Collaborative Visualization", | |
| booktitle | = | "Proceedings of the Fourth International Immersive Projection Technology Workshop 2000", | |
| year | = | "to appear"} |
| author | = | "M. Hereld and I. Judson and R. Stevens", | |
| title | = | "Introduction to Building Projection-based Tiled Display Systems", | |
| journal | = | "IEEE Computer Graphics and Applications", | |
| volume | = | "20", | |
| number | = | "4", | |
| year | = | "2000", | |
| pages | = | "22-28"} |
| author | = | "M. Hereld and I. R. Judson and J. Paris and R. L. Stevens", | |
| title | = | "Developing Tiled Projection Display Systems", | |
| booktitle | = | "Proceedings of the Fourth International Immersive Projection Technology Workshop 2000", | |
| year | = | "to appear"} |
| title | = | "Seamless Multiresolution Isosurfaces Using Wavelets", | |
| author | = | "T. Udeshi and R. Hudson and M. E. Papka", | |
| month | = | "March", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P801-0300", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Quasi Real-Time Microtomography Experiments at Photon Sources", | |
| author | = | "G. von Laszewski and M.-H. Su and I. Foster and C. Keselman", | |
| month | = | "March", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P802-0300", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Access Grid: Immersive Group-to-Group Collaborative Visualization", | |
| author | = | "L. Childers and T. Disz and R. Olson and M. E. Papka and R. Stevens and T. Udeshi", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P821-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Introduction to Building Projection-based Tiled Display Systems", | |
| author | = | "M. Hereld and I. R. Judson and R. L. Stevens", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P822-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Grid-based Asynchronous Migration of Excecution Context in Java Virtual Machines", | |
| author | = | "G. von Laszewski and K. Shudo and Y. Muraoka", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P823-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Developing Tiled Projection Display Systems", | |
| author | = | "M. Hereld and I. R. Judson and J. Paris and R. L. Stevens", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P824-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Automating the Search for Answers to Open Questions", | |
| author | = | "L. Wos and B. Fitelson", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P825-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Runtime Checking of Datatype Signatures in MPI", | |
| author | = | "W. D. Gropp", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P826-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Axiomatic Proofs through Automated Reasoning", | |
| author | = | "B. Fitelson and L. Wos", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P827-0500", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Notes on a Search for Optimal Lattice Rules", | |
| author | = | "J. Lyness and R. Cools", | |
| month | = | "June", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P829-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Approximating maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation", | |
| author | = | "S. J. Benson and Y. Ye", | |
| month | = | "June", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P830-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "ActiveSpaces on the Grid: THe Construction of Advanced Visualization and Interaction Environments", | |
| author | = | "L. Childers and T. Disz and M. Hereld and R. Hudson and I. Judson and R. Olson and M. E. Papka and and J. Paris and R. Stevens", | |
| month | = | "June", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P832-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Software for the Scalable Solution of PDEs", | |
| author | = | "S. Balay and W. D. Gropp and L. C. McInnes and B. F. Smith", | |
| month | = | "July", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P832-0700", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "The Frozen-Field Approximation and the Ginzberg-Landau Equations of Superconductivity", | |
| author | = | "H. G. Kaper and H. Nordborg", | |
| month | = | "July", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P835-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Finding Missing Proofs with Automated Reasoning", | |
| author | = | "B. Fitelson and L. Wos", | |
| month | = | "July", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P832-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Tetrahedral Mesh Improvement via Optimization of theelement Condition Number", | |
| author | = | "L. A. Freitag and P. M. Knupp", | |
| month | = | "July", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P832-0600", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "A Scalable Process-Managment Environment for Parallel Programs", | |
| author | = | "R. Butler and W. Gropp and E. Lusk", | |
| month | = | "April", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P812-0400", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Comoputing Derivatives of Computer Programs", | |
| author | = | "C. H. Bischof and H. M, Buecker", | |
| month | = | "May", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P813-0400", | |
| institution | = | "Argonne National Laboratory"} |
| title | = | "Parallel I/O", | |
| author | = | "R. Thakur and W. Gropp", | |
| month | = | "July", | |
| year | = | "2000", | |
| number | = | "ANL/MCS-P837-0400", | |
| institution | = | "Argonne National Laboratory"} Generated on Wed Dec 20 14:45:09 2000 with bib2html |