“Gaussian elimination”的概念、定义、翻译、参考文献-科学参考

Gaussian elimination

Mathematics

A particular systematic procedure for solving a set of linear equations in several unknowns. This is normally carried out by applying elementary row operations to the augmented matrix

$[\begin{matrix} a_{11} & a_{12} & \dots & a_{1 n} & b_{1} \\ a_{21} & a_{22} & \dots & a_{2 n} & b_{2} \\ ⋮ & ⋮ & ⋱ & ⋮ & ⋮ \\ a_{m 1} & a_{m 2} & \dots & a_{m n} & b_{m} \end{matrix}]$

to transform it to echelon form. The method is to divide the first row by a₁₁ and then subtract suitable multiples of the first row from the subsequent rows, to obtain a matrix of the form

$[\begin{matrix} 1 & {a′}_{12} & \dots & {a′}_{1 n} & {b′}_{1} \\ 0 & {a′}_{22} & \dots & {a′}_{2 n} & {b′}_{2} \\ ⋮ & ⋮ & ⋱ & ⋮ & ⋮ \\ 0 & {a′}_{m 2} & \dots & {a′}_{m n} & {b′}_{m} \end{matrix}] .$

(If a₁₁ = 0, it is necessary to interchange two rows first.) The first row now remains untouched, and the process is repeated with the remaining rows, dividing the second row by ${a′}_{22}$ to produce a 1 and subtracting suitable multiples of the new second row from the subsequent rows to produce zeros below that 1. The method continues in the same way. The essential point is that the corresponding set of equations at any stage has the same solution set as the original. (See also Gauss-Jordan elimination, simultaneous linear equations.)

Computer

See linear algebraic equations.

Electronics and Electrical Engineering

A method used in the solution of linear algebraic equations. See simultaneous equations.

单词	Gaussian elimination
释义	Gaussian elimination Mathematics A particular systematic procedure for solving a set of linear equations in several unknowns. This is normally carried out by applying elementary row operations to the augmented matrix $[\begin{matrix} a_{11} & a_{12} & \dots & a_{1 n} & b_{1} \\ a_{21} & a_{22} & \dots & a_{2 n} & b_{2} \\ ⋮ & ⋮ & ⋱ & ⋮ & ⋮ \\ a_{m 1} & a_{m 2} & \dots & a_{m n} & b_{m} \end{matrix}]$ to transform it to echelon form. The method is to divide the first row by a₁₁ and then subtract suitable multiples of the first row from the subsequent rows, to obtain a matrix of the form $[\begin{matrix} 1 & {a′}_{12} & \dots & {a′}_{1 n} & {b′}_{1} \\ 0 & {a′}_{22} & \dots & {a′}_{2 n} & {b′}_{2} \\ ⋮ & ⋮ & ⋱ & ⋮ & ⋮ \\ 0 & {a′}_{m 2} & \dots & {a′}_{m n} & {b′}_{m} \end{matrix}] .$ (If a₁₁ = 0, it is necessary to interchange two rows first.) The first row now remains untouched, and the process is repeated with the remaining rows, dividing the second row by ${a′}_{22}$ to produce a 1 and subtracting suitable multiples of the new second row from the subsequent rows to produce zeros below that 1. The method continues in the same way. The essential point is that the corresponding set of equations at any stage has the same solution set as the original. (See also Gauss-Jordan elimination, simultaneous linear equations.) Computer See linear algebraic equations. Electronics and Electrical Engineering A method used in the solution of linear algebraic equations. See simultaneous equations.
随便看	source coding theorem source compression coding source compression factor source count source follower source impedance source(in transportation problems) source language source-level compatibility source lines of code source listing source program source region source rock source route bridge source routing source set sources of capital sour gas Sousa, Martim Afonso de (1500–64) South Africa South African Astronomical Observatory South African Statistical Association South America South American Plate