When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Residual (numerical analysis) - Wikipedia

    en.wikipedia.org/wiki/Residual_(numerical_analysis)

    When one does not know the exact solution, one may look for the approximation with small residual. Residuals appear in many areas in mathematics, including iterative solvers such as the generalized minimal residual method, which seeks solutions to equations by systematically minimizing the residual.

  3. Residual property (mathematics) - Wikipedia

    en.wikipedia.org/.../Residual_property_(mathematics)

    In the mathematical field of group theory, a group is residually X (where X is some property of groups) if it "can be recovered from groups with property X".. Formally, a group G is residually X if for every non-trivial element g there is a homomorphism h from G to a group with property X such that ().

  4. Errors and residuals - Wikipedia

    en.wikipedia.org/wiki/Errors_and_residuals

    The residual is the difference between the observed value and the estimated value of the quantity of interest (for example, a sample mean). The distinction is most important in regression analysis , where the concepts are sometimes called the regression errors and regression residuals and where they lead to the concept of studentized residuals .

  5. Residue (complex analysis) - Wikipedia

    en.wikipedia.org/wiki/Residue_(complex_analysis)

    The next example shows that, computing a residue by series expansion, a major role is played by the Lagrange inversion theorem. Let u ( z ) := ∑ k ≥ 1 u k z k {\displaystyle u(z):=\sum _{k\geq 1}u_{k}z^{k}} be an entire function , and let v ( z ) := ∑ k ≥ 1 v k z k {\displaystyle v(z):=\sum _{k\geq 1}v_{k}z^{k}} with positive radius of ...

  6. Residue theorem - Wikipedia

    en.wikipedia.org/wiki/Residue_theorem

    In complex analysis, the residue theorem, sometimes called Cauchy's residue theorem, is a powerful tool to evaluate line integrals of analytic functions over closed curves; it can often be used to compute real integrals and infinite series as well.

  7. Reduced residue system - Wikipedia

    en.wikipedia.org/wiki/Reduced_residue_system

    In mathematics, a subset R of the integers is called a reduced residue system modulo n if: gcd(r, n) = 1 for each r in R, R contains φ(n) elements, no two elements of R are congruent modulo n. [1] [2] Here φ denotes Euler's totient function.

  8. Residuated mapping - Wikipedia

    en.wikipedia.org/wiki/Residuated_mapping

    In mathematics, the concept of a residuated mapping arises in the theory of partially ordered sets.It refines the concept of a monotone function.. If A, B are posets, a function f: A → B is defined to be monotone if it is order-preserving: that is, if x ≤ y implies f(x) ≤ f(y).

  9. Quadratic residue - Wikipedia

    en.wikipedia.org/wiki/Quadratic_residue

    Modulo 2, every integer is a quadratic residue. Modulo an odd prime number p there are (p + 1)/2 residues (including 0) and (p − 1)/2 nonresidues, by Euler's criterion.In this case, it is customary to consider 0 as a special case and work within the multiplicative group of nonzero elements of the field (/).