Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Part A Answers

    Uploaded by

    pv.vijayavani20
    The document contains solutions to 10 problems involving numerical methods like Gauss elimination, Simpson's rule, Newton-Raphson method, and divided difference tables. Key steps and formulas are provided for concepts like Gauss elimination, Simpson's 1/3 rule, Newton-Raphson method, and Newton's forward and backward difference formulas.

    Copyright:

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

    Part A Answers

    Uploaded by

    pv.vijayavani20
    13 views2 pages
    The document contains solutions to 10 problems involving numerical methods like Gauss elimination, Simpson's rule, Newton-Raphson method, and divided difference tables. Key steps and formulas are provided for concepts like Gauss elimination, Simpson's 1/3 rule, Newton-Raphson method, and Newton's forward and backward difference formulas.

    Original Description:

    a

    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 contains solutions to 10 problems involving numerical methods like Gauss elimination, Simpson's rule, Newton-Raphson method, and divided difference tables. Key steps and formulas are provided for concepts like Gauss elimination, Simpson's 1/3 rule, Newton-Raphson method, and Newton's forward and backward difference formulas.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views2 pages

    Part A Answers

    Uploaded by

    pv.vijayavani20
    The document contains solutions to 10 problems involving numerical methods like Gauss elimination, Simpson's rule, Newton-Raphson method, and divided difference tables. Key steps and formulas are provided for concepts like Gauss elimination, Simpson's 1/3 rule, Newton-Raphson method, and Newton's forward and backward difference formulas.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    PART A Answers

    1. Explain the steps involved in Gauss Elimination method.


    Sol:
    1. Write the given system of equation as augmented matrix form.
    2. Make the matrix as upper triangular matrix.
    3. By using backward subtitution method write the solution of unknown variables.
    2. Compare Gauss Jordan and Elimination method.
    Sol:
    Gauss Jordan Gauss Elimination
    1. In Gauss Jordan method, the In Gauss elimination method , the given
    given matrix is transformed matrix is transformed into upper
    into unit matrix triangular matrix.
    2. No need back substitution Using back substitution method for final
    solution,
    3. State Simpson’s 1/3 rule and Trapezoidal rule.
    Sol:
    Simpson’s 1/3 rule is
    ℎ
    Y= 3 [(𝑦0 + 𝑦𝑛 ) + 4(𝑦1 + 𝑦3 + 𝑦5 + ⋯ . . ) + 2(𝑦2 + 𝑦4 + ⋯ . . )]

    Trapezoidal rule is
    ℎ
    Y= 2 [(𝑦0 + 𝑦𝑛 ) + 2(𝑦1 + 𝑦2 + 𝑦3 + 𝑦4 + 𝑦5 + ⋯ … )]

    4. 1
    If 𝑓(𝑥) = 𝑥 , 𝑓𝑖𝑛𝑑 𝑓(𝑎, 𝑏, 𝑐, 𝑑).
    Sol:
    1 1 1 −1
    𝑓(𝑥) = , 𝑓(𝑎) = , 𝑓(𝑏) = 𝑓(𝑎, 𝑏) = ,
    𝑥 𝑎 𝑏 𝑎𝑏
    1 −1
    𝑓(𝑎, 𝑏, 𝑐) = 𝑎𝑏𝑐 , 𝑓(𝑎, 𝑏, 𝑐, 𝑑) = 𝑎𝑏𝑐𝑑.

    5. 6 𝑑𝑥
    Evaluate ∫0 1+𝑥 usingSimpson’s rule by dividing the range into 6 subdivisions.
    Sol:
    ℎ
    Y= 3 [(𝑦0 + 𝑦𝑛 ) + 2(𝑦2 + 𝑦4 +. . . . . ) + 4(𝑦1 + 𝑦3 +. . . . . )]
    x 0 1 2 3 4 5 6
    y 1 1/2 1/3 1/4 1/5 1/6 1/7
    Y=1.9661
    6. Establish the formula to calculate the square root of any positive number N using Newton
    Raphson method.
    Sol:
    𝐿𝑒𝑡 𝑥 = √𝑁 , 𝑥 2 = 𝑁,
    𝑓(𝑥) = 𝑥 2 − 𝑁; 𝑓 ′ (𝑥) = 2𝑥
    1 𝑁
    By Newton’s algorithm 𝑥𝑛+1 = 2 (𝑥𝑛 + 𝑥 )
    𝑛
    7. Why Gauss – Seidel method is better than Gauss-Jacobi method?
    Sol:
    Gauss – seidal method is converges quickly to compare with Gauss-Jacobi method.
    So the number of iterations are also less.
    8. State Lagrange’s formula.
    Sol:

    9. Construct the divided difference table for the following data

    X 4 6 8 10
    Y 1 3 8 16
    Sol:
    x y ∆𝑦 ∆2 𝑦 ∆3 𝑦
    4 1 2 3
    6 3 5
    8 8 8 3 0
    10 16

    ∆𝑦 = 2,5,8 , ∆2 𝑦= 3,3 and ∆3 𝑦 = 0


    10 State Newtons Forward and backward difference formula.
    Sol:
    Newtons Forward:
    𝑝(𝑝−1) 𝑝(𝑝−1)(𝑝−2) 3 𝑝(𝑝−1)(𝑝−2)(𝑝−3) 4
    𝑦 = 𝑦0 + 𝑝∆𝑦0 + 2 ∆2 𝑦0 + ∆ 𝑦0 + ∆ 𝑦0 +
    6 24
    𝑝(𝑝−1)(𝑝−2)(𝑝−3)(𝑝−4)
    ∆5 𝑦0 +……..
    120
    𝑥−𝑥0
    Where p= ℎ
    Newtons Backward:
    𝑝(𝑝+1) 𝑝(𝑝+1)(𝑝+2) 3 𝑝(𝑝+1)(𝑝+2)(𝑝+3) 4
    𝑦𝑛 + 𝑝∇𝑦𝑛 + 2 ∇2 𝑦𝑛 + ∇ 𝑦𝑛 + ∇ 𝑦𝑛 +
    6 24
    𝑝(𝑝+1)(𝑝+2)(𝑝+3)(𝑝+4)
    ∇5 𝑦𝑛
    120
    𝑥−𝑥𝑛
    Where p= ℎ

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy