If a problem is wellposed, then it stands a good chance of solution on a computer using a stable algorithm[?]. If it's not wellposed, it needs to be reformulated for numerical treatment.
The concept of wellposedness is related to that of continuity. In fact, if the problem can be thought of as a function mapping its data, which is an <math>m</math>tuple of real numbers, into its solution, an <math>n</math>tuple of real numbers, then wellposedness of the problem is the continuity of the function.
See also Numerical analysis
Search Encyclopedia

Featured Article
