Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Cover of Approximation Theory and Approximation Practice

    Approximation Theory and Approximation Practice

    Lloyd N. Trefethen · 2012

    An original and modern treatment of approximation theory for students in applied mathematics. Includes exercises, illustrations and Matlab code.

    Mathematics
    Open LibraryAmazon
    Stats for nerds
    9recommend
    15mentions
    10people
    2015–2025years
    87% recommend13% neutral

    Mentions per year

    201520172019202120232025

    What Hacker News says

    1. 4ce0b361Jun 2025
      I'd suggest: Trefethen, Lloyd N., Approximation theory and approximation practice (Extended edition), SIAM, Philadelphia, PA (2020), ISBN 978-1-611975-93-2.
      thread
    2. sfpotterJun 2025
      I would check out "An Introduction to Numerical Analysis" by Suli and Mayers or "Approximation Theory and Approximation Practice" by Trefethen. The former covers all the major intro numerical analysis topics in a format that is suitable for someone with ~undergrad math or engineering backgrounds. The latter goes deep into Chebyshev approximation (and some related topics). It is also very accessible but is much more specialized.
      thread
    3. sfpotterMar 2025
      A general pitfall in numerical methods is settling on a bad old method without understanding what all your options are. It's easy to get stuck on suboptimal methods, especially if you don't look at more recent references and the literature. Not all new methods are good; lots of old methods are great. There are a dozen different ways to solve any given problem. Usually, each method will be ~equally as hard for you the implementer to understand, but they can have wildly different performance characteristics. This is the main reason to avoid looking at something like Numerical Recipes---it will get you stuck in a local minimum.

      I'll try to give books that are good starting points and provide a useful and correct orientation for each topic. For each of these topics, there are many, many other books. I don't know all the books---I'm sure I'm missing other great references.

      General numerical analysis reference: Suli & Mayers, Stoer & Bulirsch, Ridgway Scott's book. There are many others---these are the ones I like. Suli & Mayers is truly excellent. Stoer & Bulirsch is comprehensive.

      Linear algebra, etc: Trefethen & Bau, "Matrix Computations". Yousef Saad's books. Greenbaum's book. There are other key topics not covered much by these, namely sparse direct solvers. Tim Davis has a good intro book. Martinsson has a new book on fast direct solvers---unclear how useful such solvers are in general.

      Approximation theory: "Approximation Theory and Approximation Practice" by Trefethen. Extremely important book. Many numerical methods for solving 1D problems (rootfinding, approximation, optimization, solving differential equations, nonlinear boundary value problems, representing special functions, etc) are made completely obsolete by using Chebyshev approximation, at least when the function you're working with is analytic (and even when not, you can get very far by using a "Chebyshev spline"). If all you're doing is calculus on a computer, this is probably the only book you need to read.

      Optimization: Nocedal & Wright. Boyd & Vandenberghe. Bertsekas has great books.

      Interval arithmetic: Moore, Kearfott & Cloud. This topic doesn't get as much play in the academic applied math/scientific computing/numerical analysis community, which is a real shame, IMO. Gives you the basic tools to get into verified numerics, where you can write algorithms which work provably correctly, allowing you to avoid epsilon hacking to some extent. E.g., "do X if |small number| < eps, otherwise do Y". Without verified numerics it's impossible to build correct algorithms on these kinds of predicates with floating point arithmetic).

      This covers what I would consider the "basic" topics. At least, if you're doing something else that's higher level (like solving PDEs), you need stuff from this toolbox.

      thread
    4. alleycat5000Jun 2024
      A great book on this subject is Approximation Theory and Approximation Practice:

      https://people.maths.ox.ac.uk/trefethen/ATAP/

      Also chebfun!

      https://www.chebfun.org/

      thread
    5. remcobJun 2023
      I wrote this intro for a friend and since then more people have found it useful:

      https://xn--2-umb.com/22/approximation

      If you want a proper textbook, I recommend L.N. Trefethen (2019). “Approximation Theory and Approximation Practice.” Which is available online here:

      https://epubs.siam.org/doi/book/10.1137/1.9781611975949

      thread
    6. alleycat5000Feb 2023
      Check out https://www.chebfun.org/ if you want to see some crazy stuff you can do with polynomials!

      Also the book Approximation Theory and Approximation Practice

      https://epubs.siam.org/doi/book/10.1137/1.9781611975949

      is really great, by the author of Chebfun.

      thread

    Related

    Cover of Numerical linear algebra
    2010–2026

    Numerical linear algebra

    Lloyd N. Trefethen
    26 recommend · 45
    Cover of A history of vector analysis
    2014–2025

    A history of vector analysis

    Michael J. Crowe
    3 recommend · 7
    Cover of Naive Set Theory
    2009–2025

    Naive Set Theory

    Paul R. Halmos
    29 recommend · 38
    Cover of Introduction to Algorithms
    2007–2026

    Introduction to Algorithms

    Thomas H. Cormen
    274 recommend · 880
    Cover of Introduction to the theory of computation
    2008–2026

    Introduction to the theory of computation

    Michael Sipser
    66 recommend · 96
    Cover of The Princeton Companion to Mathematics
    2009–2025

    The Princeton Companion to Mathematics

    Timothy Gowers
    62 recommend · 101
    Cover of Finite-dimensional vector spaces
    2009–2026

    Finite-dimensional vector spaces

    Paul R. Halmos
    24 recommend · 89
    Cover of Introduction to the design & analysis of algorithms
    2007–2024

    Introduction to the design & analysis of algorithms

    Anany Levitin
    7 recommend · 10