نتایج جستجو برای: Inverse matrix

تعداد نتایج: 445841  

Journal: :journal of linear and topological algebra (jlta) 0
a. m. nazari department of mathematics, faculty of science, arak university, arak 38156-8-8349, iran. s kamali maher department of mathematics, faculty of science, arak university, arak 38156-8-8349, iran.

in this paper, at rst for a given set of real or complex numbers  with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which  is its spectrum. in continue we present some conditions for existence such nonnegative tridiagonal matrices.

Journal: :international journal of industrial mathematics 2013
m. nikuie m. k. mirnia

in the linear system ax = b the points x are sometimes constrained to lie in a given subspace s of column space of a. drazin inverse for any singular or nonsingular matrix, exist and is unique. in this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of drazin inverse in solving such systems is investigated. constrained linear system arise ...

Journal: :bulletin of the iranian mathematical society 2015
m. z. kolundžija d. mosić d. s. djordjević

several representations of the generalized drazin inverse of an anti-triangular block matrix in banach algebra are given in terms of the generalized banachiewicz--schur form.

Journal: :computational methods for differential equations 0
chun-hui hsiao no.101, sec. 2, jhongcheng rd., shihlin district, taipei city 111, taiwan, r.o.c.

this paper presents a rational haar wavelet operational method for solving the inverse laplace transform problemand improves inherent errors from irrational haar wavelet. the approach is thus straightforward, rather simple andsuitable for computer programming. we define that $p$ is the operational matrix for integration of the orthogonalhaar wavelet. simultaneously, simplify the formulaes of li...

Journal: :international journal of mathematical modelling and computations 0
amir sadeghi young researcher club, shahre-rey branch, islamic azad university, tehran, iran. iran, islamic republic of

the computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. it is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of new-ton's method, but previous researchers have mentioned that some...

Journal: :bulletin of the iranian mathematical society 2014
xiang zhang

in this paper‎, ‎we study the extremal‎ ‎ranks and inertias of the hermitian matrix expression $$‎ ‎f(x,y)=c_{4}-b_{4}y-(b_{4}y)^{*}-a_{4}xa_{4}^{*},$$ where $c_{4}$ is‎ ‎hermitian‎, ‎$*$ denotes the conjugate transpose‎, ‎$x$ and $y$ satisfy‎ ‎the following consistent system of matrix equations $a_{3}y=c_{3}‎, ‎a_{1}x=c_{1},xb_{1}=d_{1},a_{2}xa_{2}^{*}=c_{2},x=x^{*}.$ as‎ ‎consequences‎, ‎we g...

Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. Aim of this article is to find the maximum and minimum solution of the fuzzy neutrosophic soft relational equations xA=b and Ax=b, where x and b are fuzzy neutrosophic soft vector and A is a fuzzy neutrosophic soft matrix. Wheneve...

Journal: :Proceedings of the American Mathematical Society 1983

Amir Sadeghi

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

Journal: :bulletin of the iranian mathematical society 2013
j. cai

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید