Skip to main content

All Questions

1 vote
0 answers
83 views

Fundamental Axiom of Floating Point Arithmetic for Complex Numbers Multiplication

I am trying to prove the fundamental axiom of floating point arithmetic also applies to complex number multiplication. First, let $fl$ be a function that maps a number to its closest floating point ...
Gu Bochao's user avatar
0 votes
0 answers
53 views

What is the computational complexity of calculating determinants for matrices of finite precision floating-point numbers?

Following up from this older question, I understand that calculation of determinants for integer-valued matrices is possible with polynomial scaling. However, I have been unable to locate any ...
KarimAED's user avatar
1 vote
0 answers
506 views

Number of FLOPs for the inner and outer vector product?

I'm trying to educate myself on the relative cost of the cross and dot products relative to the number of floating point operations (FLOPs) each one requires. My understanding based on this paper (see ...
mrVentures's user avatar
2 votes
1 answer
506 views

Computer science FLOPs question (complexity): We have $100$ vectors, each with $10^5$ elements.

Our numerical analysis textbook has this problem: How many bytes does it take to store $100$ vectors of length $10^5$? How many flops does it take to form a linear combination of them (with $100$ ...
Aleksandr Hovhannisyan's user avatar
1 vote
0 answers
38 views

What does the floating point arithmetic contribute to the rounding error in Mathematica?

I am a theoretical mathematician who works on the iterative method to find some generalized inverse of my interest. When I have tried some numerical example in Mathematica $11.0$, this does not ...
David's user avatar
  • 4,241
0 votes
1 answer
53 views

Obtaining Coefficients of Powers of polynomial (e.g., $P(x)^N$) for large N, becomes Numerically Unstable

Obtaining Coefficients of Powers of polynomial (e.g., $P(x)^N$) for large N, becomes Numerically Unstable I have a polynomial $P(x)$ where $-1\leq P(x) \leq 1$ for $-1 \leq x \leq 1$ and $-1\leq {\it ...
M.A's user avatar
  • 31
0 votes
2 answers
93 views

Counting Iterations

How many multiplications are performed when the following code fragment is executed? Express your answers in terms of $n$, where $n \geq 10$. ...
Xian's user avatar
  • 89
1 vote
2 answers
964 views

How to calculate the inverse of sum of a Kronecker product and a diagonal matrix

I want to calculate the inverse of a matrix of the form $S = (A\otimes B+C)$, where $A$ and $B$ are symetric and invertible, $C$ is a diagonal matrix with positive elements. Basically if the ...
Eridk Poliruyt's user avatar
4 votes
0 answers
62 views

How quickly can one compare exp(m/n) to a given rational?

For positive integers $\hspace{.06 in}m_{\hspace{.02 in}0}\hspace{.02 in},n_0\hspace{.02 in},m_1,n_1\:$, $\;$ how difficult is it to decide whether $$\exp\left(\hspace{-0.03 in}\frac{m_{\hspace{.02 in}...
user avatar