Matrix Solution (Solving System of Linear Equation)

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/linear-algebra/system-of-linear-equations/asset-matrix-solution-solving-system-of-linear-equation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This Linear Algebra lecture focuses on solving systems of linear equations using matrix notation, specifically the equation $Ax = b$. The instructor begins by briefly showing determinant formulas for 2x2 and 3x3 matrices before moving to the whiteboard. He emphasizes that standard division like $x = b/A$ is undefined for matrices. Instead, he introduces the inverse matrix method, deriving the solution $x = A^{-1}b$ by multiplying both sides by $A^{-1}$. The lecture critically analyzes the role of the determinant $|A|$, explaining that a non-zero determinant guarantees a unique solution, while a zero determinant indicates the matrix is not invertible, leading to either no solution or infinite solutions. He also discusses the vector $x$ having components $x, y, z$.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a title card "LINEAR ALGEBRA" displaying determinant formulas for 2x2 and 3x3 matrices. The instructor then stands before a whiteboard titled "MATRIX SOLUTION" and writes the fundamental equation $Ax = b$. He crosses out the incorrect notation $x = b/A$. He then writes the correct form $x = A^{-1}b$. To justify this, he performs a derivation on the right side of the board: multiplying $Ax = b$ by $A^{-1}$ on the left gives $A^{-1}Ax = A^{-1}b$. He simplifies $A^{-1}A$ to the identity matrix $I$, resulting in $Ix = A^{-1}b$, and finally boxes the solution $x = A^{-1}b$. He also notes that if $|A| = 0$, the matrix $A$ is not invertible. He writes $|A| eq 0$ and $|A| = 0$ on the board.

  2. 2:00 – 3:42 02:00-03:42

    In this section, the instructor elaborates on the conditions for the existence of solutions. He notes that $|A| eq 0$ leads to a "unique sol^n". Conversely, for $|A| = 0$, he writes that $A^{-1}$ does not exist. He explains that this case results in either "$\infty$ sol^n" (infinite solutions) or "No sol^n" (no solution). He provides concrete examples of solution sets, writing "(a) $x=4, y=3, z=8$" and "(d) $x=6, y=7, z=4$" to illustrate unique solutions. He also lists "(b) $\infty$ sol^n" and "(c) no sol^n" to categorize the outcomes when the determinant is zero. The lecture concludes with a "Thanks for watching" screen.

The lecture bridges algebraic manipulation and matrix theory. By deriving $x = A^{-1}b$ and categorizing solutions based on the determinant, it provides a clear framework for solving linear systems. The distinction between invertible and non-invertible matrices is central to understanding when a unique solution exists versus when the system is inconsistent or dependent.

Loading lesson…