# Linear kernel¶

The linear kernel is the simplest kernel function for pattern analysis.

 Operation Computational methods Programming Interface dense dense compute(…) compute_input compute_result

## Mathematical formulation¶

### Computing¶

Given a set $$X$$ of $$n$$ feature vectors $$x_1 = (x_{11}, \ldots, x_{1p}), \ldots, x_n = (x_{n1}, \ldots, x_{np})$$ of dimension $$p$$ and a set $$Y$$ of $$m$$ feature vectors $$y_1 = (y_{11}, \ldots, y_{1p}), \ldots, y_m = (y_{m1}, \ldots, x_{mp})$$, the problem is to compute the linear kernel function $$K(x_i, y_i)$$ for any pair of input vectors:

$K(x_i, y_i) = k {X_i}^T y_i + b$

### Computation method: dense¶

The method computes the linear kernel function $$K(X, Y)$$ for $$X$$ and $$Y$$ matrices.

## Programming Interface¶

Refer to API Reference: Linear kernel.