Numerical linear algebra

2017-07-31T11:13:59+03:00[Europe/Moscow] en true Moore–Penrose pseudoinverse, Triangular matrix, Conjugate gradient method, Gaussian elimination, Givens rotation, Householder transformation, Strassen algorithm, System of linear equations, Kernel (linear algebra), SequenceL, Linear least squares (mathematics) flashcards Numerical linear algebra
Click to flip
  • Moore–Penrose pseudoinverse
    In mathematics, and in particular linear algebra, a pseudoinverse A+ of a matrix A is a generalization of the inverse matrix.
  • Triangular matrix
    In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix.
  • Conjugate gradient method
    In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is symmetric and positive-definite.
  • Gaussian elimination
    In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations.
  • Givens rotation
    In numerical linear algebra, a Givens rotation is a rotation in the plane spanned by two coordinates axes.
  • Householder transformation
    In linear algebra, a Householder transformation (also known as Householder reflection or elementary reflector) is a linear transformation that describes a reflection about a plane or hyperplane containing the origin.
  • Strassen algorithm
    In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication.
  • System of linear equations
    In mathematics, a system of linear equations (or linear system) is a collection of two or more linear equations involving the same set of variables.
  • Kernel (linear algebra)
    In mathematics, and more specifically in linear algebra and functional analysis, the kernel (also known as null space or nullspace) of a linear map L : V → W between two vector spaces V and W, is the set of all elements v of V for which L(v) = 0, where 0 denotes the zero vector in W.
  • SequenceL
    SequenceL is a general purpose functional programming language and auto-parallelizing (Parallel computing) tool set, whose primary design objectives are performance on multi-core processor hardware, ease of programming, platform portability/optimization, and code clarity and readability.
  • Linear least squares (mathematics)
    In statistics and mathematics, linear least squares is an approach fitting a mathematical or statistical model to data in cases where the idealized value provided by the model for any data point is expressed linearly in terms of the unknown parameters of the model.