the conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. also we generalize a result due to s.kurepa for 2n-functionals in a group g.

The problem of characterizing those linear systems that exhibit a symmetric behavior was completely solved in the 1D case, ten years ago, in a few papers by F. Fagnani and J. C. Willems. Unfortunately, that theory could not be extended in its full generality to multidimensional systems: the techniques used in the proofs limited the results to systems of independent equations and to a restricted...

in this paper we present a method for solving fuzzy linear systemsby two crisp linear systems. also necessary and sufficient conditions for existenceof solution are given. some numerical examples illustrate the efficiencyof the method.

In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...

Banded linear systems with large bandwidths can be solved by similar methods as full linear systems. In particular, parallel algorithms based on torus-wrap mapping and Gaussian elimination with partial pivoting have been used with success. These algorithms are not suitable, however , if the bandwidth is small, say, between 1 and 100. As the bandwidth limits the amount of parallelism available a...

in this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. the sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. then, the newton-raphson method is used for solving these sets of algebraic equations. to present ability ...

classes of‎ ‎abaffy-broyden-spedicato (abs) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎the algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎here‎, ‎we show how to apply the abs algorithms to devise algorithms to compute the wz and zw‎ ‎factorizations of a nonsingular matrix as well as...