We prove a removal lemma for systems of linear equations over finite fields: let X1, . . . , Xm be subsets of the finite field Fq and let A be a (k×m) matrix with coefficients in Fq and rank k; if the linear system Ax = b has o(q) solutions with xi ∈ Xi, then we can destroy all these solutions by deleting o(q) elements from each Xi. This extends a result of Green [Geometric and Functional Analy...

solving a large sparse set of linear equations is of the problems widely seen in every numerical investigation in the entire range of engineering disciplines. employing a finite element approach in solving partial derivative equations, the resulting stiffness matrices would contain many zero-valued elements. moreover, storing all these sparse matrices in a computer memory would slower the compu...

in this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. this approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. the method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...

This paper is concerned with numerical solutions of large scale Sylvester equations AX −XB = C, Lyapunov equations as a special case in particular included, with C having very small rank. For stable Lyapunov equations, Penzl (2000) and Li andWhite (2002) demonstrated that the so called Cholesky factored ADI method with decent shift parameters can be very effective. In this paper we present a ge...

It is the purpose of this paper to introduce a computer software that is developed for the analysis of general multi degree of freedom rotor bearing systems with non-linear support elements. A numerical-analytical method for the prediction of steady state periodic response of large order nonlinear rotor dynamic systems is addressed which is based on the harmonic balance technique. By utilizing ...

let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...

(1) A system of linear equations can be stored using an augmented matrix. The part of the matrix that does not involve the constant terms is termed the coefficient matrix. (2) Variables correspond to columns and equations correspond to rows in the coefficient matrix. The augmented matrix has an extra column corresponding to the constant terms. (3) In the paradigm where the system of linear equa...

This paper is concerned with the numerical solution of large scale Sylvester equations AX −XB = C, Lyapunov equations as a special case in particular included, with C having very small rank. For stable Lyapunov equations, Penzl (2000) and Li and White (2002) demonstrated that the so called Cholesky factor ADI method with decent shift parameters can be very effective. In this paper we present a ...