. ~) U: b9 K( c- u1. James W. Cooley and John W. Tukey, "An algorithm for the machine, T8 u: L# w9 m' k# C. q
calculation of complex Fourier series," Mathematics of Computation 19 3 u4 x! @2 M h1 y {3 o# y(1965), 297-301.. Q# @8 h8 x& \2 _+ U# d$ V
& k: \, R0 Y" d2. R. Courant, K. O. Friedrichs and H. Lewy, "Ueber die partiellen' R$ A" f6 q7 ^( j5 Z# ^! o
Differenzengleichungen der mathematischen Physik," Mathematische Annalen" i' V. p; U) C1 A& o: n
100 (1928), 32-74. Translated as: "On the partial difference equations 4 b. `& O' G9 q7 J( B4 j
of mathematical physics," IBM Journal of Resarch and Development 11 - Y- r! Z/ u2 }* C
(1967), 215-234.9 y( D A; F1 I" C6 u1 f; Z
8 u- X e% N' }% ~/ D6 D1 ~
3. A. S. Householder, "Unitary triangularization of a nonsymmetric matrix," $ i* |" h: ?3 p; M1 o. p0 eJournal of the Association of Computing Machinery 5 (1958), 339-342. 3 Q/ \+ D1 O( |- `, M# b# t/ h) N+ W) X2 M8 }
4. C. F. Curtiss and J. O. Hirschfelder, "Integration of stiff equations,"+ L6 C) Y# }: Y. R3 u- W
Proceedings of the National Academy of Sciences 38 (1952), 235-243. ) H; z, @- e4 b* ^& u: c. v* y! q c
5. C. de Boor, "On calculating with B-splines," Journal of Approximation9 m8 j ?3 ? g1 n9 \
Theory 6 (1972), 50-62. / X; M) O' f; |6 u( u/ H& r' | `* w. R/ _! N; A6 }: p: H4 ^8 v( G
6. R. Courant, "Variational methods for the solution of problems of* U: V5 D3 v- X( {7 ^
equilibrium and vibrations," Bulletin of the American Mathematical R* P2 s( u; L7 ]; wSociety 49 (1943), 1-23.# M9 a ^7 ^% a+ c
9 ]7 _. a! j) P2 Z. _+ R; V6 t7. G. Golub and W. Kahan, "Calculating the singular values and pseudo-inverse- r1 i* o& z* ]# G5 D' \
of a matrix," SIAM Journal on Numerical Analysis 2 (1965), 205-224. 4 _3 b: \% {, ?: S5 {0 A( t H( y* r; G; J* F
8. A. Brandt, "Multi-level adaptive solutions to boundary-value problems,"- m, M, W$ k3 ~5 k% q
Mathematics of Computation 31 (1977), 333-390. ' c8 o8 L! p+ b0 A' b& }( ~$ D) [( H7 m/ J# F
9. Magnus R. Hestenes and Eduard Stiefel, "Methods of conjugate gradients for5 I0 {# I& c5 x% n
solving linear systems," Journal of Research of the National Bureau of # [7 g# d/ o2 J6 u( O* q0 q- l
Standards 49 (1952), 409-436. 5 G. k7 I6 n/ M- N7 u - M' p' r- J3 t& Q2 o! j. s- m, A10. R. Fletcher and M. J. D. Powell, "A rapidly convergent descent method for& g* k+ F+ l' A4 m
minimization," Computer Journal 6 (1963), 163-168. 8 ?# D2 [* R$ r, g" T3 d9 k3 j) I: j% P3 g/ d
11. G. Wanner, E. Hairer and S. P. Norsett, "Order stars and stability! C& w" c& { T% ]8 W3 n v) \
theorems," BIT 18 (1974), 475-489.6 P$ ?" Z1 o' \0 X
# X; r$ U3 V5 x1 d" j12. N. Karmarkar, "A new polynomial-time algorithm for linear programming," 9 k: d) A8 s9 p% f: z8 I. TCombinatorica 4 (1984), 373-395. ! e5 \, ^/ f7 _0 {6 k9 V% V. W" ]# h- j! Z8 F
13. L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations,"1 u) p9 G8 D* P6 F, I6 X
Journal of Computational Physics 73 (1987), 325-348