A few quick questions for those who have taken the test. The ETS booklet mentions numerical analysis as a possible 'additional topic'. Anyone have a good idea what topics such question(s) would cover? More practically, is there a book out there which has the necessary info contained in the first three chapters and 30 exercises? Same questions for 'algorithms,' which were also mentioned. With regards to latter, there's a classic computer science book out of MIT called Introduction to Algorithms by Cormen, Leiserson et al. Thinking about tackling first few sections of that one just to cover my bases, make sure I'm more comfortable with notation/complexity questions... thoughts?

Many thanks!

## Numerical Analysis topics on GRE?

### Re: Numerical Analysis topics on GRE?

The algorithm is some very basic pseudo-code question. I've never seen a numerical analysis question in the two times I've taken it

### Re: Numerical Analysis topics on GRE?

Re numerical analysis:

At most newton's method or linear approximations from Calculus textbooks eg Stewart. Of course there's the higher linear algebra that you would learn in a numerical analysis/scientific computing course like maybe 'positive definite' or when the trace of a matrix equals its rank or even possibly matrix differentiation, but I don't believe there's anything there about flops, Cholesky, LU, SVD, etc

Re algorithms:

I have a feeling the chapter in Rosen's Discrete Mathematics covers it.

At most newton's method or linear approximations from Calculus textbooks eg Stewart. Of course there's the higher linear algebra that you would learn in a numerical analysis/scientific computing course like maybe 'positive definite' or when the trace of a matrix equals its rank or even possibly matrix differentiation, but I don't believe there's anything there about flops, Cholesky, LU, SVD, etc

Re algorithms:

I have a feeling the chapter in Rosen's Discrete Mathematics covers it.

### Re: Numerical Analysis topics on GRE?

I think it's better to work on more common topics unless you're already very confident with them. In most of the practice tests I found online (official/unofficial), I see at most one question in programming. I'm not sure if reading a few chapters just for one problem is cost efficient.

It's pretty much guaranteed that there will be many Calculus questions, so I would personally spend more time there.

It's pretty much guaranteed that there will be many Calculus questions, so I would personally spend more time there.

### Re: Numerical Analysis topics on GRE?

As I have seen so far any algo question is made simple enough that people don't need to know any formal programming language or even MATLAB to read it. The most common type of question could be ask you to manually find a few inputs or to tell when does it terminate.