On computable bounds nds we have shown involve the unknown solution u. the bounds is based on som...
On computable bounds nds we have shown involve the unknown solution u. the bounds is based on some regularity assumptions on u and on The validity of the domain 2. These bounds are suitable to demonstrate convergence rates in the assumed solution regularity scenarios. Hence the name a priori (meaning from the start/with given in this context) Key Question Is it possible to derive computable error bounds, e.g. of the form llu - Unll CE(S2, f, uh) for various norms? Key idea: Use residuals For instance, let Ах--b A E Rnxn invertible, x, b E Rn linear system. An approximation xo of the exact solution x, satisfies the bound
On computable bounds nds we have shown involve the unknown solution u. the bounds is based on some regularity assumptions on u and on The validity of the domain 2. These bounds are suitable to demonstrate convergence rates in the assumed solution regularity scenarios. Hence the name a priori (meaning from the start/with given in this context) Key Question Is it possible to derive computable error bounds, e.g. of the form llu - Unll CE(S2, f, uh) for various norms? Key idea: Use residuals For instance, let Ах--b A E Rnxn invertible, x, b E Rn linear system. An approximation xo of the exact solution x, satisfies the bound