by

Wikipedia Bot (@wikibot, 0)

Numerical linear algebra

Table of contents

Domain decomposition methods

 0  0 

Exchange algorithms

 0  0 

Least squares

 0  0 

Matrix multiplication algorithms

 0  0 

Relaxation (iterative methods)

 0  0 

ABS methods

 0  0 

Armadillo (C++ library)

 0  0 

Arnoldi iteration

 0  0 

Automatically Tuned Linear Algebra Software

 0  0 

BLIS (software)

 0  0 

Backfitting algorithm

 0  0 

Basic Linear Algebra Subprograms

 1  0 

Biconjugate gradient method

 0  0 

Biconjugate gradient stabilized method

 0  0 

Block Wiedemann algorithm

 0  0 

Chebyshev iteration

 0  0 

Cholesky decomposition

 0  0 

Comparison of linear algebra libraries

 0  0 

Complete orthogonal decomposition

 0  0 

Conjugate gradient method

 1  0 

Conjugate residual method

 0  0 

DADiSP

 0  0 

DIIS

 0  0 

Data Analytics Library

 0  0 

Derivation of the conjugate gradient method

 0  0 

Divide-and-conquer eigenvalue algorithm

 0  0 

Dune (software)

 0  0 

EISPACK

 0  0 

Eigenmode expansion

 0  0 

Eigenvalue algorithm

 0  0 

Frontal solver

 0  0 

Gaussian elimination

 0  0 

Gauss–Seidel method

 0  0 

Generalized minimal residual method

 0  0 

GotoBLAS

 0  0 

GraphBLAS

 0  0 

Hypre

 0  0 

ILNumerics

 0  0 

In-place matrix transposition

 0  0 

Incomplete Cholesky factorization

 0  0 

Incomplete LU factorization

 0  0 

Interpolative decomposition

 0  0 

Inverse iteration

 0  0 

Jacobi eigenvalue algorithm

 0  0 

Jacobi method

 0  0 

Jacobi method for complex Hermitian matrices

 0  0 

Jacobi rotation

 0  0 

Julia (programming language)

 0  0 

Kaczmarz method

 0  0 

Kreiss matrix theorem

 0  0 

LAPACK

 0  0 

LINPACK

 0  0 

LOBPCG

 0  0 

LU decomposition

 0  0 

LU reduction

 0  0 

Lanczos algorithm

 0  0 

Librsb

 0  0 

Lis (linear algebra library)

 0  0 

Low-rank approximation

 0  0 

Matrix-free methods

 0  0 

Method of Four Russians

 0  0 

Minimal residual method

 0  0 

Modified Richardson iteration

 0  0 

Nested dissection

 0  0 

Numerical methods for linear least squares

 0  0 

OpenBLAS

 0  0 

Pivot element

 0  0 

Portable, Extensible Toolkit for Scientific Computation

 0  0 

Power iteration

 0  0 

Preconditioner

 0  0 

Pseudospectrum

 0  0 

QR algorithm

 0  0 

QR decomposition

 0  0 

Rayleigh quotient iteration

 0  0 

Relaxation (iterative method)

 0  0 

Row echelon form

 0  0 

Rybicki Press algorithm

 0  0 

SLEPc

 0  0 

SPIKE algorithm

 0  0 

SequenceL

 0  0 

Sparse approximation

 0  0 

Speakeasy (computational environment)

 0  0 

Stein-Rosenberg theorem

 0  0 

Stone's method

 0  0 

Successive over-relaxation

 0  0 

Tridiagonal matrix algorithm

 0  0 

Walter Edwin Arnoldi

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version