Questions tagged [na.numerical-analysis]

Numerical algorithms for problems in analysis and algebra, scientific computation

Filter by
Sorted by
Tagged with
7 votes
2 answers
1k views

Mathematics of sustainable development and energy sobriety in the classroom

Faculty members are encouraged to highlight the connection between the courses we teach and climate change, and raise awareness of the issue in our lectures, across subjects in my university. I am ...
3 votes
0 answers
163 views

Rate of uniform approximation by piecewise constant functions

Definitions and Notation: Fix a positive constant $M>0$ with positive integers $m,n$ and the standard orthonormal basis $e_1,\dots,e_n$ of $\mathbb{R}^n$. For every positive integer $N$, define the ...
ABIM's user avatar
  • 4,969
3 votes
1 answer
154 views

Approximation in Bochner spaces

Is there any result like the Bramble-Hilbert lemma for Bochner spaces? More specifically: let $H$ be a (e.g.) Hilbert space, $I\subset \mathbb R$ a bounded interval, and $L \in \mathcal L(H^k(I;H), Y)...
Lilla's user avatar
  • 225
3 votes
0 answers
146 views

Chebyshev-like polynomials [closed]

In some approximation problems I'm working on, the errors turned out to be polynomials of various degrees whose graphs on the interval $[-1,1]$ look like this: As you can see, these things look a bit ...
bubba's user avatar
  • 649
0 votes
0 answers
62 views

Direct (first-order ?) algorithm to minimize $u(x) := \|x-a\|_C + r\|x\|_p$

Fix $a \in \mathbb R^n$, $r \ge 0$, $p \in \{1,2\}$, and a positive-definite matrix $C$ of order $n$. Define $u:\mathbb R^n \to \mathbb R$ by $u(x) := \|x-a\|_C + r\|x\|_p$, where $\|z\|_C := \sqrt{z^\...
dohmatob's user avatar
  • 6,726
5 votes
1 answer
264 views

Unbounded solution but bounded Euler discretization

Is there an ordinary differential equation in $\mathbb{R}^d$ induced by a gradient vector field with unbounded solutions, for which the difference equations obtained by using the forward Euler method ...
Jean Legall's user avatar
0 votes
0 answers
46 views

Numerically expanding a function in a rational-power "basis"

I have some scientific code which interfaces with a library which accepts real functions specified as any number of additive terms with exponential powers. For instance, it is capable of accepting ...
Anti Earth's user avatar
11 votes
3 answers
713 views

Can computers find zeros of order $2$?

We assume we are given an entire function $f: \mathbb C \to \mathbb C$ with $f(0)=1$ and $f'(0)=0$ and $f$ is real on the real axis. We assume (as a fact about $f$, that we want to demonstrate ...
Pritam Bemis's user avatar
1 vote
1 answer
485 views

Calculating the eigenvalues of the Laplacian numerically

I am trying to find the eigenvalues of the Laplacian operator, or in other words, solve the Helmholtz equation $\nabla^2f=\lambda f$ on a compact 2D domain (comes from a quantum mechanics particle-in-...
FusRoDah's user avatar
  • 3,680
1 vote
0 answers
56 views

Functional approximation with derivatives

I am trying to solve a functional approximation problem. Consider a set of measurements of a d-dimensional state $\mathrm x \in \mathbb{R}^d$, together with velocities $\dot{\mathrm x}$ and ...
can't stop me now's user avatar
0 votes
0 answers
104 views

Solving a nonlinear equation maybe with Lambert W function

Can you please help me solve the following nonlinear equation? \begin{equation} \boldsymbol{z} \odot\left(\boldsymbol{\Gamma}^{\top} \boldsymbol{y}\right)=(\beta)^{\frac{1}{m-1}}\left(\frac{m-1}{...
Iman Nodozi's user avatar
3 votes
0 answers
56 views

how to efficiently find level sets (using a modification of a root-finding algorithm)?

I'm trying to find a set of points $\{ a_i | f(a_i) = c_i \}_{i=1}^k$ where $f$ and $\{ c_i \}_{i=1}^k$ are given in sorted order. All $c_i > 0$, $f$ is continuous and monotonically increasing, $f(...
Paul Mineiro's user avatar
6 votes
1 answer
885 views

Resultant of linear combinations of Chebyshev polynomials of the second kind

The Chebyshev polynomial $U_n(x)$ of the second kind is characterized by $$ U_n(\cos\theta)=\frac{\sin(n+1)\theta}{\sin(\theta)}. $$ It seems that $$\operatorname*{Res}_x \left( U_n(x)+tU_{n-1}(x),\...
W. Wang's user avatar
  • 437
3 votes
1 answer
134 views

Is there a classical textbook/reference on numerical discretization schemes?

I found that it is relatively easy to find a book that discusses Euler discretization or Runge-Kutta discretization, but I am not aware of one that is well-known and/or common knowledge (i.e., field-...
Sin Nombre's user avatar
2 votes
1 answer
149 views

Obtain 3D function from 2D slices [closed]

I am given a graph of a motor's torque vs RPM values at two different current draws, 730A and 300A (see graph). I need to obtain the 3D function to find current as a function of torque and RPM by ...
AzodineAcid's user avatar
3 votes
0 answers
117 views

Preconditioners for $Ax=y$ that rely on hierarchical statistical modeling

Solving $Ax=y$ exactly can be done as: fit a linear autoregressive model by treating rows of $A$ as data apply this model to $A^T y$ Imperfect predictive model corresponds to an approximate inverse ...
Yaroslav Bulatov's user avatar
1 vote
1 answer
54 views

Does norm of discrepancy decrease monotonously in CGLS/CGNR

I am the author of the package for tomographic reconstruction https://github.com/kulvait/KCT_cbct I have implemented CGLS/CGNR , algorithm which applies conjugate gradients on normal equation $$ A^\...
VojtaK's user avatar
  • 151
0 votes
1 answer
107 views

Explicit expression of Padé–Hermite approximant of type I

It is well known that the Padé approximants $(P,Q)$ of an analytic function in the neighborhood of $0$ can be expressed as a quotient of Hankel determinants built on the coefficients of the function $...
joaopa's user avatar
  • 3,739
1 vote
0 answers
85 views

How is the quasipotential in Freidlin-Wentzell theory of large deviations affected by $C^1$ transformations?

I have a 3D differential equation I'm interested in studying the potential landscape using quasipotentials, described in depth in this paper. I need to calculate the potential landscape several times, ...
Rono's user avatar
  • 73
0 votes
0 answers
108 views

Degeneracies in linear combination of tensor product of Pauli matrices

Let $P_i \in \{I,X,Y,Z\}^{\otimes n} $, that is $P_i = \bigotimes_{i =1 }^n \sigma_i$ with $\sigma_i \in \{I,X,Y,Z\}$, where $$ I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \hspace{1cm} X =...
KAJ226's user avatar
  • 131
1 vote
0 answers
62 views

Newton-Raphson and bisection for solving for a system of nonlinear equations?

We know that for a single equation root-finding, we can use the Newton's method, or a combination of Newton with bisection to guarantee convergence. Can we use Newton+bisection for a system of ...
Jen's user avatar
  • 11
1 vote
1 answer
210 views

Solving (or approximating) a certain delay differential equation

I'm interested in finding the (unique?) solution to the set of delay differential equations $$f_w(w,x) = xf(w,w^2x)+w^3x^2f(w,w^4x), $$ $$f_x(w,x) = wf(w,w^2x)$$ With the initial condition $f(1,x) = e^...
Caleb Briggs's user avatar
  • 1,662
6 votes
1 answer
626 views

How can I efficiently find the "simplest" rational in an interval?

For a hobby software project I am working with exact rational arithmetic, as it happens this produces numbers $\frac{n}{k}$ of huge size even after reducing them, I am searching for an efficient ...
afiori's user avatar
  • 163
1 vote
0 answers
55 views

Flux that can be represented by low and high resolution schemes

In the wiki page of Flux limiter, it writes: If these edge fluxes can be represented by low and high resolution schemes, then a flux limiter can switch between these schemes depending upon the ...
Ho-Oh's user avatar
  • 111
0 votes
0 answers
394 views

Convex maximization over the boundary of a convex set

Let $f: \mathbb{R}^n \rightarrow \mathbb{R}$ be the objective function that is strictly convex. We would to like maximize $f$ over a convex compact set $S \subseteq \mathbb{R}^n$. Assume that $f$ has ...
Mathews Boban's user avatar
2 votes
0 answers
86 views

Derivation of the Cahn-Hilliard PDE from the point of view of finite difference methods

Consider the Cahn-Hilliard equation $$\frac{\partial c}{\partial t} = \nabla^2(f(c)-\varepsilon^2 \nabla^2 c)$$ defined on your favorite domain. I'm looking for a literature reference that formally ...
ithmath's user avatar
  • 53
1 vote
0 answers
200 views

Function uniquely determined by its values at integer arguments

A smooth enough, slow growing real-valued function $f(x)$, is uniquely determined by its values at integer arguments. I don't remember the name of the theorem and the conditions for this to be true. ...
Vincent Granville's user avatar
14 votes
3 answers
1k views

Accelerating convergence for some double sums

I am interested in the following general double sums, for integers $a\geq 1$ and $b\geq 2$, $$Z(a,b) = \sum_{k,\ell \geq 0} \frac{2k+3}{\binom{k+2}{2}^a} \frac{2\ell+3}{(\binom{k+2}{2}+\binom{\ell+2}{...
F. C.'s user avatar
  • 3,507
2 votes
0 answers
251 views

A general question about spectral methods vs finite element methods

According to this Wikipedia article: Spectral methods can be computationally less expensive and easier to implement than finite element methods; they shine best when high accuracy is sought in simple ...
UserA's user avatar
  • 597
0 votes
1 answer
161 views

A simple procedure to simulate multifractional Brownian motion paths

In a paper by Peltier and Vehel the multifractional Brownian motion (mBm) was defined for the first time, and they also give a procedure to simulate mBm sample paths. Briefly, mBm generalizes the ...
sound wave's user avatar
0 votes
1 answer
106 views

FEM based solution to parabolic problem

Consider the problem $$ \begin{cases} u_t - \Delta u = 0 &\text{ on } \Omega\times (0,T)\\u=0 &\text{ on } \partial \Omega\times (0,T) \\ u(x,0)=g(x) &\text{ on } \Omega \end{cases} $$ ...
Lilla's user avatar
  • 225
1 vote
0 answers
43 views

Is there a more efficient computer algebra system to solve the system of nonlinear equations in N-R method or other numerical methods?

Consider the system of infinite series \begin{align} &F=x+\frac{y^{3^2}}{3}+\frac{x^{3^5}}{3^2}+\frac{y^{3^7}}{3^3}+\frac{x^{3^{10}}}{3^4}+\frac{y^{3^{12}}}{3^5}+\cdots=0 \\ &G=y+\frac{x^{3^3}}...
MAS's user avatar
  • 870
3 votes
0 answers
105 views

Tight bounds on the iterates of the Clenshaw algorithm for Chebyshev polynomials

I'm trying to bound the iterates of the Clenshaw algorithm when applied to the Chebyshev series, related to a question I'm running into related to the stability of this algorithm. Recall that, for $p(...
Ewin's user avatar
  • 101
1 vote
0 answers
184 views

Complexity of singular value decomposition using matrix multiplication oracles

Suppose I have an $n\times m$ real matrix $A$, $n\ll m$ with full row rank $(\mathrm{rank}(A) = n)$. I have an oracle that can compute $Ax$ or $A^T y$ for any $x\in \mathbb{R}^m, y\in \mathbb{R}^n$. ...
AspiringMat's user avatar
0 votes
1 answer
234 views

Correct way to conduct equilibrium scaling of linear/integer/MIP program

I would like to scale my linear/integer program and also mixed-integer program using the equilibrium scaling method. I have worked on two research papers and one research book. However, they did the ...
asdf's user avatar
  • 21
7 votes
1 answer
185 views

Reporting inconclusive experimental searches

In many areas of mathematics it is informative to conduct numerical experiments. But, it not uncommon that the searches do not lead to the examples or data one was hoping for. Since the numerical ...
Thomas Sauvaget's user avatar
0 votes
0 answers
82 views

3D interpolation function

I've got a 3D figure created using around 30k points and has different regions colored in an specific way according to some unrelated variables that come from a project I'm creating. Taking in ...
Vako Galvan's user avatar
1 vote
0 answers
133 views

Generating Hermite polynomial with coefficient recurrance relation algorithm

I am writing a math paper for my numerical analysis class about orthogonal Hermite polynomials. I want to implement the algorithm for generating the "probabilist's Hermite polynomials": $$ \...
russloewe's user avatar
1 vote
0 answers
130 views

p-adic taylor polynomial [closed]

This might be an easy question but i am sorry for asking this. Let $f(x)\in\mathbb{Z}_p[x].$ Is it always true that $$f(x+y)=f(x)+f'(x)y+f''(x)\frac{y^2}{2}+zy^3$$ for some $z\in\mathbb{Z}_p.$ if it ...
user avatar
2 votes
0 answers
72 views

Iterative method of finding root

I don't know much about numerical analysis. I need the following for help with my research in number theory. Is there a simple(not multistep) iterative method of finding the root of a real-valued ...
user avatar
7 votes
3 answers
907 views

How to numerically compute $x \ln x$ and related functions near $0$?

I was recently trying to find a numerical solution to a thermodynamics problem and the expression $x\ln x$ appeared in one of the computations. I did not have to find its value very near $0$, so the ...
FusRoDah's user avatar
  • 3,680
2 votes
1 answer
96 views

Maximizing a skew-symmetric 4D cross product

How do I find two orthonormal 4D vectors, $(x_0,x_1,x_2,x_3)$ and $(y_0,y_1,y_2,y_3)$, which maximize this function: $-19x_1y_0 - 33x_2y_0 + 11x_3y_0 + 19x_0y_1 - 21x_2y_1 - 33x_3y_1 + 33x_0y_2 + ...
bobuhito's user avatar
  • 1,537
4 votes
1 answer
623 views

Singular value decomposition of truncated discrete Fourier transform matrix

Let $\mathbf{F}$ be a discrete Fourier transform (DFT) matrix such that \begin{align} F_{m,n}=e^{-j2\pi(m-1)(n-1)/N},\quad m,n=1,\ldots,N. \end{align} What we can say about the singular value ...
Math_Y's user avatar
  • 311
4 votes
0 answers
108 views

How can I numerically solve the Laplace equation with cohomological data?

Consider the problem of solving for $u$ where $-\Delta u = f$, $[u] = [g]$ where $[\cdot]$ denotes cohomology class and $u, f, g$ are $p$-forms on a Riemannian manifold $M$. If $g$ instead was ...
Aidan Backus's user avatar
5 votes
3 answers
418 views

closest equidistant point to N points in M dimensions

Is there a formula/algorithm/etc. to find the closest equidistant point (assuming it exists) to a set of points, allowing that the number of dimensions of the space is independent of the number of ...
Erik's user avatar
  • 425
3 votes
1 answer
276 views

Polynomial and rational approximation of continuous functions in $\mathbb{C}$

I am wondering what the state of the art is for polynomial and rational approximations to continuous/holomorphic functions in $\mathbb{C}$. The particular domains of interest are the closed unit ball $...
zjs's user avatar
  • 465
1 vote
0 answers
69 views

Fitting a model

I have a function expressed as the ratio of two exponential series with certain parameters $$\frac{\sum\limits_{j=1}^{i-1} \frac{e^{-ar_jt}}{\prod_{l=1\\l \ne j}^{i-1} (b^j-b^l)}}{\sum\limits_{j=1}^{i}...
Ahmed Khan's user avatar
2 votes
0 answers
116 views

Harmonic function over a square with linear Neumann boundary conditions

For a rectangle with height 1 and length 2, here is the unique numerical solution (showing contours of the equipotential from 0, defined by the bottom, to 0.54, the numerically-calculated maximum) to ...
bobuhito's user avatar
  • 1,537
0 votes
1 answer
137 views

Are root finding algorithms stable for bounded polynomials? [closed]

Suppose that we have a bounded polynomial defined on $[0,1]$. I think because it is just polynomial, root finding algorithms would easily and without any instability find all its roots. Am I right? ...
bitWise's user avatar
  • 113
1 vote
0 answers
71 views

Error estimates for orthogonal polynomial approximation

tl;dr: Are there explicit bounds for the approximation error by orthogonal polynomials? There are various ways to formulate this question more precisely, so want I emphasize up front that this is a ...
user13322's user avatar

1 2
3
4 5
25