LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_dsprfs_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 dsprfs
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_dsprfs_work( int matrix_layout, char uplo, lapack_int n,
36 lapack_int nrhs, const double* ap,
37 const double* afp, const lapack_int* ipiv,
38 const double* b, lapack_int ldb, double* x,
39 lapack_int ldx, double* ferr, double* berr,
40 double* work, lapack_int* iwork )
41{
42 lapack_int info = 0;
43 if( matrix_layout == LAPACK_COL_MAJOR ) {
44 /* Call LAPACK function and adjust info */
45 LAPACK_dsprfs( &uplo, &n, &nrhs, ap, afp, ipiv, b, &ldb, x, &ldx, ferr,
46 berr, work, iwork, &info );
47 if( info < 0 ) {
48 info = info - 1;
49 }
50 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
51 lapack_int ldb_t = MAX(1,n);
52 lapack_int ldx_t = MAX(1,n);
53 double* b_t = NULL;
54 double* x_t = NULL;
55 double* ap_t = NULL;
56 double* afp_t = NULL;
57 /* Check leading dimension(s) */
58 if( ldb < nrhs ) {
59 info = -9;
60 LAPACKE_xerbla( "LAPACKE_dsprfs_work", info );
61 return info;
62 }
63 if( ldx < nrhs ) {
64 info = -11;
65 LAPACKE_xerbla( "LAPACKE_dsprfs_work", info );
66 return info;
67 }
68 /* Allocate memory for temporary array(s) */
69 b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,nrhs) );
70 if( b_t == NULL ) {
72 goto exit_level_0;
73 }
74 x_t = (double*)LAPACKE_malloc( sizeof(double) * ldx_t * MAX(1,nrhs) );
75 if( x_t == NULL ) {
77 goto exit_level_1;
78 }
79 ap_t = (double*)
80 LAPACKE_malloc( sizeof(double) * ( MAX(1,n) * MAX(2,n+1) ) / 2 );
81 if( ap_t == NULL ) {
83 goto exit_level_2;
84 }
85 afp_t = (double*)
86 LAPACKE_malloc( sizeof(double) * ( MAX(1,n) * MAX(2,n+1) ) / 2 );
87 if( afp_t == NULL ) {
89 goto exit_level_3;
90 }
91 /* Transpose input matrices */
92 LAPACKE_dge_trans( matrix_layout, n, nrhs, b, ldb, b_t, ldb_t );
93 LAPACKE_dge_trans( matrix_layout, n, nrhs, x, ldx, x_t, ldx_t );
94 LAPACKE_dsp_trans( matrix_layout, uplo, n, ap, ap_t );
95 LAPACKE_dsp_trans( matrix_layout, uplo, n, afp, afp_t );
96 /* Call LAPACK function and adjust info */
97 LAPACK_dsprfs( &uplo, &n, &nrhs, ap_t, afp_t, ipiv, b_t, &ldb_t, x_t,
98 &ldx_t, ferr, berr, work, iwork, &info );
99 if( info < 0 ) {
100 info = info - 1;
101 }
102 /* Transpose output matrices */
103 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, nrhs, x_t, ldx_t, x, ldx );
104 /* Release memory and exit */
105 LAPACKE_free( afp_t );
106exit_level_3:
107 LAPACKE_free( ap_t );
108exit_level_2:
109 LAPACKE_free( x_t );
110exit_level_1:
111 LAPACKE_free( b_t );
112exit_level_0:
113 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
114 LAPACKE_xerbla( "LAPACKE_dsprfs_work", info );
115 }
116 } else {
117 info = -1;
118 LAPACKE_xerbla( "LAPACKE_dsprfs_work", info );
119 }
120 return info;
121}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_dsprfs(...)
Definition: lapack.h:15638
#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
lapack_int LAPACKE_dsprfs_work(int matrix_layout, char uplo, lapack_int n, lapack_int nrhs, const double *ap, const double *afp, const lapack_int *ipiv, const double *b, lapack_int ldb, double *x, lapack_int ldx, double *ferr, double *berr, double *work, lapack_int *iwork)
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_dsp_trans(int matrix_layout, char uplo, lapack_int n, const double *in, double *out)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)