Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    November 3, 2009 Not For Submission: Indian Institute of Technology Kanpur Department of Mechanical Engineering

    Uploaded by

    anpyaa
    The document outlines 9 numerical methods problems involving solving differential equations using Euler's method, modified Euler method, and Runge-Kutta 4th order method. It also involves using modified Adams' method, Trapezoidal rule, Simpson's 1/3 rule, Richardson method, Gauss-Legendre quadrature, maximum pivot strategy, Jacobi iteration method, Gauss-Seidel method, condition for convergence, Cholesky decomposition, and solving a system of linear equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    November 3, 2009 Not For Submission: Indian Institute of Technology Kanpur Department of Mechanical Engineering

    Uploaded by

    anpyaa
    16 views1 page
    The document outlines 9 numerical methods problems involving solving differential equations using Euler's method, modified Euler method, and Runge-Kutta 4th order method. It also involves using modified Adams' method, Trapezoidal rule, Simpson's 1/3 rule, Richardson method, Gauss-Legendre quadrature, maximum pivot strategy, Jacobi iteration method, Gauss-Seidel method, condition for convergence, Cholesky decomposition, and solving a system of linear equations.

    Original Description:

    FEM Assignment

    Original Title

    ME685_Assign4

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines 9 numerical methods problems involving solving differential equations using Euler's method, modified Euler method, and Runge-Kutta 4th order method. It also involves using modified Adams' method, Trapezoidal rule, Simpson's 1/3 rule, Richardson method, Gauss-Legendre quadrature, maximum pivot strategy, Jacobi iteration method, Gauss-Seidel method, condition for convergence, Cholesky decomposition, and solving a system of linear equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views1 page

    November 3, 2009 Not For Submission: Indian Institute of Technology Kanpur Department of Mechanical Engineering

    Uploaded by

    anpyaa
    The document outlines 9 numerical methods problems involving solving differential equations using Euler's method, modified Euler method, and Runge-Kutta 4th order method. It also involves using modified Adams' method, Trapezoidal rule, Simpson's 1/3 rule, Richardson method, Gauss-Legendre quadrature, maximum pivot strategy, Jacobi iteration method, Gauss-Seidel method, condition for convergence, Cholesky decomposition, and solving a system of linear equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    INDIAN INSTITUTE OF TECHNOLOGY KANPUR

    Department of Mechanical Engineering


    ME 685: Programming and Numerical Methods
    Assignment No : 4
    November 3, 2009
    Not for submission
    1)

    Solve

    With the initial condition y (0) =1, determine y(x=0.2, 0.4) by Euler method, modified Euler and Runge-Kutta
    4th order methods. Estimate the maximum approximate and real errors in each interval.
    2)

    In the above problem, use the values predicted by RK 4 method, apply Modified Adams method to
    determine the value of y at x=0.5. What is the error?
    to six decimal places by the

    3) Determine the step size h sufficient for computing the integral


    a) Trapezoidal rule and

    b) Simpsons 1/3 rule

    4) Compute
    1
    Using Richardson method. Evaluate the error.
    5) For 5-point Gauss-Legendre quadrature the integral of 1/x interval [1, 3]. Compare the accuracy with 6-point
    trapezoidal rule.
    6) Use maximum pivot strategy to find solution of the linear equations:
    1
    1
    3

    7)

    4
    1
    1

    1
    6
    1

    5
    12
    4

    Solve the system


    20
    2
    17
    3
    20
    18
    2
    3
    20
    25
    By Jacobi iteration method. Do five iterations. Solve also by Gauss-Siedel Method.

    8)

    Prove that the condition for convergency


    |

    9) For the matrix [A],


    8
    20
    15
    Use Cholesky decomposition to determine [L].
    If {b}T = [ 3 5 8], find the solution of [A]{x}={b}

    20
    80
    50

    15
    50
    60

    You might also like