Reduction (mathematics)

Last updated May 05, 2022

In mathematics, reduction refers to the rewriting of an expression into a simpler form. For example, the process of rewriting a fraction into one with the smallest whole-number denominator possible (while keeping the numerator a whole number) is called "reducing a fraction". Rewriting a radical (or "root") expression with the smallest possible whole number under the radical symbol is called "reducing a radical". Minimizing the number of radicals that appear underneath other radicals in an expression is called denesting radicals.

Algebra

In linear algebra, reduction refers to applying simple rules to a series of equations or matrices to change them into a simpler form. In the case of matrices, the process involves manipulating either the rows or the columns of the matrix and so is usually referred to as row-reduction or column-reduction, respectively. Often the aim of reduction is to transform a matrix into its "row-reduced echelon form" or "row-echelon form"; this is the goal of Gaussian elimination.

Calculus

In calculus, reduction refers to using the technique of integration by parts to evaluate integrals by reducing them to simpler forms.

Static (Guyan) reduction

In dynamic analysis, static reduction refers to reducing the number of degrees of freedom. Static reduction can also be used in finite element analysis to refer to simplification of a linear algebraic problem. Since a static reduction requires several inversion steps it is an expensive matrix operation and is prone to some error in the solution. Consider the following system of linear equations in an FEA problem:

{\begin{bmatrix}K_{11}&K_{12}\\K_{21}&K_{22}\end{bmatrix}}{\begin{bmatrix}x_{1}\\x_{2}\end{bmatrix}}={\begin{bmatrix}F_{1}\\F_{2}\end{bmatrix}}

where K and F are known and K, x and F are divided into submatrices as shown above. If F₂ contains only zeros, and only x₁ is desired, K can be reduced to yield the following system of equations

{\begin{bmatrix}K_{11,{\text{reduced}}}\end{bmatrix}}{\begin{bmatrix}x_{1}\end{bmatrix}}={\begin{bmatrix}F_{1}\end{bmatrix}}

$K_{11,{\text{reduced}}}$ is obtained by writing out the set of equations as follows:

K_{11}x_{1}+K_{12}x_{2}=F_{1}

(1)

K_{21}x_{1}+K_{22}x_{2}=0

(2)

Equation ( 2 ) can be solved for $x_{2}$ (assuming invertibility of $K_{22}$ ):

-K_{22}^{-1}K_{21}x_{1}=x_{2}.

And substituting into ( 1 ) gives

K_{11}x_{1}-K_{12}K_{22}^{-1}K_{21}x_{1}=F_{1}.

Thus

K_{11,{\text{reduced}}}=K_{11}-K_{12}K_{22}^{-1}K_{21}.

In a similar fashion, any row or column i of F with a zero value may be eliminated if the corresponding value of x_i is not desired. A reduced K may be reduced again. As a note, since each reduction requires an inversion, and each inversion is an operation with computational cost O(n³), most large matrices are pre-processed to reduce calculation time.

History

In the 9th century, Persian mathematician Al-Khwarizmi's Al-Jabr introduced the fundamental concepts of "reduction" and "balancing", referring to the transposition of subtracted terms to the other side of an equation and the cancellation of like terms on opposite sides of the equation. This is the operation which Al-Khwarizmi originally described as al-jabr.^[1] The name "algebra" comes from the "al-jabr" in the title of his book.

Related Research Articles

In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of operations performed on the corresponding matrix of coefficients. This method can also be used to compute the rank of a matrix, the determinant of a square matrix, and the inverse of an invertible matrix. The method is named after Carl Friedrich Gauss (1777–1855) although some special cases of the method—albeit presented without proof—were known to Chinese mathematicians as early as circa 179 CE.

In linear algebra, the rank of a matrix $A$ is the dimension of the vector space generated by its columns. This corresponds to the maximal number of linearly independent columns of $A$ . This, in turn, is identical to the dimension of the vector space spanned by its rows. Rank is thus a measure of the "nondegenerateness" of the system of linear equations and linear transformation encoded by $A$ . There are multiple equivalent definitions of rank. A matrix's rank is one of its most fundamental characteristics.

In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspace is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a subspace when the context serves to distinguish it from other types of subspaces.

In linear algebra, the column space of a matrix A is the span of its column vectors. The column space of a matrix is the image or range of the corresponding matrix transformation.

In mathematics, a system of linear equations is a collection of one or more linear equations involving the same variables. For example,

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices $A$ and $B$ is denoted as $AB$ .

In linear algebra, the Cholesky decomposition or Cholesky factorization is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations. It was discovered by André-Louis Cholesky for real matrices, and posthumously published in 1924. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is $, while an example of a 3\times3 diagonal matrix is . An identity matrix of any size, or any multiple of it, is a diagonal matrix.$

In linear algebra, an n-by-n square matrix $A$ is called invertible, if there exists an n-by-n square matrix $B$ such that

Muḥammad ibn Mūsā al-Khwārizmī, or al-Khwarizmi was a Persian polymath from Khwarazm, who produced vastly influential works in mathematics, astronomy, and geography. Around 820 CE, he was appointed as the astronomer and head of the library of the House of Wisdom in Baghdad.

In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the linear subspace of the domain of the map which is mapped to the zero vector. That is, given a linear map $L : V \to W$ between two vector spaces $V$ and $W$ , the kernel of $L$ is the vector space of all elements $v$ of $V$ such that $L (v) = 0$ , where $0$ denotes the zero vector in $W$ , or more symbolically:

The Compendious Book on Calculation by Completion and Balancing, also known as Al-Jabr (ٱلْجَبْر), is an Arabic mathematical treatise on algebra written by the Polymath Muḥammad ibn Mūsā al-Khwārizmī around 820 CE while he was in the Abbasid capital of Baghdad, modern-day Iraq. Al-Jabr was a landmark work in the history of mathematics, establishing algebra as an independent discipline, and with the term "algebra" itself derived from Al-Jabr.

In linear algebra, an eigenvector or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted by $, is the factor by which the eigenvector is scaled.$

In linear algebra, an augmented matrix is a matrix obtained by appending the columns of two given matrices, usually for the purpose of performing the same elementary row operations on each of the given matrices.

In numerical analysis and linear algebra, lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as well. LU decomposition can be viewed as the matrix form of Gaussian elimination. Computers usually solve square systems of linear equations using LU decomposition, and it is also a key step when inverting a matrix or computing the determinant of a matrix. The LU decomposition was introduced by the Polish mathematician Tadeusz Banachiewicz in 1938.

Algebra can essentially be considered as doing computations similar to those of arithmetic but with non-numerical mathematical objects. However, until the 19th century, algebra consisted essentially of the theory of equations. For example, the fundamental theorem of algebra belongs to the theory of equations and is not, nowadays, considered as belonging to algebra.

In mathematics, in the field of control theory, a Sylvester equation is a matrix equation of the form:

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem.

Algebra is one of the broad areas of mathematics. Roughly speaking, algebra is the study of mathematical symbols and the rules for manipulating these symbols in formulas; it is a unifying thread of almost all of mathematics.

Matrix (mathematics) Two-dimensional array of numbers

In mathematics, a matrix is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object.

References

↑ Boyer, Carl B. (1991), "The Arabic Hegemony", A History of Mathematics (Second ed.), John Wiley & Sons, Inc., p. 229, ISBN 978-0-471-54397-8, It is not certain just what the terms al-jabr and muqabalah mean, but the usual interpretation is similar to that implied in the translation above. The word al-jabr presumably meant something like "restoration" or "completion" and seems to refer to the transposition of subtracted terms to the other side of an equation, which is evident in the treatise; the word muqabalah is said to refer to "reduction" or "balancing"—that is, the cancellation of like terms on opposite sides of the equation.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Boyer-229-1] Boyer, Carl B. (1991), "The Arabic Hegemony", A History of Mathematics (Second ed.), John Wiley & Sons, Inc., p. 229, ISBN 978-0-471-54397-8, It is not certain just what the terms al-jabr and muqabalah mean, but the usual interpretation is similar to that implied in the translation above. The word al-jabr presumably meant something like "restoration" or "completion" and seems to refer to the transposition of subtracted terms to the other side of an equation, which is evident in the treatise; the word muqabalah is said to refer to "reduction" or "balancing"—that is, the cancellation of like terms on opposite sides of the equation.

[1]