When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Gauss–Seidel method - Wikipedia

    en.wikipedia.org/wiki/Gauss–Seidel_method

    In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel .

  3. Ordinary least squares - Wikipedia

    en.wikipedia.org/wiki/Ordinary_least_squares

    In statistics, ordinary least squares (OLS) is a type of linear least squares method for choosing the unknown parameters in a linear regression model (with fixed level-one [clarification needed] effects of a linear function of a set of explanatory variables) by the principle of least squares: minimizing the sum of the squares of the differences between the observed dependent variable (values ...

  4. Substitution (logic) - Wikipedia

    en.wikipedia.org/wiki/Substitution_(logic)

    A substitution σ is called a linear substitution if tσ is a linear term for some (and hence every) linear term t containing precisely the variables of σ ' s domain, i.e. with vars(t) = dom(σ). A substitution σ is called a flat substitution if xσ is a variable for every variable x.

  5. Linear recurrence with constant coefficients - Wikipedia

    en.wikipedia.org/wiki/Linear_recurrence_with...

    In mathematics (including combinatorics, linear algebra, and dynamical systems), a linear recurrence with constant coefficients [1]: ch. 17 [2]: ch. 10 (also known as a linear recurrence relation or linear difference equation) sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence.

  6. General linear methods - Wikipedia

    en.wikipedia.org/wiki/General_linear_methods

    General linear methods (GLMs) are a large class of numerical methods used to obtain numerical solutions to ordinary differential equations. They include multistage Runge–Kutta methods that use intermediate collocation points , as well as linear multistep methods that save a finite time history of the solution.

  7. Simple linear regression - Wikipedia

    en.wikipedia.org/wiki/Simple_linear_regression

    Related titles should be described in Simple linear regression, while unrelated titles should be moved to Simple linear regression (disambiguation). ( May 2019 ) Line fitting is the process of constructing a straight line that has the best fit to a series of data points.

  8. Linear regression - Wikipedia

    en.wikipedia.org/wiki/Linear_regression

    Linear regression can be used to estimate the values of β 1 and β 2 from the measured data. This model is non-linear in the time variable, but it is linear in the parameters β 1 and β 2; if we take regressors x i = (x i1, x i2) = (t i, t i 2), the model takes on the standard form

  9. Granger causality - Wikipedia

    en.wikipedia.org/wiki/Granger_causality

    The definition of Granger causality in these tests is general and does not involve any modelling assumptions, such as a linear autoregressive model. The non-parametric tests for Granger causality can be used as diagnostic tools to build better parametric models including higher order moments and/or non-linearity.