File: dpttrs.go

package info (click to toggle)
golang-gonum-v1-gonum 0.15.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 18,792 kB
  • sloc: asm: 6,252; fortran: 5,271; sh: 377; ruby: 211; makefile: 98
file content (51 lines) | stat: -rw-r--r-- 1,121 bytes parent folder | download
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
// Copyright ©2023 The Gonum Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package gonum

// Dpttrs solves a tridiagonal system of the form
//
//	A * X = B
//
// using the L*D*Lᵀ factorization of A computed by Dpttrf. D is a diagonal
// matrix specified in d, L is a unit bidiagonal matrix whose subdiagonal is
// specified in e, and X and B are n×nrhs matrices.
func (impl Implementation) Dpttrs(n, nrhs int, d, e []float64, b []float64, ldb int) {
	switch {
	case n < 0:
		panic(nLT0)
	case nrhs < 0:
		panic(nrhsLT0)
	case ldb < max(1, nrhs):
		panic(badLdB)
	}

	// Quick return if possible.
	if n == 0 || nrhs == 0 {
		return
	}

	switch {
	case len(d) < n:
		panic(shortD)
	case len(e) < n-1:
		panic(shortE)
	case len(b) < (n-1)*ldb+nrhs:
		panic(shortB)
	}

	nb := 1
	if nrhs > 1 {
		nb = max(1, impl.Ilaenv(1, "DPTTRS", " ", n, nrhs, -1, -1))
	}

	if nb >= nrhs {
		impl.dptts2(n, nrhs, d, e, b, ldb)
	} else {
		for j := 0; j < nrhs; j += nb {
			jb := min(nrhs-j, nb)
			impl.dptts2(n, jb, d, e, b[j:], ldb)
		}
	}
}