G.E. Forsythe, M.A. Malcolm, and C.B. Moler. Computer Methods for Mathematical Computations, chapter 9. Prentice-Hall, Englewood Cliffs, NJ, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Portfolio Optimization with Jump-Diffusions: Estimation of.. - Hanson, Westman (2002) (Correct)
....derivatives would be useful. For this purpose, such a method, Golden Super Finder (GSF) 8] was developed for [7] and implemented in MATLAB , since simple techniques are desirable in financial engineering. The GSF method is an extensive modification to the Golden Section Search method [4], extended to multi dimensions and allowing search beyond the initial hyper cube domain by including the endpoints in the local optimization test with the two golden section interior points per dimension, moving rather than shrinking the hypercube when the local optimum is at an edge or corner. ....
Forsythe, G. E., M. A. Malcolm and C. Moler, Computer Methods for Mathematical Computations, Prentice-Hall, Englewood Cliffs, NJ, 1977.
Unknown - Processors Are Available (Correct)
....the one we usually deal with. Modern computer hardware, can only represent a finite subset of the real numbers. Therefore, when a real number is entered in a computer, a representation error generally appears. The effects of finite precision arithmetic are thoroughly discussed in Forsythe et al. [38] and Gill et al. 47] among others. We may explain what occurs by first stating that the internal representation of a real number is a floating point number. This representation is characterized by the number base fi, the precision t and the exponent range [L; U ] all four being integers. The ....
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cliffs, NJ, 1977.
Jump-Diffusion Stock-Return Model with Weighted Fitting of.. - Hanson, Westman (Correct)
....would be useful. For this purpose, such a method, Golden Super Finder (GSF) 11] was developed for [7, 10, 9] and implemented in MATLAB TM , since simple techniques are desirable in financial engineering. The GSF method is an extensive modification to the Golden Section Search method [5], extended to multi dimensions and allowing search beyond the initial hyper cube domain by including the endpoints in the local optimization test with the two golden section interior points per dimension, moving rather than shrinking the hypercube when the local optimum is at an edge or corner. ....
Forsythe, G. E., M. A. Malcolm and C. Moler, Computer Methods for Mathematical Computations, Prentice-Hall, Englewood Cliffs, NJ, 1977.
Reducing the Impact of Spill Code - Harvey (Correct)
....techniques sometimes favor particular hardware configurations, code shape (such as George and Appel s environment of many copy instructions) etc. 2. 7 Our experiments In our experiments, we use a test suite of 169 routines, including code based on Forsythe et al. s book on numerical methods [23], the SPEC 90 benchmarks [40] and the SPEC 95 benchmarks [41] The SPEC 95 benchmarks have been transformed by the insertion of advisory prefetch instructions intended to improve cache behavior [35] and this transformation has the impact of increasing the register requirements in those ....
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cliffs, New Jersey, 1977.
Optimizing for Reduced Code Space Using Genetic Algorithms - Cooper, Schielke.. (1999) (23 citations) (Correct)
....and we move on to the next chromosome. 4 Experimental Results To test the efficacy of our ga, we used it to find optimization sequences for several benchmark programs. The Fortran programs used in the experiments were fmin, rkf45, seval, solve, svd, urand, and zeroin from the fmm benchmark suite [12] and tomcatv from spec. The C codes used were adpcm, which performs adaptive differential pulse code modulation, compress, which is the unix file compression utility, fft, a fast Fourier transformation algorithm, dfa, an implementation of the Knuth Morris Pratt string matching algorithm, ....
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1977.
Non-Local Instruction Scheduling with Limited Code Growth - Keith Cooper Philip (1998) (6 citations) (Correct)
....After optimization, the iloc is translated into C, instrumented to report operation and instruction counts, and compiled. This code is then run. A variety of C and Fortran benchmark codes were studied, including several from various versions of the SPEC benchmarks and the fmm test suite [9]. The C codes used are, clean, compress, dfa, dhrystone, fft, go, jpeg, nsieve, and water. All other benchmarks are Fortran codes. clean is an optimization pass from our compiler. dfa is a small program that implements the Knuth Morris Pratt string matching algorithm. nsieve computes prime ....
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1977.
A Simple, Fast Dominance Algorithm - Cooper, Harvey, Kennedy (2001) (1 citation) (Correct)
....300 MHz Sun Ultra10 under the Solaris operating system. On this machine, the clock( function has a granularity of only one hundredth of a second. # Our standard test suite contains 169 Fortran routines taken from the SPEC benchmarks and from Forsythe, Malcolm, and Moler s book on numericalmethods [15]. The largest cfg in the suite is from field,with744 basic blocks. ## On this file, the timer only measures one hundredth of a second of cpu time to compute # The manual page for clock( says that the time returned is in microseconds; however, we found that in practice, the amount of cpu time is ....
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cli#s, New Jersey, 1977.
Non-Local Instruction Scheduling with Limited Code Growth - Cooper, Schielke (1998) (6 citations) (Correct)
....After optimization, the iloc is translated into C, instrumented to report operation and instruction counts, and compiled. This code is then run. A variety of C and Fortran benchmark codes were studied, including several from various versions of the SPEC benchmarks and the fmm test suite [9]. The C codes used are, clean, compress, dfa, dhrystone, fft, go, jpeg, nsieve, and water. All other benchmarks are Fortran codes. clean is an optimization pass from our compiler. dfa is a small program that implements the KnuthMorris Pratt string matching algorithm. nsieve computes prime numbers ....
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Inc., Englewood Cli#s, NJ, 1977.
Compiler-Controlled Memory - Cooper, Harvey (1998) (17 citations) (Correct)
....We also built a memory compaction routine that colors spill memory to make non interfering spilled values occupy the same memory location when possible. We ran these algorithms on a suite of 122 routines, drawn from sources that include code from Forsythe et al. s book on numerical methods [11], the SPEC 89 benchmarks [24] and the SPEC 95 benchmarks [25] Out of this suite, 59 routines required some amount of spill code, and it is on these 59 routines that the following numbers were generated. All the routines were subjected to extensive scalar optimization, including global value ....
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cli#s, New Jersey, 1977.
Interactive Geometric Constraint Systems - Brunkhart (1994) (5 citations) (Correct)
No context found.
G.E. Forsythe, M.A. Malcolm, and C.B. Moler. Computer Methods for Mathematical Computations, chapter 9. Prentice-Hall, Englewood Cliffs, NJ, 1977.
Identification of Critical Values in Latent Semantic.. - Kontostathis, Pottenger, .. (Correct)
No context found.
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Prentice Hall, 1977.
Surface Reconstruction from Multiple Views using Rational.. - Siddiqui, Sclaroff (2001) (1 citation) (Correct)
No context found.
G. Forsythe, M. Malcom, and C. Moler. Computer Methods for Mathematical Computations. PrenticeHall, 1976.
Identification of Critical Values in Latent Semantic.. - Kontostathis, Pottenger, .. (2005) (Correct)
No context found.
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Prentice Hall, 1977.
A Primal-Dual Active-Set Method for Convex - Quadratic Programming Ekaterina (2003) (Correct)
No context found.
G. E. FORSYTHE, M. A. MALCOLM AND C. B. MOLER, Computer Methods for Mathematical Computations, Prentice-hall, London, 1977.
Oolala - From Numerical Linear Algebra To Compiler Technology For .. - Moreno (2002) (Correct)
No context found.
G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, 1977. ISBN: 0131653326.
Detecting Patterns in the LSI Term-Term Matrix - Kontostathis, Pottenger (2002) (1 citation) (Correct)
No context found.
Forsythe, G.E., M.A. Malcolm, and C.B. Moler. Computer Methods for Mathematical Computations. pp 192-235. 1977.
Improving 3D Object Recognition Based on Algebraic.. - Li, Bebis, Bourbakis (Correct)
No context found.
G. Forsythe, M. Malcolm, and C. Moler, Computer methods for mathematical computations. (chapter 9): Prentice-Hall, 1977.
Singular Value Decomposition -- A Primer - Sonia Leach Department (1 citation) (Correct)
No context found.
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations, pages 201--235. Prentice Hall, Englewood Cliffs, 1977.
Grasping of Static and Moving Objects Using Vision-Based.. - Smith, Papanikolopoulos (1996) (1 citation) (Correct)
No context found.
G.E. Forsythe, M.A. Malcolm, and C.B. Moler, Computer methods for mathematical computations, Prentice-Hall, Englewood Cliffs, N.J., 1977.
Broadband Wireless - Communication In An (2002) (Correct)
No context found.
Forsythe, Malcolm and Moler, Computer Methods for Mathematical Computations, Prentice-Hall, 1976.
Exploiting Fast Hardware Floating Point in High Precision.. - Geddes, Zheng (2002) (Correct)
No context found.
Forsythe, G., Malcolm, M. and Moler, C. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cli s, NJ, 1974.
Interpretation and Practical Use of Error Propagation Matrices - Wikström, Wedin (Correct)
No context found.
G.E. Forsythe and M.A. Malcolm and C.B. Moler , Computer Methods for Mathematical Computations, Prentice-Hall, 1977.
Use of Acoustic Prior Information for Confidence Measure in.. - Mengusoglu, Ris (2001) (2 citations) (Correct)
No context found.
Forsythe, Malcolm and Moler, "Computer Methods for Mathematical Computations", Prentice-Hall, 1976.
Computational Stochastic Control: Basic Foundations, Complexity.. - Hanson (Correct)
No context found.
Forsythe, G. E., M. A. Malcolm and C. Moler, Computer Methods for Mathematical Computations, PrenticeHall, Englewood Cliffs, NJ, 1977.
How to Build an Interference Graph - Cooper, Harvey, Torczon (1988) (Correct)
No context found.
George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler, Computer Methods for Mathematical Computations, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1977.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC