mathstodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance for maths people. We have LaTeX rendering in the web interface!

Server stats:

2.8K
active users

#numericalmethods

0 posts0 participants0 posts today

Whenever I walk to/from home, I have to walk up/down an inclined street; I noticed that the asphalt floor has different curvatures depending on how near it is of a bend, and I try to find a less steep incline while walking.

This got me inspiration for the few questions below. Any simple explanations, and related links, are welcome.

Given a surface within R^3, and two distinct points in it, there are infinitely many differentiable paths from one point to another, remaining on the surface. At each point of the , one can find the path's local . Then:

- Find a path that minimizes the supreme of the curvature. In other words, find the "flattest" path.

- Find a path that minimizes the variation of the curvature. In other words, find a path that "most resembles" a circle arc.

Are these tasks always possible within the given conditions? Are any stronger conditions needed? Are there cases with an solution, or are they possible only with numerical approximations?

student problems:

TFW you're scrambling to get enough done before deadline and it hits you that a nontrivial swath of your troubleshooting headaches is you didn't put as many decimal places in your answer as the order of magnitude of the error bound bc the problem on error bound came *after*

ISTG I'm going to put calculating error bounds with "nice" assumptions right there in the function

Hello all. Going to give Mastodon a try. Here's my :

I'm a professor at Dartmouth College. I do research primarily in physically based , particularly and volumetric/participating media rendering, and also a bit in digital .

I also teach courses in , , , , .
You can find my projects on my github page, including HDRView, SamplinSafari, rendering-bib.