OneStopGate.Com
OnestopGate   OnestopGate
   Sunday, November 17, 2024 Login  
OnestopGate
Home | Overview | Syllabus | Tutorials | FAQs | Downloads | Recommended Websites | Advertise | Payments | Contact Us | Forum
OneStopGate

GATE Resources
Gate Articles
Gate Books
Gate Colleges 
Gate Downloads 
Gate Faqs
Gate Jobs
Gate News 
Gate Sample Papers
Training Institutes

GATE Overview
Overview
GATE Eligibility
Structure Of GATE
GATE Coaching Centers
Colleges Providing M.Tech/M.E.
GATE Score
GATE Results
PG with Scholarships
Article On GATE
Admission Process For M.Tech/ MCP-PhD
GATE Topper 2012-13
GATE Forum




GATE 2025 Exclusive
Organizing Institute
Important Dates
How to Apply
Discipline Codes
GATE 2025 Exam Structure

GATE 2025 Syllabus
Aerospace Engg..
Agricultural Engg..
Architecture and Planning
Chemical Engg..
Chemistry
Civil Engg..
Computer Science / IT
Electronics & Communication Engg..
Electrical Engg..
Engineering Sciences
Geology and Geophysics
Instrumentation Engineering
Life Sciences
Mathematics
Mechanical Engg..
Metallurgical Engg..
Mining Engg..
Physics
Production & Industrial Engg..
Pharmaceutical Sciences
Textile Engineering and Fibre Science

GATE Study Material
Aerospace Engg..
Agricultural Engg..
Chemical Engg..
Chemistry
Civil Engg..
Computer Science / IT
Electronics & Communication Engg..
Electrical Engg..
Engineering Sciences
Instrumentation Engg..
Life Sciences
Mathematics
Mechanical Engg..
Physics
Pharmaceutical Sciences
Textile Engineering  and Fibre Science

GATE Preparation
GATE Pattern
GATE Tips N Tricks
Compare Evaluation
Sample Papers 
Gate Downloads 
Experts View

CEED 2013
CEED Exams
Eligibility
Application Forms
Important Dates
Contact Address
Examination Centres
CEED Sample Papers

Discuss GATE
GATE Forum
Exam Cities
Contact Details
Bank Details

Miscellaneous
Advertisment
Contact Us


Big "O" Truncation Error

Looking for GATE Preparation Material? Join & Get here now!

** Gate 2013 Question Papers.. ** CEED 2013 Results.. ** Gate 2013 Question Papers With Solutions.. ** GATE 2013 CUT-OFFs.. ** GATE 2013 Results.. **

Big "O" Truncation Error

Big "O" Truncation Error

The 0th Order of Approximation

Clearly, the sequences[Graphics:Images/BigOMod_gr_2.gif]and[Graphics:Images/BigOMod_gr_3.gif]are both converging to zero.In addition, it should be observed that the first sequence is converging to zero more rapidly than the second sequence.In the coming modules some special terminology and notation will be used to describe how rapidly a sequence is converging.

Definition 1.The function[Graphics:Images/BigOMod_gr_4.gif]is said to be big Oh of[Graphics:Images/BigOMod_gr_5.gif],denoted[Graphics:Images/BigOMod_gr_6.gif],if there exist constants[Graphics:Images/BigOMod_gr_7.gif]and[Graphics:Images/BigOMod_gr_8.gif]such that

[Graphics:Images/BigOMod_gr_9.gif]whenever[Graphics:Images/BigOMod_gr_10.gif].

The big Oh notation provides a useful way of describing the rate of growth of a function in terms of well-known elementary functions ([Graphics:Images/BigOMod_gr_31.gif], etc.).The rate of convergence of sequences can be described in a similar manner.

Definition 2.Let[Graphics:Images/BigOMod_gr_32.gif]and[Graphics:Images/BigOMod_gr_33.gif]be two sequences.The sequence[Graphics:Images/BigOMod_gr_34.gif]is said to be of order big Oh of[Graphics:Images/BigOMod_gr_35.gif], denoted[Graphics:Images/BigOMod_gr_36.gif],if there exist[Graphics:Images/BigOMod_gr_37.gif]andNsuch that

[Graphics:Images/BigOMod_gr_38.gif]whenever[Graphics:Images/BigOMod_gr_39.gif].

Often a function[Graphics:Images/BigOMod_gr_46.gif]is approximated by a function[Graphics:Images/BigOMod_gr_47.gif]and the error bound is known to be[Graphics:Images/BigOMod_gr_48.gif].This leads to the following definition.

Definition 3.Assume that[Graphics:Images/BigOMod_gr_49.gif]is approximated by the function[Graphics:Images/BigOMod_gr_50.gif]and that there exist a real constant[Graphics:Images/BigOMod_gr_51.gif]and a positive integer n so that

[Graphics:Images/BigOMod_gr_52.gif]for sufficiently small h.
We say thatapproximateswith order of approximationandwrite

[Graphics:Images/BigOMod_gr_53.gif].

When this relation is rewritten in the form[Graphics:Images/BigOMod_gr_54.gif],we see that the notation[Graphics:Images/BigOMod_gr_55.gif]stands in place of the error bound[Graphics:Images/BigOMod_gr_56.gif].The following results show how to apply the definition to simple combinations of two functions.

Theorem (Big "O" Remainders for Series Approximations).

Assume that[Graphics:Images/BigOMod_gr_57.gif]and[Graphics:Images/BigOMod_gr_58.gif],and[Graphics:Images/BigOMod_gr_59.gif].Then

(i)[Graphics:Images/BigOMod_gr_60.gif],

(ii)[Graphics:Images/BigOMod_gr_61.gif],

(iii)[Graphics:Images/BigOMod_gr_62.gif],

provided that[Graphics:Images/BigOMod_gr_63.gif].

It is instructive to consider[Graphics:Images/BigOMod_gr_66.gif]to be the [Graphics:Images/BigOMod_gr_67.gif] degree Taylor polynomial approximation of[Graphics:Images/BigOMod_gr_68.gif];then the remainder term is simply designated[Graphics:Images/BigOMod_gr_69.gif],which stands for the presence of omitted terms starting with the power[Graphics:Images/BigOMod_gr_70.gif].The remainder term converges to zero with the same rapidity that[Graphics:Images/BigOMod_gr_71.gif]converges to zero as h approaches zero, as expressed in the relationship

[Graphics:Images/BigOMod_gr_72.gif]

for sufficiently small
h.Hence the notation[Graphics:Images/BigOMod_gr_73.gif]stands in place of the quantity[Graphics:Images/BigOMod_gr_74.gif], whereMis a constant or behaves like a constant.

Theorem (Taylor polynomial).

Assume that the function[Graphics:Images/BigOMod_gr_75.gif]and its derivatives[Graphics:Images/BigOMod_gr_76.gif]are all continuous on[Graphics:Images/BigOMod_gr_77.gif].Ifboth[Graphics:Images/BigOMod_gr_78.gif]and[Graphics:Images/BigOMod_gr_79.gif]lie in the interval[Graphics:Images/BigOMod_gr_80.gif],and[Graphics:Images/BigOMod_gr_81.gif]then

[Graphics:Images/BigOMod_gr_82.gif],

is the n-th degree Taylor polynomial expansion of[Graphics:Images/BigOMod_gr_83.gif]about[Graphics:Images/BigOMod_gr_84.gif].The Taylor polynomial of degree nis

[Graphics:Images/BigOMod_gr_85.gif]
and
[Graphics:Images/BigOMod_gr_86.gif].

The integral form of the remainder is

[Graphics:Images/BigOMod_gr_87.gif],

and Lagrange's formula for the remainder is

[Graphics:Images/BigOMod_gr_88.gif][Graphics:Images/BigOMod_gr_89.gif][Graphics:Images/BigOMod_gr_90.gif]

where [Graphics:Images/BigOMod_gr_91.gif] depends on [Graphics:Images/BigOMod_gr_92.gif] and lies somewhere between[Graphics:Images/BigOMod_gr_93.gif].

The following example illustrates the theorems above.The computations use the addition properties

(i)[Graphics:Images/BigOMod_gr_122.gif],

(ii)[Graphics:Images/BigOMod_gr_123.gif]where[Graphics:Images/BigOMod_gr_124.gif],

(iii)[Graphics:Images/BigOMod_gr_125.gif]where[Graphics:Images/BigOMod_gr_126.gif].

Order of Convergence of a Sequence

Numerical approximations are often arrived at by computing a sequence of approximations that get closer and closer to the answer desired. The definition of big Oh for sequences was given in definition 2, and the definition of order of convergence for a sequence is analogous to that given for functions in Definition 3.

Definition 4.Suppose that[Graphics:Images/BigOMod_gr_159.gif]and[Graphics:Images/BigOMod_gr_160.gif]is a sequence with[Graphics:Images/BigOMod_gr_161.gif].We say that[Graphics:Images/BigOMod_gr_162.gif]converges to x with the order of convergence[Graphics:Images/BigOMod_gr_163.gif],if there exists a constant[Graphics:Images/BigOMod_gr_164.gif]such that

[Graphics:Images/BigOMod_gr_165.gif]for n sufficiently large.

This is indicated by writing

[Graphics:Images/BigOMod_gr_166.gif]
or
[Graphics:Images/BigOMod_gr_167.gif]with order of convergence [Graphics:Images/BigOMod_gr_168.gif].

Example.Let[Graphics:Images/BigOMod_gr_169.gif]and[Graphics:Images/BigOMod_gr_170.gif];then[Graphics:Images/BigOMod_gr_171.gif]with a rate of convergence[Graphics:Images/BigOMod_gr_172.gif].
Solution.



Discussion Center

Discuss/
Query

Papers/
Syllabus

Feedback/
Suggestion

Yahoo
Groups

Sirfdosti
Groups

Contact
Us

MEMBERS LOGIN
  
Email ID:
Password:

  Forgot Password?
 New User? Register!

INTERVIEW EBOOK
Get 9,000+ Interview Questions & Answers in an eBook. Interview Question & Answer Guide
  • 9,000+ Interview Questions
  • All Questions Answered
  • 5 FREE Bonuses
  • Free Upgrades
GATE RESOURCES
 
  • Gate Books
  • Training Institutes
  • Gate FAQs
  • GATE BOOKS
     
  • Mechanical Engineeering Books
  • Robotics Automations Engineering Books
  • Civil Engineering Books
  • Chemical Engineering Books
  • Environmental Engineering Books
  • Electrical Engineering Books
  • Electronics Engineering Books
  • Information Technology Books
  • Software Engineering Books
  • GATE Preparation Books
  • Exciting Offers



    GATE Exam, Gate 2009, Gate Papers, Gate Preparation & Related Pages


    GATE Overview | GATE Eligibility | Structure Of GATE | GATE Training Institutes | Colleges Providing M.Tech/M.E. | GATE Score | GATE Results | PG with Scholarships | Article On GATE | GATE Forum | GATE 2009 Exclusive | GATE 2009 Syllabus | GATE Organizing Institute | Important Dates for GATE Exam | How to Apply for GATE | Discipline / Branch Codes | GATE Syllabus for Aerospace Engineering | GATE Syllabus for Agricultural Engineering | GATE Syllabus for Architecture and Planning | GATE Syllabus for Chemical Engineering | GATE Syllabus for Chemistry | GATE Syllabus for Civil Engineering | GATE Syllabus for Computer Science / IT | GATE Syllabus for Electronics and Communication Engineering | GATE Syllabus for Engineering Sciences | GATE Syllabus for Geology and Geophysics | GATE Syllabus for Instrumentation Engineering | GATE Syllabus for Life Sciences | GATE Syllabus for Mathematics | GATE Syllabus for Mechanical Engineering | GATE Syllabus for Metallurgical Engineering | GATE Syllabus for Mining Engineering | GATE Syllabus for Physics | GATE Syllabus for Production and Industrial Engineering | GATE Syllabus for Pharmaceutical Sciences | GATE Syllabus for Textile Engineering and Fibre Science | GATE Preparation | GATE Pattern | GATE Tips & Tricks | GATE Compare Evaluation | GATE Sample Papers | GATE Downloads | Experts View on GATE | CEED 2009 | CEED 2009 Exam | Eligibility for CEED Exam | Application forms of CEED Exam | Important Dates of CEED Exam | Contact Address for CEED Exam | CEED Examination Centres | CEED Sample Papers | Discuss GATE | GATE Forum of OneStopGATE.com | GATE Exam Cities | Contact Details for GATE | Bank Details for GATE | GATE Miscellaneous Info | GATE FAQs | Advertisement on GATE | Contact Us on OneStopGATE |
    Copyright © 2024. One Stop Gate.com. All rights reserved Testimonials |Link To Us |Sitemap |Privacy Policy | Terms and Conditions|About Us
    Our Portals : Academic Tutorials | Best eBooksworld | Beyond Stats | City Details | Interview Questions | India Job Forum | Excellent Mobiles | Free Bangalore | Give Me The Code | Gog Logo | Free Classifieds | Jobs Assist | Interview Questions | One Stop FAQs | One Stop GATE | One Stop GRE | One Stop IAS | One Stop MBA | One Stop SAP | One Stop Testing | Web Hosting | Quick Site Kit | Sirf Dosti | Source Codes World | Tasty Food | Tech Archive | Software Testing Interview Questions | Free Online Exams | The Galz | Top Masala | Vyom | Vyom eBooks | Vyom International | Vyom Links | Vyoms | Vyom World
    C Interview Questions | C++ Interview Questions | Send Free SMS | Placement Papers | SMS Jokes | Cool Forwards | Romantic Shayari