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.
تازہ کاری جانچی گئی مثالیں: 5
a · b = 32, so the vectors are 12.9332° apart; the parallelogram they span has area 7.34847.
Equivalent to arccos(a·b / |a||b|), but stays accurate when the vectors are nearly parallel.
The dot product multiplies matching components and adds them, a · b = a₁b₁ + a₂b₂ + a₃b₃. The cross product of two 3D vectors is a vector perpendicular to both, and its length equals the area of the parallelogram they span. The angle between the vectors is computed as θ = atan2(|a × b|, a · b), which equals arccos(a · b / |a||b|) but stays accurate for nearly parallel vectors, and the projection of a onto b is (a · b / |b|²) b.
Physics (work and torque), 3D graphics and linear algebra are the usual uses. The default vectors a = (1, 2, 3) and b = (4, 5, 6) give a · b = 32, a × b = (−3, 6, −3) and an angle of about 12.93°.
A dot product of 0 means the vectors are perpendicular; a zero cross product means they are parallel or one is zero. In 2D mode both vectors lie in the xy-plane, so their cross product points along z: (3, 4) × (4, −3) = (0, 0, −25).
جانچ کا ماخذ: Hand calculation; Python decimal √14, √54 and atan2(√54, 32) in degrees (hp.py)
جانچ کا ماخذ: 3·4 + 4·(−3) = 0; 3·(−3) − 4·4 = −25
جانچ کا ماخذ: b = 2a, so a × b = 0 and θ = 0
جانچ کا ماخذ: a·b/|b| = 8/4; angle atan2(3, 2) = 56.3099324740202…° (Python math.degrees)
Multiply corresponding components and add the results: a · b = a₁b₁ + a₂b₂ + a₃b₃. For (1, 2, 3) · (4, 5, 6) that is 4 + 10 + 18 = 32. The dot product also equals |a||b| cos θ, so it is positive when the angle is under 90°, 0 at exactly 90° and negative beyond it: (1, 0) · (−2, 0) = −2.
For a = (a₁, a₂, a₃) and b = (b₁, b₂, b₃), a × b = (a₂b₃ − a₃b₂, a₃b₁ − a₁b₃, a₁b₂ − a₂b₁). For (1, 2, 3) × (4, 5, 6) that gives (12 − 15, 12 − 6, 5 − 8) = (−3, 6, −3). The result is perpendicular to both vectors, follows the right-hand rule, and changes sign if the order is swapped: b × a = (3, −6, 3).
Use cos θ = (a · b)/(|a||b|). For (1, 2, 3) and (4, 5, 6), cos θ = 32/(√14 × √77) ≈ 0.974632, so θ ≈ 12.93°. Near 0° or 180° the arccos form loses accuracy, so the calculator uses the equivalent θ = atan2(|a × b|, a · b), the form William Kahan recommends in his notes on floating-point roundoff.
The two vectors are perpendicular (orthogonal), provided neither is the zero vector. (3, 4) · (4, −3) = 12 − 12 = 0, so those vectors meet at exactly 90°. In physics the same test shows that a force at right angles to the motion does no work, since work is the dot product of force and displacement.
The scalar projection of a onto b is the signed length of a along b, a · b / |b|; the vector projection is that length times the unit vector of b, (a · b / |b|²) b. Projecting (2, 3) onto (4, 0) gives a scalar projection of 8/4 = 2 and a vector projection of (2, 0). A negative scalar projection means a points partly against b.
درستی آپ کی درج کردہ قدروں اور طریقے کے مفروضوں پر منحصر ہے۔ اعشاری حساب 50 بامعنی ہندسے استعمال کرتا ہے، مگر تخمینے، عددی طریقے اور ماخذ کا ڈیٹا کم درست ہو سکتے ہیں؛ دکھائی گئی قدروں کو راؤنڈ کرنے سے یہ حدود ختم نہیں ہوتیں۔ آزاد ذرائع کی حل شدہ مثالوں سے جانچ: 5۔ مثلاً، “a = (1, 2, 3), b = (4, 5, 6)” کو Hand calculation; Python decimal √14, √54 and atan2(√54, 32) in degrees (hp.py) سے جانچا جاتا ہے۔
Wolfram MathWorld — Dot Product; Wolfram MathWorld — Cross Product; W. Kahan, How futile are mindless assessments of roundoff in floating-point computation? §12 — angles via atan2 rather than arccos.
اس کیلکولیٹر میں آزاد ذرائع سے حاصل کردہ جوابات والی 5 حل شدہ مثالیں شامل ہیں۔ یہ ٹیسٹ مجموعے میں چلتی ہیں اور آپ انہیں یہاں بھی چلا سکتے ہیں۔
6 × 6 تک کے میٹرکس کا مقطع، معکوس، رینک اور مختصر قطاری زینائی شکل، ہر قطاری عمل کے ساتھ؛ نیز ٹرانسپوز، حاصلِ ضرب اور مجموعہ، عین درست کسروں میں۔
Add, subtract, multiply and divide complex numbers, raise them to powers, find nth roots, and convert a + bi to polar form, with an Argand diagram.
Solve 2 to 5 simultaneous linear equations exactly by Gauss–Jordan elimination, with every row operation shown, and detect no-solution or infinite cases.