02/23/2016, 01:01 PM

The integral method can handle small g " much better.

So i Will be focusing more on integral type formula's in the future.

For instance focusing on the truncated integral method

Sup & g " , g "' , ... g ^(n) &

Where n is picked such that we get Sup , and & * & stands for the integral taking into account the first n derivatives of g.

Likewise second to one supremum , Inf , second to one Inf etc are considered.

This might take Some time.

In fact, I do not know An easy way to compute such Sup.

Although approximations seem easy.

---

Not sure about the future for Tommy-Sheldon iterations.

Maybe if we replace iterating the gaussian with iterating integral methods.

Or not.

---

Regards

Tommy1729

So i Will be focusing more on integral type formula's in the future.

For instance focusing on the truncated integral method

Sup & g " , g "' , ... g ^(n) &

Where n is picked such that we get Sup , and & * & stands for the integral taking into account the first n derivatives of g.

Likewise second to one supremum , Inf , second to one Inf etc are considered.

This might take Some time.

In fact, I do not know An easy way to compute such Sup.

Although approximations seem easy.

---

Not sure about the future for Tommy-Sheldon iterations.

Maybe if we replace iterating the gaussian with iterating integral methods.

Or not.

---

Regards

Tommy1729