{"id":7250,"date":"2026-01-20T09:48:35","date_gmt":"2026-01-20T02:48:35","guid":{"rendered":"https:\/\/istiarto.staff.ugm.ac.id\/?page_id=7250"},"modified":"2026-06-18T10:55:39","modified_gmt":"2026-06-18T03:55:39","slug":"numerical-methods","status":"publish","type":"page","link":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/kuliah\/sarjana-s1\/numerical-methods\/","title":{"rendered":"Numerical Methods"},"content":{"rendered":"\r\n<p class=\"wp-block-paragraph\">Numerical Methods is a course subject in the IUP\u2019s Civil Engineering. It is a 2-credit compulsory subject in the fourth semester. The subject covers the following topics.<\/p>\r\n<ol>\r\n<li>Introduction\r\n<ol>\r\n<li>Mathematics in civil engineering<\/li>\r\n<li>Spreadsheet, computer programs<\/li>\r\n<li>Approximations and round-off errors<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Roots of equations\r\n<ol>\r\n<li>Graphical methods<\/li>\r\n<li>The bisection methods<\/li>\r\n<li>The false-position methods<\/li>\r\n<li>Simple fixed-point iteration<\/li>\r\n<li>The Newton-Raphson method<\/li>\r\n<li>The secant method<\/li>\r\n<li>Multiple roots<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Linear algebraic equations\r\n<ol>\r\n<li>The graphical method<\/li>\r\n<li>Cramer&#8217;s rule<\/li>\r\n<li>Elimination of unknowns<\/li>\r\n<li>Naive Gauss elimination<\/li>\r\n<li>Gauss-Jordan<\/li>\r\n<li><em>LU<\/em> decomposition<\/li>\r\n<li>The matrix inverse<\/li>\r\n<li>Jacobi<\/li>\r\n<li>Gauss-Seidel<\/li>\r\n<li>Successive over-\/under-relaxation<\/li>\r\n<li>Tri-diagonal matrix, Thomas algorithm<\/li>\r\n<li>Symmetric matrix, Cholesky decomposition<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Curve fitting\r\n<ol>\r\n<li>Least-squares regression<\/li>\r\n<li>Interpolation<\/li>\r\n<li>Fourier approximation<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Numerical differentiation and integration\r\n<ol>\r\n<li>The trapezoidal rule<\/li>\r\n<li>Simpson&#8217;s rule<\/li>\r\n<li>Gauss quadrature<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Ordinary differential equations (initial-value problems)\r\n<ol>\r\n<li>Euler&#8217;s method<\/li>\r\n<li>Heun&#8217;s method<\/li>\r\n<li>The midpoint (improved polygon) method<\/li>\r\n<li>Runge-Kutta methods<\/li>\r\n<li>Stiffness<\/li>\r\n<li>Multistep methods<\/li>\r\n<\/ol>\r\n<\/li>\r\n<li>Introduction to the finite difference approximation (boundary-value problems)\r\n<ol>\r\n<li>Boundary-value problems<\/li>\r\n<li>Eigenvalue problems<\/li>\r\n<\/ol>\r\n<\/li>\r\n<\/ol>\r\n<h2>Reference<\/h2>\r\n<p>Chapra, S.C., Canale, R.P., 2015, <em>Numerical Methods for Engineers<\/em>, 7th Ed., McGraw-Hill Book Co., New York.<\/p>\r\n<h2>Weekly Agenda<\/h2>\r\n\r\n<figure class=\"wp-block-table is-style-regular\">\r\n<table>\r\n<thead>\r\n<tr>\r\n<td><strong>Week#<\/strong><\/td>\r\n<td><strong>Subject<\/strong><\/td>\r\n<td><span style=\"color: #000000\"><b>Description<\/b><\/span><\/td>\r\n<\/tr>\r\n<\/thead>\r\n<tbody>\r\n<tr>\r\n<td>1<\/td>\r\n<td>Introduction<\/td>\r\n<td>\r\n<ul>\r\n<li>Course description<\/li>\r\n<li>Mathematics in civil engineering<\/li>\r\n<li>Spreadsheet and computer programs<\/li>\r\n<li>Approximation and round-off errors<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>2<\/td>\r\n<td>Roots of equations (1\/2)<\/td>\r\n<td>\r\n<ul>\r\n<li>Graphical methods<\/li>\r\n<li>The bisection methods<\/li>\r\n<li>The false-position methods<\/li>\r\n<li>Simple fixed-point iteration<\/li>\r\n<li>The Newton-Raphson method<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>3<\/td>\r\n<td>Roots of equations (2\/2)<\/td>\r\n<td>\r\n<ul>\r\n<li>The secant method<\/li>\r\n<li>Multiple roots<\/li>\r\n<li><span style=\"color: #ff0000\">Exercise #1: roots of equations<\/span><\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>4<\/td>\r\n<td>Linear algebraic equations (1\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>Gauss elimination<\/li>\r\n<li>Gauss-Jordan<\/li>\r\n<li>LU decomposition<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>5<\/td>\r\n<td>Linear algebraic equations (2\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>The matrix inverse<\/li>\r\n<li>Jacobi<\/li>\r\n<li>Gauss-Seidel<\/li>\r\n<li>Successive over-\/under-relaxation<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>6<\/td>\r\n<td>Linear algebraic equations (3\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>Tri-diagonal matrix, Thomas algorithm<\/li>\r\n<li>Symmetric matrix, Cholesky decomposition<\/li>\r\n<li><span style=\"color: #ff0000\">Exercise #2: linear algebraic equations<\/span><\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>7<\/td>\r\n<td>Regression<\/td>\r\n<td>\r\n<ul>\r\n<li>Polynomial regression<\/li>\r\n<li>Multivariable regression<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>8<\/td>\r\n<td colspan=\"2\"><span style=\"color: #ff0000\"><strong>Midterm exam<\/strong><\/span><\/td>\r\n<\/tr>\r\n<tr>\r\n<td>9<\/td>\r\n<td>Interpolation<\/td>\r\n<td>\r\n<ul>\r\n<li>Newton interpolation method<\/li>\r\n<li>Lagrange interpolation method<\/li>\r\n<li>Fourier approximation<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>10<\/td>\r\n<td>Numerical differentiation and integration (1\/2)<\/td>\r\n<td>\r\n<ul>\r\n<li>The trapezoidal rule<\/li>\r\n<li>Simpson&#8217;s rule<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>11<\/td>\r\n<td>Numerical differentiation and integration (2\/2)<\/td>\r\n<td>\r\n<ul>\r\n<li>Gauss quadrature<\/li>\r\n<li><span style=\"color: #ff0000\">Exercise #3: interpolation, numerical differentiation and integration<\/span><\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>12<\/td>\r\n<td>Initial-value problems (1\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>Euler&#8217;s method<\/li>\r\n<li>Heun&#8217;s method<\/li>\r\n<li>The midpoint (improved polygon) method<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>13<\/td>\r\n<td>Initial-value problems (2\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>Runge-Kutta methods<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>14<\/td>\r\n<td>Initial-value problems (3\/3)<\/td>\r\n<td>\r\n<ul>\r\n<li>Stiffness<\/li>\r\n<li>Multistep methods<\/li>\r\n<li><span style=\"color: #ff0000\">Exercise #4: initial-value problems<\/span><\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>15<\/td>\r\n<td>Boundary-value problems<\/td>\r\n<td>\r\n<ul>\r\n<li>Introduction to FDA<\/li>\r\n<li>Eigenvalue problems<\/li>\r\n<\/ul>\r\n<\/td>\r\n<\/tr>\r\n<tr>\r\n<td>16<\/td>\r\n<td colspan=\"2\"><strong><span style=\"color: #ff0000\">Final exam<\/span><\/strong><\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<\/figure>\r\n<h2>Lecture Notes<\/h2>\r\n<p><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/NM00_Course_Description-1.pdf\">NM00_Course_Description<\/a><br \/><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/NM01_Math_and_Civil_Eng.pdf\">NM01_Math_and_Civil_Eng<\/a><br \/><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/NM02_Roots_of_Equations-1.pdf\">NM02_Roots_of_Equations<\/a><br \/><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/NM03_Linear_Algebraic_Equations-1.pdf\">NM03_Linear_Algebraic_Equations<\/a><br \/><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/NM04_Curve_Fitting.pdf\">NM04_Curve_Fitting<\/a><\/p>\r\n<h2>Exams<\/h2>\r\n<p><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/Soal_UTS_Numerical_Methods_2026_IUP.pdf\">Soal_UTS_Numerical_Methods_2026_IUP<\/a><br \/><a href=\"https:\/\/istiarto.staff.ugm.ac.id\/files\/Soal_UAS_Numerical_Methods_2026_IUP.pdf\">Soal_UAS_Numerical_Methods_2026_IUP<\/a><\/p>","protected":false},"excerpt":{"rendered":"<p>Numerical Methods is a course subject in the IUP\u2019s Civil Engineering. It is a 2-credit compulsory subject in the fourth semester. The subject covers the following topics. Introduction Mathematics in civil engineering Spreadsheet, computer programs Approximations and round-off errors Roots &hellip; <a href=\"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/kuliah\/sarjana-s1\/numerical-methods\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":71,"featured_media":0,"parent":2999,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-7250","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/pages\/7250","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/users\/71"}],"replies":[{"embeddable":true,"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/comments?post=7250"}],"version-history":[{"count":38,"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/pages\/7250\/revisions"}],"predecessor-version":[{"id":7442,"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/pages\/7250\/revisions\/7442"}],"up":[{"embeddable":true,"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/pages\/2999"}],"wp:attachment":[{"href":"https:\/\/istiarto.staff.ugm.ac.id\/index.php\/wp-json\/wp\/v2\/media?parent=7250"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}