Fuzzy liner systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of inconsistent fuzzy matrix equation. Also some numerical examples are considered.  

Based on the higher-order restricted flows, first type of integrable deformed fourth-order matrix NLS equations, that is, equations with self-consistent sources (FMNLSSCS), is derived. By virtue $${\bar{\partial }}$$ -dressing method, second called NLS–Maxwell–Bloch system (FMNLS-MB) presented. We prove equivalence FMNLSSCS and FMNLS-MB successfully. Furthermore, N-soliton solutions are explici...

This article makes use of simultaneous decomposition four quaternion matrixes to investigate some Sylvester-like matrix equation systems. We present useful necessary and sufficient conditions for the consistency system equations in terms equivalence form block matrixes. also derive general solution according partition coefficient As an application system, we practical a ϕ-Hermitian provide when...

We consider linear time-invariant (LTI) systems of the following form Σ : { ẋ(t) = Ax(t) + Bu(t), t > 0, x(0) = x, y(t) = Cx(t) + Du(t), t ≥ 0, with stable state matrix A ∈ Rn×n and B ∈ Rn×m, C ∈ Rp×n, D ∈ Rp×m, arising, e.g., from the discretization and linearization of parabolic PDEs. Typically, in practical applications, we have a large state-space dimension n = O(105) and a small input and ...

In recent years, there has been greater attempt to find numerical solutions of differential equations using wavelet's methods. The following method is based on vector forms of Haar-wavelet functions. In this paper, we will introduce one dimensional Haar-wavelet functions and the Haar-wavelet operational matrices of the fractional order integration. Also the Haar-wavelet operational matrices of ...

We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and τ a bound on the bitsize of the minors extracted from Sylvester matrix, our algorithm has O(d2) arithmetic operations and size of intermediate computations 2τ . The key idea is to precise the relations between the successive Sy...

Let A be a unital complex semisimple Banach algebra, and MA denote its maximal ideal space. For matrix M∈An×n, Mˆ denotes the obtained by taking entry-wise Gelfand transforms. M∈Cn×n, σ(M)⊂C set of eigenvalues M. It is shown that if A∈An×n B∈Am×m are such for all φ∈MA, σ(Aˆ(φ))∩σ(Bˆ(φ))=∅, then C∈An×m, Sylvester equation AX−XB=C has unique solution X∈An×m. As an application, Roth's removal rule...

Abstract We show that the discrete operator stemming from time-space discretization of evolutionary partial differential equations can be represented in terms a single Sylvester matrix equation. A novel solution strategy combines projection techniques with full exploitation entry-wise structure involved coefficient matrices is proposed. The resulting scheme able to efficiently solve problems tr...

In this paper, the eigenvalues of row-inverted 2 × 2 Sylvester Hadamard matrices are derived. Especially when the sign of a single row or two rows of a 2×2 Sylvester Hadamard matrix are inverted, its eigenvalues are completely evaluated. As an example, we completely list all the eigenvalues of 256 different row-inverted Sylvester Hadamard matrices of size 8. Mathematics Subject Classification (...

We propose a displacement structure based rank-revealing algorithm for Sylvester matrix, then apply it to compute approximate greatest common division of two univariate polynomials with floating-point coefficients. This structured rank-revealing method is based on a stabilized version of the generalized Schur algorithm [8], and is a fast rank-revealing method in the sense that, all computations...