Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Review Suggested Edit

You can't approve or reject suggested edits because you haven't yet earned the Edit Posts ability.

Approved.
This suggested edit was approved and applied to the post 11 months ago by watchmaker‭.

0 / 255
  • *numericaly* calculate $\sin x$ for large $x$
  • *numerically* calculate $\sin x$ for large $x$
  • I am looking for a way to *numericaly* calculate $\sin x$ for large $x$.
  • Background is from software programming (java, if that should matter).
  • I have seen some realy horrible code (don't ask for details unless you want to wake up screaming at night from dreaming about it).
  • What remains after refactoring and clean-up is the question in the first line.
  • I have seen a paper approaching this in two steps:
  • * First, considering only values in $[-\frac\pi 4,\frac\pi 4]$ so the Taylor series converges quickly.
  • * Second, a software algorithm *specialized* on data representation with bits and bytes.
  • I would like to see a *mathematical* solution to that problem, preferably one that gives lower and upper bounds as rational numbers.
  • I am looking for a way to *numerically* calculate $\sin x$ for large $x$.
  • Background is from software programming (java, if that should matter).
  • I have seen some realy horrible code (don't ask for details unless you want to wake up screaming at night from dreaming about it).
  • What remains after refactoring and clean-up is the question in the first line.
  • I have seen a paper approaching this in two steps:
  • * First, considering only values in $[-\frac\pi 4,\frac\pi 4]$ so the Taylor series converges quickly.
  • * Second, a software algorithm *specialized* on data representation with bits and bytes.
  • I would like to see a *mathematical* solution to that problem, preferably one that gives lower and upper bounds as rational numbers.

Suggested 11 months ago by celtschk‭