Pardiso test example fail

I am trying to debug my implementation of PARDISO, but unfortunately I cannot get even a simple example to work.

I created a 6x6 matrix with 16 non-zero elements and used the mkl ddnscsr routine to obtain my acsr, ia, and ja vectors to feed into the PARDISO routine. Whenever i plug things into the function call nothing happens; my code just stops running after the call to PARDISO.

Here is my code:

double *tempB;

QR decomposition for transposed matrices

Hi,

There is a simple Z*beta=Y overdetermined linear system with respect to beta and I want to solve it with MKL/QR decomposition. I read manual and found two similar approaches to achieve the goal:

Progress bar for FEAST eigensolver

Does anyone know if it is possible to determine the progress of an eigenvalue analysis using the Feast solver?

I use it to calculate the natural frequencies of buildings and bridges and, for medium size structures, getting 40 eigenvalues is sometimes taking 15 or 20 minutes with absolutely no indication of how far through the solution it is. It is really disconcerting having to wait that long with no feedback at all.

I would like to be able to display a progress bar or, failing that, just show which iteration it is working on.

VML for safe evaluation of function

Hello,

I plan to use VML to evalaute the following functions:

y = x / (exp(x) - 1)   and dy/dx =  1/(exp(x)-1)  - x exp(x)/(exp(x)-1)^2

I have to make sure that, i do not get NAN or Infinity at x =0 or x << 1

Any suggestions on how to write the subroutine.

for y i use, expm1 and code works fine i.e, limit x->0 y = 1

using expm1 in dy/dx i am getting, infinity for small x  say 1D-20.

Thanks

Reddy

MKL sequential parallel option and FFT

Hi, I got an question.

What is different between sequential and parallel options in mkl ?

When I try to use FFT, two different options bring me two different answers. ( The input and output are different size in FFT)

Thanks.

MKL on Visual Studio 2012 with V110_XP toolset

Visual Studio 2012 did not compile for Windows XP until the service pack 1 was released. It introduced v110_xp toolset. Using this toolset you can compile for Windows XP win VS2012.

Subroutine to solve system of equation with the accuracy better than double precision

I'm currently using the GESV subroutine from MKL library  to solve the system of equations (A.x=B). The number I used is Double Precision.

I see the results are accurate up to 11 digits after the decimal point. Now I would like to have the accuracy is up to 16 digits but I can't find the solution yet.

Anyone suggests a solution for that would be highly appreciated.

Thanks a heap!

sparse equation system

Hi!

In the below code, I have declared one matrix and one vector: A[3][3] and B[3]. The  matrix A is symmetric from main diagonal. I converted the matrix A from dense format to CSR format, and from CSR format to coordinate format using the function mkl_dcsrcoo. All conversions are ok, but I can not solve correctly the system AxY=B. I obtained a wrong solution. The correct solution is: Y=[0.5 0.5 0.5]

How can I obtain the correct solution?

The code is following:

A minimal test program:

#include "mkl_lapacke.h"

int main(int argc, char** argv)
{
float a = 0.5f;
LAPACKE_slasrt('I', 1, &a);

return 0;
}

I used the "Library Link Line Advisor" to get the linker command line, but it still fails:

FFT Failure Within SideFX Houdini

Hi guys,

This is a long shot but I'm hoping you can help, as I'm totally out of ideas and don't know where to go with this. I'm trying to run a plugin inside SideFX's Houdini that uses MKL's FFT. I had absolutely no problems with this with Houdini 12.5, but in Houdini 13 the calls are failing.
My test case is to run this code (have taken out status-checking for brevity):