Computational mathematics involves mathematical research in areas of science where computing plays a central and essential role, emphasizing algorithms, numerical methods, and symbolic methods.

learn more… | top users | synonyms

2
votes
1answer
13 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
40 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
0
votes
1answer
474 views

Fast methods to check linearity of differentials? Generalizing linearity?

The L1 Mat-1.1010 -course here has taught me the linearity conditions $f(a x)=a f(x)$ and $f(a+b)=f(a)+f(b)$. I want to generalize it, some quite irrelevant slow investigation here. It requires time ...
-2
votes
1answer
23 views

Finding missing dates and variance [closed]

I have the list of dates and sold items on that date. 12/22/2013 15 12/23/2013 14 12/24/2013 16 12/25/2013 98 12/27/2013 17 12/28/2013 01 12/29/2013 15 How do I ...
0
votes
1answer
15 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
12 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 ...
5
votes
2answers
115 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 ...
1
vote
0answers
43 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 ...
2
votes
1answer
96 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
19 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 ...
9
votes
1answer
262 views

Krylov-like method for solving systems of polynomials?

To iteratively solve large linear systems, many current state-of-the-art methods work by finding approximate solutions in successively larger (Krylov) subspaces. Are there similar iterative methods ...
0
votes
0answers
14 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 ...
2
votes
1answer
107 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 ...
0
votes
1answer
22 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) = ...
1
vote
1answer
56 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 ...
0
votes
0answers
39 views

need help in simplification

I need help in simplification below are the two formulas for AGP series: if $n$ is even $a\cdot r^{(n-1)/2} + d\cdot( 1 + r + r^2 + r^{(n-1)/2})$ if $n$ is odd $a\cdot r^{(n-1)/2} + d\cdot( 1 + ...
1
vote
1answer
65 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 ...
5
votes
1answer
306 views

cylinder-ray intersections equation

Can You Pleas Help with this one I found an article http://www.mrl.nyu.edu/~dzorin/rendering/lectures/lecture3/lecture3.pdf for Infinite cylinder-ray intersections And I don't know how they develop ...
1
vote
1answer
55 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
0answers
20 views

Guass integration(quadrature)

Assume that the formula $$I(f)=\sum_{i=0}^6A_if(x_i)$$ approximating $\int_{-1}^{1}f(x)dx$ is exact for all polynomial of degree at most 6 and the distinct nodes $x_i$ (i=0,1...,6) are symmetrically ...
1
vote
0answers
87 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 ...
1
vote
2answers
82 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
0answers
9 views

Algorithm to randomly distribute a fixed no. of points on a line such that density graph tends to a certain function?

Lets say I have 10 points. And I have 40 empty places. I want to randomly place those ten points in those places such that when I plot the avg. density of points vs. position, I should get a graph ...
0
votes
1answer
68 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
66 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 ...
2
votes
1answer
217 views

Given two sets of vectors, how do I find a change of basis that will convert one set to another?

Given two sets of dimension $n$ vectors $\lbrace v_1 , v_2 , \ldots , v_m \rbrace$, $\lbrace u_1, u_2, \ldots , u_m \rbrace$, where $m > n$, is there a computational method (in particular, using ...
0
votes
0answers
26 views

Computationally efficient approximations of the jacobian determinant

Is there an compuationally efficient way to compute an approximation of the determinant of a large matrix (thousands of rows)? Some kind of expansion maybe? More specifically, I am interested in the ...
0
votes
1answer
35 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 ...
3
votes
0answers
20 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 ...
-1
votes
1answer
60 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 ...
13
votes
1answer
1k views

Quadratic sieve algorithm

I am stuck with the sieving stage of Quadratic Sieve algorithm. I've read lots of papers to this point but I can't find any guidlines how to choose sieving interval or how sieving is actually done ...
0
votes
1answer
35 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} ...
10
votes
1answer
459 views

Why are there mathematicians that do not use computers?

I was watching a video on Andrew Wiles and his proof of Fermat's Last Theorem and I quite liked the video, especially the complexity of the proof only to prove a simple concept which can be understood ...
5
votes
2answers
786 views

Fast Matlab Code for hypergeometric function $_2F_1$

I am looking for a good numerical algorithm to evaluate the hypergeometric function $_2F_1$ in Matlab (hypergeom in Matlab is very slow). I looked across the ...
2
votes
1answer
80 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
78 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
83 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
42 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
22 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
29 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
77 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
46 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
26 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$ ...
0
votes
2answers
21 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}
3
votes
8answers
4k views

Fastest Square Root Algorithm

What is the fastest algorithm for finding the square root of a number? I created one that can find the square root of "987654321" to 16 decimal places in just 20 iterations (I'm not ready to release ...
-2
votes
1answer
84 views

If P = NP, how would this allow us to cure diseases? [closed]

I have read a number articles on what the real-world ramifications would be if P = NP. One of these ramifications that is often repeated is that we 'could cure all sorts of diseases'. How or why ...
1
vote
1answer
194 views

Minimum number of iterations in Newton's method to find a square root

I am writing an algorithm that evaluates the square root of a positive real number $y$. To do this I am using the Newton-Raphton method to approximate the roots to $f(x)=x^2-y$. The $n^{th}$ iteration ...
0
votes
1answer
41 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?
6
votes
1answer
50 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 ...