MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What are some good graduate level books on applied mathematics which explain in-depth the general modern problem-solving methods of the real-world typical hard problems?

There is a lot of books on numerical methods, engineering math, but I do not know any good modern book, which emphasizes algorithmic complexity of the discussed problems.

share|cite|improve this question
Two things. First, I'm very interested in an answer to this question, but pertaining to the applications of more abstract mathematics (algebraic topology and geometry, galois theory, etc). Second, this looks like it's going for a sorted list, so should be community wiki. – Charles Siegel Dec 4 '09 at 13:44
Are there actually applications of algebraic topology, algebraic geometry, and galois theory anywhere aside from theoretical physics? – Harry Gindi Dec 4 '09 at 15:01
ALgebraic geometry is ubiquitous in cryptography and information theory. Curves play a major role in both. – Steve Huntsman Dec 4 '09 at 15:20
I'm told that algebraic topology has lots of applications to sensor networks and target tracking as well, but I really know nothing about these things. I threw in Galois theory as something that I didn't know any examples of what they're applied to, but figured 'hey, it's abstract, but maybe someone will know' – Charles Siegel Dec 4 '09 at 16:12
Yes, I've been to talks, and simplicial, singular and deRham cohomology were all used. – Charles Siegel Dec 4 '09 at 22:11
up vote 4 down vote accepted

Since the question was tagged with "algorithms", I will give an algorithms recommendation. (You don't say specifically what type of problems you want to solve, but you do mention "algorithmic complexity.") For a book that was written to motivate the theory of algorithms from real-world problems, I would recommend Algorithm Design by Kleinberg and Tardos. It discusses many problem-solving methods. From the website for the book:

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. In a clear, straight-forward style, Kleinberg and Tardos teaches students to analyze and define problems for themselves and from this, to recognize which design principles are appropriate for a given situation. The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Amazon link:

share|cite|improve this answer
Thanks a lot! This book is very useful! – psihodelia Feb 8 '10 at 22:26

This book by Erica Flapan relating chemistry and algebraic topology was of use to my wife when she has writing her undergrad thesis. It seems like it might qualify.

share|cite|improve this answer

Geometric Fundamentals of Robotics by Selig applies algebraic and differential geometry to problems in robotics.

Computational Homology by Kaczynski et al has applications of homology to image processing and nonlinear dynamics.

Robert Ghrist,, applies topology to problems in engineering, including robotics and sensor networks.

share|cite|improve this answer
Yep, Rob is the one I was thinking of in my comment that fpqc took issue with. – Charles Siegel Dec 4 '09 at 22:12

Derivations of Applied Mathematicsis a book of applied mathematical proofs. If you have seen a mathematical result, if you want to know why the result is so, you can look for the proof here

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.