Search results for " Computational"

Robust stability and stabilization of uncertain T-S fuzzy systems with time-varying delay: An input-output approach

2013

An input-output approach to the stability and stabilization of uncertain Takagi-Sugeno (T-S) fuzzy systems with time-varying delay is proposed in this paper. The time-varying parameter uncertainties are assumed to be norm-bounded, and the delay is intervally time varying. A novel method is employed to approximate the time-varying delay, based on which the considered system is transformed into a feedback interconnection form. The new formulation of the system is comprised of a forward subsystem with constant time delay and a feedback subsystem embedding the uncertainties. By applying the scaled small-gain theorem to the converted system, less conservative stability and stabilization criteria…

Wannier90 as a community code: new features and applications

2019

Wannier90 is an open-source computer program for calculating maximally-localised Wannier functions (MLWFs) from a set of Bloch states. It is interfaced to many widely used electronic-structure codes thanks to its independence from the basis sets representing these Bloch states. In the past few years the development of Wannier90 has transitioned to a community-driven model; this has resulted in a number of new developments that have been recently released in Wannier90 v3.0. In this article we describe these new functionalities, that include the implementation of new features for wannierisation and disentanglement (symmetry-adapted Wannier functions, selectively-localised Wannier functions, s…

The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem

2016

The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.

Minimal star-varieties of polynomial growth and bounded colength

2018

Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…

Polynomial growth and star-varieties

2016

Abstract Let V be a variety of associative algebras with involution over a field F of characteristic zero and let c n ⁎ ( V ) , n = 1 , 2 , … , be its ⁎-codimension sequence. Such a sequence is polynomially bounded if and only if V does not contain the commutative algebra F ⊕ F , endowed with the exchange involution, and M, a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices. Such algebras generate the only varieties of ⁎-algebras of almost polynomial growth, i.e., varieties of exponential growth such that any proper subvariety is polynomially bounded. In this paper we completely classify all subvarieties of the ⁎-varieties of almost polynomial growth by gi…

Some characterizations of algebras with involution with polynomial growth of their codimensions

2018

Let A be an associative algebra endowed with an involution ∗ of the first kind and let c ∗n (A) denote the sequence of ∗-codimensions of A. In this paper, we are interested in algebras with involution such that the ∗-codimension sequence is polynomially bounded. We shall prove that A is of this kind if and only if it satisfies the same identities of a finite direct sum of finite dimensional algebras with involution A i , each of which with Jacobson radical of codimension less than or equal to one in A i . We shall also relate the condition of having polynomial codimension growth with the sequence of cocharacters and with the sequence of colengths. Along the way, we shall show that the multi…

The smoothed particle hydrodynamics method via residual iteration

2019

Abstract In this paper we propose for the first time an iterative approach of the Smoothed Particle Hydrodynamics (SPH) method. The method is widespread in many areas of science and engineering and despite its extensive application it suffers from several drawbacks due to inaccurate approximation at boundaries and at irregular interior regions. The presented iterative process improves the accuracy of the standard method by updating the initial estimates iterating on the residuals. It is appealing preserving the matrix-free nature of the method and avoiding to modify the kernel function . Moreover the process refines the SPH estimates and it is not affected by disordered data distribution. W…

Dynamique de la structure industrielle française

1990

A Note on added information in the RAS Procedure: reexamination of some evidence

2006

International audience; An example in Miernyk (1977) presented a rather counterintuitive result, namely that introducing accurate exogenous information into an RAS matrix estimating procedure could lead to an estimate that was worse than one generated by RAS using no exogenous information at all. This became an oft-cited black mark against RAS. Miller and Blair (1985) included a different (and small) illustration of the same possibility. It was recently pointed out by one of us that the Miller/Blair numerical results are wrong. For that reason, we decided to reexamine all the empirical evidence we could find on the subject. While figures in both Miernyk and Miller/Blair appear to be wrong, …

Normalizing biproportional methods

2002

International audience; Biproportional methods are used to update matrices: the projection of a matrix Z to give it the column and row sums of another matrix is R Z S, where R and S are diagonal and secure the constraints of the problem (R and S have no signification at all because they are not identified). However, normalizing R or S generates important mathematical difficulties: it amounts to put constraints on Lagrange multipliers, non negativity (and so the existence of the solution) is not guaranteed at equilibrium or along the path to equilibrium.