LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_zhprfs_work.c
Go to the documentation of this file.
1/*****************************************************************************
2 Copyright (c) 2014, Intel Corp.
3 All rights reserved.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 may be used to endorse or promote products derived from this software
15 without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 THE POSSIBILITY OF SUCH DAMAGE.
28*****************************************************************************
29* Contents: Native middle-level C interface to LAPACK function zhprfs
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_zhprfs_work( int matrix_layout, char uplo, lapack_int n,
36 lapack_int nrhs,
37 const lapack_complex_double* ap,
38 const lapack_complex_double* afp,
39 const lapack_int* ipiv,
42 double* ferr, double* berr,
43 lapack_complex_double* work, double* rwork )
44{
45 lapack_int info = 0;
46 if( matrix_layout == LAPACK_COL_MAJOR ) {
47 /* Call LAPACK function and adjust info */
48 LAPACK_zhprfs( &uplo, &n, &nrhs, ap, afp, ipiv, b, &ldb, x, &ldx, ferr,
49 berr, work, rwork, &info );
50 if( info < 0 ) {
51 info = info - 1;
52 }
53 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
54 lapack_int ldb_t = MAX(1,n);
55 lapack_int ldx_t = MAX(1,n);
56 lapack_complex_double* b_t = NULL;
57 lapack_complex_double* x_t = NULL;
58 lapack_complex_double* ap_t = NULL;
59 lapack_complex_double* afp_t = NULL;
60 /* Check leading dimension(s) */
61 if( ldb < nrhs ) {
62 info = -9;
63 LAPACKE_xerbla( "LAPACKE_zhprfs_work", info );
64 return info;
65 }
66 if( ldx < nrhs ) {
67 info = -11;
68 LAPACKE_xerbla( "LAPACKE_zhprfs_work", info );
69 return info;
70 }
71 /* Allocate memory for temporary array(s) */
74 ldb_t * MAX(1,nrhs) );
75 if( b_t == NULL ) {
77 goto exit_level_0;
78 }
81 ldx_t * MAX(1,nrhs) );
82 if( x_t == NULL ) {
84 goto exit_level_1;
85 }
86 ap_t = (lapack_complex_double*)
88 ( MAX(1,n) * MAX(2,n+1) ) / 2 );
89 if( ap_t == NULL ) {
91 goto exit_level_2;
92 }
93 afp_t = (lapack_complex_double*)
95 ( MAX(1,n) * MAX(2,n+1) ) / 2 );
96 if( afp_t == NULL ) {
98 goto exit_level_3;
99 }
100 /* Transpose input matrices */
101 LAPACKE_zge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
102 LAPACKE_zge_trans( matrix_layout, n, nrhs, x, ldx, x_t, ldx_t );
103 LAPACKE_zhp_trans( matrix_layout, uplo, n, ap, ap_t );
104 LAPACKE_zhp_trans( matrix_layout, uplo, n, afp, afp_t );
105 /* Call LAPACK function and adjust info */
106 LAPACK_zhprfs( &uplo, &n, &nrhs, ap_t, afp_t, ipiv, b_t, &ldb_t, x_t,
107 &ldx_t, ferr, berr, work, rwork, &info );
108 if( info < 0 ) {
109 info = info - 1;
110 }
111 /* Transpose output matrices */
112 LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
113 /* Release memory and exit */
114 LAPACKE_free( afp_t );
115exit_level_3:
116 LAPACKE_free( ap_t );
117exit_level_2:
118 LAPACKE_free( x_t );
119exit_level_1:
120 LAPACKE_free( b_t );
121exit_level_0:
122 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
123 LAPACKE_xerbla( "LAPACKE_zhprfs_work", info );
124 }
125 } else {
126 info = -1;
127 LAPACKE_xerbla( "LAPACKE_zhprfs_work", info );
128 }
129 return info;
130}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_zhprfs(...)
Definition: lapack.h:8823
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_zge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
void LAPACKE_zhp_trans(int matrix_layout, char uplo, lapack_int n, const lapack_complex_double *in, lapack_complex_double *out)
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_int LAPACKE_zhprfs_work(int matrix_layout, char uplo, lapack_int n, lapack_int nrhs, const lapack_complex_double *ap, const lapack_complex_double *afp, const lapack_int *ipiv, const lapack_complex_double *b, lapack_int ldb, lapack_complex_double *x, lapack_int ldx, double *ferr, double *berr, lapack_complex_double *work, double *rwork)