LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_zgelsd.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 high-level C interface to LAPACK function zgelsd
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
38 lapack_int ldb, double* s, double rcond,
39 lapack_int* rank )
40{
41 lapack_int info = 0;
42 lapack_int lwork = -1;
43 /* Additional scalars declarations for work arrays */
44 lapack_int liwork;
45 lapack_int lrwork;
46 lapack_int* iwork = NULL;
47 double* rwork = NULL;
48 lapack_complex_double* work = NULL;
49 lapack_int iwork_query;
50 double rwork_query;
51 lapack_complex_double work_query;
52 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53 LAPACKE_xerbla( "LAPACKE_zgelsd", -1 );
54 return -1;
55 }
56#ifndef LAPACK_DISABLE_NAN_CHECK
57 if( LAPACKE_get_nancheck() ) {
58 /* Optionally check input matrices for NaNs */
59 if( LAPACKE_zge_nancheck( matrix_layout, m, n, a, lda ) ) {
60 return -5;
61 }
62 if( LAPACKE_zge_nancheck( matrix_layout, MAX(m,n), nrhs, b, ldb ) ) {
63 return -7;
64 }
65 if( LAPACKE_d_nancheck( 1, &rcond, 1 ) ) {
66 return -10;
67 }
68 }
69#endif
70 /* Query optimal working array(s) size */
71 info = LAPACKE_zgelsd_work( matrix_layout, m, n, nrhs, a, lda, b, ldb, s,
72 rcond, rank, &work_query, lwork, &rwork_query,
73 &iwork_query );
74 if( info != 0 ) {
75 goto exit_level_0;
76 }
77 liwork = iwork_query;
78 lrwork = (lapack_int)rwork_query;
79 lwork = LAPACK_Z2INT( work_query );
80 /* Allocate memory for work arrays */
81 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
82 if( iwork == NULL ) {
84 goto exit_level_0;
85 }
86 rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
87 if( rwork == NULL ) {
89 goto exit_level_1;
90 }
91 work = (lapack_complex_double*)
92 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
93 if( work == NULL ) {
95 goto exit_level_2;
96 }
97 /* Call middle-level interface */
98 info = LAPACKE_zgelsd_work( matrix_layout, m, n, nrhs, a, lda, b, ldb, s,
99 rcond, rank, work, lwork, rwork, iwork );
100 /* Release memory and exit */
101 LAPACKE_free( work );
102exit_level_2:
103 LAPACKE_free( rwork );
104exit_level_1:
105 LAPACKE_free( iwork );
106exit_level_0:
107 if( info == LAPACK_WORK_MEMORY_ERROR ) {
108 LAPACKE_xerbla( "LAPACKE_zgelsd", info );
109 }
110 return info;
111}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
int LAPACKE_get_nancheck(void)
lapack_int LAPACKE_zgelsd_work(int matrix_layout, lapack_int m, lapack_int n, lapack_int nrhs, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double *s, double rcond, lapack_int *rank, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork)
#define LAPACK_Z2INT(x)
Definition: lapacke.h:50
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapack_int LAPACKE_zgelsd(int matrix_layout, lapack_int m, lapack_int n, lapack_int nrhs, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double *s, double rcond, lapack_int *rank)