reference/slauumf.f · 三字经/OpenBLAS

代码拉取完成,页面将自动刷新

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 0

三字经/OpenBLAS

代码 Issues 0 Pull Requests 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

develop

分支 (57)

标签 (69)

管理

develop

gh-pages

release-0.3.0

issue5267

revert-5565-jn/makefile-rule-dynamic

revert-5643-neov2_param

revert-5479-forklock

revert-4741-Pthread_Scalability_Improvement

gemm_batch

revert-5180-openmp_use_cmake

revert-5251-issue5250

timeout-riscv-ci

revert-4920-issue4917

revert-4628-CI-c910v-mips64-loongarch64

risc-v

revert-4153-dgemv

jenkins

revert-4103-windows_perf

utest-riscv

revert-3518-elbrus

v0.3.33

v0.3.32

v0.3.31

v0.3.30

v0.3.29

v0.3.28

v0.3.27

v0.3.26

v0.3.25

v0.3.24

v0.3.23

v0.3.22

v0.3.21

v0.3.20

v0.3.19

v0.3.18

v0.3.17

v0.3.16

v0.3.15

v0.3.14

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 57

标签 69

OpenBLAS

reference

slauumf.f

slauumf.f 4.70 KB

SUBROUTINE SLAUUMF( UPLO, N, A, LDA, INFO )
*
* -- LAPACK auxiliary routine (version 3.0) --
* Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
* Courant Institute, Argonne National Lab, and Rice University
* February 29, 1992
*
* .. Scalar Arguments ..
 CHARACTER UPLO
 INTEGER INFO, LDA, N
* ..
* .. Array Arguments ..
 REAL A( LDA, * )
* ..
*
* Purpose
* =======
*
* SLAUUM computes the product U * U' or L' * L, where the triangular
* factor U or L is stored in the upper or lower triangular part of
* the array A.
*
* If UPLO = 'U' or 'u' then the upper triangle of the result is stored,
* overwriting the factor U in A.
* If UPLO = 'L' or 'l' then the lower triangle of the result is stored,
* overwriting the factor L in A.
*
* This is the blocked form of the algorithm, calling Level 3 BLAS.
*
* Arguments
* =========
*
* UPLO (input) CHARACTER*1
* Specifies whether the triangular factor stored in the array A
* is upper or lower triangular:
* = 'U': Upper triangular
* = 'L': Lower triangular
*
* N (input) INTEGER
* The order of the triangular factor U or L. N >= 0.
*
* A (input/output) REAL array, dimension (LDA,N)
* On entry, the triangular factor U or L.
* On exit, if UPLO = 'U', the upper triangle of A is
* overwritten with the upper triangle of the product U * U';
* if UPLO = 'L', the lower triangle of A is overwritten with
* the lower triangle of the product L' * L.
*
* LDA (input) INTEGER
* The leading dimension of the array A. LDA >= max(1,N).
*
* INFO (output) INTEGER
* = 0: successful exit
* < 0: if INFO = -k, the k-th argument had an illegal value
*
* =====================================================================
*
* .. Parameters ..
 REAL ONE
 PARAMETER ( ONE = 1.0E+0 )
* ..
* .. Local Scalars ..
 LOGICAL UPPER
 INTEGER I, IB, NB
* ..
* .. External Functions ..
 LOGICAL LSAME
 INTEGER ILAENV
 EXTERNAL LSAME, ILAENV
* ..
* .. External Subroutines ..
 EXTERNAL SGEMM, SLAUU2, SSYRK, STRMM, XERBLA
* ..
* .. Intrinsic Functions ..
 INTRINSIC MAX, MIN
* ..
* .. Executable Statements ..
*
* Test the input parameters.
*
 INFO = 0
 UPPER = LSAME( UPLO, 'U' )
 IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN
 INFO = -1
 ELSE IF( N.LT.0 ) THEN
 INFO = -2
 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN
 INFO = -4
 END IF
 IF( INFO.NE.0 ) THEN
 CALL XERBLA( 'SLAUUM', -INFO )
 RETURN
 END IF
*
* Quick return if possible
*
 IF( N.EQ.0 )
 $ RETURN
*
* Determine the block size for this environment.
*
 NB = 128
*
 IF( NB.LE.1 .OR. NB.GE.N ) THEN
*
* Use unblocked code
*
 CALL SLAUU2( UPLO, N, A, LDA, INFO )
 ELSE
*
* Use blocked code
*
 IF( UPPER ) THEN
*
* Compute the product U * U'.
*
 DO 10 I = 1, N, NB
 IB = MIN( NB, N-I+1 )
 CALL STRMM( 'Right', 'Upper', 'Transpose', 'Non-unit',
 $ I-1, IB, ONE, A( I, I ), LDA, A( 1, I ),
 $ LDA )
 CALL SLAUU2( 'Upper', IB, A( I, I ), LDA, INFO )
 IF( I+IB.LE.N ) THEN
 CALL SGEMM( 'No transpose', 'Transpose', I-1, IB,
 $ N-I-IB+1, ONE, A( 1, I+IB ), LDA,
 $ A( I, I+IB ), LDA, ONE, A( 1, I ), LDA )
 CALL SSYRK( 'Upper', 'No transpose', IB, N-I-IB+1,
 $ ONE, A( I, I+IB ), LDA, ONE, A( I, I ),
 $ LDA )
 END IF
 10 CONTINUE
 ELSE
*
* Compute the product L' * L.
*
 DO 20 I = 1, N, NB
 IB = MIN( NB, N-I+1 )
 CALL STRMM( 'Left', 'Lower', 'Transpose', 'Non-unit', IB,
 $ I-1, ONE, A( I, I ), LDA, A( I, 1 ), LDA )
 CALL SLAUU2( 'Lower', IB, A( I, I ), LDA, INFO )
 IF( I+IB.LE.N ) THEN
 CALL SGEMM( 'Transpose', 'No transpose', IB, I-1,
 $ N-I-IB+1, ONE, A( I+IB, I ), LDA,
 $ A( I+IB, 1 ), LDA, ONE, A( I, 1 ), LDA )
 CALL SSYRK( 'Lower', 'Transpose', IB, N-I-IB+1, ONE,
 $ A( I+IB, I ), LDA, ONE, A( I, I ), LDA )
 END IF
 20 CONTINUE
 END IF
 END IF
*
 RETURN
*
* End of SLAUUM
*
 END

一键复制编辑原始数据按行查看历史

Zhang Xianyi 提交于 2011年01月24日 22:54 +08:00 . Import GotoBLAS2 1.13 BSD version codes.

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

SUBROUTINESLAUUMF(UPLO,N,A,LDA,INFO)
*
*--LAPACKauxiliaryroutine(version3.0)--
*Univ.ofTennessee,Univ.ofCaliforniaBerkeley,NAGLtd.,
*CourantInstitute,ArgonneNationalLab,andRiceUniversity
*February29,1992
*
*..ScalarArguments..
CHARACTERUPLO
INTEGERINFO,LDA,N
*..
*..ArrayArguments..
REALA(LDA,*)
*..
*
*Purpose
*=======
*
*SLAUUMcomputestheproductU*U' or L'*L,wherethetriangular
*factorUorLisstoredintheupperorlowertriangularpartof
*thearrayA.
*
*IfUPLO='U'or'u'thentheuppertriangleoftheresultisstored,
*overwritingthefactorUinA.
*IfUPLO='L'or'l'thenthelowertriangleoftheresultisstored,
*overwritingthefactorLinA.
*
*Thisistheblockedformofthealgorithm,callingLevel3BLAS.
*
*Arguments
*=========
*
*UPLO(input)CHARACTER*1
*SpecifieswhetherthetriangularfactorstoredinthearrayA
*isupperorlowertriangular:
*='U':Uppertriangular
*='L':Lowertriangular
*
*N(input)INTEGER
*TheorderofthetriangularfactorUorL.N>=0.
*
*A(input/output)REALarray,dimension(LDA,N)
*Onentry,thetriangularfactorUorL.
*Onexit,ifUPLO='U',theuppertriangleofAis
*overwrittenwiththeuppertriangleoftheproductU*U';
* if UPLO = 'L', the lower triangle of A is overwritten with
* the lower triangle of the product L'*L.
*
*LDA(input)INTEGER
*TheleadingdimensionofthearrayA.LDA>=max(1,N).
*
*INFO(output)INTEGER
*=0:successfulexit
*<0:ifINFO=-k,thek-thargumenthadanillegalvalue
*
*=====================================================================
*
*..Parameters..
REALONE
PARAMETER(ONE=1.0E+0)
*..
*..LocalScalars..
LOGICALUPPER
INTEGERI,IB,NB
*..
*..ExternalFunctions..
LOGICALLSAME
INTEGERILAENV
EXTERNALLSAME,ILAENV
*..
*..ExternalSubroutines..
EXTERNALSGEMM,SLAUU2,SSYRK,STRMM,XERBLA
*..
*..IntrinsicFunctions..
INTRINSICMAX,MIN
*..
*..ExecutableStatements..
*
*Testtheinputparameters.
*
INFO=0
UPPER=LSAME(UPLO,'U')
IF(.NOT.UPPER.AND..NOT.LSAME(UPLO,'L'))THEN
INFO=-1
ELSEIF(N.LT.0)THEN
INFO=-2
ELSEIF(LDA.LT.MAX(1,N))THEN
INFO=-4
ENDIF
IF(INFO.NE.0)THEN
CALLXERBLA('SLAUUM',-INFO)
RETURN
ENDIF
*
*Quickreturnifpossible
*
IF(N.EQ.0)
$RETURN
*
*Determinetheblocksizeforthisenvironment.
*
NB=128
*
IF(NB.LE.1.OR.NB.GE.N)THEN
*
*Useunblockedcode
*
CALLSLAUU2(UPLO,N,A,LDA,INFO)
ELSE
*
*Useblockedcode
*
IF(UPPER)THEN
*
*ComputetheproductU*U'.
*
 DO 10 I = 1, N, NB
 IB = MIN( NB, N-I+1 )
 CALL STRMM( 'Right', 'Upper', 'Transpose', 'Non-unit',
 $ I-1, IB, ONE, A( I, I ), LDA, A( 1, I ),
 $ LDA )
 CALL SLAUU2( 'Upper', IB, A( I, I ), LDA, INFO )
 IF( I+IB.LE.N ) THEN
 CALL SGEMM( 'Notranspose', 'Transpose', I-1, IB,
 $ N-I-IB+1, ONE, A( 1, I+IB ), LDA,
 $ A( I, I+IB ), LDA, ONE, A( 1, I ), LDA )
 CALL SSYRK( 'Upper', 'Notranspose', IB, N-I-IB+1,
 $ ONE, A( I, I+IB ), LDA, ONE, A( I, I ),
 $ LDA )
 END IF
 10 CONTINUE
 ELSE
*
* Compute the product L'*L.
*
DO20I=1,N,NB
IB=MIN(NB,N-I+1)
CALLSTRMM('Left','Lower','Transpose','Non-unit',IB,
$I-1,ONE,A(I,I),LDA,A(I,1),LDA)
CALLSLAUU2('Lower',IB,A(I,I),LDA,INFO)
IF(I+IB.LE.N)THEN
CALLSGEMM('Transpose','No transpose',IB,I-1,
$N-I-IB+1,ONE,A(I+IB,I),LDA,
$A(I+IB,1),LDA,ONE,A(I,1),LDA)
CALLSSYRK('Lower','Transpose',IB,N-I-IB+1,ONE,
$A(I+IB,I),LDA,ONE,A(I,I),LDA)
ENDIF
20CONTINUE
ENDIF
ENDIF
*
RETURN
*
*EndofSLAUUM
*
END