0% found this document useful (0 votes)
2 views9 pages

Triangular Pyramid Geometry Explained

Uploaded by

hulk54495
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views9 pages

Triangular Pyramid Geometry Explained

Uploaded by

hulk54495
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

TABLE OF CONTENTS

CONTENTS

[Link]
2. Review of literature
3. Aim & Objective
4. Material and methods
5. Result and Discussion
6. Conclusion
7. Reference

INTRODUCTION:
A triangular pyramid is a three-dimensional shape made up of four
two-dimensional triangles. But what do two-dimensional and three-
dimensional mean?

Two-dimensional (or 2-D) shapes are flat. They are called two-dimensional
because they only have two dimensions: a length and a width. A drawing of
a triangle on paper is a two-dimensional shape.

A pyramid is a three-dimensional shape. A pyramid has a polygonal base

and flat triangular faces, which join at a common point called the apex. A

pyramid is formed by connecting the bases to an apex. Each edge of the

base is connected to the apex, and forms the triangular face, called the
lateral face. If a pyramid has an n-sided base, then it has n+1 faces, n+1

vertices, and 2n edges.

Triangular pyramids are also called tetrahedrons .

In geometry, certain vocabulary is used to describe the features of 3-D


shapes. The triangles attached to the base of the pyramid are called faces.
The point where they meet above the base is the apex, and the distance from
the apex straight down to the base is the height. The slant height refers to
the length of the side of the faces. The apothem is the height of the base
triangle. The base length is, of course, the length of the base.

USEFUL FORMULAS FOR TRIANGULAR PYRAMIDS

Formulas can be used to find the base area, surface area, and volume of a
triangular pyramid. For the following formulas, B = base length, S = slant
height, A = apothem length, and H = height.

The base area is exactly what it sounds like: the area of the base. It can be
found with the formula:

𝐵𝑎𝑠𝑒 𝑎𝑟𝑒𝑎=𝐴⋅𝐵2
TRIANGULAR PYRAMID
If the base of the pyramid is in a triangular shape (base with 3 sides), then

the pyramid is called a triangular pyramid. As the triangle has 3 sides, then

the triangular pyramid has the following properties:

No. of Faces = (3+1) = 4

[Link] Vertices: (3+1) = 4

No. of Edges: 2(3) = 6

REGULAR VS IRREGULAR PYRAMID


To distinguish between regular and irregular Pyramid, you need to consider
the shape of the base. If the base of a polygon is regular, it is labelled as
Regular Pyramid, else it is considered as Irregular Pyramid. The figure given
below illustrates the regular pyramid and an irregular pyramid.

Pyramid Formulas
The standard formula to find the surface area and the volume of the
pyramid are given as follows:

The total surface area of a pyramid is the sum of the base area and half
the product of the base perimeter and the slant height.

Thus,

The Total Surface Area of Pyramid = (½)Pl +B square units

Where,

“P” is the perimeter of the base

“l” is the slant height

“B” is the base area.

The general form to find the volume of the pyramid is one-third of the base
area and the height of the pyramid.

Thus,

The volume of the pyramid = (⅓)×(Base Area)×(Height) Cubic units


AIM & OBJECTIVE OF TRIANGLE PYRAMID
MATERIAL & METHODS OF TRIANGLE

CROUT’S METHODS
U decomposition method is also known as matrix factorization or Crout's
reduction method. Let the coefficient matrix A be written as A = LU, where L
and U are the lower and upper triangular matrices respectively.

JACOBI METHOD

Jacobian method or Jacobi method is one the iterative methods for


approximating the solution of a system of n linear equations in n variables.
The Jacobi iterative method is considered as an iterative algorithm which is
used for determining the solutions for the system of linear equations in
numerical linear algebra, which is diagonally dominant. In this method, an
approximate value is filled in for each diagonal element. Until it converges,
the process is iterated. This algorithm was first called the Jacobi
transformation process of matrix diagonalization. Jacobi Method is also
known as the simultaneous displacement method.

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 x 1,
x2,…. xn.

To get the value of x1, solve the first equation using the formula given below:

𝑥1=1𝑎11(𝑏1−𝑎12𝑥2−𝑎13𝑥3−…−𝑎1𝑛𝑥𝑛)…..(1)

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

𝑥2=1𝑎22(𝑏2−𝑎21𝑥2−𝑎23𝑥3−…−𝑎2𝑛𝑥𝑛)……(2)

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

𝑥𝑛=1𝑎𝑛𝑛(𝑏𝑛−𝑎𝑛1𝑥2−𝑎𝑛2𝑥3−…−𝑎𝑛,𝑛−1𝑥𝑛−1)……(𝑛)

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

𝑥(0)=(𝑥1(0),𝑥2(0),𝑥3(0),…,𝑥𝑛(0))

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:

(𝑥1(1),𝑥2(1),𝑥3(1),…,𝑥𝑛(1))

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

𝑥𝑘=(𝑥1(𝑘),𝑥2(𝑘),𝑥3(𝑘),…,𝑥𝑛(𝑘)); 𝑘=1,2,3….

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

A triangle has three sides, three vertices, and three angles. The

sum of the three interior angles of a triangle is always 180°. The

sum of the length of two sides of a triangle is always greater than

the length of the third side. f two angles of a triangle have


measures equal to the measures of two angles of another

triangle, then the triangles are similar. They are one of the first

shapes studied in geometry. Triangles are particularly important

because arbitrary polygons (with 4, 5, 6, or n sides) can be

decomposed into triangles. All angles of an equilateral triangle

are equal. A triangle cannot be constructed from a three-line

segment if any of them is longer than the sum of the other two.

The triangle inequality theorem states that any side of a triangle

is always shorter than the sum of the other two sides. how the

triangle is co A triangle has three sides, three vertices, and three

angles. The sum of the three interior angles of a triangle is always

180°. The sum of the length of two sides of a triangle is always

greater than the length of the third side Instructed.

REFERENCE

Belly Ndayikeza

You might also like