Fazlollah Soleymani
Reputation
415
Top tag
Next privilege 500 Rep.
Access review queues
3 12
Impact
~10k people reached

 Aug29 comment How to deal with matrices involved in system of SDEs? It is now done. Can anyone give even some general hints or codes for dealing with system of SDEs? Aug28 comment How to deal with matrices involved in system of SDEs? Nov19 comment Why doesn't FullSimplify work properly on this? Note that $1+R+R^2+R^3+R^4+R^5+R^6$ requires 5 multiplications to be implemented, while $1+(R+R^4)(1+R+R^2)$ requires only 3! That is why a more factorized form is desirable. Sep6 comment Faster Eigenvalues with lower precision goal Can anyone extend this answer for the unsolved question at: mathematica.stackexchange.com/questions/29688/… Sep1 comment How can you compute Itō Integrals with Mathematica? Well done. Can you implement the Euler-Maruyama or SRK method for finding the weak solution of Black-Scholes SDE in Mathematica? Aug21 comment Is there any fast way to solve a quadratic matrix equation in Mathematica approximately? The applied norm is optional (Frobenius or Infinity). Just finding some approximate valaues for the scalars in any fast way is needed. Aug2 comment How to use adaptive precision in matrix computations? Can you write it down, please? Does it reduce the whole computational time? Aug2 comment How to use adaptive precision in matrix computations? Thanks for your comment. I do agree. However, I think some built-in functions of MMA already do such an action. An example is the function FindRoot[], which applies the precision of the input data (function and the initial guess) and then improve it per cycle. Also, applying the adaptive precision in matrix calculations (such as the above concrete question/idea) is very good in high precision computing environment. It should reduce the computational time dramatically for large scale problems. Apr26 comment How to use Compile for accelerating matrix multiplications? Please write a code solution based on your tip. I am not familiar with your suggestion. Apr26 comment How to use Compile for accelerating matrix multiplications? So, if you think there is any other way to speed up the process, I am happy to be informed. Furthermore, I cannot use CUDADot in my MMA. It fails to be fully downloaded and installed after 30 minutes. Any tips to accelerate the process is fully appreciated. Apr25 comment How to find the index of a square matrix in Mathematica quickly? Dear J.M., I must compute the index for both types of matrices. Specially for inexact matrices. It would also be nice if an algorithm could produce $k$, $A^k$ and $A^{k+1}$ at the end of its run for all types of matrices. Apr25 comment How to find the index of a square matrix in Mathematica quickly? Thanks. I meant if for example the rank is 2, then I need $A^2$ and $A^3$, i.e. the last two matrices in process of computations not the first two matrices. Apr25 comment How to find the index of a square matrix in Mathematica quickly? Excellent idea. Can you check that why your technique cannot produce the result for a simple matrix in floating points arithmetic as follows: $n=100; a = RandomReal[{}, {n, n}]$. I faced with some errors such as "Transpose::nmtx: "The first two levels of the one-dimensional list {} cannot be transposed."". Apr25 comment How to find the index of a square matrix in Mathematica quickly? Mr. Wizard, can you revise your code in order to give $A^k$ and $A^{k+1}$ as well. I mean I also need the last two matrices $A^{k+1}$ and $A^{k}$! Although $k$ is obvious but I do not want to compute them again because it might be time-consuming for large matrices! Can you give me a hand in this? Apr25 comment How to find the index of a square matrix in Mathematica quickly? Thanks Mr. Wizard. It works good. Any improvement on the code will be appreciated. Apr24 comment How to find the index of a square matrix in Mathematica quickly? I think the code is not working well, Mr. Wizard is right down here. For a random matrix, it sould give 0 while produces 5 as the $Ind(A)$. Apr24 comment How to find the index of a square matrix in Mathematica quickly? You are totally right Mr. Wizard, the codes sounds to be incorrect. For the 500*500 example of you, the answer must be $Ind(A)=0$. Because $A^0$ and $A^1$ agrees in terms of rank. So is there any bug here? Apr24 comment How to find the index of a square matrix in Mathematica quickly? Yes, your answer always gives 2 as the output by varying $n$, while the output of Szabolcs's code is correct and is what I want. Your technique to accelerate the process is nice, but currently not working. Apr24 comment How to find the index of a square matrix in Mathematica quickly? I think Mr. Wizard answer needs some revision. I mean the answers are not the same. For instance, check the following sample examples: Clear["Global`*"] SeedRandom[1234]; n = 500; A = RandomReal[{}, {n, n}]; Length@NestWhileList[A.# &, A, MatrixRank[#] == MatrixRank[#2] &, 2] // AbsoluteTiming Length@NestWhileList[{A.#[[1]], MatrixRank@#[[1]]} &, {A, -1}, #[[2]] == #2[[2]] &, 2] // AbsoluteTiming Apr6 comment How to draw Fractal images of iteration functions on the Riemann sphere? Thanks. An excellent answer. Just one note. There might be some diverging points (black areas) in the fractal picture for some test problems. On the other hand, we used a color correspond to a point in a sphere or a rectangular domain. So, the domain of working (I mean the mesh of points) are finite. So is it possible to count the number of diverging points? I mean it would be nice to have the percentage of diverging points for each fractal picture. Is it possible to cunt the number of diverging points in your implementation?