File: qr_example_test.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 (40 lines) | stat: -rw-r--r-- 830 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
// Copyright ©2022 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 mat_test

import (
	"fmt"
	"log"

	"gonum.org/v1/gonum/mat"
)

func ExampleQR_solveTo() {
	// QR factorization can be used for solving linear inverse problems,
	// as this is a more numerically stable technique than direct
	// matrix inversion.
	//
	// Here, we want to solve:
	//   Ax = b

	var (
		a = mat.NewDense(4, 2, []float64{0, 1, 1, 1, 1, 1, 2, 1})
		b = mat.NewDense(4, 1, []float64{1, 0, 2, 1})
		x = mat.NewDense(2, 1, nil)
	)

	var qr mat.QR
	qr.Factorize(a)

	err := qr.SolveTo(x, false, b)
	if err != nil {
		log.Fatalf("could not solve QR: %+v", err)
	}
	fmt.Printf("%.3f\n", mat.Formatted(x))

	// Output:
	// ⎡0.000⎤
	// ⎣1.000⎦
}