Search results for "Matrix"

showing 10 items of 3205 documents

Solution of coupled riccati equations occurring in nash games

2006

To obtain the open-loop Nash strategy for a linear-quadratic differential game, a set of coupled matrix Riccati equations has to be solved. It is shown that by means of algebraic transformations, the original problem can be reduced to another one to which the successive approximation method is applicable. This leads to a simple iterative algorithm with a predetermined approximation error. An example is given to illustrate the proposed method.

Matrix (mathematics)Simple (abstract algebra)Iterative methodApproximation errorComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONDifferential gameMatrix normRiccati equationApplied mathematicsMathematical economicsAlgebraic Riccati equationMathematics
researchProduct

A Parallel Approach for Statistical Texture Parameter Calculation

2014

This chapter focusses on the development of a new image processing technique for the processing of large and complex images, especially SAR images. We propose here a new and effective approach that outperforms the existing methods for the calculation of high order textural parameters. With a single processor, this approach is about \(256^{n-1}\) times faster than the co-occurrence matrix approach considered as classical, where \(n\) is the order of the textural parameter for a 256-gray scales image. In a parallel environment made of N processor, this performance can almost be multiply by the factor N. Our approach is based on a new modeling of textural parameters of a generic order \(n>1\) …

Matrix (mathematics)Texture (cosmology)Computer Science::Computer Vision and Pattern RecognitionImage (category theory)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONOrder (ring theory)ByteImage processingDevelopment (differential geometry)Space (mathematics)AlgorithmMathematics
researchProduct

BMaD – A Boolean Matrix Decomposition Framework

2014

Boolean matrix decomposition is a method to obtain a compressed representation of a matrix with Boolean entries. We present a modular framework that unifies several Boolean matrix decomposition algorithms, and provide methods to evaluate their performance. The main advantages of the framework are its modular approach and hence the flexible combination of the steps of a Boolean matrix decomposition and the capability of handling missing values. The framework is licensed under the GPLv3 and can be downloaded freely at http://projects.informatik.uni-mainz.de/bmad.

Matrix (mathematics)Theoretical computer scienceAnd-inverter graphBoolean circuitDecomposition (computer science)Logical matrixCircuit minimization for Boolean functionsRepresentation (mathematics)Standard Boolean modelMathematics
researchProduct

Exchange transfer in high-nuclearity mixed valence magnetic clusters: Theoretical approach and expected manifestations

1998

Abstract We report here a general solution of the exchange transfer problem in the high-nuclearity mixed valence clusters containing arbitrary number of itinerant electrons. The concept of two kinds of exchange transfer, namely kinetic and potential, is introduced by analogy with basic Anderson's mechanisms of the magnetic exchange. The kinetic exchange transfer is treated as a second order transfer process between two centres through the excited state of a third centre. The potential exchange transfer is also considered as a three-centre interaction but in this case only the ground states of the constituent ions are involved. The actual parameters of the exchange transfer are expected to b…

Matrix (mathematics)Valence (chemistry)ChemistryChemical physicsExcited stateGeneral Physics and AstronomyPhysical and Theoretical ChemistryAtomic physicsGround stateExchange operatorQuantum numberTransfer problemOrder of magnitude
researchProduct

The Risk, the Real, and the Impossibility of Life

2017

The discourse of the Matrix not only wakes up philosophy from the slumber they are, but reflects the rise of fears which are proper of a culture, that manipulates anxieties to fix policies otherwise would be rejected. Basically, Neo is subject to an ethical dilemma which means that we are free to make the decision to live in a fake without suffering or in “the real of the dessert” as Morpheus put it. At this extent, if technology is used to protect humankind, Matrix evinces under some circumstances, it can oppress human beings when they renounce to their “free-will”. This chapter not only explored the limitations of the society of risks within liberal thought but taking into consideration t…

Matrix (mathematics)Welfare economicsImpossibilityMathematical economicsMathematics
researchProduct

Stationarity Test for Wireless Communication Channels

2009

In this article, we propose a new test to determine the intervals of stationarity for wireless communication channels. The intervals of stationarity are identified by comparing the delay power spectral density (PSD) estimated at different time instances. The performance of the proposed stationarity test has been evaluated based on the synthetic data generated using a channel simulator. The analysis of the stationarity intervals for two radio communication channels measured in different propagation scenarios reveals that the number and the length of the stationarity intervals decrease as the dimensions of the channel matrix increase.

Matrix (mathematics)business.industryComputer scienceMIMOWirelessSpectral densitybusinessTelecommunicationsAlgorithmComputer Science::Information TheoryCommunication channelGLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
researchProduct

On attracting sets in artificial networks: cross activation

2018

Mathematical models of artificial networks can be formulated in terms of dynamical systems describing the behaviour of a network over time. The interrelation between nodes (elements) of a network is encoded in the regulatory matrix. We consider a system of ordinary differential equations that describes in particular also genomic regulatory networks (GRN) and contains a sigmoidal function. The results are presented on attractors of such systems for a particular case of cross activation. The regulatory matrix is then of particular form consisting of unit entries everywhere except the main diagonal. We show that such a system can have not more than three critical points. At least n–1 eigenvalu…

Matrix (mathematics)lcsh:T58.5-58.64Mathematical modelDynamical systems theorylcsh:Information technologyComputer scienceQuantitative Biology::Molecular NetworksOrdinary differential equationAttractorSigmoid functionTopologyMain diagonalEigenvalues and eigenvectorsITM Web of Conferences
researchProduct

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…

Matrix (mathematics)symbols.namesakeMathematical optimizationGaussian eliminationMatrix splittingConvergent matrixsymbolsBlock matrixSquare matrixAugmented matrixEigendecomposition of a matrixMathematicsSSRN Electronic Journal
researchProduct

Multidimensional scaling of emotional responses to music: The effect of musical expertise and of the duration of the excerpts

2005

Musically trained and untrained listeners were required to listen to 27 musical excerpts and to group those that conveyed a similar emotional meaning (Experiment 1). The groupings were transformed into a matrix of emotional dissimilarity that was analysed through multidimensional scaling methods (MDS). A 3-dimensional space was found to provide a good fit of the data, with arousal and emotional valence as the primary dimensions. Experiments 2 and 3 confirmed the consistency of this 3-dimensional space using excerpts of only 1 second duration. The overall findings indicate that emotional responses to music are very stable within and between participants, and are weakly influenced by musical …

Matrix (music)Experimental and Cognitive PsychologyCognitionMusicalSpace (commercial competition)Developmental psychologyArousalArts and Humanities (miscellaneous)Duration (music)Developmental and Educational PsychologyMultidimensional scalingPsychologyMeaning (linguistics)Cognitive psychologyCognition & Emotion
researchProduct

Convergence of a high-order compact finite difference scheme for a nonlinear Black–Scholes equation

2004

A high-order compact finite difference scheme for a fully nonlinear parabolic differential equation is analyzed. The equation arises in the modeling of option prices in financial markets with transaction costs. It is shown that the finite difference solution converges locally uniformly to the unique viscosity solution of the continuous equation. The proof is based on a careful study of the discretization matrices and on an abstract convergence result due to Barles and Souganides.

Matrix difference equationFTCS schemeNumerical AnalysisPartial differential equationApplied MathematicsMathematical analysisCompact finite differenceNumerical solution of the convection–diffusion equationFinite difference coefficientCentral differencing schemeComputational MathematicsModeling and SimulationAnalysisCompact convergenceMathematicsESAIM: Mathematical Modelling and Numerical Analysis
researchProduct