Lines Matching refs:ki

269 	for ki := n - 1; ki >= 0; ki-- {
278 if ki == 0 || t[ki*ldt+ki-1] == 0 {
290 if !selected[ki] {
293 } else if !selected[ki-1] {
299 wr := t[ki*ldt+ki]
302 wi = math.Sqrt(math.Abs(t[ki*ldt+ki-1])) * math.Sqrt(math.Abs(t[(ki-1)*ldt+ki]))
309 b[ki*ldb+iv] = 1
311 for k := 0; k < ki; k++ {
312 b[k*ldb+iv] = -t[k*ldt+ki]
316 for j := ki - 1; j >= 0; {
329 bi.Dscal(ki+1, scale, b[iv:], ldb)
351 bi.Dscal(ki+1, scale, b[iv:], ldb)
365 bi.Dcopy(ki+1, b[iv:], ldb, vr[is:], ldvr)
366 ii := bi.Idamax(ki+1, vr[is:], ldvr)
368 bi.Dscal(ki+1, remax, vr[is:], ldvr)
369 for k := ki + 1; k < n; k++ {
374 if ki > 0 {
375 bi.Dgemv(blas.NoTrans, n, ki, 1, vr, ldvr, b[iv:], ldb,
376 b[ki*ldb+iv], vr[ki:], ldvr)
378 ii := bi.Idamax(n, vr[ki:], ldvr)
379 remax := 1 / math.Abs(vr[ii*ldvr+ki])
380 bi.Dscal(n, remax, vr[ki:], ldvr)
384 for k := ki + 1; k < n; k++ {
396 if math.Abs(t[(ki-1)*ldt+ki]) >= math.Abs(t[ki*ldt+ki-1]) {
397 b[(ki-1)*ldb+iv-1] = 1
398 b[ki*ldb+iv] = wi / t[(ki-1)*ldt+ki]
400 b[(ki-1)*ldb+iv-1] = -wi / t[ki*ldt+ki-1]
401 b[ki*ldb+iv] = 1
403 b[ki*ldb+iv-1] = 0
404 b[(ki-1)*ldb+iv] = 0
406 for k := 0; k < ki-1; k++ {
407 b[k*ldb+iv-1] = -b[(ki-1)*ldb+iv-1] * t[k*ldt+ki-1]
408 b[k*ldb+iv] = -b[ki*ldb+iv] * t[k*ldt+ki]
412 for j := ki - 2; j >= 0; {
427 bi.Dscal(ki+1, scale, b[iv-1:], ldb)
428 bi.Dscal(ki+1, scale, b[iv:], ldb)
456 bi.Dscal(ki+1, scale, b[iv-1:], ldb)
457 bi.Dscal(ki+1, scale, b[iv:], ldb)
476 bi.Dcopy(ki+1, b[iv-1:], ldb, vr[is-1:], ldvr)
477 bi.Dcopy(ki+1, b[iv:], ldb, vr[is:], ldvr)
479 for k := 0; k <= ki; k++ {
483 bi.Dscal(ki+1, remax, vr[is-1:], ldvr)
484 bi.Dscal(ki+1, remax, vr[is:], ldvr)
485 for k := ki + 1; k < n; k++ {
491 if ki-1 > 0 {
492 bi.Dgemv(blas.NoTrans, n, ki-1, 1, vr, ldvr, b[iv-1:], ldb,
493 b[(ki-1)*ldb+iv-1], vr[ki-1:], ldvr)
494 bi.Dgemv(blas.NoTrans, n, ki-1, 1, vr, ldvr, b[iv:], ldb,
495 b[ki*ldb+iv], vr[ki:], ldvr)
497 bi.Dscal(n, b[(ki-1)*ldb+iv-1], vr[ki-1:], ldvr)
498 bi.Dscal(n, b[ki*ldb+iv], vr[ki:], ldvr)
502 emax = math.Max(emax, math.Abs(vr[k*ldvr+ki-1])+math.Abs(vr[k*ldvr+ki]))
505 bi.Dscal(n, remax, vr[ki-1:], ldvr)
506 bi.Dscal(n, remax, vr[ki:], ldvr)
510 for k := ki + 1; k < n; k++ {
524 ki2 := ki
579 for ki := 0; ki < n; ki++ {
587 if ki == n-1 || t[(ki+1)*ldt+ki] == 0 {
596 if howmny == lapack.EVSelected && !selected[ki] {
601 wr := t[ki*ldt+ki]
604 wi = math.Sqrt(math.Abs(t[ki*ldt+ki+1])) * math.Sqrt(math.Abs(t[(ki+1)*ldt+ki]))
611 b[ki*ldb+iv] = 1
613 for k := ki + 1; k < n; k++ {
614 b[k*ldb+iv] = -t[ki*ldt+k]
620 for j := ki + 1; j < n; {
628 bi.Dscal(n-ki, rec, b[ki*ldb+iv:], ldb)
631 b[j*ldb+iv] -= bi.Ddot(j-ki-1, t[(ki+1)*ldt+j:], ldt, b[(ki+1)*ldb+iv:], ldb)
637 bi.Dscal(n-ki, scale, b[ki*ldb+iv:], ldb)
650 bi.Dscal(n-ki+1, 1/vmax, b[ki*ldb+iv:], 1)
653 b[j*ldb+iv] -= bi.Ddot(j-ki-1, t[(ki+1)*ldt+j:], ldt, b[(ki+1)*ldb+iv:], ldb)
654 b[(j+1)*ldb+iv] -= bi.Ddot(j-ki-1, t[(ki+1)*ldt+j+1:], ldt, b[(ki+1)*ldb+iv:], ldb)
662 bi.Dscal(n-ki, scale, b[ki*ldb+iv:], ldb)
675 bi.Dcopy(n-ki, b[ki*ldb+iv:], ldb, vl[ki*ldvl+is:], ldvl)
676 ii := bi.Idamax(n-ki, vl[ki*ldvl+is:], ldvl) + ki
678 bi.Dscal(n-ki, remax, vl[ki*ldvl+is:], ldvl)
679 for k := 0; k < ki; k++ {
684 if n-ki-1 > 0 {
685 bi.Dgemv(blas.NoTrans, n, n-ki-1,
686 1, vl[ki+1:], ldvl, b[(ki+1)*ldb+iv:], ldb,
687 b[ki*ldb+iv], vl[ki:], ldvl)
689 ii := bi.Idamax(n, vl[ki:], ldvl)
690 remax := 1 / math.Abs(vl[ii*ldvl+ki])
691 bi.Dscal(n, remax, vl[ki:], ldvl)
695 for k := 0; k < ki; k++ {
707 if math.Abs(t[ki*ldt+ki+1]) >= math.Abs(t[(ki+1)*ldt+ki]) {
708 b[ki*ldb+iv] = wi / t[ki*ldt+ki+1]
709 b[(ki+1)*ldb+iv+1] = 1
711 b[ki*ldb+iv] = 1
712 b[(ki+1)*ldb+iv+1] = -wi / t[(ki+1)*ldt+ki]
714 b[(ki+1)*ldb+iv] = 0
715 b[ki*ldb+iv+1] = 0
717 for k := ki + 2; k < n; k++ {
718 b[k*ldb+iv] = -b[ki*ldb+iv] * t[ki*ldt+k]
719 b[k*ldb+iv+1] = -b[(ki+1)*ldb+iv+1] * t[(ki+1)*ldt+k]
725 for j := ki + 2; j < n; {
733 bi.Dscal(n-ki, rec, b[ki*ldb+iv:], ldb)
734 bi.Dscal(n-ki, rec, b[ki*ldb+iv+1:], ldb)
737 b[j*ldb+iv] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j:], ldt, b[(ki+2)*ldb+iv:], ldb)
738 b[j*ldb+iv+1] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j:], ldt, b[(ki+2)*ldb+iv+1:], ldb)
744 bi.Dscal(n-ki, scale, b[ki*ldb+iv:], ldb)
745 bi.Dscal(n-ki, scale, b[ki*ldb+iv+1:], ldb)
759 bi.Dscal(n-ki, rec, b[ki*ldb+iv:], ldb)
760 bi.Dscal(n-ki, rec, b[ki*ldb+iv+1:], ldb)
763 b[j*ldb+iv] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j:], ldt, b[(ki+2)*ldb+iv:], ldb)
764 b[j*ldb+iv+1] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j:], ldt, b[(ki+2)*ldb+iv+1:], ldb)
765 b[(j+1)*ldb+iv] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j+1:], ldt, b[(ki+2)*ldb+iv:], ldb)
766 b[(j+1)*ldb+iv+1] -= bi.Ddot(j-ki-2, t[(ki+2)*ldt+j+1:], ldt, b[(ki+2)*ldb+iv+1:], ldb)
774 bi.Dscal(n-ki, scale, b[ki*ldb+iv:], ldb)
775 bi.Dscal(n-ki, scale, b[ki*ldb+iv+1:], ldb)
792 bi.Dcopy(n-ki, b[ki*ldb+iv:], ldb, vl[ki*ldvl+is:], ldvl)
793 bi.Dcopy(n-ki, b[ki*ldb+iv+1:], ldb, vl[ki*ldvl+is+1:], ldvl)
795 for k := ki; k < n; k++ {
799 bi.Dscal(n-ki, remax, vl[ki*ldvl+is:], ldvl)
800 bi.Dscal(n-ki, remax, vl[ki*ldvl+is+1:], ldvl)
801 for k := 0; k < ki; k++ {
807 if n-ki-2 > 0 {
808 bi.Dgemv(blas.NoTrans, n, n-ki-2,
809 1, vl[ki+2:], ldvl, b[(ki+2)*ldb+iv:], ldb,
810 b[ki*ldb+iv], vl[ki:], ldvl)
811 bi.Dgemv(blas.NoTrans, n, n-ki-2,
812 1, vl[ki+2:], ldvl, b[(ki+2)*ldb+iv+1:], ldb,
813 b[(ki+1)*ldb+iv+1], vl[ki+1:], ldvl)
815 bi.Dscal(n, b[ki*ldb+iv], vl[ki:], ldvl)
816 bi.Dscal(n, b[(ki+1)*ldb+iv+1], vl[ki+1:], ldvl)
820 emax = math.Max(emax, math.Abs(vl[k*ldvl+ki])+math.Abs(vl[k*ldvl+ki+1]))
823 bi.Dscal(n, remax, vl[ki:], ldvl)
824 bi.Dscal(n, remax, vl[ki+1:], ldvl)
829 for k := 0; k < ki; k++ {
842 ki2 := ki