Numerical algorithms for problems in analysis and algebra, scientific computation

learn more… | top users | synonyms

0
votes
1answer
69 views

What is a one-parameter Newton's method?

The Newton's method that I know is defined as follows: $$x_{n+1}=x_n-\frac{f(x_n)}{f'(x_n)}$$ However, I've recently encountered a paper that talks about a one-parameter family of Newton's method ...
0
votes
1answer
76 views

Generating random variables from the Cantor Distribution [on hold]

I am looking for a method (exact, if possible, but at least asymptotically correct) for generating random variates from a Cantor Distribution? It seems like its abstract definition prevents this. In ...
0
votes
0answers
16 views

Column Subset Selection implementations

Are there readily available implementations of algorithms for the CSSP - Column Subset Selection Problem?
1
vote
0answers
13 views

Comparing Calculation Error in Divergent Numerical Methods

I'm not an expert in numerical methods, but I'm doing a simulation based on non-linear differential equations (General Relativity), there solutions has singularities, thus at some points numerical ...
0
votes
1answer
73 views

What is exponentially fitted osculating straight line?

While reading an article about iterative methods for solving nonlinear equations I can't understand what is exponentially fitted osculating straight line. Could someone please briefly explain this ...
-2
votes
1answer
73 views

BDF2 and TR-BDF2: what is better? [closed]

What method of numerical solving ODEs is better? BDF2 or TR-BDF2? Namely, what advantages has TR-BDF2 over BDF2? Is TR-BDF2 more accurate? Does it damp "ringing" better? The BDF2 method requires the ...
4
votes
1answer
520 views

Solution of Helmholtz-Equation where Phase is restricted by additional PDE

Hello! Let's say I have $(\partial_x^2 + \partial_y^2 + a)f(x,y)=0$ with $f(x,y) \in \mathbb{C}$, ($\lim_{x,y \to \infty} f(x,y)=0$). Now separate the Amplitude and Phase of the solution: ...
2
votes
2answers
231 views

Solving a matrix equation $X=c \cdot AXA' +I$ with a diagonal corrections

I am now struggling to solve the matrix $X \in R^{n \times n}$ in the following equation: $X=c \cdot AXA' - diag(c \cdot AXA')+ I$, where (1) $A \in R^{n \times n}$ is a given matrix whose element ...
0
votes
0answers
18 views

non-coherent estimation problem

I have the following signals $$\left[\begin{array}{c} y_{mn} \\ y_{nm}\end{array}\right] =\left[\begin{array}{c} x_{n} \\ x_{m}\end{array}\right]h_{nm} +\left[\begin{array}{c} e_{mn} \\ ...
3
votes
1answer
87 views

Selecting Rays for Simulated Radon Transform

I have the task of determining approximations of a 2D function $f: (x,y)\in \mathbb{R}^2\mapsto\mathbb{R}$ from integrals along lines, i.e. from its Radon transform $R(\phi,\tau)[f(x,y)]$ and, because ...
5
votes
1answer
172 views

Approximation theory on the disc

Chebyshev theory provides a very effective method for approximating continuous real valued functions on the unit interval. Is there something similar for continuous real valued functions on the ...
1
vote
0answers
51 views

Helmholtz Equation FEM Iterative Solvers vs Direct Solvers

Consider the Helmholtz equation $- (\Delta + k^2) u(x) = f(x) \quad x \in \Omega \subset \mathbb{R}^d$ with Robin boundary condition $\partial_n u(x) - iku(x) = 0 \quad x \in \partial \Omega$. ...
2
votes
3answers
1k views

Best algorithm/software for solving a planar transportation problem ?

I am looking for software (open-source or otherwise) or an implementable algorithm for solving a continuous transportation problem. The input consists of a pointset in a planar rectangle, and we need ...
2
votes
1answer
101 views

Special Function, Series Expansion, or Simpler Form of a Certain Infinite Product?

$\prod _{n=1}^{\infty } \left(1+a (c+n)^b\right)$ where a > 0, b < -1, and c >= 0 Is there a special function, series expansion, or other simpler (or maybe just interesting) representation of ...
0
votes
0answers
54 views

Eigenvalue problem (finite difference operator)

Consider an arbitrary elliptic (perhaps, degenerate) finite difference operator $$L_{i,j,k}=-\Delta_{i,j,k}+\alpha_{i,j,k}\frac{\partial}{\partial x}_{i,j,k}+\beta_{i,j,k}\frac{\partial}{\partial ...
0
votes
0answers
41 views

Shooting method for non-oscillatory solutions

I am having some trouble with using the shooting method : I am given a system of ode's representing initial value problem, and I know I want one of the unknowns (=u) to vanish at infinity (which I ...
1
vote
3answers
209 views

What are some good sanity checks for simulating BNLS?

After doing some googling, I failed to find any explicit solution for the Biharmonic Nonlinear Schrodinger Equation, which states: $$ i\psi (x,t) _t - \Delta ^2 \psi (x,t) + |\psi (x,t) | ^{2 \sigma} ...
1
vote
1answer
82 views

Divergence of the Lagrange interpolation on the Chebyshev nodes

Faber theorem states that for every $\lbrace x_k^{(n)} \rbrace$ there exists a continuous $f$ function such that $\| f - L_n \|_{\infty} \not\rightarrow 0$, where $L_n$ is interpolation polynomial on ...
1
vote
1answer
204 views

Residues and values of Riemann Zeta function at some points

I need the following computational results for proving something. Let $1/2 + i\gamma_0$, be the first nontrivial zero of Riemann zeta function, $\zeta(s)$, i.e. $\gamma_0\sim 14.134...$. 1) what is ...
8
votes
2answers
544 views

Sampling from Sine Kernel and Airy Kernel

A determinantal process on the line is a random collection of points on $\mathbb{R}$ such that the probability of $x_1, \dots, x_n$ lying on the random set is $\det (K(x_i, x_j))_{(i,j)}$. Examples ...
0
votes
1answer
124 views

A kind of Discrete Fourier Transform

Given a $z\in \mathbb{C}^N$, the DFT of $z$ is given for every $k\in [0,N-1]_\mathbb{N}$ by $$DFT_z(k)=\frac{1}{N} \sum_{j=0}^{N-1} z_j\, \omega^{-k j}$$ where I have denoted by $\omega$ the $N$-th ...
2
votes
3answers
223 views

What is an extragradient method?

I've searched Google, but it seems that only research journal papers appear in search results, where some new, improved, or specialized extragradient method is discussed. I've also searched Wikipedia ...
0
votes
0answers
125 views

$Ax=b$ in a function space (again)

Let $X$ be compact Hausdorff topological space, $C(X)$ denote the algebra of complex-valued continuous functions on $X$, $b\in \mathbb{C}^m$, $\mathbf{A}\in C(X)^{m\times n}$, Let ${\mathbb{C}}^n$ ...
0
votes
0answers
27 views

Multiple integral of the resolvent kernel

I am trying to implent Volterra equations using resolvent kernel.To do this, the iterative kernel $$K_i(x,y) = \int\limits_x^y K_1(y,t)K_{i-1}(t, x)dt. $$ should be calculated. However, it is not ...
1
vote
1answer
32 views

Convergent algorithm for dividing a body into two regions of equal volume

Let $\Omega \subset R^3$ be a bounded open region. It is well known that there exists a smooth surface $\Gamma$ with minimum area and constant mean curvature which is orthogonal to $\partial \Omega$ ...
0
votes
0answers
54 views

Rational dynamical system with nonnegative paramaters

let $A$ be a rational system of the form :$\begin{cases} x_{n+1}=\frac{\alpha_{1}}{y_{n}} \\ y_{n+1}=\frac{\alpha_{2}}{z_{n}} \\ ...
4
votes
1answer
146 views

Rank 1 Approximation of Elementwise Inverse Matrix

I'm wondering whether there is a good way to solve the following optimisation problem. Given a strictly positive quadratic matrix $A$, find two diagonal matrices $D_1$ and $D_2$ so that $$ \| D_1 A ...
2
votes
0answers
100 views

error estimate of linear interpolation in high dimension

Consider convex functions $f,g$ on $[0,1]^d$. Let $x_1,\cdots,x_n$ be $n\geq d+1$ fixed point in $[0,1]^d$ that is equally 'distributed' in the sense that $$c_1\leq ...
5
votes
2answers
217 views

Local positivity of solutions to linear differential inequalities (Chaplygin's theorem)

According to the entry "Differential inequality" of the Encyclopedia of Mathematics http://www.encyclopediaofmath.org/index.php/Differential_inequality the following result is due to Chaplygin ...
4
votes
1answer
155 views

Resolvent of a triangular matrix

Suppose $A$ is a triangular matrix. What is the most efficient known algorithm to compute the polynomial (in $x$) matrix $(xI-A)^{-1}$? Of course, $(xI-A)^{-1}= N(x)/p_A(x)$, where $p_A$ is the ...
0
votes
0answers
38 views

Bound on change of function given bound on Hessian

Suppose I have very some smooth function $F(x)$, and let $x_0 = \text{argmin}_x F(x)$. I would like to bound $F(x) - F(x_0)$ from above, in terms of the gradient $\nabla f(x)$ and the Hessian matrix ...
-2
votes
2answers
50 views

Systems of ODEs that fulfill a matrix relationship at steady state [closed]

It is well known that for a system of linear ODE $$x'(t) = A(t) \cdot x(t) + b(t)$$ with initial condition $x(t_0) = x_0$, that for a solution at any other time point $t_1$, $x(t_1) = (z_1, \ldots, ...
6
votes
2answers
1k views

Mathematical study of Mpemba effect?

It has been known since the days of Aristotle and Descartes that under certain circumstances warm water freezes faster than cold water. This effect is now commonly known as the Mpemba effect, named ...
2
votes
0answers
46 views

Estimating polynomial approximation error in high dimension

Question Let $x \in [-1, 1]^d \subset \mathbb{R}^d$ be a $d$-dimensional variable and assume that -- given $n$ -- I have a way of computing a polynomial $p_n(x)$ of degree $n$ that approximates a ...
0
votes
0answers
32 views

Probability of close approach for multivariate normal variables

The following problem comes from a physical model of two groups of particles in three dimensions. I need to know the probability that the two groups of particles approach each other within some ...
2
votes
0answers
66 views

What is the computational complexity to compute the integral numerically?

Given $$\int_{\Delta}\frac{P_1(x_1,x_2,\dots,x_n)}{P_2(x_1,x_2,\dots,x_n)}$$ where $P_i$ is polynomial(that is $P_1(x_1,x_2,\dots,x_n), P_2(x_1,x_2,\dots,x_n)$ are polynomial) whose coefficients are ...
1
vote
1answer
42 views

Condition Number and CFL Condition in Finite difference Methods

when applying a Finite Difference scheme for an IVP, two factors come to mind when considering stability: One factor would be the condition number of the approximation operator. The other factor ...
2
votes
1answer
124 views

books on very large scale linear optimization

Recently in my material science research, I have encountered problems of very large scale linear optimization. I read the introductory book "Introduction to Linear Optimization (Athena Scientific ...
1
vote
2answers
146 views

iterative solution better than analytic solution? [closed]

My supervisor and I were discussing a specific optimisation problem this afternoon. To be simple: solve for $R$ in the equation $Rx=y$, where $x$, $y$ are made of samples in two difference ...
1
vote
0answers
55 views

Frozen coefficient method (von Neumann stability analysis)

Earlier it was considered that frozen coefficients method for Neumann stability analysis for finite difference scheme is more heuristic than rigorous. But I have read some information in a book by ...
7
votes
1answer
166 views

Problems where Conjugate gradient works much better than GMRES

I am interested in cases where Conjugate gradient works much better than GMRES method. In general, CG is preferable choice in many cases of SPD because it requires less storage and theoretical bound ...
8
votes
1answer
260 views

Algorithm to produce random number with a gamma distribution

I'd like to produce pseudo-random numbers with different distributions for a Monte Carlo simulation. I've got the poisson distribution working nicely with an algorithm from Knuth. I'm having trouble ...
6
votes
1answer
142 views

Computing certain integrals over high-dimensional polyhedra

Let $\delta>0$ be a small real number and consider the $k$-dimensional region consisting of points for which $$\delta\leq x_1\leq x_2\leq\ldots \leq x_k$$ and $$x_1+\ldots+x_k\leq 1.$$ I am ...
0
votes
1answer
223 views

Improving Newton's Inequalities using the Taylor Theorem

Newton's inequalities say that if $f(x) = \sum \binom{n}{k} a_k x^k$ is a polynomial with all real roots then $ a_k^2 > a_{k-1}a_{k+1}$. The proof this result uses that if $f(x)$ has all real ...
1
vote
0answers
42 views

General reparameterization of a b-spline

Say I have a bspline function (or curve) of order $k_1$, defined over some knot vector $\mathbf{t} = \{ t_i\}_1^{n_1}$, i.e. $$f(x) = \sum_i a^i B_{i,k_1}(x).$$ Do you know of a process of finding ...
3
votes
1answer
61 views

The link and equivalence between variant definition of computation model and computational complexity over reals

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational ...
7
votes
1answer
155 views

Compute only selected components of an eigenvector

I am wondering whether it is possible to compute portions of the eigenvectors of a given (possibly very big) matrix. More formally, consider the eigenvalue problem $\mathbf{Ax} = \lambda \mathbf{x}$, ...
7
votes
4answers
248 views

Numerical integration of legendre polynomials

I hope that numerical questions are also permitted here. I want to expand a smooth functions $f \in C^{\infty}$in terms of Legendre polynomials. Thus I need to calculate integrals of the form ...
2
votes
0answers
37 views

Conditions for convergence of Euler's method

It is know that a sufficient and necessary condition for $$\dot y(t) = f(y(t), t), \quad t > 0, \quad y(0) = y_0$$ assumes a unique solution of $f$ is Lipschitz in $y$ and continuous in $t$. ...
5
votes
4answers
698 views

Quanitative de Moivre–Laplace theorem (reference request)

The classical de Moivre-Laplace theorem states that we can approximate the normal distribution by discrete binomial distribution: $${n \choose k} p^k q^{n-k} \simeq \frac{1}{\sqrt{2 \pi ...