5 T) j& w5 X9 H+ \" P1 U1. James W. Cooley and John W. Tukey, "An algorithm for the machine1 `* C3 Y% j6 f/ h" z
calculation of complex Fourier series," Mathematics of Computation 19, \2 C1 u( L6 ~1 `- I
(1965), 297-301. ( Y$ M$ P* s& }% U ' T5 i9 \6 g$ J% \2. R. Courant, K. O. Friedrichs and H. Lewy, "Ueber die partiellen ( Y9 L0 b: K8 x6 KDifferenzengleichungen der mathematischen Physik," Mathematische Annalen 2 F6 @1 D$ F* B1 A4 h100 (1928), 32-74. Translated as: "On the partial difference equations 0 H4 F5 U1 U& x; t/ Oof mathematical physics," IBM Journal of Resarch and Development 11 : j: E2 l4 K' T* _, S1 S8 \
(1967), 215-234. , c. o" o, x* ~* a C8 \/ |7 c) m$ D& X
3. A. S. Householder, "Unitary triangularization of a nonsymmetric matrix," 9 i4 Y Y/ b, ~7 f. z; h8 D& CJournal of the Association of Computing Machinery 5 (1958), 339-342. * j% \% p7 I8 a/ ] % q+ c. e; P; c& U2 h q8 t4. C. F. Curtiss and J. O. Hirschfelder, "Integration of stiff equations," ( L1 B7 E" b9 ? t* c$ {Proceedings of the National Academy of Sciences 38 (1952), 235-243. 9 A) x, G" R- [ ' ?4 P: O: `- C9 q0 K [' U h5. C. de Boor, "On calculating with B-splines," Journal of Approximation) F5 c6 O" J6 m* ~- J7 o8 r
Theory 6 (1972), 50-62. ! A! a- X# t* S: R& Q Q8 R 2 ~+ }1 y( Z3 q/ I1 o- y- v2 F2 k! O6. R. Courant, "Variational methods for the solution of problems of % j+ ]* \6 l$ \" }9 Pequilibrium and vibrations," Bulletin of the American Mathematical 6 m+ u& `) E. e3 C
Society 49 (1943), 1-23.5 W% {. N1 k# E R" Q8 }, f; m
! B) d* t' a, Q- M; c! v8 c/ c7. G. Golub and W. Kahan, "Calculating the singular values and pseudo-inverse. n( T1 t' Q' Y5 Y8 U) K) r: I
of a matrix," SIAM Journal on Numerical Analysis 2 (1965), 205-224.! n3 r/ [4 [: _% p! j7 l
, Y* O$ S1 Z a' t: u
8. A. Brandt, "Multi-level adaptive solutions to boundary-value problems," . A( I6 S) c/ |9 [Mathematics of Computation 31 (1977), 333-390. - J5 q: K$ V9 |7 p* y5 S5 k( }& j1 n1 \
9. Magnus R. Hestenes and Eduard Stiefel, "Methods of conjugate gradients for + s J7 I6 D: X( L* Csolving linear systems," Journal of Research of the National Bureau of ( f) t0 K" E6 h# u$ gStandards 49 (1952), 409-436.* n: v8 o. j' X
- K6 e) V$ [! {1 k' v r
10. R. Fletcher and M. J. D. Powell, "A rapidly convergent descent method for + j$ d4 K* @5 N3 c! Vminimization," Computer Journal 6 (1963), 163-168. , i6 o8 w& w8 o# V) c. X ; q; h5 m8 g! E# z3 C1 W11. G. Wanner, E. Hairer and S. P. Norsett, "Order stars and stability+ H. S/ m' D" u/ [4 X
theorems," BIT 18 (1974), 475-489.3 m! n9 A7 _6 n
7 p4 L2 K+ c% I# ~! K+ F3 [
12. N. Karmarkar, "A new polynomial-time algorithm for linear programming,"* o% T g7 C/ l, R/ d: n7 ?, d
Combinatorica 4 (1984), 373-395.1 T# E% K- Z, z- ]
# d7 A5 f2 {' k# O% |+ y
13. L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations," 5 }$ U9 ]4 Y0 p* v1 m6 qJournal of Computational Physics 73 (1987), 325-348