Numerical Analysis Second Edition

[1]  Florian Cajori,et al.  Historical Note on the Newton-Raphson Method of Approximation , 1911 .

[2]  Gene H. Golub,et al.  Some History of the Conjugate Gradient and Lanczos Algorithms: 1948-1976 , 1989, SIAM Rev..

[3]  F. M. Larkin.  Root-finding by fitting rational functions , 1980 .

[4]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[5]  R. Winther.  Some Superlinear Convergence Results for the Conjugate Gradient Method , 1980 .

[6]  Simon J. Smith,et al.  Lebesgue constants in polynomial interpolation , 2006 .

[7]  Proof of Two Matrix Theorems via Triangular Factorizations , .

[8]  Alan Edelman,et al.  Large Dense Numerical Linear Algebra in 1993: the Parallel Computing Influence , 1993, Int. J. High Perform. Comput. Appl..

[9]  A. Logg.  Automating the Finite Element Method , 2007, 1112.0433.

[10]  P. Deuflhard,et al.  Affine Invariant Convergence Theorems for Newton’s Method and Extensions to Related Methods , 1979 .

[11]  P. Crout,et al.  A short method for evaluating determinants and solving systems of linear equations with real or complex coefficients , 1941, Electrical Engineering.

[12]  G. Strang,et al.  Linear Algebra, Geodesy, and GPS , 1997 .

[13]  D. Keyes,et al.  Jacobian-free Newton-Krylov methods: a survey of approaches and applications , 2004 .

[14]  H. Rack.  An Example of Optimal Nodes for Interpolation Revisited , 2013 .

[15]  I. P. Mysovskih.  Approximate Calculation of Integrals , 1969 .

[16]  L. Ridgway Scott,et al.  Parallel Linear Stationary Iterative Methods , 2000 .

[17]  H. D. Huskey,et al.  NOTES ON THE SOLUTION OF ALGEBRAIC LINEAR SIMULTANEOUS EQUATIONS , 1948 .

[18]  Seddik M. Djouadi.  Comments on "Is the Frobenius Matrix Norm Induced?" [with reply] , 2003, IEEE Trans. Autom. Control..

[19]  James V. Rauff.  Benjamin Franklin's Numbers: An Unsung Mathematical Odyssey , 2008 .

[20]  J. H. Wilkinson,et al.  Inverse Iteration, Ill-Conditioned Equations and Newton’s Method , 1979 .

[21]  Theodore Kilgore.  A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm , 1978 .

[22]  Herman Heine Goldstine,et al.  A History of Numerical Analysis from the 16th through the 19th Century. , 1976 .

[23]  B V Gnedenko,et al.  SERGEI NATANOVICH BERNSTEIN (obituary) , 1969 .

[24]  Radhey S. Gupta,et al.  Elements of Numerical Analysis , 2015 .

[25]  E. Breitenberger,et al.  Gauss's geodesy and the axiom of parallels , 1984 .

[26]  L. Qi,et al.  Numerical multilinear algebra and its applications , 2007 .

[27]  L. Goddard.  Approximation of Functions , 1965, Nature.

[28]  William M. Waite,et al.  Software manual for the elementary functions , 1980 .

[29]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[30]  H. Keller,et al.  CONVERGENCE RATES FOR NEWTON'S METHOD AT SINGULAR POINTS* , 1983 .

[31]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[32]  René Taton.  Évariste Galois and his Contemporaries , 1983 .

[33]  Eleanor Robson,et al.  Square Root Approximations in Old Babylonian Mathematics: YBC 7289 in Context , 1998 .

[34]  Jean-Michel Muller,et al.  Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .

[35]  I. Lakatos.  PROOFS AND REFUTATIONS (I)*† , 1963, The British Journal for the Philosophy of Science.

[36]  A. Folkesson.  Analysis of numerical methods , 2011 .

[37]  James Demmel,et al.  Applied Numerical Linear Algebra , 1997 .

[38]  George D. Birkhoff,et al.  General mean value and remainder theorems with applications to mechanical differentiation and quadrature , 1906 .

[39]  Lech Maligranda,et al.  Why Hölder's inequality should be called Rogers' inequality , 1998 .

[40]  J. Borwein,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[41]  W. Rudin.  Principles of mathematical analysis , 1964 .

[42]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[43]  G B Kolata,et al.  Geodesy: dealing with an enormous computer task. , 1978, Science.

[44]  R. Scanlan,et al.  Resonance, Tacoma Narrows bridge failure, and undergraduate physics textbooks , 1991 .

[45]  Åke Björck,et al.  A new high order method of regula falsi type for computing a root of an equation , 1973 .

[46]  Lloyd N. Trefethen,et al.  The Exponentially Convergent Trapezoidal Rule , 2014, SIAM Rev..

[47]  Peter Deuflhard,et al.  Numerical Analysis: A First Course in Scientific Computation , 1995 .

[48]  Daniel Kehlmann.  Measuring the World , 2005 .

[49]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

[50]  Michael Ghil,et al.  Revised version submitted to The Astrophysical Journal SUCCESSIVE REFINEMENTS IN LONG-TERM INTEGRATIONS OF PLANETARY ORBITS , 2022 .

[51]  Beresford Parlett.  Very Early Days of Matrix Computations , 2003 .

[52]  E. Hairer,et al.  Geometric Numerical Integration: Structure Preserving Algorithms for Ordinary Differential Equations , 2004 .

[53]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[54]  L. R. Scott,et al.  The Mathematical Theory of Finite Element Methods , 1994 .

[55]  Wolfgang Hackbusch,et al.  The Concept of Stability in Numerical Mathematics , 2014 .

[56]  C.J.H. Mann,et al.  Remarkable Mathematicians: From Euler to von Neumann , 2006 .

[57]  L. Childs.  A concrete introduction to higher algebra , 1978 .

[58]  N. G. Parke,et al.  Ordinary Differential Equations. , 1958 .

[59]  C. T. Fike.  Computer Evaluation of Mathematical Functions , 1970 .

[60]  E. Reich.  On the Convergence of the Classical Iterative Method of Solving Linear Simultaneous Equations , 1949 .

[61]  Ren-Cang Li,et al.  Near optimality of Chebyshev interpolation for elementary function computations , 2004, IEEE Transactions on Computers.

[62]  William H. Press,et al.  Numerical recipes , 1990 .

[63]  M. Powell,et al.  Approximation theory and methods , 1984 .

[64]  J. Butcher.  The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods , 1987 .

[65]  Philipp Birken,et al.  Numerical Linear Algebra , 2011, Encyclopedia of Parallel Computing.

[66]  S. Althoen,et al.  Gauss-Jordan reduction: a brief history , 1987 .

[67]  Ronald Gowing.  Roger Cotes - Natural Philosopher , 1983 .

[68]  Anders Logg,et al.  Multi-Adaptive Galerkin Methods for ODEs I , 2002, SIAM J. Sci. Comput..

[69]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[70]  Ian Tweddle.  The prickly genius- Colin MacLaurin (1698-1746) , 1998 .

[71]  Anne Greenbaum,et al.  Iterative methods for solving linear systems , 1997, Frontiers in applied mathematics.

[72]  P. Erdös.  Problems and results on the theory of interpolation. I , 1958 .

[73]  Robert S. Maier.  On reducing the Heun equation to the hypergeometric equation , 2002, math/0203264.

[74]  W. Hackbusch.  Iterative Solution of Large Sparse Systems of Equations , 1993 .

[75]  Lloyd N. Trefethen,et al.  Is Gauss Quadrature Better than Clenshaw-Curtis? , 2008, SIAM Rev..

[76]  Ranjan Roy.  THE WORK OF CHEBYSHEV ON ORTHOGONAL POLYNOMIALS , 1993 .

[77]  P. Henrici.  Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[78]  H. Schneider.  Olga Taussky-Todd's influence on matrix theory and matrix theorists , 1977 .

[79]  Paul E. Ceruzzi,et al.  When Computers Were Human , 1991, Annals of the History of Computing.

[80]  A. Ostrowski.  Solution of equations and systems of equations , 1967 .

[81]  C. D. Boor,et al.  Divided Differences , 2005, math/0502036.

[82]  I. Hunter.  An exceptional talent for calculative thinking. , 1962, British journal of psychology.

[83]  장훈,et al.  [서평]「Computer Organization and Design, The Hardware/Software Interface」 , 1997 .

[84]  A. G. Greenhill.  Analytical Mechanics , 1890, Nature.

[85]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[86]  L. Qi.  Eigenvalues and invariants of tensors , 2007 .

[87]  Carl Tim Kelley,et al.  Iterative methods for optimization , 1999, Frontiers in applied mathematics.

[88]  G. Milovanović,et al.  Interpolation Processes: Basic Theory and Applications , 2008 .

[89]  Tobin A. Driscoll,et al.  From Potential Theory to Matrix Iterations in Six Steps , 1998, SIAM Rev..

[90]  D. Brink.  Hölder Continuity of Roots of Complex and p-adic Polynomials , 2010 .

[91]  Todd F. Dupont,et al.  The end-game for Newton iteration , 2010 .

[92]  Hari M. Srivastava,et al.  Topics in polynomials of one and several variables and their applications : volume dedicated to the memory of P.L. Chebyshev (1821-1894) , 1993 .

[93]  D. Kalman.  Uncommon Mathematical Excursions: Polynomia and Related Realms , 2009 .

[94]  Claude Brezinski,et al.  The life and work of André Cholesky , 2007, Numerical Algorithms.

[95]  John C. Butcher,et al.  A history of Runge-Kutta methods , 1996 .

[96]  J. Lambert.  Numerical Methods for Ordinary Differential Equations , 1991 .

[97]  Woon-Seng Gan,et al.  Fixed-Point Square Roots Using L-b Truncation [DSP Tips and Tricks] , 2011, IEEE Signal Processing Magazine.

[98]  Frank McSherry,et al.  A uniform approach to accelerated PageRank computation , 2005, WWW '05.

[99]  N. Higham.  The numerical stability of barycentric Lagrange interpolation , 2004 .

[100]  A. Turing.  ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .

[101]  W. M. Kaula,et al.  Dynamical Evolution of Planetesimals in the Outer Solar System: I. The Jupiter/Saturn Zone , 1999 .

[102]  David J. Thomas,et al.  Joseph Raphson, F. R. S , 1990, Notes and Records of the Royal Society of London.

[103]  Luca Dieci,et al.  Some Stability Aspects of Schemes for the Adaptive Integration of Siff Initial Value Problems , 1991, SIAM J. Sci. Comput..

[104]  W. Ledermann,et al.  Issai Schur and His School in Berlin , 1983 .

[105]  George E. Forsythe,et al.  Solving linear algebraic equations can be interesting , 1953 .

[106]  L. Brutman,et al.  ON THE LEBESGUE FUNCTION FOR POLYNOMIAL INTERPOLATION , 1978 .

[107]  J. Todd.  Numerical Analysis at the National Bureau of Standards , 1975 .

[108]  Edmund Taylor Whittaker,et al.  The calculus of observations : an introduction to numerical analysis , 1967 .

[109]  W. Riha,et al.  CONVERGENCE CRITERIA FOR SUCCESSIVE OVERRELAXATION , 1975 .

[110]  G. W. Stewart,et al.  Matrix Algorithms: Volume 1, Basic Decompositions , 1998 .

[111]  W. Wells,et al.  Modern higher algebra , 2022 .

[112]  L. R. Scott,et al.  Solitary‐wave interaction , 1980 .

[113]  Blair K. Spearman,et al.  Characterization of Solvable Quintics x5 + ax + b , 1994 .

[114]  Katharina Wagner.  Euler The Master Of Us All , 2016 .

[115]  J. Junker.  Introduction To Approximation Theory , 2016 .

[116]  F. Cucker,et al.  An alternate proof of the continuity of the roots of a polynomial , 1989 .

[117]  M. Dowell,et al.  A modified regula falsi method for computing the root of an equation , 1971 .

[118]  E. Hairer,et al.  Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems , 2010 .

[119]  Ting-Zhu Huang,et al.  On a new criterion for the H-matrix property , 2006, Appl. Math. Lett..

[120]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[121]  W. Haddad,et al.  Is the Frobenius matrix norm induced? , 1995, IEEE Trans. Autom. Control..

[122]  H. R. Tolley,et al.  The Doolittle Method for Solving Multiple Correlation Equations versus the Kelley-Salisbury “Iteration” Method , 1927 .

[123]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[124]  J. Silvester.  Determinants of block matrices , 2000, The Mathematical Gazette.

[125]  S. Axler.  Linear Algebra Done Right , 1995, Undergraduate Texts in Mathematics.

[126]  G. Meurant.  The Lanczos and conjugate gradient algorithms , 2008 .

[127]  Ernst Hairer,et al.  Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .

[128]  V. I. Arnold,et al.  Remarks on eigenvalues and eigenvectors of Hermitian matrices, berry phase, adiabatic connections and quantum Hall effect , 1995 .

[129]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[130]  Allan Pinkus,et al.  Proof of the conjectures of Bernstein and Erdös concerning the optimal nodes for polynomial interpolation , 1978 .

[131]  J. M Varah,et al.  Computational methods in linear algebra , 1984 .

[132]  W. B.,et al.  The Calculus of Observations: a Treatise on Numerical Mathematics , 1924, Nature.

[133]  B. Parlett.  The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices , 1974 .