A) The rate of error accumulation in calculations B) The property of a function to have multiple solutions C) The property of a sequence of iterates to approach a solution D) The property of numerical methods to never reach a solution
A) Testing statistical hypotheses B) Generating random numbers C) Estimating unknown values between known data points D) Finding exact solutions to equations
A) Exact calculation of mathematical functions B) Approximating complex functions using simpler ones C) Modeling physical systems D) Finding maximum or minimum values of functions
A) Solving systems of linear equations efficiently B) Generating random matrices C) Predicting future trends D) Finding eigenvalues of matrices
A) Runge-Kutta method B) Secant method C) Gaussian elimination D) Newton's method
A) Runge-Kutta method B) Newton's method C) Lagrange interpolation D) Gaussian elimination
A) Gradient descent B) False position method C) Bisection method D) Newton's method
A) Creating new data points beyond the given range B) Discarding outliers in the dataset C) Exact replication of known data points D) Estimating missing values between known data points
A) 19th century. B) 18th century. C) 21st century. D) 20th century.
A) Decrease in computational costs. B) Reduction in data availability. C) Growth in computing power. D) Advancements in symbolic manipulation.
A) Quantum physics. B) Electromagnetism. C) Thermodynamics. D) Celestial mechanics.
A) Exact symbolic translations into digits. B) Approximate solutions within specified error bounds. C) Discrete mathematical proofs. D) Purely theoretical models without computation.
A) Advanced numerical methods make it feasible. B) It relies solely on historical data analysis. C) Symbolic manipulation techniques are used. D) Discrete mathematics provides the foundation.
A) Basic arithmetic calculations. B) Discrete event simulations. C) Sophisticated optimization algorithms developed within operations research. D) Symbolic manipulation techniques.
A) To perform symbolic computations. B) To simulate quantum phenomena. C) For actuarial analysis. D) To develop discrete models.
A) John von Neumann and Herman Goldstine B) Euler and Gaussian C) Whittaker and Stegun D) Newton and Lagrange
A) 1947 B) 2000 C) 1985 D) 1912
A) Interpolation tables B) Formula lists C) Mechanical books D) Electronic computers
A) Because of E. T. Whittaker's work B) Because they were only calculated to 16 decimal places C) Because a computer is available D) Because the Leslie Fox Prize was initiated
A) A convergence test involving the residual. B) The number of steps taken. C) The size of the initial guess. D) The precision of arithmetic operations.
A) 3x + 4 = 28 B) 3x2 + 4 C) x3 - 8 D) 3x3 − 24
A) a = 0, b = 3 B) a = -1, b = 4 C) a = 2, b = 5 D) a = 1, b = 2
A) Exactly 0 B) Equal to 0.5 C) Less than 0.2 D) Greater than 1
A) Evaluating f(x) = 1/(x − 1) near x = 10. B) Integrating a function with an infinite number of regions. C) Differentiating a function where the differential element is zero. D) Evaluating f(x) = 1/(x − 1) near x = 1.
A) Simplex method B) Principal component analysis C) Spectral image compression D) Monte Carlo integration
A) Gaussian quadrature B) Monte Carlo methods C) Newton–Cotes formulas D) Sparse grids
A) Simpson's rule B) Monte Carlo integration C) Simplex method D) Sparse grids
A) IMSL library B) GNU Scientific Library C) Netlib repository D) NAG libraries
A) Fixed-point arithmetic B) Arbitrary-precision arithmetic C) Binary arithmetic D) Floating-point arithmetic
A) Excel B) MATLAB C) Scilab D) Julia
A) Journal on Numerical Analysis (SINUM) B) Numerische Mathematik C) Digital Library of Mathematical Functions D) Encyclopedia of Mathematics
A) MATLAB B) R C) Python D) C++ |