CAE Exam 1 fully solved & updated (latest
version verified for accuracy) (Questions +
Answers) Solved 100% Correct!!
Save
Practice questions for this set
Learn 1 /7 Study with Learn
bisection, false position
Choose an answer
1 accuracy 2 false position pros
3 bracketing methods 4 round off errors
Don't know?
Terms in this set (35)
accuracy how close the value is compared to the true
value
, precision how close the value is to the previous value
inaccuracy the deviation from the actual value (bias)
imprecision the magnitude of the scatter (uncertainty)
round off errors came from computers having a fixed number of
sig figs during calculations. computers used a
base-2 representation so they can represent
base-10 numbers like pi or exp
subtractive cancellation happens when subtracting two nearly equal
numbers. comes from round off error. avoid by
multiplying by the conjugate over the conjugate.
stability applies to algorithms and is unstable if the
uncertainty of the input values is greatly
magnified by the numerical method. stable
algorithm computes nearly the right answer or
nearly the right question
condition number applies to problems and relates to a problem's
sensitivity to changes in the input. all small
deviations of a system have small effects. ill-
conditioned problems mean some small
deviations of a system will have large effects. if k
= 0 then well-conditioned otherwise ill-
conditioned
bracketing method pros fast to execute, roots will always be found as
long as the initial two guesses bracket the root.
bracketing method cons unable to tell if there are multiple roots, takes
many iterations if guesses are far from the root
version verified for accuracy) (Questions +
Answers) Solved 100% Correct!!
Save
Practice questions for this set
Learn 1 /7 Study with Learn
bisection, false position
Choose an answer
1 accuracy 2 false position pros
3 bracketing methods 4 round off errors
Don't know?
Terms in this set (35)
accuracy how close the value is compared to the true
value
, precision how close the value is to the previous value
inaccuracy the deviation from the actual value (bias)
imprecision the magnitude of the scatter (uncertainty)
round off errors came from computers having a fixed number of
sig figs during calculations. computers used a
base-2 representation so they can represent
base-10 numbers like pi or exp
subtractive cancellation happens when subtracting two nearly equal
numbers. comes from round off error. avoid by
multiplying by the conjugate over the conjugate.
stability applies to algorithms and is unstable if the
uncertainty of the input values is greatly
magnified by the numerical method. stable
algorithm computes nearly the right answer or
nearly the right question
condition number applies to problems and relates to a problem's
sensitivity to changes in the input. all small
deviations of a system have small effects. ill-
conditioned problems mean some small
deviations of a system will have large effects. if k
= 0 then well-conditioned otherwise ill-
conditioned
bracketing method pros fast to execute, roots will always be found as
long as the initial two guesses bracket the root.
bracketing method cons unable to tell if there are multiple roots, takes
many iterations if guesses are far from the root
