<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500986#M34745</link>
    <description>&lt;P&gt;To be consistent when you link against libmkl_intel_ilp64.a, you should have chosen preprocessor definitions/compiler options to make the integer variables in your MKL calls to be treated as 64 bit integers.&lt;/P&gt;&lt;P&gt;Alternatively, let the integer arguments be the default 32-bit integer type, and use libmkl_intel_lp64.a when linking.&lt;/P&gt;</description>
    <pubDate>Sat, 01 Jul 2023 15:49:12 GMT</pubDate>
    <dc:creator>mecej4</dc:creator>
    <dc:date>2023-07-01T15:49:12Z</dc:date>
    <item>
      <title>ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500958#M34742</link>
      <description>&lt;P&gt;My CMakeLists.text:&lt;/P&gt;&lt;DIV&gt;&lt;SPAN&gt;cmake_minimum_required&lt;/SPAN&gt;(&lt;SPAN&gt;VERSION &lt;/SPAN&gt;3.17)&lt;BR /&gt;&lt;SPAN&gt;project&lt;/SPAN&gt;(test)&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;set&lt;/SPAN&gt;(CMAKE_CXX_STANDARD 14)&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;FIND_PACKAGE&lt;/SPAN&gt;( OpenMP &lt;SPAN&gt;REQUIRED&lt;/SPAN&gt;)&lt;BR /&gt;&lt;SPAN&gt;if&lt;/SPAN&gt;(OPENMP_FOUND)&lt;BR /&gt;&lt;SPAN&gt;message&lt;/SPAN&gt;("OPENMP FOUND")&lt;BR /&gt;&lt;SPAN&gt;set&lt;/SPAN&gt;(CMAKE_C_FLAGS "&lt;SPAN&gt;${&lt;/SPAN&gt;CMAKE_C_FLAGS&lt;SPAN&gt;} ${&lt;/SPAN&gt;OpenMP_C_FLAGS&lt;SPAN&gt;}&lt;/SPAN&gt;")&lt;BR /&gt;&lt;SPAN&gt;set&lt;/SPAN&gt;(CMAKE_CXX_FLAGS "&lt;SPAN&gt;${&lt;/SPAN&gt;CMAKE_CXX_FLAGS&lt;SPAN&gt;} ${&lt;/SPAN&gt;OpenMP_CXX_FLAGS&lt;SPAN&gt;}&lt;/SPAN&gt;")&lt;BR /&gt;&lt;SPAN&gt;endif&lt;/SPAN&gt;()&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;#set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -O0")&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -O0")&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#set(CMAKE_BUILD_TYPE "Release" )&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;include_directories&lt;/SPAN&gt;( "/usr/include/eigen3" )&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;include_directories&lt;/SPAN&gt;(/opt/intel/oneapi/mkl/2023.1.0/include)&lt;BR /&gt;&lt;SPAN&gt;link_directories&lt;/SPAN&gt;(/opt/intel/oneapi/mkl/2023.1.0/lib/intel64)&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;include_directories&lt;/SPAN&gt;(/opt/intel/oneapi/compiler/2023.1.0/linux/include)&lt;BR /&gt;&lt;SPAN&gt;link_directories&lt;/SPAN&gt;(/opt/intel/oneapi/compiler/2023.1.0/linux/lib/intel64)&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;include_directories&lt;/SPAN&gt;(/home/chenkaihuang/sycl_workspace/llvm/build/install/include)&lt;BR /&gt;&lt;SPAN&gt;link_directories&lt;/SPAN&gt;(/home/chenkaihuang/sycl_workspace/llvm/build/install/lib)&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;add_executable&lt;/SPAN&gt;(test pardiso_sym.c)&lt;BR /&gt;&lt;BR /&gt;&lt;SPAN&gt;target_link_libraries&lt;/SPAN&gt;(test -Wl,--start-group /opt/intel/oneapi/mkl/2023.1.0/lib/intel64/libmkl_intel_ilp64.a /opt/intel/oneapi/mkl/2023.1.0/lib/intel64/libmkl_gnu_thread.a /opt/intel/oneapi/mkl/2023.1.0/lib/intel64/libmkl_core.a -Wl,--end-group -lgomp -lpthread -lm -ldl)&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;DIV&gt;-----------------------------------------------------&lt;/DIV&gt;&lt;/DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;My pardiso_sym.c:&lt;/DIV&gt;&lt;DIV&gt;&lt;DIV&gt;&lt;SPAN&gt;/*******************************************************************************&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* Copyright 2004-2022 Intel Corporation.&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;*&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* This software and the related documents are Intel copyrighted materials, and&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* your use of them is governed by the express license under which they were&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* provided to you (License). Unless the License provides otherwise, you may not&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* use, modify, copy, publish, distribute, disclose or transmit this software or&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* the related documents without Intel's prior written permission.&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;*&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* This software and the related documents are provided as is, with no express&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* or implied warranties, other than those that are expressly stated in the&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* License.&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;*******************************************************************************/&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/*&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;* Content : Intel(R) oneAPI Math Kernel Library (oneMKL) PARDISO C example&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;*&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;********************************************************************************&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;*/&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Example program to show the use of the "PARDISO" routine */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* on symmetric linear systems */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* This program can be downloaded from the following site: */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* &lt;A href="http://www.pardiso-project.org" target="_blank"&gt;www.pardiso-project.org&lt;/A&gt; */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* (C) Olaf Schenk, Department of Computer Science, */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* University of Basel, Switzerland. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Email: olaf.schenk@unibas.ch */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#include &lt;/SPAN&gt;&lt;SPAN&gt;&amp;lt;stdio.h&amp;gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#include &lt;/SPAN&gt;&lt;SPAN&gt;&amp;lt;stdlib.h&amp;gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#include &lt;/SPAN&gt;&lt;SPAN&gt;&amp;lt;math.h&amp;gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#include &lt;/SPAN&gt;&lt;SPAN&gt;"mkl_pardiso.h"&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#include &lt;/SPAN&gt;&lt;SPAN&gt;"mkl_types.h"&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;// Define the format to printf MKL_INT values&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#if &lt;/SPAN&gt;!defined(&lt;SPAN&gt;MKL_ILP64&lt;/SPAN&gt;)&lt;BR /&gt;&lt;SPAN&gt;#define &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT &lt;/SPAN&gt;&lt;SPAN&gt;"%i"&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#else&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#define IFORMAT "%lli"&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;#endif&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;int &lt;/SPAN&gt;&lt;SPAN&gt;main &lt;/SPAN&gt;(&lt;SPAN&gt;void&lt;/SPAN&gt;)&lt;BR /&gt;{&lt;BR /&gt;&lt;SPAN&gt;/* Matrix data. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;n = &lt;SPAN&gt;8&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;ia[&lt;SPAN&gt;9&lt;/SPAN&gt;] = { &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;5&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;8&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;10&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;12&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;15&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;17&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;18&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;19&lt;/SPAN&gt;}&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;ja[&lt;SPAN&gt;18&lt;/SPAN&gt;] =&lt;BR /&gt;{ &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;3&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;6&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;7&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;2&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;3&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;5&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;3&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;8&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;4&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;7&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;5&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;6&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;7&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;6&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;8&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;7&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;8&lt;BR /&gt;&lt;/SPAN&gt;}&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;double &lt;/SPAN&gt;a[&lt;SPAN&gt;18&lt;/SPAN&gt;] =&lt;BR /&gt;{ &lt;SPAN&gt;7.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;1.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;2.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;7.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;-&lt;SPAN&gt;4.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;8.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;2.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;1.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;5.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;7.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;9.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;5.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;1.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;5.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;-&lt;SPAN&gt;1.0&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;&lt;SPAN&gt;5.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;11.0&lt;/SPAN&gt;&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;5.0&lt;BR /&gt;&lt;/SPAN&gt;}&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;mtype = -&lt;SPAN&gt;2&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Real symmetric matrix */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* RHS and solution vectors. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;double &lt;/SPAN&gt;b[&lt;SPAN&gt;8&lt;/SPAN&gt;]&lt;SPAN&gt;, &lt;/SPAN&gt;x[&lt;SPAN&gt;8&lt;/SPAN&gt;]&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;nrhs = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Number of right hand sides. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Internal solver memory pointer pt, */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* 32-bit: int pt[64]; 64-bit: long int pt[64] */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* or void *pt[64] should be OK on both architectures */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;void &lt;/SPAN&gt;*pt[&lt;SPAN&gt;64&lt;/SPAN&gt;]&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Pardiso control parameters. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;iparm[&lt;SPAN&gt;64&lt;/SPAN&gt;]&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;maxfct&lt;SPAN&gt;, &lt;/SPAN&gt;mnum&lt;SPAN&gt;, &lt;/SPAN&gt;phase&lt;SPAN&gt;, &lt;/SPAN&gt;error&lt;SPAN&gt;, &lt;/SPAN&gt;msglvl&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Auxiliary variables. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;i&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;double &lt;/SPAN&gt;ddum&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Double dummy */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;MKL_INT &lt;/SPAN&gt;idum&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Integer dummy. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Setup Pardiso control parameters. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;for &lt;/SPAN&gt;( i = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i &amp;lt; &lt;SPAN&gt;64&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i++ )&lt;BR /&gt;{&lt;BR /&gt;iparm[i] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;iparm[&lt;SPAN&gt;0&lt;/SPAN&gt;] = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* No solver default */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;1&lt;/SPAN&gt;] = &lt;SPAN&gt;2&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Fill-in reordering from METIS */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;3&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* No iterative-direct algorithm */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;4&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* No user fill-in reducing permutation */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;5&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Write solution into x */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;6&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;7&lt;/SPAN&gt;] = &lt;SPAN&gt;2&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Max numbers of iterative refinement steps */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;8&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;9&lt;/SPAN&gt;] = &lt;SPAN&gt;13&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Perturb the pivot elements with 1E-13 */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;10&lt;/SPAN&gt;] = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Use nonsymmetric permutation and scaling MPS */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;11&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;12&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Maximum weighted matching algorithm is switched-off (default for symmetric). Try iparm[12] = 1 in case of inappropriate accuracy */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;13&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Output: Number of perturbed pivots */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;14&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;15&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;16&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Not in use */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;17&lt;/SPAN&gt;] = -&lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Output: Number of nonzeros in the factor LU */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;18&lt;/SPAN&gt;] = -&lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Output: Mflops for LU factorization */&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;19&lt;/SPAN&gt;] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Output: Numbers of CG Iterations */&lt;BR /&gt;&lt;/SPAN&gt;maxfct = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Maximum number of numerical factorizations. */&lt;BR /&gt;&lt;/SPAN&gt;mnum = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Which factorization to use. */&lt;BR /&gt;&lt;/SPAN&gt;msglvl = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Print statistical information in file */&lt;BR /&gt;&lt;/SPAN&gt;error = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Initialize error flag */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Initialize the internal solver memory pointer. This is only */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* necessary for the FIRST call of the PARDISO solver. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;for &lt;/SPAN&gt;( i = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i &amp;lt; &lt;SPAN&gt;64&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i++ )&lt;BR /&gt;{&lt;BR /&gt;pt[i] = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Reordering and Symbolic Factorization. This step also allocates */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* all memory that is necessary for the factorization. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;phase = &lt;SPAN&gt;11&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;PARDISO (pt&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;maxfct&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mnum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mtype&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;phase&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&amp;amp;n&lt;SPAN&gt;, &lt;/SPAN&gt;a&lt;SPAN&gt;, &lt;/SPAN&gt;ia&lt;SPAN&gt;, &lt;/SPAN&gt;ja&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;idum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;nrhs&lt;SPAN&gt;, &lt;/SPAN&gt;iparm&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;msglvl&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;if &lt;/SPAN&gt;( error != &lt;SPAN&gt;0 &lt;/SPAN&gt;)&lt;BR /&gt;{&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;ERROR during symbolic factorization: " &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;exit (&lt;SPAN&gt;1&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;Reordering completed ... "&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;Number of nonzeros in factors = " &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;iparm[&lt;SPAN&gt;17&lt;/SPAN&gt;])&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;Number of factorization MFLOPS = " &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;iparm[&lt;SPAN&gt;18&lt;/SPAN&gt;])&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Numerical factorization. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;phase = &lt;SPAN&gt;22&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;PARDISO (pt&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;maxfct&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mnum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mtype&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;phase&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&amp;amp;n&lt;SPAN&gt;, &lt;/SPAN&gt;a&lt;SPAN&gt;, &lt;/SPAN&gt;ia&lt;SPAN&gt;, &lt;/SPAN&gt;ja&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;idum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;nrhs&lt;SPAN&gt;, &lt;/SPAN&gt;iparm&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;msglvl&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;if &lt;/SPAN&gt;( error != &lt;SPAN&gt;0 &lt;/SPAN&gt;)&lt;BR /&gt;{&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;ERROR during numerical factorization: " &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;exit (&lt;SPAN&gt;2&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;Factorization completed ... "&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Back substitution and iterative refinement. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;phase = &lt;SPAN&gt;33&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;iparm[&lt;SPAN&gt;7&lt;/SPAN&gt;] = &lt;SPAN&gt;2&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Max numbers of iterative refinement steps. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* Set right hand side to one. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;for &lt;/SPAN&gt;( i = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i &amp;lt; n&lt;SPAN&gt;; &lt;/SPAN&gt;i++ )&lt;BR /&gt;{&lt;BR /&gt;b[i] = &lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;PARDISO (pt&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;maxfct&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mnum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mtype&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;phase&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&amp;amp;n&lt;SPAN&gt;, &lt;/SPAN&gt;a&lt;SPAN&gt;, &lt;/SPAN&gt;ia&lt;SPAN&gt;, &lt;/SPAN&gt;ja&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;idum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;nrhs&lt;SPAN&gt;, &lt;/SPAN&gt;iparm&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;msglvl&lt;SPAN&gt;, &lt;/SPAN&gt;b&lt;SPAN&gt;, &lt;/SPAN&gt;x&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;if &lt;/SPAN&gt;( error != &lt;SPAN&gt;0 &lt;/SPAN&gt;)&lt;BR /&gt;{&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;ERROR during solution: " &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;exit (&lt;SPAN&gt;3&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;Solve completed ... "&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;The solution of the system is: "&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;for &lt;/SPAN&gt;( i = &lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;i &amp;lt; n&lt;SPAN&gt;; &lt;/SPAN&gt;i++ )&lt;BR /&gt;{&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt; x [" &lt;/SPAN&gt;&lt;SPAN&gt;IFORMAT &lt;/SPAN&gt;&lt;SPAN&gt;"] = % f"&lt;/SPAN&gt;&lt;SPAN&gt;, &lt;/SPAN&gt;i&lt;SPAN&gt;, &lt;/SPAN&gt;x[i])&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;BR /&gt;printf (&lt;SPAN&gt;"&lt;/SPAN&gt;&lt;SPAN&gt;\n&lt;/SPAN&gt;&lt;SPAN&gt;"&lt;/SPAN&gt;)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* .. Termination and release of memory. */&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;/* -------------------------------------------------------------------- */&lt;BR /&gt;&lt;/SPAN&gt;phase = -&lt;SPAN&gt;1&lt;/SPAN&gt;&lt;SPAN&gt;; &lt;/SPAN&gt;&lt;SPAN&gt;/* Release internal memory. */&lt;BR /&gt;&lt;/SPAN&gt;PARDISO (pt&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;maxfct&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mnum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;mtype&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;phase&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;&amp;amp;n&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;ia&lt;SPAN&gt;, &lt;/SPAN&gt;ja&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;idum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;nrhs&lt;SPAN&gt;,&lt;BR /&gt;&lt;/SPAN&gt;iparm&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;msglvl&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;ddum&lt;SPAN&gt;, &lt;/SPAN&gt;&amp;amp;error)&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;&lt;SPAN&gt;return &lt;/SPAN&gt;&lt;SPAN&gt;0&lt;/SPAN&gt;&lt;SPAN&gt;;&lt;BR /&gt;&lt;/SPAN&gt;}&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;RESULT:&amp;nbsp;&lt;/DIV&gt;&lt;DIV&gt;&lt;P&gt;/home/chenkaihuang/programming/test_mkl/cmake-build-debug/test&lt;/P&gt;&lt;P&gt;ERROR during symbolic factorization: -1&lt;BR /&gt;Process finished with exit code 1&lt;/P&gt;&lt;/DIV&gt;&lt;/DIV&gt;</description>
      <pubDate>Sat, 01 Jul 2023 09:21:54 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500958#M34742</guid>
      <dc:creator>kaihuang</dc:creator>
      <dc:date>2023-07-01T09:21:54Z</dc:date>
    </item>
    <item>
      <title>Re: ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500986#M34745</link>
      <description>&lt;P&gt;To be consistent when you link against libmkl_intel_ilp64.a, you should have chosen preprocessor definitions/compiler options to make the integer variables in your MKL calls to be treated as 64 bit integers.&lt;/P&gt;&lt;P&gt;Alternatively, let the integer arguments be the default 32-bit integer type, and use libmkl_intel_lp64.a when linking.&lt;/P&gt;</description>
      <pubDate>Sat, 01 Jul 2023 15:49:12 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500986#M34745</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2023-07-01T15:49:12Z</dc:date>
    </item>
    <item>
      <title>Re: ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500987#M34746</link>
      <description>Thanks for the reply. Can I understand like I should set the integer to be 64bit under current linking. I'm not sure I understand you totally due to the word "libmkl_intel_lp64.a" in your last sentence. Guess it should be 32bit library? Thank you.</description>
      <pubDate>Sat, 01 Jul 2023 16:04:34 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500987#M34746</guid>
      <dc:creator>kaihuang</dc:creator>
      <dc:date>2023-07-01T16:04:34Z</dc:date>
    </item>
    <item>
      <title>Re: ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500989#M34747</link>
      <description>&lt;P&gt;In the context of choosing between the LP64 and ILP64 versions of MKL, the issue is whether integer arguments to MKL routines are 4-byte or 8-byte &lt;STRONG&gt;integers&lt;/STRONG&gt;. In contrast, when we use phrases such as "32-bit library", we are distinguishing between 32-bit addresses and 64-bit &lt;STRONG&gt;addresses&lt;/STRONG&gt;. Please read &lt;A href="https://www.intel.com/content/www/us/en/docs/onemkl/developer-guide-linux/2023-0/using-the-ilp64-interface-vs-lp64-interface.html" target="_self"&gt;this article&lt;/A&gt; for more details.&lt;/P&gt;</description>
      <pubDate>Sat, 01 Jul 2023 16:17:29 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1500989#M34747</guid>
      <dc:creator>mecej4</dc:creator>
      <dc:date>2023-07-01T16:17:29Z</dc:date>
    </item>
    <item>
      <title>Re:ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1503506#M34794</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Has the information provided earlier helped you? &lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Could you please let us know if you have any other queries? &lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Thanks &amp;amp; Regards,&lt;/P&gt;&lt;P&gt;Varsha&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Tue, 11 Jul 2023 08:44:02 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1503506#M34794</guid>
      <dc:creator>VarshaS_Intel</dc:creator>
      <dc:date>2023-07-11T08:44:02Z</dc:date>
    </item>
    <item>
      <title>Re:ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506189#M34830</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;We have not heard back from you. Could you please provide us with an update on your issue?&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Thanks &amp;amp; Regards,&lt;/P&gt;&lt;P&gt;Varsha&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Wed, 19 Jul 2023 10:48:22 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506189#M34830</guid>
      <dc:creator>VarshaS_Intel</dc:creator>
      <dc:date>2023-07-19T10:48:22Z</dc:date>
    </item>
    <item>
      <title>Re: Re:ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506210#M34835</link>
      <description>Solved by the first answer.</description>
      <pubDate>Wed, 19 Jul 2023 11:57:59 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506210#M34835</guid>
      <dc:creator>kaihuang</dc:creator>
      <dc:date>2023-07-19T11:57:59Z</dc:date>
    </item>
    <item>
      <title>Re:ERROR during symbolic factorization: -1. Even in runing the example code like pardiso_sym.c</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506484#M34840</link>
      <description>&lt;P&gt;Hi,&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;&lt;EM&gt;&amp;gt;&amp;gt;Solved by the first answer.&lt;/EM&gt;&lt;/P&gt;&lt;P&gt;It’s great to know that the issue has been resolved, in case you run into any other issues please feel free to create a new thread.&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Have a Good Day!&lt;/P&gt;&lt;P&gt;&lt;BR /&gt;&lt;/P&gt;&lt;P&gt;Thanks &amp;amp; Regards,&lt;/P&gt;&lt;P&gt;Varsha&lt;/P&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 20 Jul 2023 08:04:46 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/ERROR-during-symbolic-factorization-1-Even-in-runing-the-example/m-p/1506484#M34840</guid>
      <dc:creator>VarshaS_Intel</dc:creator>
      <dc:date>2023-07-20T08:04:46Z</dc:date>
    </item>
  </channel>
</rss>

