SMI University

Project No: 1
Dec 6, 2024

Name | Muhammad Hassan mansoor

ID | BSE-23S-220
Department of software engineering
Section | SE4D
Subject | Linear Algebra
Q. No. 01: Write down the application of Linear System of Equations in IT with
five examples

A linear system of equations includes equations where each term is both a constant also a
product of a constant as well as a variable. These systems remain widely used in IT for solving
real-world problems, regularly through matrices also numerical methods.

1. Machine Learning and Data Science

In machine learning also data science, linear equations are fundamental to algorithms for
predictive modeling, classification, clustering. Linear systems play a critical role in techniques
like regression analysis, dimensionality reduction, neural network training.

Example: Linear Regression

Linear regression models predict outcomes by fitting a line to data points, expressed as:

Y=β0+β1X1+β2X2+⋯+βnXn
Where Y are the independent variables (features). The task is to find the coefficients
β0, β1,…, βn that minimize the error between the predicted as well as actual values.

System of Equations:
The process of finding the best-fitting line involves setting up a system of linear equations. This
is usually done by using the least squares method, where the sum of the squared differences
between the predicted then actual values is minimized.

Matrix Formulation:
For multiple linear regression, this can be represented as:

Y=Xβ
Where:
Y is the vector of observed outcomes,
X is the matrix of input features (with each row representing an example and each column
representing a feature),
β is the vector of coefficients we need to solve for.
The solution to this system is found using the normal equation:

β= (XTX) −1XTY
Example: In predicting house prices based on features like size, location, number of bedrooms,
we set up a system of linear equations where the coefficients are the factors that influence the
price, we solve for these coefficients using matrix algebra.

2. Resource Allocation in IT Systems

IT schemes often want optimized resource allocation across servers, storage systems, networks.
Linear equations remain used to model dependencies and constraints among resources.
Optimization is essential in IT, from scheduling tasks to allocating resources. Linear
programming problems, which are stated as systems of linear equations, help find the best
solutions under given constraints.

Problem Scenario:
An organization has three servers (S1, S2, S3) then needs to allocate 100 units of processing
power to manage workloads w1, w2, and w3. The distribution is theme to the following
constraints:
1. The total processing power across all three servers cannot beat 100 units:
x1+x2+x3=100
Where x1, x2, x3 characterize the processing power assigned to S1, S2, S3, respectively.
2. Server 1 must handle twice the workload of Server 2 (x1=2x2)
3. Server 3 must handle at least 20% of the total workload (x3≥0.2(x1+x2+x3))
The goal is to control the allocation of resources (x1, x2, x3) while satisfying these constraints.

Solution:
Step 1: Represent the Constraints Mathematically
From the constraints:
1. x1+x2+x3=100
2. x1=2x2
3. x3≥0.2×100=20
Substitute x1=2x2 into the first equation:
2x2+x2+x3=100⇒3x2+x3=100

Step 2: Solve the System of Equations

Let’s treat the variation x3≥20 as an edge condition then solve for the likeness case x3=20x3=20:

3x2+20=100⇒3x2=80⇒x2=80/3≈26.67
Now, calculate x1 using x1=2x2:
x1=2×26.67≈53.33
Therefore, the solution for the equivalence case is:
x1=53.33, x2=26.67, x3=20

Step 3: Verify the Solution

• Total processing power:x1+x2+x3=53.33+26.67+20=100(satisfied).
• Server 1 handles twice the workload of Server 2:

x1=2x2⇒53.33=2×26.67(satisfied).
• Server 3 handles at least 20% of the workload:
x3=20≥0.2×100=20(satisfied).
All constrictions are satisfied, so the solution is valid.

Applications of the Example in IT Systems

1. Cloud Computing: Assign virtual machine properties (CPU, memory, storage) to
guarantee optimal performance under workload constrictions.
2. Load Balancing: Allocate handling tasks through servers in a data focus to prevent
overcapacity while maintaining effectiveness.
3. Database Query Optimization: Assign processing power between database nodes to
improve query performance time.
4. Task Scheduling: Assign computing properties in multi-core processors to tasks based
on importance then constraints.
This example validates how linear algebra assistances model then solve real-world difficulties in
IT systems, ensuring effective use of resources while meeting constraints.
3. Network Flow Analysis
Now network flow problems such as defining the extreme flow or optimum routing in
communication networks, linear systems of equations are a lot employed. The network is
characterized as a graph, with nodules then edges. The flow of data or goods amid nodules is
subject to limitations like cost or capacity.
Flow Variables: The flow complete each edge in the network is represented by a variable. The
system of equations is usual based on the flow preservation principle then capacity controls
Linear System: The problem of defining the extreme flow can be expressed as a linear system.
For example, in an extreme flow problem, each edge in the network will have an attendant flow
value, then the objective is to exploit the total flow after a source node to a drop node, subject
to the constraints on the flow capacity of each edge.
Example: In a transport or communiqué network, you may have several paths linking numerous
nodes, each with a volume limit. By determining the system of equations, you can analyze the
extreme amount of data otherwise goods that can flow from a source to a purpose, ensuring
that all limitations are content.

4. Cryptography: Solving Linear Equations in Cryptanalysis

Several cryptographic processes use linear equations, breaking these codes at times includes
solving systems of linear equations. One such example is the Hill cipher, a polygraphist
conversation cipher.
Hill Cipher: The Hill cipher converts blocks of version by on behalf of each letter as an amount
also growing it by a key matrix (a square matrix of size n). The encryption technique is:

C=K⋅P
Where:
C is the cipher text,
K is the key matrix,
P is the plaintext vector.
Decryption: To decrypt, you want to inverse the matrix K (if it is invertible), now multiply by the
cipher text C. Explanation the system of linear equations, by detection the inverse of K, is an
example of how linear systems are used in cryptography.
Example: Supposing you receive the cipher text in the procedure of numbers, then you see the
encryption key matrix. Explanation the system of linear equations, by computing the inverse of
the key matrix, will provide you the plaintext (original message). If the key matrix is not
invertible, the system cannot be answered directly, which can be a softness in the cipher.

5. Optimization: Linear Programming

Linear programming (LP) is a mathematical technique used for optimization, somewhere the
objective is to maximize or minimalize a linear function focus to linear equality then inequality
constraints. Linear systems of equations form the foundation of LP problems.
Formulation: In an LP problem, you frequently have a linear objective function (e.g., maximize
profit or minimalize cost) then constraints represented by linear equations or inequalities.

Maximize Z=c1x1+c2x2+⋯+cnxn
Subject to:
Ax ≤ b
Where:
X is the vector of variables,
A is the matrix of coefficients,
B is the vector of constraints,
c1,c,,…,cn are the coefficients of the objective function.
Solution: Solving this system of linear equations (using methods like Simplex or Interior-Point
Methods) allows you to find the optimal values of the decision variables x1,x2,…,xn
Example: In a supply chain management scenario, you might want to minimalize transportation
costs while consultation demand at different warehouses. By formulating the problem as a
linear programming prototypical, you can solve the system of equations to determine the
optimal transport plan.

Conclusion
Linear systems of equations continue vital to some IT fields, including computer graphics,
machine learning, network analysis, cryptography, as well as optimization. By representative
complex relations between variables also controls, LSEs agree for well-organized computation
of explanations that power algorithms in these zones. Whether it's adapting 3D objects,
predicting outcomes in machine learning models, enhancing resource distribution in networks,
or solving cryptographic codes, linear systems are essential to recent IT problem-solving
techniques.

Q. No. 02: Write down the application of Linear Algebra in Computer

Science (CS)/ Software Engineering (SE) with five examples.

Linear Algebra is a foundational mathematical tool used extensively in Software Engineering

(SE). It helps solve problems related to data representation, transformations, optimizations, and
more, by leveraging operations on vectors and matrices. Here are five important applications of
Linear Algebra in these fields

1. Computer Graphics: 3D Transformations

In computer graphics, linear systems are used to model then solve geometric transformations
of 3D objects, including scaling, rotation, also translation. These transformations are normally
represented as matrices, then when combined, they form systems of linear equations.

Transformation Matrix:

A 3D object is represented by coordinates in space (x, y, z). When performing a transformation,

we apply a transformation matrix to these coordinates. For example, a scaling matrix might
multiply the x, y, and z coordinates by a scaling factor.

Example 1: Transformations in 3D Graphics

In 3D modeling, to rotate or scale an object, linear transformations are applied using matrices.
For instance:

X’ a11 a12 a13 x

Y’ = a21 a22 a23 y
Z’ a31 a32 a33 z
2. Artificial Intelligence then Machine Learning
Linear algebra forms the basis of several machine learning algorithms, providing implements to
work datasets, enhance models, development high-dimensional data.

Examples in Machine Learning

Neural Networks: The weights then preferences of a neural network are characterized as
matrices, onward spread involves matrix multiplications:

Output=W⋅X+b, where W is the weight matrix, X is the input, and b is the vector.

Dimensionality Reduction: Methods like Principal Component Analysis (PCA) use

eigenvalues then eigenvectors to reduce high-dimensional data into lower dimensions,
preservative the most critical info.

Clustering then Classification: Algorithms such as k-means then support vector machines
use vector then matrix operations to piece data then identify patterns.

Applications in SE
Building AI models for image, speech recognition.
Recommender methods (e.g., Netflix, Amazon).
Predictive analytics in healthcare, finance, marketing.

3. Game Physics Engines

Physics engines used in gaming then simulation rely heavily on linear algebra for simulating
forces, object movements, collisions,

Examples in Game Physics

• Rigid Body Dynamics: The position also velocity of game objects are designed using vector
equations, transformations like rotations are applied using matrices.
• Collision Detection: Defining whether two objects in a game strike involves solving equations
derived from their regular properties.
• Constraint Solvers: Linear algebra make sure that objects associated by constraints (e.g., a
chain or a hinged door) behave realistically.
Applications in SE
• Developing realistic game mechanics (e.g., FIFA, GTA).
• Virtual reality also augmented reality models.
•Engineering software for robotics or mechanical simulations.

4. Signal and Image Processing

Linear algebra is serious in the analysis as well as manipulation of signals (audio, video, images)
for applications such as filtering, compression, then enhancement.

Examples in Signal Processing

• Fourier Transforms: Representing signals in the frequency domain includes matrix
computations.
• Image Compression: Algorithms like JPEG usage Singular Value Decomposition (SVD), a linear
algebra method, to reduce image sizes while maintaining quality.
• Filtering: Matrices characterize filters applied to improve images or remove noise.

Applications in SE
• Software for digital image editing (e.g., Photoshop, GIMP).
• Audio processing tools (e.g., Audacity, Pro Tools).
• Video streaming platforms (e.g., Netflix) that compress video files efficiently.

5. Operations Research and Optimization

Optimization problems are at the core of software systems that essential to assign schedule
tasks, resources, or discovery the most effective solutions to complex problems. Linear algebra
provides methods to solve these problems efficiently.

Examples in Optimization
• Linear Programming: Used in resource allocation, scheduling problems. The optimization of a
linear objective task with constraints is represented using matrix equations.
• Gradient Descent: A method used in machine learning other optimization tasks involves
computing gradients (vectors) to minimalize error functions.
• Graph Theory: Adjacency matrices are used to represent analyze networks, such as social
networks, transport systems, or supply chains.

Applications in SE
• Scheduling algorithms for cloud computing.
• Logistics and supply chain management software.
• Financial modeling tools for portfolio optimization.

Conclusion
Linear Algebra is an influential mathematical tool in both Software Engineering, allowing
solutions to problems in graphics, machine learning, network theory, optimization,
cryptography. It facilitates efficient algorithms systems in these areas, allowing for data
manipulation, optimization, security in ways that would not be possible without it
Q. No. 03: Write down only four pages in your own words very precisely about
the history of Linear Algebra specifying the contribution of Rene Descartes in
Linear Algebra.

History of Linear Algebra then the Contribution of René

Descartes

Linear algebra, as a branch of mathematics, deals with the study of vectors, linear
transformations, vector spaces, systems of linear equations. Its foundations are carefully tied to
the development of geometry, matrix theory, then systems of equations. The history of linear
algebra spans several times, with contributions from many mathematicians. Among them, René
Descartes stands out for his initial role in linking algebra with geometry, an achievement that
has had long-term impacts on linear algebra as we know it today. Descartes’ revolutions
method for the validation of methods that are essential for modern linear algebra.

Background: Early History of Linear Algebra

The development of linear algebra can be sketched back to the ancient civilizations of
Babylonians then Egyptians, who solved practical problems such as dividing land or distributing
resources, involving simple systems of equations. However, these early methods were not yet
formalized into the modern framework of linear algebra.

By the 16th also 17th centuries, mathematicians began to formalize the study of algebra as well
as geometry. The study of systems of linear equations then methods for solving them was
already beginning to take shape. During this time, algebra became more symbolic than abstract,
while geometry remained primarily descriptive. The need for a method that could join these
two branches of mathematics grew stronger, leading to important developments that
contributed to the increase of linear algebra.

René Descartes' Contribution to Linear Algebra

René Descartes is best identified for his offerings to philosophy as well as mathematics, mostly
for developed the Cartesian coordinate system, which usages algebra to describe geometry.
Descartes’ effort in analytical geometry was vital in formalizing the joining between algebra in
addition geometry, a joining that is central to the methods used in linear algebra currently.
1. Introduction of the Cartesian coordinate system
Before Descartes, mathematics was mostly confined to geometry then algebra as discrete
fields. Descartes' key origination was to apply algebraic equations to define geometric shapes.
The Cartesian coordinate system—announced in his work La Géométrie—was based on the
idea of representative points in a plane using two numbers (coordinates). This was an epic
breakthrough because it allowed geometric problems to be solved algebraically.
The Cartesian coordinate system announced by Descartes allowed a point in space to be
described by an well-organized pair of numbers (x,y)(x, y)(x,y) in two-dimensional space or by
triplets (x,y,z)(x, y, z)(x,y,z) in three-dimensional space. This system allowed geometric natures
such as lines, circles, curves to be represented algebraically, making it possible to use algebraic
methods to solve geometric problems. Thus, Descartes' system of coordinates placed the
groundwork for solving systems of linear equations algebraically.

2. Systems of Linear Equations then Geometrical Interpretation

Descartes' work was critical in changing how mathematicians believed about then solved
systems of linear equations. A system of equations, such as two lines intersecting, could be
characterized geometrically as the intersection of two straight lines. Descartes made it possible
to solve for the intersection points algebraically by transforming the geometric problem into an
algebraic one.
For example, consider the system of two linear equations:
ax+by=c , dx + ey = f

Instead of seeing these as two lines geometrically, Descartes introduced the idea of solving
those algebraically using algebraic methods to find the values of x and y that satisfy both
equations. This process marked a significant shift from purely geometric thought to an algebraic
approach.
The geometrical interpretation of solving a system of linear equations placed the foundation
for later developments in linear algebra, mainly vector spaces, matrix representations, matrix
operations.

3. The Theory of Linear Equations in the Cartesian plane

The ability to represent lines, planes, other geometric objects algebraically released the door to
more innovative applications. By using the coordinate system, Descartes might desire linear
equations as objects in the Cartesian plane. For example, the slope-intercept form of a line,
y=mx+by = mx + by=mx+b, openly linked the concept of a line to an algebraic equation, which
was a crucial step near the growth of more classy methods in linear algebra.
Descartes' algebraic method to geometry was active in the later development of vector spaces
also matrices, as it provided a real way of viewing geometric shapes their relationships
algebraically.

4. Matrix Theory also Linear Transformations

While Descartes did not use matrices in the present sense, his work located the theoretical
groundwork for their later development. The matrix is a mathematical object used to represent
solve systems of linear equations define linear transformations among vector spaces.
Descartes' advance in treating regular objects algebraically was thoughtful for the validation of
matrix theory.
In current linear algebra, linear transformations are unspoken as processes that plot one vector
space to a different. The matrix is used to characterize these alterations, processes on matrices
agree to conversions in geometric space. The study of matrix operations, such as
multiplication, addition, inversion, is important to solving systems of linear equations.

Further Developments in Linear Algebra

Following Descartes’ offerings, some mathematicians completed significant progresses that
formalized the field of linear algebra:

Carl Friedrich Gauss: In the 19th century, Gauss documented the Gaussian elimination
method on behalf of explanation systems of linear equations. His work facilitated validate the
technique of solving linear systems, which would future be vital in the growth of matrix theory.

Arthur Cayley: Cayley more progressive matrix theory too announced the idea of the matrix
inverse, a thought vital to linear algebra.

Conclusion
René Descartes' work in analytical geometry was the foundation of modern linear algebra. By
announcing the Cartesian coordinate system algebraically expressive geometric natures,
Descartes changed the way mathematics was complete. His innovations allowed systems of
linear equations to be resolved algebraically, which later achieved to the development of
matrices, linear transformations, as well as vector spaces.
Though Descartes did not effort directly with the theories of vector spaces or matrices, his
foundational thoughts were vital for these later developments. His donation remains to shape
the study then application of linear algebra in fields reaching from physics then engineering to
economics also computer science. Descartes’ involvement to the history of linear algebra
remains a important innovative in the evolution of modern mathematics.