Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with na.numerical-analysis
Search options not deleted
user 505008
Numerical algorithms for problems in analysis and algebra, scientific computation
2
votes
0
answers
87
views
Finding a branch cut or a branch point [closed]
Is there a way to find a branch cut or a branch point, through which a curve over a complex function goes, or in general in some region of complex function, say $\ln(f(z))$, using numerical methods or …
- 67
2
votes
0
answers
127
views
Extensions of Euler–Maclaurin formula
There are ways to approximate a sum through integration like the Euler–Maclaurin formula, which requires the function $f(x)$ to be continuous, but there are several ways to extend the formula to funct …
- 67
0
votes
0
answers
44
views
Complexity of evaluation of analytic functions
Given an analytic function $f(x)$ (say as combination of elementary functions and operators), is it possible to compute $n$ first bits of the value of the function on the whole interval $[a, b]$ insid …
- 67