zunglq_2.c
Go to the documentation of this file.
00001 /*****************************************************************************
00002   Copyright (c) 2010, Intel Corp.
00003   All rights reserved.
00004 
00005   Redistribution and use in source and binary forms, with or without
00006   modification, are permitted provided that the following conditions are met:
00007 
00008     * Redistributions of source code must retain the above copyright notice,
00009       this list of conditions and the following disclaimer.
00010     * Redistributions in binary form must reproduce the above copyright
00011       notice, this list of conditions and the following disclaimer in the
00012       documentation and/or other materials provided with the distribution.
00013     * Neither the name of Intel Corporation nor the names of its contributors
00014       may be used to endorse or promote products derived from this software
00015       without specific prior written permission.
00016 
00017   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00018   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00019   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00020   ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
00021   LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00022   CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
00023   SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
00024   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
00025   CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
00026   ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
00027   THE POSSIBILITY OF SUCH DAMAGE.
00028 *****************************************************************************/
00029 /*  Contents: test routine for C interface to LAPACK
00030 *   Author: Intel Corporation
00031 *   Created in March, 2010
00032 *
00033 * Purpose
00034 *
00035 * zunglq_2 is the test program for the C interface to LAPACK
00036 * routine zunglq
00037 * The program doesn't require an input, the input data is hardcoded in the
00038 * test program.
00039 * The program tests the C interface in the four combinations:
00040 *   1) column-major layout, middle-level interface
00041 *   2) column-major layout, high-level interface
00042 *   3) row-major layout, middle-level interface
00043 *   4) row-major layout, high-level interface
00044 * The output of the C interface function is compared to those obtained from
00045 * the corresponiding LAPACK routine with the same input data, and the
00046 * comparison diagnostics is then printed on the standard output having PASSED
00047 * keyword if the test is passed, and FAILED keyword if the test isn't passed.
00048 *****************************************************************************/
00049 #include <stdio.h>
00050 #include "lapacke.h"
00051 #include "lapacke_utils.h"
00052 #include "test_utils.h"
00053 
00054 static void init_scalars_zunglq( lapack_int *m, lapack_int *n, lapack_int *k,
00055                                  lapack_int *lda, lapack_int *lwork );
00056 static void init_a( lapack_int size, lapack_complex_double *a );
00057 static void init_tau( lapack_int size, lapack_complex_double *tau );
00058 static void init_work( lapack_int size, lapack_complex_double *work );
00059 static int compare_zunglq( lapack_complex_double *a, lapack_complex_double *a_i,
00060                            lapack_int info, lapack_int info_i, lapack_int lda,
00061                            lapack_int n );
00062 
00063 int main(void)
00064 {
00065     /* Local scalars */
00066     lapack_int m, m_i;
00067     lapack_int n, n_i;
00068     lapack_int k, k_i;
00069     lapack_int lda, lda_i;
00070     lapack_int lda_r;
00071     lapack_int lwork, lwork_i;
00072     lapack_int info, info_i;
00073     lapack_int i;
00074     int failed;
00075 
00076     /* Local arrays */
00077     lapack_complex_double *a = NULL, *a_i = NULL;
00078     lapack_complex_double *tau = NULL, *tau_i = NULL;
00079     lapack_complex_double *work = NULL, *work_i = NULL;
00080     lapack_complex_double *a_save = NULL;
00081     lapack_complex_double *a_r = NULL;
00082 
00083     /* Iniitialize the scalar parameters */
00084     init_scalars_zunglq( &m, &n, &k, &lda, &lwork );
00085     lda_r = n+2;
00086     m_i = m;
00087     n_i = n;
00088     k_i = k;
00089     lda_i = lda;
00090     lwork_i = lwork;
00091 
00092     /* Allocate memory for the LAPACK routine arrays */
00093     a = (lapack_complex_double *)
00094         LAPACKE_malloc( lda*n * sizeof(lapack_complex_double) );
00095     tau = (lapack_complex_double *)
00096         LAPACKE_malloc( k * sizeof(lapack_complex_double) );
00097     work = (lapack_complex_double *)
00098         LAPACKE_malloc( lwork * sizeof(lapack_complex_double) );
00099 
00100     /* Allocate memory for the C interface function arrays */
00101     a_i = (lapack_complex_double *)
00102         LAPACKE_malloc( lda*n * sizeof(lapack_complex_double) );
00103     tau_i = (lapack_complex_double *)
00104         LAPACKE_malloc( k * sizeof(lapack_complex_double) );
00105     work_i = (lapack_complex_double *)
00106         LAPACKE_malloc( lwork * sizeof(lapack_complex_double) );
00107 
00108     /* Allocate memory for the backup arrays */
00109     a_save = (lapack_complex_double *)
00110         LAPACKE_malloc( lda*n * sizeof(lapack_complex_double) );
00111 
00112     /* Allocate memory for the row-major arrays */
00113     a_r = (lapack_complex_double *)
00114         LAPACKE_malloc( m*(n+2) * sizeof(lapack_complex_double) );
00115 
00116     /* Initialize input arrays */
00117     init_a( lda*n, a );
00118     init_tau( k, tau );
00119     init_work( lwork, work );
00120 
00121     /* Backup the ouptut arrays */
00122     for( i = 0; i < lda*n; i++ ) {
00123         a_save[i] = a[i];
00124     }
00125 
00126     /* Call the LAPACK routine */
00127     zunglq_( &m, &n, &k, a, &lda, tau, work, &lwork, &info );
00128 
00129     /* Initialize input data, call the column-major middle-level
00130      * interface to LAPACK routine and check the results */
00131     for( i = 0; i < lda*n; i++ ) {
00132         a_i[i] = a_save[i];
00133     }
00134     for( i = 0; i < k; i++ ) {
00135         tau_i[i] = tau[i];
00136     }
00137     for( i = 0; i < lwork; i++ ) {
00138         work_i[i] = work[i];
00139     }
00140     info_i = LAPACKE_zunglq_work( LAPACK_COL_MAJOR, m_i, n_i, k_i, a_i, lda_i,
00141                                   tau_i, work_i, lwork_i );
00142 
00143     failed = compare_zunglq( a, a_i, info, info_i, lda, n );
00144     if( failed == 0 ) {
00145         printf( "PASSED: column-major middle-level interface to zunglq\n" );
00146     } else {
00147         printf( "FAILED: column-major middle-level interface to zunglq\n" );
00148     }
00149 
00150     /* Initialize input data, call the column-major high-level
00151      * interface to LAPACK routine and check the results */
00152     for( i = 0; i < lda*n; i++ ) {
00153         a_i[i] = a_save[i];
00154     }
00155     for( i = 0; i < k; i++ ) {
00156         tau_i[i] = tau[i];
00157     }
00158     for( i = 0; i < lwork; i++ ) {
00159         work_i[i] = work[i];
00160     }
00161     info_i = LAPACKE_zunglq( LAPACK_COL_MAJOR, m_i, n_i, k_i, a_i, lda_i,
00162                              tau_i );
00163 
00164     failed = compare_zunglq( a, a_i, info, info_i, lda, n );
00165     if( failed == 0 ) {
00166         printf( "PASSED: column-major high-level interface to zunglq\n" );
00167     } else {
00168         printf( "FAILED: column-major high-level interface to zunglq\n" );
00169     }
00170 
00171     /* Initialize input data, call the row-major middle-level
00172      * interface to LAPACK routine and check the results */
00173     for( i = 0; i < lda*n; i++ ) {
00174         a_i[i] = a_save[i];
00175     }
00176     for( i = 0; i < k; i++ ) {
00177         tau_i[i] = tau[i];
00178     }
00179     for( i = 0; i < lwork; i++ ) {
00180         work_i[i] = work[i];
00181     }
00182 
00183     LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_i, lda, a_r, n+2 );
00184     info_i = LAPACKE_zunglq_work( LAPACK_ROW_MAJOR, m_i, n_i, k_i, a_r, lda_r,
00185                                   tau_i, work_i, lwork_i );
00186 
00187     LAPACKE_zge_trans( LAPACK_ROW_MAJOR, m, n, a_r, n+2, a_i, lda );
00188 
00189     failed = compare_zunglq( a, a_i, info, info_i, lda, n );
00190     if( failed == 0 ) {
00191         printf( "PASSED: row-major middle-level interface to zunglq\n" );
00192     } else {
00193         printf( "FAILED: row-major middle-level interface to zunglq\n" );
00194     }
00195 
00196     /* Initialize input data, call the row-major high-level
00197      * interface to LAPACK routine and check the results */
00198     for( i = 0; i < lda*n; i++ ) {
00199         a_i[i] = a_save[i];
00200     }
00201     for( i = 0; i < k; i++ ) {
00202         tau_i[i] = tau[i];
00203     }
00204     for( i = 0; i < lwork; i++ ) {
00205         work_i[i] = work[i];
00206     }
00207 
00208     /* Init row_major arrays */
00209     LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_i, lda, a_r, n+2 );
00210     info_i = LAPACKE_zunglq( LAPACK_ROW_MAJOR, m_i, n_i, k_i, a_r, lda_r,
00211                              tau_i );
00212 
00213     LAPACKE_zge_trans( LAPACK_ROW_MAJOR, m, n, a_r, n+2, a_i, lda );
00214 
00215     failed = compare_zunglq( a, a_i, info, info_i, lda, n );
00216     if( failed == 0 ) {
00217         printf( "PASSED: row-major high-level interface to zunglq\n" );
00218     } else {
00219         printf( "FAILED: row-major high-level interface to zunglq\n" );
00220     }
00221 
00222     /* Release memory */
00223     if( a != NULL ) {
00224         LAPACKE_free( a );
00225     }
00226     if( a_i != NULL ) {
00227         LAPACKE_free( a_i );
00228     }
00229     if( a_r != NULL ) {
00230         LAPACKE_free( a_r );
00231     }
00232     if( a_save != NULL ) {
00233         LAPACKE_free( a_save );
00234     }
00235     if( tau != NULL ) {
00236         LAPACKE_free( tau );
00237     }
00238     if( tau_i != NULL ) {
00239         LAPACKE_free( tau_i );
00240     }
00241     if( work != NULL ) {
00242         LAPACKE_free( work );
00243     }
00244     if( work_i != NULL ) {
00245         LAPACKE_free( work_i );
00246     }
00247 
00248     return 0;
00249 }
00250 
00251 /* Auxiliary function: zunglq scalar parameters initialization */
00252 static void init_scalars_zunglq( lapack_int *m, lapack_int *n, lapack_int *k,
00253                                  lapack_int *lda, lapack_int *lwork )
00254 {
00255     *m = 4;
00256     *n = 4;
00257     *k = 3;
00258     *lda = 8;
00259     *lwork = 1024;
00260 
00261     return;
00262 }
00263 
00264 /* Auxiliary functions: zunglq array parameters initialization */
00265 static void init_a( lapack_int size, lapack_complex_double *a ) {
00266     lapack_int i;
00267     for( i = 0; i < size; i++ ) {
00268         a[i] = lapack_make_complex_double( 0.0, 0.0 );
00269     }
00270     a[0] = lapack_make_complex_double( -2.22551117723546850e+000,
00271                                        0.00000000000000000e+000 );
00272     a[8] = lapack_make_complex_double( 2.43844259461276080e-001,
00273                                        -3.08206993291480160e-001 );
00274     a[16] = lapack_make_complex_double( -2.74136498519149120e-001,
00275                                         -2.30966496866882000e-001 );
00276     a[24] = lapack_make_complex_double( 5.80770951470128920e-001,
00277                                         3.46866360216428750e-001 );
00278     a[1] = lapack_make_complex_double( 0.00000000000000000e+000,
00279                                        0.00000000000000000e+000 );
00280     a[9] = lapack_make_complex_double( 1.68810098934606920e+000,
00281                                        0.00000000000000000e+000 );
00282     a[17] = lapack_make_complex_double( -1.93641525844946090e-001,
00283                                         5.42951785523693940e-001 );
00284     a[25] = lapack_make_complex_double( 2.78908485124207680e-001,
00285                                         -2.20317579745833100e-001 );
00286     a[2] = lapack_make_complex_double( 0.00000000000000000e+000,
00287                                        0.00000000000000000e+000 );
00288     a[10] = lapack_make_complex_double( -2.80478799113691670e-001,
00289                                         -4.12446107471391210e-001 );
00290     a[18] = lapack_make_complex_double( -1.59025825045931810e+000,
00291                                         0.00000000000000000e+000 );
00292     a[26] = lapack_make_complex_double( -1.26766851611322510e-001,
00293                                         1.10984520235717200e-001 );
00294     a[3] = lapack_make_complex_double( 0.00000000000000000e+000,
00295                                        0.00000000000000000e+000 );
00296     a[11] = lapack_make_complex_double( 2.10347237263873110e-001,
00297                                         -4.46076099427661470e-001 );
00298     a[19] = lapack_make_complex_double( -5.70841942484137550e-001,
00299                                         6.43744629522165630e-002 );
00300     a[27] = lapack_make_complex_double( -2.00218286620699090e+000,
00301                                         0.00000000000000000e+000 );
00302 }
00303 static void init_tau( lapack_int size, lapack_complex_double *tau ) {
00304     lapack_int i;
00305     for( i = 0; i < size; i++ ) {
00306         tau[i] = lapack_make_complex_double( 0.0, 0.0 );
00307     }
00308     tau[0] = lapack_make_complex_double( 1.12581379184436000e+000,
00309                                          1.61760589514177240e-001 );
00310     tau[1] = lapack_make_complex_double( 1.09905366916895430e+000,
00311                                          5.46859059846678370e-001 );
00312     tau[2] = lapack_make_complex_double( 1.13292565731157910e+000,
00313                                          -9.59054047896148680e-001 );
00314 }
00315 static void init_work( lapack_int size, lapack_complex_double *work ) {
00316     lapack_int i;
00317     for( i = 0; i < size; i++ ) {
00318         work[i] = lapack_make_complex_double( 0.0, 0.0 );
00319     }
00320 }
00321 
00322 /* Auxiliary function: C interface to zunglq results check */
00323 /* Return value: 0 - test is passed, non-zero - test is failed */
00324 static int compare_zunglq( lapack_complex_double *a, lapack_complex_double *a_i,
00325                            lapack_int info, lapack_int info_i, lapack_int lda,
00326                            lapack_int n )
00327 {
00328     lapack_int i;
00329     int failed = 0;
00330     for( i = 0; i < lda*n; i++ ) {
00331         failed += compare_complex_doubles(a[i],a_i[i]);
00332     }
00333     failed += (info == info_i) ? 0 : 1;
00334     if( info != 0 || info_i != 0 ) {
00335         printf( "info=%d, info_i=%d\n",(int)info,(int)info_i );
00336     }
00337 
00338     return failed;
00339 }


swiftnav
Author(s):
autogenerated on Sat Jun 8 2019 18:56:44