Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

I am writing a code for a system of equations for which the variables vary in time and space. I have written an implicit code to solve a system of equations before but in that case I could write the equations in matrix form and used Newton Raphson's method to solve the equations. This time I am just using for loops and I'm not assembling the matrices. Would it be possible to use Newton Raphson's method and Implicit Euler for this case. I mean I was having problems in terms of calculating the Jacobian (the gradients of the function). Any hints would be appreciated.

share|cite|improve this question
up vote 1 down vote accepted

It is difficult to use the Newton-Raphson method without assembling the matrix. The reason is that Newton-Raphson requires you to solve a matrix equation with the Jacobian, and the standard method for solving matrix equations is Gaussian elimination / LU-factorization, and for that you do need to assemble the matrix. There are methods for solving matrix equations that do not require you to assemble the matrix but these are more advanced.

If you cannot calculate the Jacobian (your question is a bit vague here), then you cannot use Newton-Raphson.

Assuming that you want to solve your equation without using any built-in solver, perhaps you should first try fixed-point iteration to solve the nonlinear equation in the implicit Euler method as this is the easiest method. There is a very short description on Wikipedia at . However, fixed-point iteration destroys the stability of the implicit Euler method and that is probably the reason why you are using an implicit method in the first place.

share|cite|improve this answer
Thanks very much for your help. – Hooman May 15 '12 at 12:54

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.