The matrix expression is very convenient in logic inference because it converts the problem to solving linear algebraic equation
. In this paper, we have presented an algorithm to convert these logical functions into a linear algebraic equation
using the Sum of Products (SOP) canonical form and logic vector.
This is a first linear algebraic equation
relating the four unknown coefficients [a.sub.3], [a.sub.2], [a.sub.1] and [a.sub.0].
The realization of the Galerkin method leads to the linear algebraic equation
Zhang, "Analogue recurrent neural network for linear algebraic equation
solving," Electronics Letters, vol.
It is a system of linear algebraic equations
of the form
Linear uninterrupted discrete system with some quantifiers with discrete time [T.sub.1], ..., [T.sub.N] can be described by the system of linear algebraic equations
in certain fields
Inserting the collocation points into (3.5), the following (2N + 2) X (2N + 2) system of linear algebraic equations
for the unknown vectors X and Y is obtained:
Then Hansen offered a solution on interval linear algebraic equations
In this regard, the considered equations are collocated and then transformed into the associated systems of linear algebraic equations
which can be solved through some iterative methods such as GMRES.
Using either of the two collocation points to collocate (7) together with the initial conditions given in (3b) will result in a system of N +1 linear algebraic equations
in N +1 unknowns.
Substituting (5) into (3), multiplying the first equation of system (1) by [p.sub.m] (z), the second--by [R.sub.m] (z), integrating both sides with respect to z from -1 to 1 and taking into account formulas B 4.4, B 4.5, B 4.6, obtained in , we obtain an infinite system of linear algebraic equations
with respect to the unknowns [[chi].sub.j] and [[psi].sub.j] .
For composing an infinite system of linear algebraic equations
with respect to the unknowns [[alpha].sup.*.sub.k], subject to (14) we substitute (13) in condition (7).