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