Numerical analysis

Numerical Analysis

Volumn , Issue , 2011, Pages

  Scott, Ridgway L ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84875930318     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (174)

1. P.-A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2007.
2. Victor S. Adamchik and David J. Jeffrey. Polynomial transformations of Tschirnhaus, Bring and Jerrard. SIGSAM Bulletin, 37(3):90-94, 2003.
3. A. C. Aitken. Studies in practical mathematics. I. the evaluation, with application, of a certain triple product matrix. Proceedings of the Royal Society of Edinburgh, 57:172-181, 1937.
4. A. C. Aitken. Gallipoli to the Somme: Recollections of a New Zealand Infantryman. Oxford, 1963.
5. Adrian Albert. Modern Higher Algebra. University of Chicago Press, 1937.
6. P. S. Aleksandrov, N. I. Akhiezer, B. V. Gnedenko, and A. N. Kolmogorov. Sergei Natanovich Bernstein (obituary). Russian Mathematical Surveys, 24(3):169-176, 1969.
7. Steven C. Althoen and Renate McLaughlin. Gauss-Jordan reduction: A brief history. American Mathematical Monthly, 94(2):130-142, 1987.
8. Ned Anderson and Åke Björck. A new high order method of regula falsi type for computing a root of an equation. BIT Numerical Mathematics, 13:253-264, Sept. 1973. 10.1007/BF01951936.
9. V. I. Arnold. Remarks on eigenvalues and eigenvectors of Hermitian matrices, Berry phase, adiabatic connections and quantum Hall effect. Selecta Mathematica, New Series, 1(1):1-19, 1995.
10. Vladimir I. Arnold. Ordinary Differential Equations. Springer Verlag, 2006.
11. Sheldon J. Axler. Linear Algebra Done Right. Springer Verlag, 1997.
12. Francis Bashforth and John Couch Adams. An Attempt to Test the Theories of Capillary Action. Cambridge University Press, 1883.
13. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.
14. K. Yusuf Billah and Robert H. Scanlan. Resonance, Tacoma Narrows Bridge failure, and undergraduate physics textbooks. American Journal of Physics, 59(2):118-124, 1991.
15. George David Birkhoff. General mean value and remainder theorems with applications to mechanical differentiation and quadrature. Transactions of the American Mathematical Society, 7(1):107-136, 1906.
16. J. L. Bona, W. G. Pritchard, and L. R. Scott. Solitary-wave interaction. Physics of Fluids, 23:438-441, 1980.
17. Jonathan Borwein and Adrian S. Lewis. Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, 2nd edition, 2005.
18. John Boyd. Chebyshev and Fourier Spectral Methods. Dover, 2nd edition, 2001.
19. Stephen P. Boyd. Convex Optimization. Cambridge University Press, 2004.
20. Ernst Breitenberger. Gauss's geodesy and the axiom of parallels. Archive for History of Exact Sciences, 31:273-289, Sept. 1984. 10.1007/BF00327704.
21. S. C. Brenner and L. R. Scott. The Mathematical Theory of Finite Element Methods. Springer-Verlag, 3rd edition, 2008.
22. Richard Brent. Algorithms for Minimization Without Derivatives. Dover Publications, 2002.
23. C. Brezinski. The life and work of André Cholesky. Numerical Algorithms, 43:279-288, Nov. 2006. 10.1007/s11075-006-9059-x.
24. C. Brezinski and M. Gross-Cholesky. La vie et les travaux d'André Cholesky. Bulletin de la Société des Amis de la Bibliothèque de l'Éc. Polytechnique, 39:7-32, 2005.
25. Sergey Brin and Lawrence Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
26. Ezra Brown. Square roots from 1; 24, 51, 10 to Dan Shanks. College Mathematics Journal, 30(2):82-95, Mar. 1999.
27. L. Brutman. On the Lebesgue function for polynomial interpolation. SIAM Journal on Numerical Analysis, 15(4):694-704, 1978.
28. Richard L. Burden and J. Douglas Faires. Elementary Numerical Analysis. Brooks/Cole, 8th edition, 2005.
29. J. C. Butcher. The Numerical Analysis of Ordinary Differential Equations: Runge-Kutta and General Linear Methods. John Wiley & Sons, 1987.
30. J. C. Butcher. A history of Runge-Kutta methods. Applied Numerical Mathematics, 20:247-260, March 1996.
31. J. C. Butcher. Numerical Methods for Ordinary Differential Equations. John Wiley & Sons, 2nd edition, 2008.
32. Florian Cajori. Historical note on the Newton-Raphson method of approximation. American Mathematical Monthly, 18(2):29-32, 1911.
33. V. Chellaboina and W. M. Haddad. Is the Frobenius matrix norm induced? IEEE Transactions on Automatic Control, 40(12):2137-2139, 1995.
34. E. W. Cheney. Introduction to Approximation Theory. American Mathematical Society, Providence, RI, 2nd edition, 2000.
35. Lindsay N. Childs. A Concrete Introduction to Higher Algebra. Springer Verlag, 3rd edition, 2009.
36. William James Cody, Jr. and William Waite. Software Manual for the Elementary Functions. Prentice-Hall, 1980.
37. Julian Coolidge. Mathematics 1870-1928. In Samuel Eliot Morison, editor, The Tercentennial History of Harvard College and University 1636-1936, pages 248-257. Harvard University Press, 1930.
38. P. D. Crout. A short method for evaluating determinants and solving systems of linear equations with real or complex coefficients. Transactions of the American Institute of Electrical Engineers, 60:1235-1240, 1941.
39. Germund Dahlquist and Åke Björck. Numerical Methods. Dover, 2003.
40. Harold Davenport. Dirichlet. Mathematical Gazette, 43(346):268-269, 1959.
41. Philip J. Davis and Philip Rabinowitz. Methods of Numerical Integration. Academic Press, 2nd edition, 1984.
42. Carl de Boor. Divided differences. Surveys in Approximation Theory, 1:46-69, 2005.
43. Carl de Boor and Allan Pinkus. Proof of the conjectures of Bernstein and Erdös concerning the optimal nodes for polynomial interpolation. Journal of Approximation Theory, 24:289-303, Dec. 1978.
44. D. W. Decker, H. B. Keller, and C. T. Kelley. Convergence rates for Newton's method at singular points. SIAM Journal on Numerical Analysis, 20(2):296-314, 1983.
45. James W. Demmel. Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997.
46. P. Deuflhard and G. Heindl. Affine invariant convergence theorems for Newton's method and extensions to related methods. SIAM Journal on Numerical Analysis, 16(1):1-10, 1979.
47. Peter Deuflhard and Andreas Hohmann. Numerical Analysis: A First Course in Scientific Computation. Walter de Gruyter & Co., Hawthorne, NJ, USA, 1995.
48. Luca Dieci and Donald Estep. Some stability aspects of schemes for the adaptive integration of stiff initial value problems. SIAM Journal on Scientific and Statistical Computing, 12:1284-1303, 1991.
49. E. Dikmen, A. Novoselsky, and M. Vallieres. Shell model calculations of 108Sb in the sdgh shell. Physical Review C, 66(5):057302, Nov 2002.
50. S. M. Djouadi. Comments on "Is the Frobenius Matrix Norm Induced?". IEEE Transactions on Automatic Control, 48(3):518-518, 2003.
51. M. H. Doolittle. Method employed in the solution of normal equations and the adjustment of a triangulation. U.S. Coast and Geodetic Survey Report, pages 115-120, 1878.
52. M. Dowell and P. Jarratt. A modified regula falsi method for computing the root of an equation. BIT Numerical Mathematics, 11:168-174, June 1971. 10.1007/BF01934364.
53. Tobin A. Driscoll, Kim-Chuan Toh, and Lloyd N. Trefethen. From potential theory to matrix iterations in six steps. SIAM Review, 40(3):547-578, 1998.
54. William Dunham. Euler: The Master of Us All. Mathematics Association of America, Washington, D.C., 1999.
55. Todd F. Dupont and L. Ridgway Scott. The end-game for Newton iteration. Research Report UC/CS TR-2010-10, University of Chicago, Department of Computer Science, 2010.
56. Alan Edelman. Large dense numerical linear algebra in 1993: the parallel computing influence. International Journal of High Performance Computing Applications, 7(2):113-128, 1993.
57. Paul Erdös. Problems and results on the theory of interpolation. II. Journal Acta Mathematica Hungarica, 12(1-2):235-244, 1961.
58. D. K. Fadeev and V. N. Fadeeva. Computational Methods of Linear Algebra. W. H. Freeman, 1963.
59. Richard William Farebrother. A memoir of the life of M. H. Doolittle. Bulletin of the Institute of Mathematics and Its Application, 23(6/7):102, 1987.
60. P. C. Fenton. A. C. Aitken (1895-1967). Gazette of the Australian Mathematical Society, Mar. 1995.
61. C. T. Fike. Computer evaluation of mathematical functions. Prentice-Hall, 1968.
62. George Forsythe. Notes, 128. Mathematical Tables and Other Aids to Computation, 5(36):255-258, 1951.
63. George E. Forsythe. Solving linear algebraic equations can be interesting. Bulletin of the American Mathematical Society, 59:299-329, 1953.
64. David Fowler and Eleanor Robson. Square root approximations in old Babylonian mathematics: YBC 7289 in context. Historia Mathematica, 25:366-378, Nov. 1998.
65. L. Fox, H. D. Huskey, and J. H. Wilkinson. Notes on the solution of algebraic linear simultaneous equations. Quarterly Journal Mechanics and Applied Mathematics, 1(1):149-173, 1948.
66. Herman H. Goldstine. A History of Numerical Analysis from the 16th through the 19th century. Springer, 1977.
67. Gene H. Golub and Charles F. Van Loan. Matrix Computations. Dover, 3rd edition, 1996.
68. Gene H. Golub and Dianne P. O'Leary. Some history of the conjugate gradient and Lanczos algorithms: 1948-1976. SIAM Review, 31(1):50-102, 1989.
69. Ronald Gowing. Roger Cotes-Natural Philosopher. Cambridge University Press, 1983.
70. K. R. Grazier, W. I. Newman, W. M. Kaula, and J. M. Hyman. Dynamical evolution of planetesimals in the outer solar system. Icarus, 140:341-352, 1999.
71. Anne Greenbaum. Iterative methods for solving linear systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997.
72. David Alan Grier. When Computers Were Human. Princeton University Press, 2005.
73. Wolfgang Hackbusch. Iterative Solution of Large Sparse Systems of Equations. Springer, 1993.
74. E. Hairer, Christian Lubich, and G. Wanner. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations. Springer, 2nd edition, 2006.
75. E. Hairer, Syvert P. Nørsett, and G. Wanner. Solving Ordinary Differential Equations I: Nonstiff Problems. Springer, 2002.
76. E. Hairer and G. Wanner. Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems. Springer, 2004.
77. Anders Hald. A History of Mathematical Statistics. John Wiley & Sons, 1998.
78. John Fraser Hart et al. Computer Approximations. Krieger, 1978.
79. Peter Henrici. Discrete Variable Methods in Ordinary Differential Equations. John Wiley & Sons, 1962.
80. Peter Henrici. Elements of Numerical Analysis. John Wiley & Sons, 1964.
81. V. Hernández, J. E. Román, A. Tomás, and V. Vidal. A survey of software for sparse eigenvalue problems. Technical Report SLEPc Technical Report STR-6, Universidad Politecnica de Valencia, http://www.grycap.upv.es/slepc, 2005.
82. Nicholas J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2nd edition, 2002.
83. Nicholas J. Higham. The numerical stability of barycentric Lagrange interpolation. IMA Journal of Numerical Analysis, 24(4):547-556, 2004.
84. Alston S. Householder. Principles of Numerical Analysis. McGraw-Hill, 1953.
85. I. M. L. Hunter. An exceptional talent for calculative thinking. British Journal of Psychology, 53(3):243-258, 1962.
86. E. Isaacson and H. B. Keller. Analysis of Numerical Methods. Dover, 1994.
87. Nathan Jacobson. Lectures in Abstract Algebra II. Linear algebra. Springer Verlag, 1953.
88. Ioan James. Remarkable Mathematicians: From Euler to von Neumann. Cambridge University Press, 2003.
89. K. R. James and W. Riha. Convergence criteria for successive overrelaxation. SIAM Journal on Numerical Analysis, 12(2):137-143, 1975.
90. Glen Jeh and Jennifer Widom. Scaling personalized web search. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 271-279, New York, NY, USA, 2003. Association for Computing Machinery, New York, NY.
91. D. Kalman. Uncommon Mathematical Excursions: Polynomia and Related Realms. Mathematical Association of America, 2008.
92. Shen Kangshen, John N. Crossley, and Anthony W.-C. Lun. The Nine Chapters of the Mathematical Art. Oxford, 1999.
93. Daniel Kehlmann. Measuring the World. Vintage, 2007.
94. C. T. Kelley. Iterative Methods for Linear and Nonlinear Equations. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1995.
95. C. T. Kelley. Iterative Methods for Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1995.
96. Theodore A. Kilgore. A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm. Journal of Approximation Theory, 24:273-288, Dec. 1978.
97. D. A. Knoll and D. E. Keyes. Jacobian-free Newton-Krylov methods: A survey of approaches and applications. Journal of Computational Physics, 193(2):357-397, 2004.
98. Gina Bari Kolata. Geodesy: Dealing with an enormous computer task. Science, 200(4340):421-466, 1978.
99. Nick Kollerstrom. Thomas Simpson and "Newton's method of approximation:" an enduring myth. British Journal for the History of Science, 25(3):347-354, 1992.
100. Vladimir Ivanovich Krylov. Approximate Calculation of Integrals. Macmillan Press, 1962.
101. J. L. Lagrange. Analytical Mechanics. Springer, 2001.
102. F. M. Larkin. Root-finding by fitting rational functions. Mathematics of Computation, 35(151):803-816, 1980.
103. Imre Latakos. Proofs and Refutations. Cambridge University Press, 1976.
104. Norman Lebovitz. Ordinary Differential Equations. Brooks/Cole, 2002.
105. W. Ledermann. Issai Schur and his school in Berlin. Bulletin of the London Mathematical Society, 15(2):97-106, 1983.
106. Hou-Biao Li and Ting-Zhu Huang. On a new criterion for the H-matrix property. Applied Mathematics Letters, 19:1134-1142, 2006.
107. Ren-Cang Li. Near optimality of Chebyshev interpolation for elementary function computations. IEEE Transactions on Computers, 53(6):678-687, 2004.
108. Elliott H. Lieb and Michael Loss. Analysis. American Mathematical Society, Providence, RI, 2nd edition, 2001.
109. A. Logg. Multi-adaptive Galerkin methods for ODEs I. SIAM Journal on Scientific Computing, 24(6):1879-1902, 2003.
110. A. Logg. Automating the finite element method. Archives of Computational Methods in Engineering, 14(2):93-138, 2007.
111. G. G. Lorentz. Approximation of Functions. Chelsea, New York, 2nd edition, 1986.
112. G. G. Lorentz and K. L. Zeller. Birkhoff interpolation. SIAM Journal on Numerical Analysis, 8(1):43-48, 1971.
113. L. A. Lyusternik, O. A. Chervonenkis, and A. R. Yanpol'skii. Handbook for Computing Elementary Functions. Pergamon Press, 1965.
114. Robert S.Maier. On reducing the Heun equation to the hypergeometric equation. Journal of Differential Equations, 213:171-203, 2005.
115. L. Maligranda. Why Hölder's inequality should be called Rogers' inequality. Mathematical Inequalities and Applications, 1(1):69-83, 1998.
116. Roy Mathias. Proof of two matrix theorems via triangular factorizations. Technical report, University of Birmingham.
117. Frank McSherry. A uniform approach to accelerated PageRank computation. InWWW '05: Proceedings of the 14th International Conference on the World Wide Web, pages 575-582, New York, NY, USA, 2005. Association for Computing Machinery, New York, NY.
118. Gérard Meurant. The Lanczos and Conjugate Gradient Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, Philadelphia, PA, 2006.
119. Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lefèvre, Guillaume Melquiond, Nathalie Revol, Damien Stehlé, and Serge Torres. Handbook of Floating-Point Arithmetic. Birkhäuser Boston, 2010. ACM G.1.0; G.1.2; G.4; B.2.0; B.2.4; F.2.1., ISBN 978-0-8176-4704-9.
120. Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer, 2nd edition, 2006.
121. J. Tinsley Oden and Leszek F. Demkowicz. Applied Functional Analysis. CRC Press, 1996.
122. A. M. Ostrowski. Solution of Equations and Systems of Equations. Academic Press, 1966.
123. B. N. Parlett. The Rayleigh quotient iteration and some generalizations for nonnormal matrices. Mathematics of Computation, 28(127):679-693, 1974.
124. Beresford Parlett. Very early days of matrix computations. SIAM News, 36(9), 2003.
125. Paul C. Pasles. Benjamin Franklin's Numbers: An Unsung Mathematical Odyssey. Princeton University Press, 2008.
126. David A. Patterson and John L. Hennessy. Computer Organization and Design: The Hardware/Software Interface. Morgan Kaufmann, 3rd edition, 2007.
127. Giuseppe Peano. Resto nelle formule di quadratura, espresso con un integrale definito. ATTI della Reale Accademia Dei Lincei-Rendiconti, 22:562-569, 1913.
128. G. Peters and J. H. Wilkinson. Inverse iteration, ill-conditioned equations and Newton's method. SIAM Review, 21(3):339-360, 1979.
129. Clifford A. Pickover. Archimedes to Hawking. Oxford, 2008.
130. M. J. D. Powell. Approximation Theory and Methods. Cambridge University Press, 1981.
131. William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes. Cambridge University Press, 3rd edition, 2007.
132. Liqun Qi. Eigenvalues and invariants of tensors. Journal of Mathematical Analysis and Applications, 325(2):1363 - 1377, 2007.
133. Liqun Qi, W. Sun, and Y. Wang. Numerical multilinear algebra and its applications. Frontiers of Mathematics in China, 2(4):501-526, 2007.
134. Alfio Quarteroni, Riccardo Sacco, and Fausto Saleri. Numerical Mathematics. Springer, 2nd edition, 2007.
135. Th. M. Rassias, H. M. Srivastava, and A. Yanushauskas. Topics in Polynomials of One and Several Variables and Their Applications. River Edge, 1993.
136. Edgar Reich. On the convergence of the classical iterative method of solving linear simultaneous equations. Annals of Mathematical Statistics, 20(3):448-451, 1949.
137. J. R. Rice. The Approximation of Functions, volume 1. Addison-Wesley, 1969.
138. J. R. Rice. The Approximation of Functions, volume 2. Addison-Wesley, 1969.
139. Ralph Tyrell Rockafellar. Convex Analysis. Princeton University Press, 1996.
140. R. Roy. The work of Chebyshev on orthogonal polynomials. In Th. M. Rassias, H. M. Srivastava, and A. Yanushauskas, editors, Topics in Polynomials of One and Several Variables and Their Applications, pages 495-512. River Edge, 1993.
141. Walter Rudin. Principles of Mathematical Analysis. McGraw-Hill, 3rd edition, 1976.
142. Walter Rudin. Real and Complex Analysis. McGraw-Hill, 3rd edition, 1986.
143. Hans Schneider. Olga Taussky-Todd's influence on matrix theory and matrix theorists. Linear & Multilinear Alg., 5:197-224, 1977.
144. L. R. Scott, T. W. Clark, and B. Bagheri. Scientific Parlallel Computing. Princeton University Press, 2005.
145. L. R. Scott and Xie Dexuan. Parallel linear stationary iterative methods. In Petter Bjørstad and Mitchell Luskin, editors, Parallel solution of partial differential equations, pages 31-55. Springer-Verlag, 2000.
146. J. R. Silvester. Determinants of block matrices. Mathematical Gazette, 84(501):460-467, 2000.
147. Simon J. Smith. Lebesgue constants in polynomial interpolation. Annales Mathematicae et Informaticae, 33:109-123, 2006.
148. Arnold Sommerfeld. Mechanics. Academic Press, 1952.
149. 5 + ax + b. American Mathematical Monthly, 101(10):986-992, 1994.
150. Neal Stephenson. The Baroque Cycle, Volume 1: Quicksilver. Harper Perennial, 2004.
151. G. W. Stewart. Matrix Algorithms, Volume I: Basic Decompositions. Philadelphia: Society for Industrial and Applied Mathematics, 1998.
152. G. W. Stewart. Matrix Algorithms, Volume II: Eigenvalue Problems. Philadelphia: Society for Industrial and Applied Mathematics, 2001.
153. G. Strang and K. Borre. Linear Algebra, Geodesy, and GPS. Wellesley Cambridge Press, 1997.
154. V. Szebehely, D. Saari, J. Waldvogel, and U. Kirchgraber. Eduard L. Stiefel (1909-1978). Celestial Mechanics and Dynamical Astronomy, 21:2-4, Jan. 1980. 10.1007/BF01230237.
155. René Taton. Evariste Galois and his contemporaries. Bulletin of the London Mathematical Society, 15(2):107-118, 1983.
156. David J. Thomas and Judith M. Smith. Joseph Raphson, F.R.S. Notes and Records of the Royal Society of London, 44(2):151-167, 1990.
157. John Todd. Numerical analysis at the National Bureau of Standards. SIAM Review, 17(2):361-370, 1975.
158. H. R. Tolley and Mordecai Ezekiel. The Doolittle method for solving multiple correlation equations versus the Kelley-Salisbury "iteration" method. Journal of the American Statistical Association, 22(160):497-500, 1927.
159. Lloyd N. Trefethen. Is Gauss quadrature better than Clenshaw-Curtis? SIAM Review, 50(1):67-87, 2008.
160. Lloyd N. Trefethen and David Bau, III. Numerical Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997.
161. A. M. Turing. Rounding-off errors in matrix processes. Quarterly Journal of Mechanics and Applied Mathematics, 1(1):287-308, 1948.
162. Herbert Westren Turnbull. University of St. Andrews James Gregory Tercentenary. St. Andrews: The University, 1939.
163. Ian Tweddle. The prickly genius-Colin Maclaurin (1698-1746). Mathematical Gazette, 82(495):373-378, 1998.
164. Robert A. van de Geijn and Enrique S. Quintana-Ortí. The Science of Programming Matrix Computations. www.lulu.com, 2008.
165. Henk A. van der Vorst. Iterative Krylov Methods for Large Linear Systems. Cambridge University Press, 2003.
166. F. Varadi, B. Runnegar, and M. Ghil. Successive refinements in longterm integrations of planetary orbits. Astrophysical Journal, 592:620-630, 2003.
167. Richard S. Varga. Gershgorin and His Circles. Springer, 2000.
168. Richard S. Varga. Matrix Iterative Analysis. Springer, 2nd edition, 2000.
169. John H. Welsch. Algorithm 280: Abscissas and weights for Gregory quadrature. Communincations of the ACM, 9(4):271, 1966.
170. E. T. Whittaker and G. Robinson. The Calculus of Observations: A Treatise on Numerical Mathematics. Blackie, 1942.
171. E. T. Whittaker and G. Robinson. The Calculus of Observations: An Introduction to Numerical Analysis. Dover, 4th edition, 1967.
172. J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford, 1965.
173. Ragnar Winther. Some superlinear convergence results for the conjugate gradient method. SIAM Journal on Numerical Analysis, 17(1):14-17, 1980.
174. Tjalling J. Ypma. Historical development of the Newton-Raphson method. SIAM Review, 37(4):531-551, 1995.