Encyclopedia > Well-posed problem

  Article Content

Well-posed problem

A well-posed problem is, roughly speaking, a numerical problem whose solution changes by only a small amount if its data are changed by a small amount. A measure of well-posedness is the condition.

If a problem is well-posed, then it stands a good chance of solution on a computer using a stable algorithm[?]. If it's not well-posed, it needs to be re-formulated for numerical treatment.

The concept of well-posedness 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 well-posedness of the problem is the continuity of the function.

See also Numerical analysis

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
Battle Creek, Michigan

... Pacific Islander, 2.11% from other races, and 2.72% from two or more races. 4.64% of the population are Hispanic or Latino of any race. There are 21,348 households ...

This page was created in 23.4 ms