gauss-jordan elimination
71List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …
72List of linear algebra topics — This is a list of linear algebra topics. See also list of matrices glossary of tensor theory. Contents 1 Linear equations 2 Matrices 3 Matrix decompositions 4 …
73Elementary matrix — In mathematics, an elementary matrix is a simple matrix which differs from the identity matrix in a minimal way. The elementary matrices generate the general linear group of invertible matrices, and left (respectively, right) multiplication by an …
74Row echelon form — In linear algebra a matrix is in row echelon form if * All nonzero rows are above any rows of all zeroes, and * The leading coefficient of a row is always strictly to the right of the leading coefficient of the row above it.This is the definition …
75Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… …
76Lie group decomposition — In mathematics, Lie group decompositions are used to analyse the structure of Lie groups and associated objects, by showing how they are built up out of subgroups. They are essential technical tools in the representation theory of Lie groups and… …
77Bruhat decomposition — In mathematics, the Bruhat decomposition G = BWB into cells can be regarded as a general expression of the principle of Gauss–Jordan elimination, which generically writes a matrix as a product of an upper triangular and lower triangular matrices… …
78Flexibility method — In structural engineering, the flexibility method is the classical consistent deformation method for computing member forces and displacements in structural systems. Its modern version formulated in terms of the members flexibility matrices also… …
79Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation …
80algebra and algebraic structures — Generalized version of arithmetic that uses variables to stand for unspecified numbers. Its purpose is to solve algebraic equations or systems of equations. Examples of such solutions are the quadratic formula (for solving a quadratic equation)… …
