1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
|
/*
* Copyright (c) 2012, Michael Lehn
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
* 3) Neither the name of the FLENS development group nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* Based on
*
SUBROUTINE DGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, INFO )
SUBROUTINE ZGEQP3( M, N, A, LDA, JPVT, TAU, WORK, LWORK, RWORK, INFO )
*
* -- LAPACK routine (version 3.3.1) --
* -- LAPACK is a software package provided by Univ. of Tennessee, --
* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
* -- April 2011 --
*/
#ifndef FLENS_LAPACK_GE_QP3_TCC
#define FLENS_LAPACK_GE_QP3_TCC 1
#include <flens/blas/blas.h>
#include <flens/lapack/lapack.h>
namespace flens { namespace lapack {
//== generic lapack implementation =============================================
namespace generic {
//-- worksize query ------------------------------------------------------------
template <typename MA>
typename GeMatrix<MA>::IndexType
qp3_wsq_impl(const GeMatrix<MA> &A)
{
typedef typename GeMatrix<MA>::ElementType ElementType;
typedef typename GeMatrix<MA>::IndexType IndexType;
const IndexType m = A.numRows();
const IndexType n = A.numCols();
const IndexType minmn = min(m, n);
IndexType iws, lwOpt;
if (minmn==0) {
iws = 1;
lwOpt = 1;
} else {
if (IsReal<ElementType>::value) {
iws = 3*n + 1;
const IndexType nb = ilaenv<ElementType>(1, "GEQRF", "", m, n);
lwOpt = 2*n +(n+1)*nb;
} else {
iws = n + 1;
const IndexType nb = ilaenv<ElementType>(1, "GEQRF", "", m, n);
lwOpt = (n+1)*nb;
}
}
return lwOpt;
}
//-- (ge)qp3 [real variant] ----------------------------------------------------
template <typename MA, typename JPIV, typename VTAU, typename VWORK>
void
qp3_impl(GeMatrix<MA> &A, DenseVector<JPIV> &jPiv, DenseVector<VTAU> &tau,
DenseVector<VWORK> &work)
{
using std::max;
using std::min;
typedef typename GeMatrix<MA>::ElementType T;
typedef typename GeMatrix<MA>::IndexType IndexType;
const Underscore<IndexType> _;
const IndexType m = A.numRows();
const IndexType n = A.numCols();
const IndexType minmn = min(m, n);
IndexType iws, lwOpt;
if (minmn==0) {
iws = 1;
} else {
iws = 3*n + 1;
}
lwOpt = qp3_wsq(A);
if (work.length()==0) {
work.resize(lwOpt);
}
work(1) = lwOpt;
IndexType lWork = work.length();
//
// Quick return if possible.
//
if (minmn==0) {
return;
}
//
// Move initial columns up front.
//
IndexType nFixed = 1;
for (IndexType j=1; j<=n; ++j) {
if (jPiv(j)!=0) {
if (j!=nFixed) {
blas::swap(A(_,j), A(_,nFixed));
jPiv(j) = jPiv(nFixed);
jPiv(nFixed) = j;
} else {
jPiv(j) = j;
}
++nFixed;
} else {
jPiv(j) = j;
}
}
--nFixed;
//
// Factorize fixed columns
// =======================
//
// Compute the QR factorization of fixed columns and update
// remaining columns.
//
if (nFixed>0) {
const IndexType na = min(m, nFixed);
auto A1 = A(_,_(1,na));
auto A2 = A(_,_(na+1,n));
auto tau1 = tau(_(1,na));
qrf(A1, tau1, work);
iws = max(iws, IndexType(work(1)));
if (na<n) {
ormqr(Left, Trans, A1, tau1, A2, work);
iws = max(iws, IndexType(work(1)));
}
}
//
// Factorize free columns
// ======================
//
if (nFixed<minmn) {
IndexType sm = m - nFixed;
IndexType sn = n - nFixed;
IndexType sminmn = minmn - nFixed;
//
// Determine the block size.
//
IndexType nb = ilaenv<T>(1, "GEQRF", "", sm, sn);
IndexType nbMin = 2;
IndexType nx = 0;
if (nb>1 && nb<sminmn) {
//
// Determine when to cross over from blocked to unblocked code.
//
nx = max(IndexType(0), ilaenv<T>(3, "GEQRF", "", sm, sn));
//
//
if (nx<sminmn) {
//
// Determine if workspace is large enough for blocked code.
//
IndexType minWs = 2*sn + (sn+1)*nb;
iws = max(iws, minWs);
if (lWork<minWs) {
//
// Not enough workspace to use optimal NB: Reduce NB and
// determine the minimum value of NB.
//
nb = (lWork-2*sn) / (sn+1);
nbMin = max(IndexType(2),
ilaenv<T>(2, "GEQRF", "", sm, sn));
}
}
}
//
// Initialize partial column norms. The first N elements of work
// store the exact column norms.
//
for (IndexType j=nFixed+1; j<=n; ++j) {
work(j) = blas::nrm2(A(_(nFixed+1,m),j));
work(n+j) = work(j);
}
IndexType j;
if (nb>=nbMin && nb<sminmn && nx<sminmn) {
//
// Use blocked code initially.
//
j = nFixed + 1;
//
// Compute factorization: while loop.
//
//
const IndexType topbmn = minmn - nx;
while (j<=topbmn) {
const IndexType jb = min(nb, topbmn-j+1);
//
// Factorize JB columns among columns J:N.
//
IndexType fjb;
auto A_ = A(_,_(j,n));
auto jPiv_ = jPiv(_(j,n));
auto tau_ = tau(_(j,min(j+jb-1,minmn)));
auto vn1 = work(_(j,n));
auto vn2 = work(_(j+n,2*n));
auto aux = work(_(2*n+1, 2*n+jb));
IndexType fLen = jb*(n-j+1);
auto f = work(_(2*n+jb+1,2*n+jb+fLen));
GeMatrixView<T> F(n-j+1, jb, f, n-j+1);
laqps(j-1, jb, fjb, A_, jPiv_, tau_, vn1, vn2, aux, F);
j += fjb;
}
} else {
j = nFixed + 1;
}
//
// Use unblocked code to factor the last or only block.
//
//
if (j<=minmn) {
auto A_ = A(_,_(j,n));
auto jPiv_ = jPiv(_(j,n));
auto tau_ = tau(_(j,minmn));
auto vn1 = work(_(j,n));
auto vn2 = work(_(j+n,2*n));
auto work_ = work(_(2*n+1, 3*n+1-j));
laqp2(j-1, A_, jPiv_, tau_, vn1, vn2, work_);
}
}
work(1) = iws;
}
//-- (ge)qp3 [complex variant] -------------------------------------------------
template <typename MA, typename JPIV, typename VTAU, typename VWORK,
typename VRWORK>
void
qp3_impl(GeMatrix<MA> &A, DenseVector<JPIV> &jPiv, DenseVector<VTAU> &tau,
DenseVector<VWORK> &work, DenseVector<VRWORK> &rWork)
{
using std::max;
using std::min;
using std::real;
typedef typename GeMatrix<MA>::ElementType T;
typedef typename GeMatrix<MA>::IndexType IndexType;
const Underscore<IndexType> _;
const IndexType m = A.numRows();
const IndexType n = A.numCols();
const IndexType minmn = min(m, n);
IndexType iws, lwOpt;
if (minmn==0) {
iws = 1;
} else {
iws = n + 1;
}
lwOpt = qp3_wsq(A);
if (work.length()==0) {
work.resize(lwOpt);
}
work(1) = lwOpt;
IndexType lWork = work.length();
//
// Quick return if possible.
//
if (minmn==0) {
return;
}
//
// Move initial columns up front.
//
IndexType nFixed = 1;
for (IndexType j=1; j<=n; ++j) {
if (jPiv(j)!=IndexType(0)) {
if (j!=nFixed) {
blas::swap(A(_,j), A(_,nFixed));
jPiv(j) = jPiv(nFixed);
jPiv(nFixed) = j;
} else {
jPiv(j) = j;
}
++nFixed;
} else {
jPiv(j) = j;
}
}
--nFixed;
//
// Factorize fixed columns
// =======================
//
// Compute the QR factorization of fixed columns and update
// remaining columns.
//
if (nFixed>0) {
const IndexType na = min(m, nFixed);
auto A1 = A(_,_(1,na));
auto A2 = A(_,_(na+1,n));
auto tau1 = tau(_(1,na));
qrf(A1, tau1, work);
iws = max(iws, IndexType(real(work(1))));
if (na<n) {
unmqr(Left, ConjTrans, A1, tau1, A2, work);
iws = max(iws, IndexType(real(work(1))));
}
}
//
// Factorize free columns
// ======================
//
if (nFixed<minmn) {
IndexType sm = m - nFixed;
IndexType sn = n - nFixed;
IndexType sminmn = minmn - nFixed;
//
// Determine the block size.
//
IndexType nb = ilaenv<T>(1, "GEQRF", "", sm, sn);
IndexType nbMin = 2;
IndexType nx = 0;
if (nb>1 && nb<sminmn) {
//
// Determine when to cross over from blocked to unblocked code.
//
nx = max(IndexType(0), ilaenv<T>(3, "GEQRF", "", sm, sn));
//
//
if (nx<sminmn) {
//
// Determine if workspace is large enough for blocked code.
//
IndexType minWs = (sn+1)*nb;
iws = max(iws, minWs);
if (lWork<minWs) {
//
// Not enough workspace to use optimal NB: Reduce NB and
// determine the minimum value of NB.
//
nb = lWork / (sn+1);
nbMin = max(IndexType(2),
ilaenv<T>(2, "GEQRF", "", sm, sn));
}
}
}
//
// Initialize partial column norms. The first N elements of work
// store the exact column norms.
//
for (IndexType j=nFixed+1; j<=n; ++j) {
rWork(j) = blas::nrm2(A(_(nFixed+1,m),j));
rWork(n+j) = rWork(j);
}
IndexType j;
if (nb>=nbMin && nb<sminmn && nx<sminmn) {
//
// Use blocked code initially.
//
j = nFixed + 1;
//
// Compute factorization: while loop.
//
//
const IndexType topbmn = minmn - nx;
while (j<=topbmn) {
const IndexType jb = min(nb, topbmn-j+1);
//
// Factorize JB columns among columns J:N.
//
IndexType fjb;
auto A_ = A(_,_(j,n));
auto jPiv_ = jPiv(_(j,n));
auto tau_ = tau(_(j,min(j+jb-1,minmn)));
auto vn1 = rWork(_(j,n));
auto vn2 = rWork(_(j+n,2*n));
auto aux = work(_(1, jb));
IndexType fLen = jb*(n-j+1);
auto f = work(_(jb+1,jb+fLen));
GeMatrixView<T> F(n-j+1, jb, f, n-j+1);
laqps(j-1, jb, fjb, A_, jPiv_, tau_, vn1, vn2, aux, F);
j += fjb;
}
} else {
j = nFixed + 1;
}
//
// Use unblocked code to factor the last or only block.
//
//
if (j<=minmn) {
auto A_ = A(_,_(j,n));
auto jPiv_ = jPiv(_(j,n));
auto tau_ = tau(_(j,minmn));
auto vn1 = rWork(_(j,n));
auto vn2 = rWork(_(j+n,2*n));
auto work_ = work(_(1, n+1-j));
laqp2(j-1, A_, jPiv_, tau_, vn1, vn2, work_);
}
}
work(1) = iws;
}
} // namespace generic
//== interface for native lapack ===============================================
#ifdef USE_CXXLAPACK
namespace external {
//-- worksize query ------------------------------------------------------------
template <typename MA>
typename RestrictTo<IsRealGeMatrix<MA>::value,
typename MA::IndexType>::Type
qp3_wsq_impl(const MA &A)
{
typedef typename MA::ElementType ElementType;
typedef typename MA::IndexType IndexType;
ElementType DUMMY, WORK;
IndexType IDUMMY;
IndexType LWORK = -1;
cxxlapack::geqp3<IndexType>(A.numRows(),
A.numCols(),
&DUMMY,
A.leadingDimension(),
&IDUMMY,
&DUMMY,
&WORK,
LWORK);
return WORK;
}
template <typename MA>
typename RestrictTo<IsComplexGeMatrix<MA>::value,
typename MA::IndexType>::Type
qp3_wsq_impl(const MA &A)
{
typedef typename MA::ElementType ElementType;
typedef typename ComplexTrait<ElementType>::PrimitiveType RealType;
typedef typename MA::IndexType IndexType;
ElementType DUMMY, WORK;
RealType RWORK;
IndexType IDUMMY;
IndexType LWORK = -1;
cxxlapack::geqp3<IndexType>(A.numRows(),
A.numCols(),
&DUMMY,
A.leadingDimension(),
&IDUMMY,
&DUMMY,
&WORK,
LWORK,
&RWORK);
return WORK.real();
}
//-- (ge)qp3 [real variant] ----------------------------------------------------
template <typename MA, typename JPIV, typename VTAU, typename VWORK>
void
qp3_impl(GeMatrix<MA> &A,
DenseVector<JPIV> &jPiv,
DenseVector<VTAU> &tau,
DenseVector<VWORK> &work)
{
typedef typename GeMatrix<MA>::IndexType IndexType;
cxxlapack::geqp3<IndexType>(A.numRows(),
A.numCols(),
A.data(),
A.leadingDimension(),
jPiv.data(),
tau.data(),
work.data(),
work.length());
}
//-- (ge)qp3 [complex variant] -------------------------------------------------
template <typename MA, typename JPIV, typename VTAU, typename VWORK,
typename VRWORK>
void
qp3_impl(GeMatrix<MA> &A,
DenseVector<JPIV> &jPiv,
DenseVector<VTAU> &tau,
DenseVector<VWORK> &work,
DenseVector<VRWORK> &rWork)
{
typedef typename GeMatrix<MA>::IndexType IndexType;
cxxlapack::geqp3<IndexType>(A.numRows(),
A.numCols(),
A.data(),
A.leadingDimension(),
jPiv.data(),
tau.data(),
work.data(),
work.length(),
rWork.data());
}
} // namespace external
#endif // USE_CXXLAPACK
//== public interface ==========================================================
//-- (ge)qp3 [real variant] ----------------------------------------------------
template <typename MA, typename VJPIV, typename VTAU, typename VWORK>
typename RestrictTo<IsRealGeMatrix<MA>::value
&& IsIntegerDenseVector<VJPIV>::value
&& IsRealDenseVector<VTAU>::value
&& IsRealDenseVector<VWORK>::value,
void>::Type
qp3(MA &&A,
VJPIV &&jPiv,
VTAU &&tau,
VWORK &&work)
{
using std::min;
//
// Remove references from rvalue types
//
typedef typename RemoveRef<MA>::Type MatrixA;
typedef typename MatrixA::IndexType IndexType;
const IndexType m = A.numRows();
const IndexType n = A.numCols();
const IndexType k = min(m, n);
# ifndef NDEBUG
//
// Test the input parameters
//
ASSERT(A.firstRow()==1);
ASSERT(A.firstCol()==1);
ASSERT(jPiv.firstIndex()==1);
ASSERT(tau.firstIndex()==1);
ASSERT(work.firstIndex()==1);
ASSERT(jPiv.length()==0 || jPiv.length()==n);
ASSERT(tau.length()==0 || tau.length()==k);
ASSERT(work.length()>=3*n+1 || work.length()==IndexType(0));
# endif
//
// Resize vector output arguments and workspace if needed
//
if (jPiv.length()==0) {
jPiv.resize(n);
}
if (tau.length()==0) {
tau.resize(k);
}
if (work.length()==0) {
work.resize(qp3_wsq(A));
}
# ifdef CHECK_CXXLAPACK
typedef typename RemoveRef<VJPIV>::Type VectorJPiv;
typedef typename RemoveRef<VTAU>::Type VectorTau;
typedef typename RemoveRef<VWORK>::Type VectorWork;
//
// Make copies of output arguments
//
typename MatrixA::NoView A_org = A;
typename VectorJPiv::NoView jPiv_org = jPiv;
typename VectorTau::NoView tau_org = tau;
typename VectorWork::NoView work_org = work;
# endif
if (work.length()==0) {
work.resize(qp3_wsq(A));
}
//
// Call implementation
//
LAPACK_SELECT::qp3_impl(A, jPiv, tau, work);
# ifdef CHECK_CXXLAPACK
//
// Restore output arguments
//
typename MatrixA::NoView A_generic = A;
typename VectorJPiv::NoView jPiv_generic = jPiv;
typename VectorTau::NoView tau_generic = tau;
typename VectorWork::NoView work_generic = work;
A = A_org;
jPiv = jPiv_org;
tau = tau_org;
// if the generic implementation resized work due to a work size query
// we must not restore the work array
if (work_org.length()>0) {
work = work_org;
} else {
work = 0;
}
//
// Compare results
//
external::qp3_impl(A, jPiv, tau, work);
bool failed = false;
if (! isIdentical(A_generic, A, "A_generic", "A")) {
std::cerr << "CXXLAPACK: A_generic = " << A_generic << std::endl;
std::cerr << "F77LAPACK: A = " << A << std::endl;
failed = true;
}
if (! isIdentical(jPiv_generic, jPiv, "jPiv_generic", "jPiv")) {
std::cerr << "CXXLAPACK: jPiv_generic = " << jPiv_generic << std::endl;
std::cerr << "F77LAPACK: jPiv = " << jPiv << std::endl;
failed = true;
}
if (! isIdentical(tau_generic, tau, "tau_generic", "tau")) {
std::cerr << "CXXLAPACK: tau_generic = " << tau_generic << std::endl;
std::cerr << "F77LAPACK: tau = " << tau << std::endl;
failed = true;
}
if (! isIdentical(work_generic, work, "work_generic", "work")) {
std::cerr << "CXXLAPACK: work_generic = " << work_generic << std::endl;
std::cerr << "F77LAPACK: work = " << work << std::endl;
failed = true;
}
if (failed) {
ASSERT(0);
}
# endif
}
//
//-- (ge)qp3 [real variant (with temporary workspace) ] ------------------------
//
template <typename MA, typename VJPIV, typename VTAU>
typename RestrictTo<IsRealGeMatrix<MA>::value
&& IsIntegerDenseVector<VJPIV>::value
&& IsRealDenseVector<VTAU>::value,
void>::Type
qp3(MA &&A,
VJPIV &&jPiv,
VTAU &&tau)
{
typename RemoveRef<MA>::Type::Vector work;
qp3(A, jPiv, tau, work);
}
//
//-- (ge)qp3 [complex variant] -------------------------------------------------
//
template <typename MA, typename VJPIV, typename VTAU, typename VWORK,
typename VRWORK>
typename RestrictTo<IsComplexGeMatrix<MA>::value
&& IsIntegerDenseVector<VJPIV>::value
&& IsComplexDenseVector<VTAU>::value
&& IsComplexDenseVector<VWORK>::value
&& IsRealDenseVector<VRWORK>::value,
void>::Type
qp3(MA &&A,
VJPIV &&jPiv,
VTAU &&tau,
VWORK &&work,
VRWORK &&rWork)
{
using std::min;
//
// Remove references from rvalue types
//
typedef typename RemoveRef<MA>::Type MatrixA;
typedef typename MatrixA::IndexType IndexType;
# ifdef CHECK_CXXLAPACK
typedef typename RemoveRef<VJPIV>::Type VectorJPiv;
typedef typename RemoveRef<VTAU>::Type VectorTau;
typedef typename RemoveRef<VWORK>::Type VectorWork;
typedef typename RemoveRef<VRWORK>::Type VectorRWork;
# endif
const IndexType m = A.numRows();
const IndexType n = A.numCols();
const IndexType k = min(m, n);
# ifndef NDEBUG
//
// Test the input parameters
//
ASSERT(A.firstRow()==1);
ASSERT(A.firstCol()==1);
ASSERT(jPiv.firstIndex()==1);
ASSERT(tau.firstIndex()==1);
ASSERT(work.firstIndex()==1);
ASSERT(jPiv.length()==0 || jPiv.length()==n);
ASSERT(tau.length()==0 || tau.length()==k);
ASSERT(work.length()>=n+1 || work.length()==IndexType(0));
ASSERT(rWork.length()==0 || rWork.length()>=2*n);
# endif
//
// Resize vector output arguments and workspace if needed
//
if (jPiv.length()==0) {
jPiv.resize(n);
}
if (tau.length()==0) {
tau.resize(k);
}
if (rWork.length()==0) {
rWork.resize(2*n);
}
# ifdef CHECK_CXXLAPACK
//
// Make copies of output arguments
//
typename MatrixA::NoView A_org = A;
typename VectorJPiv::NoView jPiv_org = jPiv;
typename VectorTau::NoView tau_org = tau;
typename VectorWork::NoView work_org = work;
typename VectorRWork::NoView rWork_org = rWork;
# endif
if (work.length()==0) {
work.resize(qp3_wsq(A));
}
//
// Call implementation
//
LAPACK_SELECT::qp3_impl(A, jPiv, tau, work, rWork);
# ifdef CHECK_CXXLAPACK
//
// Restore output arguments
//
typename MatrixA::NoView A_generic = A;
typename VectorJPiv::NoView jPiv_generic = jPiv;
typename VectorTau::NoView tau_generic = tau;
typename VectorWork::NoView work_generic = work;
typename VectorRWork::NoView rWork_generic = rWork;
A = A_org;
jPiv = jPiv_org;
tau = tau_org;
// if the generic implementation resized work due to a work size query
// we must not restore the work array
if (work_org.length()>0) {
work = work_org;
} else {
work = 0;
}
rWork = rWork_org;
//
// Compare results
//
external::qp3_impl(A, jPiv, tau, work, rWork);
bool failed = false;
if (! isIdentical(A_generic, A, "A_generic", "A")) {
std::cerr << "CXXLAPACK: A_generic = " << A_generic << std::endl;
std::cerr << "F77LAPACK: A = " << A << std::endl;
failed = true;
}
if (! isIdentical(jPiv_generic, jPiv, "jPiv_generic", "jPiv")) {
std::cerr << "CXXLAPACK: jPiv_generic = " << jPiv_generic << std::endl;
std::cerr << "F77LAPACK: jPiv = " << jPiv << std::endl;
failed = true;
}
if (! isIdentical(tau_generic, tau, "tau_generic", "tau")) {
std::cerr << "CXXLAPACK: tau_generic = " << tau_generic << std::endl;
std::cerr << "F77LAPACK: tau = " << tau << std::endl;
failed = true;
}
if (! isIdentical(work_generic, work, "work_generic", "work")) {
std::cerr << "CXXLAPACK: work_generic = " << work_generic << std::endl;
std::cerr << "F77LAPACK: work = " << work << std::endl;
failed = true;
}
if (! isIdentical(rWork_generic, rWork, "rWork_generic", "rWork")) {
std::cerr << "CXXLAPACK: rWork_generic = "
<< rWork_generic << std::endl;
std::cerr << "F77LAPACK: rWork = " << rWork << std::endl;
failed = true;
}
if (failed) {
std::cerr << "A_org = " << A_org << std::endl;
ASSERT(0);
}
# endif
}
//
//-- (ge)qp3 [complex variant (with temporary workspace) ] ---------------------
//
template <typename MA, typename VJPIV, typename VTAU>
typename RestrictTo<IsComplexGeMatrix<MA>::value
&& IsIntegerDenseVector<VJPIV>::value
&& IsComplexDenseVector<VTAU>::value,
void>::Type
qp3(MA &&A,
VJPIV &&jPiv,
VTAU &&tau)
{
typedef typename RemoveRef<MA>::Type::Vector Vector;
typedef typename RemoveRef<MA>::Type::ElementType T;
typedef typename ComplexTrait<T>::PrimitiveType PT;
typedef DenseVector<Array<PT> > RealVector;
Vector work;
RealVector realWork;
qp3(A, jPiv, tau, work, realWork);
}
//== workspace query ===========================================================
template <typename MA>
typename RestrictTo<IsGeMatrix<MA>::value,
typename MA::IndexType>::Type
qp3_wsq(const MA &A)
{
typedef typename MA::IndexType IndexType;
//
// Call implementation
//
const IndexType info = LAPACK_SELECT::qp3_wsq_impl(A);
# ifdef CHECK_CXXLAPACK
//
// Compare generic results with results from the native implementation
//
const IndexType info_ = external::qp3_wsq_impl(A);
ASSERT(info==info_);
# endif
return info;
}
} } // namespace lapack, flens
#endif // FLENS_LAPACK_GE_QP3_TCC
|