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