The Gateway to Computer Science Excellence
0 votes

Match the following items

(i) Newton-Raphson (a) Integration
(ii) Runge-Kutta (b) Root finding
(iii) Gauss-Seidel (c) Ordinary Differential Equations
(iv) Simpson's Rule (d) Solution of Systems of Linear Equations
in Numerical Methods by | 906 views

3 Answers

+3 votes
Best answer
selected by
+1 vote

(i) - (b)
(ii) - (c)
(iii) - (d)
(iv) - (a)
+1 vote


==> Newton-Raphson method. it is a iterative process follows a set guideline to approximate one root, considering the function, its derivative, and an initial x-value.

The Newton-Raphson method uses an iterative process to approach one root of a function.The specific root that the process locates depends on the initial, arbitrarily chosen x-value.

and one good example is

==>Runge–Kutta methods are a family of implicit and explicit iterative methods, which include the well-known routine called the Euler Method, used in temporal discretization for the approximate solutions of ordinary differential equations

==>Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations.

==>Simpson's rule is a Newton-cotes formula for approximating the integral of a function f using quadratic polynomial

edited by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,433 answers
95,258 users