This tag concerns computational problems central to mathematical and scientific computating. The scope includes algorithms, numerical analysis, optimization, and linear algebra, computational topology, computational geometry, symbolic methods, and inverse problems.

learn more… | top users | synonyms

1
vote
0answers
23 views

Transformation between Ideal and Warped Surface

I work on manufacturing metal panels with holes drilled in them. Suppose I have an ideal 3D surface from CAD. I want to compare it to the actual part using reference points to compare between the two. ...
8
votes
4answers
839 views

What is the most efficient way to calculate the sine of a rational number?

I'm happy that we can use some trig identities like $$\sin\left(\frac{\theta}{2}\right) \equiv \pm \sqrt{\frac{1-\cos(\theta)}{2}}$$ and $$\sin(\alpha \pm\beta) \equiv \sin(\alpha) \cos(\beta)\pm ...
0
votes
0answers
95 views

Implementing formula correctly in matlab for neuroscience: total soma membrane potential?

Please help me to understand: am I correctly implementing a total soma membrane potential (TSMP) equation in Matlab? Due to being a new member I need to use this list link to refer to the links ...
1
vote
1answer
69 views

Isomorphism between two magmas with one.

Do we have a method to find one (or all) isomorphism between two given magmas with one using GAP? Edit If we have Loop or Latin square (with one) instead of Magma then do we have the method?
0
votes
4answers
68 views

Min and Max of $ f(x,y)=\frac{x-y}{a-x-y}$

I'd like to find max and min of $$ f(x,y)=\frac{x-y}{a-x-y}$$ where $0\le x<y\le a/2$. Any one can suggest? Thank you
3
votes
1answer
115 views

How to numerically solve the eigenvalues of the laplacian in a triangular domain with Dirichlet boundary condition?

Consider an arbitrary triangle. Now impose the Dirichlet boundary condition. How to solve the eigenvalues and eigenvectors of the Laplacian $-\nabla^2 = - \frac{\partial^2}{\partial x^2} - ...
4
votes
1answer
73 views

GAP code to get Multiplication Table.

I have a finite set $S=\{0,1,2,\ldots,n-1\}$ and binary operation $\star$ on $S$ defined by $$x\star y= \left\{ \begin{array}{l l l} \frac{3(x+y)}{2} ~~\text{modulo} ~~n& \qquad \mbox{if $x$ ...
0
votes
1answer
71 views

what is the coefficient of following expression

what is the co-efficient of $x^{50}$ in the expansion of $$\frac{1}{(1-x^{1.7})(1-x^{1.8})(1-x^{2.6})(1-x^{3.0})(1-x^{4.0})(1-x^{6.7})(1-x^{7.5})(1-x^{8.2})}$$ can you please explain me the logic
18
votes
4answers
341 views

How could I improve this approximation?

In a computer application, I need to solve trillions of times an equation which can be reduced to $$f(x)=\sin(x)-a x=0$$ Newton methods (quadratic and higher orders) are used for the solution. ...
0
votes
1answer
27 views

What is and what are the use for an “ AINV preconditioner ” or “ SAINV ”?

In an article that I'm reading there is a mention to this "thing" and I absolutely don't know anything about it, for me it could be anything. I noticed that this thing is somehow related to the math ...
0
votes
1answer
37 views

Converting x number of petaFLOPS into a base 2 number

I would like a few different formulas or methods for doing a couple of conversions and calculations: 1) How can I convert petaFLOPS into a base $2$ number representing how many operations per second ...
1
vote
0answers
59 views

Time needed to algebraically solve system of $15$ nonlinear equations with parameters

How long can I expect it will take to algebraically solve a system of $15$ nonlinear equations (without any numbers, only parameters), if I feed it into a computing software? I'm asking for symbolic ...
6
votes
2answers
160 views

How was the $3x+1$ problem checked up to $5 \times 2^{60}$?

The Wikipedia article for the Collatz conjecture states that: The conjecture has been checked by computer for all starting values up to $5 \times 2^{60} \approx 5.764 \times 10^{18}$. It gives ...
4
votes
2answers
334 views

The J programming language: is it useful for mathematics?

I just stumbled upon the J programming language, which has the description: J is particularly strong in the mathematical, statistical, and logical analysis of data. It is a powerful tool in ...
0
votes
1answer
41 views

Numerical evaluation of a complex integral

I have to evaluate numerically $f(z)$ via the Cauchy representation (so via a complex integral), in other words, I have to calculare $f(z)$ performing a complex integral: $\dfrac{1}{2\pi ...
0
votes
0answers
16 views

solving numerically ODE

Consider solving numerically a well-posed initial value problem $$y'=f(t,y),a\leq x\leq b,\\ y(a)=\alpha, $$ using Taylor's method of order n, with step sizes h and $\frac{h}{2}$,respectively, where ...
0
votes
1answer
39 views

Change of variables in function $T(n)$.

I've been given this recurrence to solve: $T(n) = T(\sqrt n) + \theta(lglgn)$ And I'm told that the way to solve it is to let $m = lgn$, so that the recurrence can be rewritten as follows: $S(m) = ...
3
votes
1answer
166 views

Changing streams in PhD

I've a masters degree from a reputed Indian university in pure mathematics, with a specialization in Algebraic Number Theory. However, I'd like to apply for a PhD in computational math/theoretical ...
1
vote
1answer
67 views

minimize distance

consider a two dimensional system. two points are given whose co-ordinates are $(h1,h2)$ and $(k1,k2)$. I want to minimize the distance between these two points with the condition that person has to ...
1
vote
1answer
68 views

another counting problem

There are $k$ warriors that participate in the Wars, which have happened for the past $n$ years. Each year there has been a victor. Further, a particular warrior $W$ has won the Wars an even number of ...
1
vote
1answer
66 views

A problem on GCD

I want to calculate $f(n)$ where $f(n)$ is given by $$f(n) = \sum_{i=1}^n \dfrac{n}{gcd(n,i)}$$ and $2\leq n\leq 10^{12}$. Can someone tell me the fastest algorithm to calculate this. thanks
0
votes
1answer
64 views

Deleting subsets in the list of sets

If we have a list like $[[2,1],[5,2,1],[6,5,2,1],[9,10]]$ and I want to find the result in the form of $[[6,5,2,1], [9,10]]$ and want to delete all those list that are contained in another. How may I ...
1
vote
2answers
105 views

How can I solve this problem without having to do it by hand?

I'm dealing with the following problem in computational programming. I'm trying to find a way to build an algorithm that can quickly resolve the following problem statement without forcing me to do it ...
0
votes
1answer
75 views

How can I solve this problem without doing it by hand? [duplicate]

I'm dealing with the following problem in computational programming. I'm trying to find a way to build an algorithm that can quickly resolve the following problem statement without forcing me to do it ...
1
vote
2answers
92 views

Is there any way to solve this problem without having to do it by hand? [duplicate]

I'm dealing with the following problem in computational programming. I'm trying to find a way to build an algorithm that can quickly resolve the following problem statement. Is there any way to group ...
3
votes
0answers
25 views

Has there been work on computational group theory applications to computing colimits of crosses n-cubes of groups?

I'm trying to compute homotopy groups of a few spaces using crossed n-cubes of groups. I'm able to describe a few colimits in terms of quotients of induced crossed modules and nonabelian tensor ...
3
votes
0answers
292 views

Nerve Theorem: Is the finite union of closed convex sets triangulable?

My Question: Let $A_1, \ldots, A_k \subseteq \mathbb{R}^n$ be closed convex sets. Is the union $\bigcup_{i=1}^k A_i$ triangulable$^1$? If so, why? Background: I'm trying to better understand the ...
0
votes
1answer
123 views

Is there any algorithm (if possible, I need the codes) for Jordan normal form decomposition for large matrices in practice?

Although it is an ill-posed problem as B Kågström said in "An algorithm for numerical computation of the Jordan normal form of a complex matrix", I wonder what people do when they need to do Jordan ...
0
votes
1answer
36 views

Eliminate $p$ from these 2 equations.

$$ X \ = \ 2 \left[ \dfrac {h_1pv_1} {(1-p^2v_1^2)^{1/2}} + \dfrac {h_2pv_2} {(1-p^2v_2^2)^{1/2}} \right] \\ T_2 \ = \ 2 \left[ \dfrac {h_1/v_1} {(1-p^2v_1^2)^{1/2}} + \dfrac {h_2/v_2} ...
2
votes
1answer
101 views

Going through all Bit Strings with no 11 in it (no consecutive 1s)

My question is very simple: How can i (efficiently) go through all Bitstrings which don't contain two consecutive 1s? So for instance, all Bitstrings of length 3 with no consecutive 1s are: 000, 001, ...
1
vote
3answers
107 views

For how many consecutive numbers Collatz conjecture was checked?

I heard here that Collatz conjecture was checked at least for every first $5 \cdot 10^{18}$ natural numbers, but I cannot find any source or actual information about this. Can anyone help to find out ...
1
vote
2answers
147 views

Questions about the field scientific computing

I have heard about the field of Applied and Computational Mathematics, Scientific Computing and want to get some information. Is this a combination of computer science and mathematics? What subjects ...
1
vote
2answers
57 views

How to compute the sine of a complex number in floating-point arithmetic?

What is the most efficient way to numerically compute the sine of a complex number? Suppose I want to calculate the sine of a complex number a + bi on a computer. Suppose that a and b are both ...
1
vote
1answer
34 views

Approximating zeros on an interval

I'm writing a program for my AP Calculus class, and I'm trying to write an equation solver that approximates the zeros of functions. Right now it can take symbolic derivatives and evaluate functions. ...
1
vote
0answers
79 views

QR decomposition: Same results for Classical Gram-Schmidt and Modified Gram-Schmidt

I am implementing QR decomposition (in Fortran) for a complex-valued matrix, using Classical Gram-Schmidt and Modified Gram-Schmidt (and Householder). I was expecting that the Classical Gram-Schmidt ...
1
vote
1answer
121 views

Rational approximation of $\tanh\,(\sqrt[4]{s}$)

I'd like to find a rational representation of $$f(s) = \frac{\tanh\,\sqrt[4]{s}}{\sqrt[4]{s}}= \frac{a_0 + a_1 s + a_2 s^2 + ... + a_n s^n}{b_0 + b_1 s + b_2 s^2 + ... + b_m s^m} $$ For the case ...
0
votes
1answer
54 views

Practical differences between a PRNG and a Markov chains

In computer programming you can easily find people describing both a PRNG, like a Mersenne Twister, and a Markov / Stochastic process as "pseudo random generators". I honestly never liked this ...
0
votes
0answers
28 views

Numerical calculation of an $x$ for which $\pi(x) > li(x)$

Littlewood 1914 proved that there are an infinite number of $x$ for which $\pi(x) > li(x)$. Skewes 1933 provided the first numerical upper bound on $x$ ...
-1
votes
1answer
82 views

Fermat Last theorem on Poly-Euler numbers

The poly-Euler numbers, denoted as $E_{n}^{(k)}$, are defined by the following generating functions :$${2\operatorname{Li}_k(1-e^{-x}) \over 1+e^{-x}}=\sum_{n=0}^\infty E_n^{(k)}{x^n\over n!}$$ The ...
0
votes
2answers
26 views

Design a DFA with following condition.

A DFA that accepts a language in which every odd position of a string is a 1 with inputs as {0,1}
1
vote
1answer
76 views
0
votes
1answer
42 views

How is the status of a bigger number known while the smaller not?

In this wolfram mathworld article in the table below the status of $2059$ is known before the some smaller numbers, or they choose to aim the computation for that specific number?
7
votes
1answer
465 views

Why is Householder computationally more stable than modified Gram-Schmidt?

I'm having trouble nailing down why using Householder transformations yields a more stable/accurate result than the modified Gram-Schmidt method when computing the QR decomposition of a matrix. Can ...
0
votes
2answers
37 views

How can I find $x$ such that $ax \equiv 1 \pmod{bx+c}$, given $a,b,c$?

Everything I've read about modular arithmetic generally concerns doing things in some "mod m" world where "m" is some constant. But I'm perplexed how to tackle modular arithmetic problems where the ...
1
vote
0answers
760 views

Change MATLAB code from Lax-Wendroff to Leapfrog

I want to see how leapfrog would look using this code, but I'm having issues implementing it. I think my biggest problem is adding in the $ U_j^{n-1}$ term, I just don't get the logic. Here's what ...
1
vote
1answer
34 views

Pumping lemma contradiction

I have to prove that the language $A_{1}= \{\alpha \in \Sigma^{*}|c^{a}(\alpha)>c^{b}(\alpha) \}$ where $\Sigma=\{a,b\}$, where $c^{a}(a)$ means the number of $a$ in $\alpha$, and $c^{b}(\alpha)$ ...
2
votes
2answers
87 views

Very slow convergence of a particular series?

I've read that $$ \sum_{k=2}^{\infty} \frac{1}{k (\log k)^2} = 2.1097\ldots $$ However when I compute the partial sums it looks like a lot of terms are needed to even get the first decimals right. My ...
1
vote
1answer
40 views

Computational complexity of expanding a MacLaurin/Taylor Series

What methods exist to computationally determine the first $k$ coefficients of a function (possibly polynomial or rational polynomial function)? How do Mathematica/MatLab/Maple/etc. solve this ...
2
votes
2answers
112 views

summation of ceil and floor function

I need a closed solution or a faster algorithm for calculating $$ \sum_{k=1}^{n-1} \left\lceil \frac{n}{k}-1 \right\rceil $$ and $$ \sum_{k=1}^{n-1} \left\lfloor \frac{n}{k} \right\rfloor $$ where $ ...
0
votes
2answers
403 views

Google Code Jam's Cookie Clicker Program…

Today, the Google Code Jam's cookie clicker problem was something like this. Problem In this problem, you start with 0 cookies. You gain cookies at a rate of 2 cookies per second, by ...