Elements of Gonum for Scientific Computing
summary
Gonum implements BLAS/LAPACK-like primitives in Go with both pure-Go and cgo backends, using row-major storage with strides and light-weight views for rows, columns and diagonals. The library exposes Solve/SolveVec for A·x=b, concrete types for band, triangular and symmetric matrices, and a band Cholesky factorization that solves the tridiagonal 1D Poisson discretization efficiently. Test suites check numerical correctness and the code panics on invalid mathematical operations. Iterative solvers live in an x package pending main-repo merge.
AI-written summary · about
chapters (7)
- 0:00Introduction and motivation
- 2:23What is scientific computing
- 15:40What is Gonum
- 18:13Hello world problem
- 21:27Linear systems in Gonum
- 27:49Matrix storage and BLAS
- 32:53Future of Gonum
related talks
18mMachine Learning and Go
04mGo and data, can they ever be friends?
31mMachine Learning for Gophers
30mGo Faster: Integrating CUDA in Go for GPU Acceleration
34mGoHEP: what can Go do for science?
34mHigh-load CGo: calling nonblocking C/C++ code without surprise ☠️
57mGraphBLAS: Building a C++ Matrix API for Graph Algorithms
46mGoing Loopy: Iteration in Go