SRINIVAS UNIVERSITY

SEMINAR REPORT
ON
“JACOBIAN MATRIX”
A Dissertation Submitted to Srinivas University, Mangalore. In The Partial
Fulfilment of The Requirements for The Award of Degree Of

B. TECH
For The Academic Year
2023

SUBMITTED BY
PAULSON K C
1SU20CV011

GUIDED BY
MRS. SHILPA S
Assistant professor,
Department Of Civil Engineering
SRINIVAS UNIVERSITY
Mukka, Mangalore.
 DEPARTMENT OF CIVIL ENGINEERING

CERTIFICATE
This is to certify that the technical seminar entitled
“JACOBIAN MATRIX”
has been carried out by
Mr. PAULSON K C bearing USN:1SU20CV011, a Bonafede student
of SRINIVAS UNIVERSITY, COLLEGE OF ENGINEERING AND
TECHNOLOGY, MUKKA in partial fulfilment of requirements for the
award of the degree of BACHELOR OF TECHNOLOGY in CIVIL
ENGINEERING of the Srinivas University, Mangalore during the year
2023. It is certified that all corrections/suggestions indicated for internal
assessment have been incorporated in the report and deposited in the
departmental library. The report has been approved as it satisfies the
academic requirements in respect of Technical Seminar prescribed for the
said Degree.

-----------------------------
Mrs. SHILPA S
Assistant professor,
(Guide)
Dept. of Civil Engineering
CONTENTS
INTRODUCTION
JACOBIAN MATRIX
JACOBIAN DETERMINANT
JACOBIAN EXAMPLE
JACOBI ITERATIVE METHOD
JACOBIAN METHOD IN MATRIX FORM
CONCLUSION
REFERENCES
INTRODUCTION

Jacobian matrix is a matrix of partial derivatives. Jacobian is the determinant of the jacobian
matrix. The matrix will contain all partial derivatives of a vector function. The main use of
Jacobian is found in the transformation of coordinates. It deals with the concept of
differentiation with coordinate transformation. In this article, let us discuss what is a jacobian
matrix, determinants, and examples in detail.The term “Jacobian” often represents both the
jacobian matrix and determinants, which is defined for the finite number of function with the
same number of variables. Here, each row consists of the first partial derivative of the same
function, with respect to the variables. The jacobian matrix can be of any form. It may be a
square matrix (number of rows and columns are equal) or the rectangular matrix(the number
of rows and columns are not equal).Many numerical methods for solving nonlinear integro-
differential.
JACOBIAN MATRIX

Jacobian Determinant

In a jacobian matrix, if m = n = 2, and the function f: ℝ3 → ℝ, is defined as:

Function, f (x, y) = (u (x, y), v (x, y))
Hence, the jacobian matrix is written as:

Therefore, the determinant of a jacobian matrix is

Polar and Spherical Cartesian Transformation
For a normal cartesian to polar transformation, the equation can be written as:
x = r cos θ
y = r sin θ
The jacobian determinant is written as:

Using these partial differentiation on the polar equations we get,

Jacobian Example

Question: Let x (u, v) = u2 – v2 , y (u, v) = 2 uv. Find the jacobian J (u, v).
Solution:
Given: x (u, v) = u2 – v2
y (u, v) = 2 uv
We know that,

Therefore, J (u, v) is 4u2 + 4v2

Stay tuned with BYJU’S – The Learning App to learn all the important Maths-related
concepts.
Jacobi Iterative Method
The first iterative technique is called the Jacobi method, named after Carl Gustav Jacob
Jacobi (1804–1851) to solve the system of linear equations. This method makes two
assumptions:
Assumption 1: The given system of equations has a unique solution.

Assumption 2: The coefficient matrix A has no zeros on its main diagonal, namely, a11, a22,
…, ann, are non-zeros
If any of the diagonal entries a11, a22,…, ann are zero, then we should interchange the rows
or columns to obtain a coefficient matrix that has nonzero entries on the main diagonal.
Follow the steps given below to get the solution of a given system of equations.
Step 1: In this method, we must solve the equations to obtain the values x1, x2,…. xn.
To get the value of x1, solve the first equation using the formula given below:

To get the value of x2, solve the second equation using the formulas as:

Similarly, to find the value of xn, solve the nth equation.

Step 2: Now, we have to make the initial guess of the solution as:

Step 3: Substitute the values obtained in the previous step in equation (1), i.e., into the right
hand side the of the rewritten equations in step (1) to obtain the first approximation as:

Step 4: In the same way as done in the previous step, compute

Jacobian Method in Matrix Form
Let the n system of linear equations be Ax = b.
Here,

Let us decompose matrix A into a diagonal component D and remainder R such that A = D +
R.

Iteratively the solution will be obtained using the below equation.

x(k+1) = D-1(b – Rx(k))
Here,
xk = kth iteration or approximation of x
x(k+1) = Next iteration of xk or (k+1)th iteration of x
The formula for the element-based method is given as
CONCLUSION

If the Jacobian matrix is a square matrix, then the number of rows and columns is same, thus
it can be written as m = n, then f is a function from ℝn to itself. From the Jacobian matrix, we
can form a determinant, known as the Jacobian determinant.It's clear overall that the sorting
step in Jacobi's Algorithm causes the matrix to converge on a diagonal in less iterations. But
the reason we looked at the sorting step was that it can be slow for large matrices; after all,
you have to go through all of the off-diagonal entries and find which one is largest. However,
the iterations of the Jacobi Algorithm saved by the sorting step take time to process also.
Since the sorting step significantly reduces the number of iterations of Jacobi's Algorithm
needed to achieve a diagonal, it's clear that it's pretty useful. And it makes sense; by
systematically applying Jacobi's algorithm to the off-diagonal elements furthest from zero,
you're going to get all of the offdiagonal elements to approach zero the fastest.
 REFERENCES

 T. M. Apostol. Calculus (Volume II). John Wiley & Sons, Inc., 1969.
 A. E. Taylor. The differential: Nineteenth and twentieth century developments. Arch.
Hist.Exact Sci., 12:355–383, 1974.
 A. N. Michel and C. J. Herget. Applied Algebra and Functional Analysis. Dover
Publications,Inc., 1981.
 J. M. Ortega and W. C. Rheinboldt. Iterative Solution of Nonlinear Equations in Several
Variables. Academic Press, New York, NY, 1970.
 D. Margetis, M. Aziz, and H. Stone. Continuum approach to profile scaling in
nanostructuredecay. Phys.Rev.B, 71:165432, 2005.
 [30] D. Margetis, P. Fok, M. Aziz, and H. Stone. Continuum theory of nanostructure
decay via amicroscale condition. Submitted for review.
 [31] M. Z. Bazant, K. T. Chu, and B. J. Bayly. Current-voltage relations for
electrochemical thinfilms. SIAM J. Appl. Math., 65:1463–1484, 2005.