Tagged Questions

23 views

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 ...
38 views

Rate of Decay of the sum of two Exponentials.

I have this data set: ...
174 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 ...
76 views

Bisection Method Question, Multiple Roots

I understand how to do the bisection method and how to do it with a point of intersection. My question is should this not actually have multiple points of intersection? and if you're not given any ...
62 views

Computational Maths

I'm trying to revise for a test and these 2 questions I just don't really understand what I'm meant to do, any pointers would be good. Any help I'd be very grateful for.
87 views

Computation Method to solving Homogeneous Fredholm Integral Equation of Second Kind with Symmetric Kernel

I am attempting to write a program that will be able to numerically solve a homogeneous Fredholm Integral Equation of Second Kind, with a Symmetric Kernel. I have been looking through textbooks and ...
135 views

Computing a large exp(x) in a numerically robust way.

I'm trying to compute $\lfloor e^x \rfloor$, where x is a 64-bit integer. The problem is that the result of the computation may be close to 2^64. In this range, 64-bit floating point numbers will be ...
55 views

Discretize an ellipsoid given its semi-major axes and orientation

An ellipsoid centered at the origin can be defined by the solutions to $$\mathbf{x}^\text{T} A \mathbf{x} = 1$$ where $A$ is symmetric and positive-definite. The eigenvectors of $A$ define the ...
50 views

logarithm and exponent computation performance

Using glibc on a x86 processor, which takes more CPU time? $a\ log\ b$ or $b^a$? For which values of $a$ is one faster than the other? Optional: Does the base used matter? See also: What algorithm ...
223 views

FFT for power of 3

Classic FFT works fine, when n is power of 2. How to generalize FFT procedure when n is power of 3? Is it possible to easily ...
34 views

196 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 ...
128 views

475 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 ...
202 views

Computational efficiency of Machin-like formulae

From what I have read, it appears that the most efficient methods of calculating $\pi$ are Machin-like formulae. And it is known that certain formulas are more efficient than others. Are there any ...
96 views

Minimizing the norm related with iteration method

I am working on a iteration method to compute the generalized inverse of a matrix $A$ of rank $r$ Iteration method is $X_{k+1} = X_{k} + \beta X_{k} (I - A X_{k})$ where notations are as follows ...
68 views

Need little hint to prove a theorem from a paper

I have an iterative method \begin{eqnarray} X_{k+1}=(1+\beta)X_k-\beta X_k A X_k~~~~~~~~~~~~~~~~~ k = 0,1,\ldots \end{eqnarray} with initial approximation $X_0 = \beta A^*$ ($\beta$ is scalar ...
178 views

How a direct method can be compared with an iterative method?

How a direct method can be compared with an iterative method? I have an iterative method to compute Moore- penrose generalized inverse. There are some direct methods available to compute Moore-Penrose ...
2k views

Rapid approximation of $\tanh(x)$

This is kind of a signal processing/programming/mathematics crossover question. At the moment it seems more math-related to me, but if the moderators feel it belongs elsewhere please feel free to ...
140 views

What's the best way to detect an algebraic number?

Suppose you calculate the first few (dozen, hundred) digits of a number which you believe to be a rational number. You can calculate the continued fraction for the number and truncate after a large ...
95 views

calculating multivariable integrals

I having a look at how to calculate using PC a multivariable integrals. I am reading about the Quasi Montecarlo methods using the following (t, m, s)-Nets and (t, s)-Sequences Faure sequences My ...
1k views

How does Knuth's algorithm for calculating logarithm work?

I had a look at Knuth's The Art of Computer Programming, book 1. In chapter 1, section 1.2.2, exercise 25, he presents the following algorithm for calculating logarithm: given $x\in[1,2)$, do the ...
7k views

What algorithm is used by computers to calculate logarithms?

I would like to know how are logarithms calculated by computers. The GNU C library, for example, uses a call to the fyl2x() assembler instruction, which means that ...
400 views

Accelerating Convergence of a Sequence

Suppose I had a monotonically increasing sequence $\{d_{n}\}$ which is also bounded above. The $d_{n}$'s satisfy a given recurrence, however computationally they tend very slowly to the limit. What ...
If $K$ is a number field, whose Galois closure over the rationals has degree 24 or so, and whose discriminant is around $163^4$, then what is a numerically efficient way of computing the first few ...