نتایج جستجو برای: rectangular matrix polynomials

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

2012
JASPREET SINGH

The objective of this paper is to study the theoretical analysis of linear differential-algebraic equations (DAEs) of higher order as well as the regularity and singularity of matrix polynomials. Some invariants and condensed forms under appropriate equivalent transformations are established for systems of linear higher-order DAEs with constant and variable coefficients. Inductively, based on c...

Journal: :wavelet and linear algebra 2015
e. kokabifar g.b. loghmani a. m. nazari s. m. karbassi

consider an n × n matrix polynomial p(λ). a spectral norm distance from p(λ) to the set of n × n matrix polynomials that havea given scalar µ ∈ c as a multiple eigenvalue was introducedand obtained by papathanasiou and psarrakos. they computedlower and upper bounds for this distance, constructing an associated perturbation of p(λ). in this paper, we extend this resultto the case of two given di...

‎In this paper‎, ‎we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays‎. ‎Constant or pantograph delays may appear in state-control or both‎. ‎We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then‎, ‎these are utilized to reduce the solution of optimal control with constant...

2007
H. Belbachir A. Boussicault

We investigate the link between rectangular Jack polynomials and Hankel hyperdeterminants. As an application we give an expression of the even power of the Vandermonde in term of Jack polynomials.

Journal: :computational methods for differential equations 0
farshid mirzaee malayer university

in this paper, we propose and analyze an efficient matrix methodbased on bell polynomials for numerically solving nonlinear fredholm- volterraintegral equations. for this aim, first we calculate operational matrix of integration and product based on bell polynomials. by using these matrices, nonlinearfredholm-volterra integral equations reduce to the system of nonlinear algebraicequations which...

2005
EDDY ARDONNE RINAT KEDEM

This paper contains the generalization of the Feigin-Stoyanovsky construction to all integrable sl r+1-modules. We give formulas for the q-characters of any highest-weight integrable module of sl r+1 as a linear combination of the fermionic q-characters of the fusion products of a special set of integrable modules. The coefficients in the sum are the entries of the inverse matrix of generalized...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

In this paper, we propose and analyze an efficient matrix method based on Bell polynomials for numerically solving nonlinear Fredholm- Volterra integral equations. For this aim, first we calculate operational matrix of integration and product based on Bell polynomials. By using these matrices, nonlinear Fredholm-Volterra integral equations reduce to the system of nonlinear algebraic equations w...

ژورنال: پژوهش های ریاضی 2022

In this paper, we are intend to present a numerical algorithm for computing approximate solution of linear and nonlinear Fredholm, Volterra and Fredholm-Volterra  integro-differential equations. The approximated solution is written in terms of fractional Jacobi polynomials. In this way, firstly we define Riemann-Liouville fractional operational matrix of fractional order Jacobi polynomials, the...

Journal: :CoRR 2018
Vincent Neiger Johan Rosenkilde Grigory Solomatov

We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are known. Here, we present deterministic, fast algorithms for rectangular input matrices. The obtained cost bound for the Popov form matches the previous best know...

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

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