Inverse of the default 3 × 3
- Calculate
- Inverse of A
- Matrix A
- 2 1 1 1 3 2 1 0 0
- 결과
- [0, 0, 1; −2, 1, 3; 3, −1, −5]
- det A
- -1
검증 출처: Python fractions Gauss–Jordan on [A | I]; det by cofactor expansion = −1
최대 6 × 6 행렬의 행렬식, 역행렬, 계수, 기약 행 사다리꼴을 모든 행 연산과 함께 표시합니다. 전치, 곱, 합도 정확한 분수로 계산합니다.
업데이트 검증한 예제: 8
A is invertible (det A = −1); the inverse undoes A, so A × A⁻¹ is the identity matrix.
| Col 1 | Col 2 | Col 3 |
|---|---|---|
| 0 | 0 | 1 |
| −2 | 1 | 3 |
| 3 | −1 | −5 |
Check: A × A⁻¹ = I.
The calculator works on matrices up to 6 × 6 in exact fractions. The inverse and the reduced row echelon form come from Gauss–Jordan elimination: [A | I] is row-reduced until the left half is the identity, and the right half is then A⁻¹. The determinant is the product of the pivots from forward elimination, negated once for each row swap; the rank is the number of pivots; and a product has entries (AB)ᵢⱼ = Σₖ aᵢₖbₖⱼ.
Linear algebra courses, 3D graphics transforms and systems of equations are the usual uses. The default matrix [2 1 1; 1 3 2; 1 0 0] has determinant −1, so it is invertible, and its inverse [0 0 1; −2 1 3; 3 −1 −5] has whole-number entries.
Type one row per line, with entries separated by spaces or commas; fractions such as 1/2 stay exact. A matrix with determinant 0 is singular: it has no inverse, and its rank is below its size.
검증 출처: Python fractions Gauss–Jordan on [A | I]; det by cofactor expansion = −1
검증 출처: (1/(ad − bc))·[d −b; −c a] = (1/10)·[6 −7; −2 4]
검증 출처: Cofactor expansion: 2·0 − 1·(0 − 2) + 1·(0 − 3) = −1
검증 출처: Row 2 = 2 × row 1; Python fractions RREF has 2 pivots
Write A next to the identity matrix, [A | I], and apply row operations until the left half becomes I; the right half is then A⁻¹. A 2 × 2 matrix [a b; c d] has a shortcut: A⁻¹ = (1/(ad − bc)) × [d −b; −c a]. For [4 7; 2 6], ad − bc = 24 − 14 = 10, so A⁻¹ = [3/5 −7/10; −1/5 2/5].
Expand along a row or column, multiplying each entry by the determinant of its 2 × 2 minor with alternating signs. For [2 1 1; 1 3 2; 1 0 0], the bottom row is quickest because two of its entries are 0: det = 1 × (1 × 2 − 1 × 3) = −1. For larger matrices row reduction reaches the same answer with far fewer operations.
When its determinant is 0, which happens exactly when one row or column is a combination of the others. In [1 2 3; 2 4 6; 1 1 1], row 2 is twice row 1, so the rank is 2 rather than 3 and the determinant is 0. Such a matrix is called singular, and a system Ax = b built on it has either no solution or infinitely many.
Each entry of AB is a row of A times a column of B, summed: (AB)ᵢⱼ = Σₖ aᵢₖbₖⱼ. For [1 2; 3 4] × [5 6; 7 8] the top-left entry is 1 × 5 + 2 × 7 = 19, and the product is [19 22; 43 50]. A needs as many columns as B has rows, and order matters: here BA = [23 34; 31 46].
A matrix is in reduced row echelon form (RREF) when each non-zero row starts with a 1, that leading 1 is the only non-zero entry in its column, the leading 1s step right going down, and zero rows sit at the bottom. Every matrix has exactly one RREF, and its number of leading 1s is the rank. For an augmented matrix it reads off the solution: [1 0 0 −8; 0 1 0 1; 0 0 1 −2] means x = −8, y = 1, z = −2.
정확도는 입력값과 계산 방법의 가정에 따라 달라집니다. 십진 연산은 유효숫자 50자리를 사용하지만, 추정값·수치해석 방법·원본 데이터의 정밀도는 더 낮을 수 있습니다. 표시값을 반올림해도 이러한 한계는 사라지지 않습니다. 독립적인 출처의 풀이와 대조한 계산 예시: 8. 예를 들어 “Inverse of the default 3 × 3”은 Python fractions Gauss–Jordan on [A | I]; det by cofactor expansion = −1와 대조해 확인합니다.
Wikipedia — Gaussian elimination (row reduction and the RREF example); Wolfram MathWorld — Matrix Inverse; G. Strang, Introduction to Linear Algebra (5th ed.), chapters 2–3.
이 계산기에는 독립적인 출처에서 답을 얻은 계산 예제가 8개 있습니다. 테스트 모음에서 실행되며 여기에서도 실행할 수 있습니다.
Solve 2 to 5 simultaneous linear equations exactly by Gauss–Jordan elimination, with every row operation shown, and detect no-solution or infinite cases.
Dot and cross products of two vectors in 2D or 3D, their magnitudes, the angle between them and the projection of one onto the other, with a drawing.