Search results for "T matrix"
showing 10 items of 39 documents
Complementary Judgment Matrix Method with Imprecise Information for Multicriteria Decision-Making
2018
The complementary judgment matrix (CJM) method is an MCDA (multicriteria decision aiding) method based on pairwise comparisons. As in AHP, the decision-maker (DM) can specify his/her preferences using pairwise comparisons, both between different criteria and between different alternatives with respect to each criterion. The DM specifies his/her preferences by allocating two nonnegative comparison values so that their sum is 1. We measure and pinpoint possible inconsistency by inconsistency errors. We also compare the consistency of CJM and AHP trough simulation. Because preference judgments are always more or less imprecise or uncertain, we introduce a way to represent the uncertainty throu…
On necessary optimality conditions for optimal control problems governed by elliptic systems
2005
The article considers an optimal control problem for the linear elliptic system div for the case where the coefficient matrix A plays the role of control and belongs to a nonconvex set and the cost functional is a quadratic form with respect to . By transforming the original problem to a more suitable one and by using ideas from the homogenization theory a necessary optimality condition is derived.
Optimal Switches in Multi–inventory Systems
2007
Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.
What is the Best Method of Matrix Adjustment? A Formal Answer by a Return to the World of Vectors
2003
The principle of matrix adjustment methods consists into finding what is the matrix which is the closest to an initial matrix but with respect of the column and row sum totals of a second matrix. In order to help deciding which matrix-adjustment method is the better, the article returns to the simpler problem of vector adjustment then back to matrices. The information-lost minimization (biproportional methods and RAS) leads to a multiplicative form and generalize the linear model. On the other hand, the distance minimization which leads to an additive form tends to distort the data by giving a result asymptotically independent to the initial matrix. The result allows concluding non-ambiguou…
Matrices A such that A^{s+1}R = RA* with R^k = I
2018
[EN] We study matrices A is an element of C-n x n such that A(s+1)R = RA* where R-k = I-n, and s, k are nonnegative integers with k >= 2; such matrices are called {R, s+1, k, *}-potent matrices. The s = 0 case corresponds to matrices such that A = RA* R-1 with R-k = I-n, and is studied using spectral properties of the matrix R. For s >= 1, various characterizations of the class of {R, s + 1, k, *}-potent matrices and relationships between these matrices and other classes of matrices are presented. (C) 2018 Elsevier Inc. All rights reserved.
Order optimal preconditioners for fully implicit Runge-Kutta schemes applied to the bidomain equations
2010
The partial differential equation part of the bidomain equations is discretized in time with fully implicit Runge–Kutta methods, and the resulting block systems are preconditioned with a block diagonal preconditioner. By studying the time-stepping operator in the proper Sobolev spaces, we show that the preconditioned systems have bounded condition numbers given that the Runge–Kutta scheme is A-stable and irreducible with an invertible coefficient matrix. A new proof of order optimality of the preconditioners for the one-leg discretization in time of the bidomain equations is also presented. The theoretical results are verified by numerical experiments. Additionally, the concept of weakly po…
Laser action in electrically driven quantum dot matrix
2007
A lasing system based on electrically driven quantum dot matrix is proposed, where population inversion of the dot matrix is obtained by rapid (nonadiabatic) switching on of in-plane electric field as a pumping force. Numerical analysis of electron-photon system kinetics is performed for various electric fields and temperatures. For parabolic type of confinement in QDs, a convenient amplification of contribution from several levels is indicated. The relevant analysis utilises an exact solution of Cauchy problem for an infinite chain of linear differential equations.
Searching for exotic states in the N pi K system
2009
We study the N pi K system in order to investigate the possibility of existence of strangeness +1 resonance(s). The formalism consists of solving the Faddeev equations with the N pi, pi K and KN t-matrices obtained from chiral dynamics. The same formalism, which leads to the finding of several 1/2(+) resonances in the corresponding three-body S = -1 channels in the 1400-2000 MeV energy region, results into only one broad bump around 1700 MeV with isospin 0. The amplitudes in isospin 1 and 2 configuration do not have any resonant structure. (C) 2009 Published by Elsevier B.V.
Methods of calculation for the T-matrix
1991
In the preceding section we have shown how the observables can be expressed in terms of the T-matrix elements or in terms of the multipole amplitudes OLλ(μjls) which contain all the relevant information on the dynamical properties of the system. For the calculation of these amplitudes a variety of different methods have been developed utilizing various kinds of approximations.
A parallel radix-4 block cyclic reduction algorithm
2013
SUMMARY A conventional block cyclic reduction algorithm operates by halving the size of the linear system at each reduction step, that is, the algorithm is a radix-2 method. An algorithm analogous to the block cyclic reduction known as the radix-q partial solution variant of the cyclic reduction (PSCR) method allows the use of higher radix numbers and is thus more suitable for parallel architectures as it requires fever reduction steps. This paper presents an alternative and more intuitive way of deriving a radix-4 block cyclic reduction method for systems with a coefficient matrix of the form tridiag{ − I,D, − I}. This is performed by modifying an existing radix-2 block cyclic reduction me…