1
vote
1answer
55 views

Monotonicity of Trapezoid Approximations

Here's a numerical analysis question which may not be very important, especially in practice, but has been bugging me. Suppose $f$ is a continuous function on an interval $[a,b]$. Let $T_n(f)$ be ...
2
votes
2answers
99 views

Boundedness of ratio of linear functions

Consider the function \begin{eqnarray} f(x_1,x_2,\cdots, x_n) = \frac{\sum_{i}^{n}a_ix_i}{\sum_{i}^{n}b_ix_i}, \end{eqnarray} over the set $S = \{x := (x_1,x_2,\cdots, x_n):-1 \leq x_i \leq 1,\; ...
6
votes
1answer
128 views

Estimates of Hausdorff dimension (and its derivatives)

For example, the cookie cutter maps, say $T:I_1 \cup I_2 \subset [0,1] \to [0,1] $ is a $C^2$ map such that $|T'|>1$ and provided $I_1$ and $I_2$ are disjoint closed intervals and $T(I_i)=[0,1]$. ...
1
vote
1answer
153 views

Is there an example where the error of Gauss-Laguerre quadrature does not vanish?

The $n$th Gauss-Laguerre quadrature aims to approximate integral $$\int_{\mathbb{R}_+} f(x) \exp(-x)$$ by the sum $$\sum_{i=1}^n f(x_i) w_i$$ where $x_1,...,x_n$ are the roots of the $n$th Laguerre ...
2
votes
2answers
120 views

Seeking a class of functions for which sums approximate integrals well

Is there a "natural" class of integrable functions $f: {\mathbb R} \rightarrow {\mathbb R}$ for which it is true (and, preferably, not too hard to prove!) that $\sup_{0 \leq a < h} |h S(a,h) - I|$ ...
4
votes
0answers
88 views

Error of midpoint method for differentiable functions

Is it the case that for every differentiable function $f$ on $[0,1]$ (with finite one-sided derivatives at the endpoints), the midpoint method of estimating $\int_0^1 f(x) \: dx$ has error $o(1/n)$? ...
3
votes
1answer
184 views

Error of midpoint method for functions that are not twice-differentiable

All of the bounds I've seen for the error of the midpoint method of integration are expressed in terms of the second derivative of the function. What bounds are available when the function is not ...
6
votes
1answer
179 views

Approximating an iteratively defined function

Let $f_0,f_1,\ldots$ be a sequence of functions $f_n : [0,1] \rightarrow R$ defined as follows: $$f_0(x) =1+2x$$ $$f_{n}(x) := \left\{\frac{5+t}{2} : \text{ where t solves } ...
10
votes
1answer
273 views

The geometric-mean factorial

Think of the factorial as $f(n) = n \odot (n-1) \odot \cdots \odot 2 \odot 1$, where $\odot$ is the binary operator for multiplication, $\cdot$. This suggests exploring replacing $\odot$ with other ...
4
votes
1answer
222 views

How to get an expression for this integral(Numerically/Analytically)

I have the following problem: I need to evaluate the integral $$\int_{\cos(\alpha)}^{1} P_l(t)P_{l'}(t) dt $$ for $\alpha \in [0,\pi]$ and each combination of $l$ and $l'$, where $P_l$ is the l-th ...
2
votes
0answers
132 views

Radius of convergence to be proved more precisely (differential equation)

There is a differential equation in polar coordinates: $r'^2+r^2=(kt)^2$, $r(t=0)=0$, k- Const. It is possible to get a solution which is a power series (see below). However, I am looking for an ...
6
votes
2answers
720 views

Approximating erf by tanh

It appears to be well-known that $\tanh(x)\le \mathrm{erf}(x)$ on $[0,\infty)$. It's off-handedly mentioned here, for example. Where can I find a formal proof? On the one hand, it's hard to imagine ...
-5
votes
2answers
658 views

why do we need algorithms, and why is non-convex optimization difficult? [closed]

A simple question, but (I'm quite sure) not a superficial one: is the basic distinction between algorithms and much of the rest of math that algorithms try to tackle problems for which we lack global ...
4
votes
1answer
160 views

Estimating the volume of a semialgebraic set from above

Suppose $S$ is a subset of $\mathbb{R}^n$ of finite volume defined by a system of finitely many polynomial inequalities with integer coefficients. Can anyone describe an algorithm that, given such a ...
1
vote
1answer
710 views

On an eigenvalue inequality

Let $\lambda_1 (\cdot)$ be the larger absolute value eigenvalue of a $2\times2$ matrix and $\lambda_2 (\cdot)$ the smaller absolute value eigenvalue of a $2\times2$ matrix, i.e. $|\lambda_1 (\cdot)| ...
5
votes
1answer
462 views

Acceleration via smoothing

Is the following approach to accelerating the rate of convergence of $(1+1/2+\dots+1/n)- \ln n$ (with $n=1,2,3,\dots$), and other sequences like it, in the literature? Let $f(t)=(\sum_{1 \leq n \leq ...
5
votes
1answer
367 views

Numerically finding a Mercer expansion for a given covariance kernel

Let $c(r)$ be a nice, continuous function with compact support. For example, $c(r) = \tfrac 1 5 (1-r)^{11} \big( 5 + 55r + 239 r^2 + 429 r^3 \big)$ for $r \in [0,1]$, and $c(r) = 0$ otherwise. On ...
8
votes
0answers
312 views

Evaluating Shintani cone zeta functions

Hi everyone I am trying the evaluate sums of the form $$ \sum_{n_1>0,n_2>0,\ldots,n_m>0} \frac{1}{\big((a_{1,1}n_1 +\ldots +a_{1,m}n_m)^k \ldots (a_{m,1}n_1+ \ldots +a_{m,m}n_m)^k\big)}$$ ...
6
votes
3answers
787 views

Dependence of error on mesh for Riemann sums

Suppose $f$ is continuous on $[a,b]$ with $I = \int_a^b f(x)\: dx$, and for every $\epsilon > 0$ let $\delta(\epsilon)$ be the largest $\delta > 0$ such that every Riemann sum arising from a ...