Knowledge object
Numerical approximation and error
Absolute error is the absolute difference between approximation and reference; relative error additionally requires a nonzero reference and divides by its absolute value.
OCME · Bilingual mathematics & derivations
Understand concepts through definitions, assumptions and formulas, then follow guides, practice and evidence.
Knowledge object
Absolute error is the absolute difference between approximation and reference; relative error additionally requires a nonzero reference and divides by its absolute value.
Knowledge object
An optimization problem seeks points minimizing or maximizing an objective on an explicit feasible set; the optimal value and optimizer set are different objects.
Knowledge object
Dimensional analysis tracks products, quotients and powers through basic-dimension exponent vectors and checks agreement between equation sides.
Knowledge object
With a fixed time step and fixed nonnegative factor r, the discrete recurrence x_(n+1)=r*x_n gives x_n=x_0*r^n.
Knowledge object
With a fixed rate i per period and no additional cash flows, balances satisfy B_(n+1)=(1+i)B_n and hence B_n=B_0(1+i)^n.
Knowledge object
Mathematical representation separately records verbal rules, symbolic expressions, finite tables, ordered pairs and coordinate data for the same object, using explicit semantic bridges to check agreement.
Knowledge object
A diagnostic mathematical assessment record binds an item, its expected result, a response and an explicit judgment rule, producing only a traceable rule-agreement status.
Knowledge object
Repeated iteration of a self-map forms an orbit. Fixed points have period 1; the least positive period of a periodic point must be distinguished from an arbitrary return time.
Knowledge object
An initial-value problem adds function or derivative values at a specified point to a differential equation; candidate checks are distinct from existence and uniqueness.
Knowledge object
Using supplied endpoint and midpoint signs, bisection takes a midpoint and retains the opposite-sign half or a detected zero; finite nonterminal bisections halve the interval width.
Knowledge object
Linear programming optimizes a linear objective over a feasible domain defined by linear equalities or inequalities; this exercise slice checks only a complete explicit finite candidate grid.
Knowledge object
For fixed capacity K and 0≤r≤1, this entry uses x_(n+1)=x_n+r*x_n*(1−x_n/K) to describe each capacity-limited discrete increment.
Knowledge object
The undamped linear harmonic oscillator is defined by m*x″+k*x=0 with m,k>0; this slice asserts no trigonometric closed-form solution.
Knowledge object
For a fixed positive accumulation factor and period count, divide a future amount by the factor power to obtain present value.
Knowledge object
A complex number a+b*i is represented by the ordered real pair (a,b), with addition, subtraction and multiplication defined using i²=−1.
Knowledge object
A real vector space has vector addition and real scalar multiplication, satisfying the additive abelian-group and compatible scalar-action axioms.
Knowledge object
A finite group has a finite carrier and complete closed Cayley table, satisfying associativity, a unique identity and inverses for every element.
Knowledge object
A metric space has a carrier set and a distance function that is nonnegative, zero exactly at equal points, symmetric and satisfies the triangle inequality.
Knowledge object
A finite discrete distribution assigns nonnegative probability masses to finitely many outcome values, with exact total mass one.
Knowledge object
Complex conjugation preserves the real part and reverses the imaginary coefficient; modulus squared is the sum of their squares.
Knowledge object
A linear combination is a scalar-weighted sum of finitely many vectors; the span collects every finite linear combination.
Knowledge object
A subgroup is a group under the inherited operation; a group homomorphism preserves multiplication, and its kernel and image follow from the complete map table.
Knowledge object
A sequence in a metric space converges to x when, for every positive epsilon, eventually all n≥N lie in the epsilon-ball around x.
Knowledge object
A sigma-algebra contains the empty set and is closed under complements and countable unions; a measure is nonnegative, zero on the empty set and countably additive.