To see the other types of publications on this topic, follow the link: Matrice G.

Journal articles on the topic 'Matrice G'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Matrice G.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Mahmoudi, Saâd, and Edgar Wendling. "Détermination de la Matrice des Coordonnées de Symétrie Pour un Groupement XYn Matrices U, G, F ET Σ Pour les Molécules XY6 de Symétrie D3h." Bulletin des Sociétés Chimiques Belges 88, no. 6 (September 1, 2010): 369–77. http://dx.doi.org/10.1002/bscb.19790880602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Florio, Isabella, Annarita Liburdi, and Luca Tiberi. "Costruire una biblioteca digitale." DigItalia 15, no. 1 (June 2020): 99–107. http://dx.doi.org/10.36181/digitalia-00007.

Full text
Abstract:
Grazie all’accordo di collaborazione interna al Consiglio nazionale delle ricerche (CNR) tra l’Istituto per il lessico intellettuale europeo e storia dell’idee (ILIESI) e la Biblioteca centrale “G. Marconi”, siglato nel 2016, è stato possibile portare a compimento il progetto di digitalizzazione della collezione di microforme dell’ILIESI. La collezione è composta prevalentemente da lessici filosofici e testi di autori, relativi alla storia intellettuale europea del Cinquecento e Seicento. Due secoli che vedono la nascita del pensiero moderno e della nuova scienza, nel corso dei quali, dalla comune matrice latina, viene sviluppandosi la terminologia filosofica e scientifica delle lingue moderne. Il contributo analizza le scelte effettuate dallo staff tecnico per il recupero e la digitalizzazione del materiale, presentando il laboratorio di digitalizzazione della Biblioteca centrale. Infine vengono illustrate le future modalità di fruizione e valorizzazione della collezione digitalizzata.
APA, Harvard, Vancouver, ISO, and other styles
3

Doughty, Cheryl, and Kyle Cavanaugh. "Mapping Coastal Wetland Biomass from High Resolution Unmanned Aerial Vehicle (UAV) Imagery." Remote Sensing 11, no. 5 (March 6, 2019): 540. http://dx.doi.org/10.3390/rs11050540.

Full text
Abstract:
Salt marsh productivity is an important control of resiliency to sea level rise. However, our understanding of how marsh biomass and productivity vary across fine spatial and temporal scales is limited. Remote sensing provides a means for characterizing spatial and temporal variability in marsh aboveground biomass, but most satellite and airborne sensors have limited spatial and/or temporal resolution. Imagery from unmanned aerial vehicles (UAVs) can be used to address this data gap. We combined seasonal field surveys and multispectral UAV imagery collected using a DJI Matrice 100 and Micasense Rededge sensor from the Carpinteria Salt Marsh Reserve in California, USA to develop a method for high-resolution mapping of aboveground saltmarsh biomass. UAV imagery was used to test a suite of vegetation indices in their ability to predict aboveground biomass (AGB). The normalized difference vegetation index (NDVI) provided the strongest correlation to aboveground biomass for each season and when seasonal data were pooled, though seasonal models (e.g., spring, r2 = 0.67; RMSE = 344 g m−2) were more robust than the annual model (r2 = 0.36; RMSE = 496 g m−2). The NDVI aboveground biomass estimation model (AGB = 2428.2 × NDVI + 120.1) was then used to create maps of biomass for each season. Total site-wide aboveground biomass ranged from 147 Mg to 205 Mg and was highest in the spring, with an average of 1222.9 g m−2. Analysis of spatial patterns in AGB demonstrated that AGB was highest in intermediate elevations that ranged from 1.6–1.8 m NAVD88. This UAV-based approach can be used aid the investigation of biomass dynamics in wetlands across a range of spatial scales.
APA, Harvard, Vancouver, ISO, and other styles
4

Mignot, Dom A. "Droit romain aux Antilles : la pratique des affranchissements." Bulletin de la Société d'Histoire de la Guadeloupe, no. 121-122 (February 7, 2018): 33–73. http://dx.doi.org/10.7202/1043194ar.

Full text
Abstract:
La question de l’esclavage aux « isles d’Amérique » a suscité une longue et pénétrante littérature depuis de nombreuses années. En revanche, l’institution de l’affranchissement ne connaît pas un tel succès, soit que l’on trouve cette pratique trop réduite et que l’on tende à la minimiser, soit que la technique issue du « favor libertatis » romain ait été négligée involontairement par les auteurs. Or, les études traditionnelles font souvent référence à la matrice romaine (Lebeau, Y. Debbasch...) sans toutefois préciser à quel état exact d’avancement du droit romain ils font allusion. En effet, ce dernier a connu une longue évolution depuis les temps archaïques (époque royale) jusqu’au droit fixé par le Code de Justinien. Le modèle antique est lui-même très flexible : l’affranchissement n’a pas toujours connu l’engouement que les auteurs modernes prêtent aux Romains de l’époque impériale. On a trop en vue la montée sociale prodigieuse des affranchis impériaux décrite dans la thèse remarquable de G. Boulvert. La réalité fut plus mitigée. Le modèle romain, à l’instar de son application plus ou moins consciente aux Antilles a connu des périodes plus ou moins favorables aux affranchis, l’empereur Auguste allant jusqu’à dénoncer un « mélange de races » qui effondrera le monde romain...
APA, Harvard, Vancouver, ISO, and other styles
5

Martinez, Benjamin, Thomas W. Miller, and Azer P. Yalin. "Cavity Ring-Down Methane Sensor for Small Unmanned Aerial Systems." Sensors 20, no. 2 (January 14, 2020): 454. http://dx.doi.org/10.3390/s20020454.

Full text
Abstract:
We present the development, integration, and testing of an open-path cavity ring-down spectroscopy (CRDS) methane sensor for deployment on small unmanned aerial systems (sUAS). The open-path configuration used here (without pump or flow-cell) enables a low mass (4 kg) and low power (12 W) instrument that can be readily integrated to sUAS, defined here as having all-up mass of <25 kg. The instrument uses a compact telecom style laser at 1651 nm (near-infrared) and a linear 2-mirror high-finesse cavity. We show test results of flying the sensor on a DJI Matrice 600 hexacopter sUAS. The high sensitivity of the CRDS method allows sensitive methane detection with a precision of ~10–30 ppb demonstrated for actual flight conditions. A controlled release setup, where known mass flows are delivered, was used to simulate point-source methane emissions. Examples of methane plume detection from flight tests suggest that isolated plumes from sources with a mass flow as low as ~0.005 g/s can be detected. The sUAS sensor should have utility for emissions monitoring and quantification from natural gas infrastructure. To the best of our knowledge, it is also the first CRDS sensor directly deployed onboard an sUAS.
APA, Harvard, Vancouver, ISO, and other styles
6

Fiedler, Miroslav, and Frank J. Hall. "G-matrices." Linear Algebra and its Applications 436, no. 3 (February 2012): 731–41. http://dx.doi.org/10.1016/j.laa.2011.08.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Orta de Velasquez, M. T., N. Martin, V. Bodison, and A. Laplanche. "Effet de la matrice de l'eau sur l'élimination des micropolluants organiques par ozonation. Partie 2. Simulation de l'élimination d'un micropolluant dans les réacteurs idéaux." Revue des sciences de l'eau 7, no. 3 (April 12, 2005): 309–23. http://dx.doi.org/10.7202/705203ar.

Full text
Abstract:
L'équation cinétique qui permet de calculer l'oxydation d'un micropolluant dans les réacteurs d'ozonation s'écrit: -(d[P]/dt)=(KD[O3]L+KID[OH∘])[P] Kd et Kid: constantes de vitesse de l'ozone et des radicaux hydroxyles sur le micropolluant P. Dans la première partie, l'approche théorique de la concentration en radicaux hydroxyles a montré que [OH·] est proportionnel à la concentration en ozone ([OH·] = k'[03]). On a donc: (d[P]/dt)=KG[O3]L[P] with KG=KD+KIDK' Dans un réacteur parfaitement agité, les concentrations en ozone et en micropolluant sont constantes et l'élimination s'écrit: ([P]/[Po])=(1/1+KG[O3]L τ) with τ=(V/Q) Dans un réacteur piston, les concentrations varient tout au long de la colonne et il est habituel de modéliser un tel réacteur comme un grand nombre de R.P.A. en série de volume DeltaV et de hauteur DeltaH (Dans notre approche DeltaH = 0,01 m). Dans les deux cas, la simulation de l'élimination du micropolluant est basée sur la connaissance de la valeur de kG et de la concentration en ozone dans l'eau [03]L [03]L est obtenue de la résolution des bilans massiques dans un volume V ou ~V. ozone à l'entrée + ozone transféré = ozone à la sortie + ozone consommé L'ozone transféré utilise pour son calcul des relations semi-empiriques donnant la constante de Henry et la valeur du kLa. L'ozone consommé est déduit de la relation établie dans la partie 1: (d[O3]L/dt)=w[O3]L Les résultats de la simulation sont comparés aux résultats expérimentaux obtenus avec un pesticide organo-phosphoré, le parathion. Les paramètres variables sont le temps de contact (300 - 600 s), le pH (6,7 - 8,2) et le taux de traitement (1 à 5 g/m3). Une valeur de kG comprise entre 500 et 600 M-¹s-¹ donne une bonne corrélation entre les valeurs expérimentales et calculées. Cependant, on peut noter quelques différences, en particulier dans la partie basse de la colonne, ce qui montre la nécessité de prendre en compte pour des calculs plus précis l'hydrodynamique du réacteur. L'emploi du programme de simulation permet de tracer deux abaques qui montrent l'influence pour n'importe quel micropolluant des facteurs kGteta et w.
APA, Harvard, Vancouver, ISO, and other styles
8

Kouonon, Léonie Clémence, Kouamé Guillaume Koffi, Koffi Adjoumani, Anouman Désirée Sandrine Mobio, and Koudougnon Alice Estère Goba. "Caractérisation phénotypique du néré (Parkia biglobosa (Jacq.) R. Br. ex G. Don, Fabaceae) dans trois types de savane de Côte d’Ivoire." International Journal of Biological and Chemical Sciences 14, no. 2 (May 12, 2020): 555–69. http://dx.doi.org/10.4314/ijbcs.v14i2.20.

Full text
Abstract:
Afin de préserver les nombreux biens et services fournis par Parkia biglobosa (Jacq.) R. Br. ex G. Don, Fabaceae, il est fondamental de connaître la variabilité phénotypique de l’espèce pour sa domestication. L’objectif de cette étude est de déterminer des caractères morphologiques permettant d’identifier des arbres-plus dans les savanes de Côte d’Ivoire. La variabilité phénotypique d’arbres distants d’au moins 100 m des trois types de savane a été étudiée à travers 22 caractères quantitatifs relatifs aux troncs, feuilles, fruits et graines. La matrice de données obtenue a été analysée avec différents tests tels que MANOVA suivie de ANOVA 1, AFD et la CAH. Les paramètres permettant de distinguer les arbres selon leur origine sont : hauteur totale d’arbre, épaisseur graine, poids de graine et pulpe par fruit, longueur du fruit, longueur et épaisseur du pédicelle, longueur et épaisseur du pédoncule. Les arbres en savane guinéenne ont de longs et épais pédoncules, des pédicelles épais et de longs fruits. Les arbres en savane sub-soudanaise sont hauts avec des graines et pédicelles épais, un poids de graine et de pulpe par fruit en moyenne élevé alors que les arbres en savane soudanaise sont hauts avec un long pédoncule. Mots clés: Parkia biglobosa, néré, variabilité phénotypique, conservation, savane. English Title: Phenotypical caracterization of african locust bean (Parkia biglobosa (Jacq.) R. Br. ex G. Don, Fabaceae) from three savannahs types in Côte d’Ivoire To preserve goods and services provided by Parkia biglobosa (Jacq.) R. Br. ex G. Don, Fabaceae, it is essential to know the phenotypical variability of this species for domestication purpose. The objective of this study is to define morphological discriminant traits to identify tree-plus in the savannahs from Côte d'Ivoire. The phenotypical variability of trees distant at least 100 m from three types of savannah was studied through 22 quantitative traits related to trunks, leaves, fruits and seeds. Matrix data was analyzed with different tests such as MANOVA followed by ANOVA 1, AFD and CAH. Traits that allow distinguishing trees according to their origin are: total height, seed thickness, seed and pulp weight per fruit, fruit length, pedicel length and thickness, peduncle length and thickness. In the Guinean savannah, trees have long and thick peduncles, thick pedicels and long fruits. In Sub-Sudanese savannah, trees are tall with thick seeds and pedicels, high seeds and pulp weight per fruit while Sudanese savannah trees are tall with a long peduncle. Keywords: Parkia biglobosa, locust bean, phenotypical variability, conservation, savannah.
APA, Harvard, Vancouver, ISO, and other styles
9

Fiedler, Miroslav, and Thomas L. Markham. "More on G-matrices." Linear Algebra and its Applications 438, no. 1 (January 2013): 231–41. http://dx.doi.org/10.1016/j.laa.2012.07.054.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dias da Silva, J. A., and Ma da Purificação Coelho. "(λ, G)-critical matrices." Linear Algebra and its Applications 140 (October 1990): 1–11. http://dx.doi.org/10.1016/0024-3795(90)90218-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Ge, Gennian. "On (g,4;1)-difference matrices." Discrete Mathematics 301, no. 2-3 (October 2005): 164–74. http://dx.doi.org/10.1016/j.disc.2005.07.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Hall, Frank J., and Miroslav Rozložník. "G-matrices, J-orthogonal matrices, and their sign patterns." Czechoslovak Mathematical Journal 66, no. 3 (September 2016): 653–70. http://dx.doi.org/10.1007/s10587-016-0284-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Mezey, Jason G., and David Houle. "Comparing G Matrices: Are Common Principal Components Informative?" Genetics 165, no. 1 (September 1, 2003): 411–25. http://dx.doi.org/10.1093/genetics/165.1.411.

Full text
Abstract:
Abstract Common principal components (CPC) analysis is a technique for assessing whether variance-covariance matrices from different populations have similar structure. One potential application is to compare additive genetic variance-covariance matrices, G. In this article, the conditions under which G matrices are expected to have common PCs are derived for a two-locus, two-allele model and the model of constrained pleiotropy. The theory demonstrates that whether G matrices are expected to have common PCs is largely determined by whether pleiotropic effects have a modular organization. If two (or more) populations have modules and these modules have the same direction, the G matrices have a common PC, regardless of allele frequencies. In the absence of modules, common PCs exist only for very restricted combinations of allele frequencies. Together, these two results imply that, when populations are evolving, common PCs are expected only when the populations have modules in common. These results have two implications: (1) In general, G matrices will not have common PCs, and (2) when they do, these PCs indicate common modular organization. The interpretation of common PCs identified for estimates of G matrices is discussed in light of these results.
APA, Harvard, Vancouver, ISO, and other styles
14

Serra-Capizzano, Stefano, and Debora Sesana. "A note on the eigenvalues of $$g$$ g -circulants (and of $$g$$ g -Toeplitz, $$g$$ g -Hankel matrices)." Calcolo 51, no. 4 (December 29, 2013): 639–59. http://dx.doi.org/10.1007/s10092-013-0104-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Roff, Derek. "COMPARING G MATRICES: A MANOVA APPROACH." Evolution 56, no. 6 (2002): 1286. http://dx.doi.org/10.1554/0014-3820(2002)056[1286:cgmama]2.0.co;2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

in Chen, Huan, and Marjan Sheibani Abdolyousefi. "g-Drazin inverses for operator matrices." Operators and Matrices, no. 1 (2020): 23–31. http://dx.doi.org/10.7153/oam-2020-14-03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Matsuura, Masaya. "A note on generalized G-matrices." Linear Algebra and its Applications 436, no. 9 (May 2012): 3475–79. http://dx.doi.org/10.1016/j.laa.2011.12.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Di Benedetto, Fabio, Giuseppe Fiorentino, and Stefano Serra. "C. G. preconditioning for Toeplitz matrices." Computers & Mathematics with Applications 25, no. 6 (March 1993): 35–45. http://dx.doi.org/10.1016/0898-1221(93)90297-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Zhang, Huasheng. "On Real Matrices to Least-Squares g-Inverse and Minimum Norm g-Inverse of Quaternion Matrices." Advances in Linear Algebra & Matrix Theory 01, no. 01 (2011): 1–7. http://dx.doi.org/10.4236/alamt.2011.11001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

No, Jong-Seon, and Hong-Yeop Song. "Expanding generalized Hadamard matrices over Gm by substituting several generalized Hadamard matrices over G." Journal of Communications and Networks 3, no. 4 (December 2001): 361–64. http://dx.doi.org/10.1109/jcn.2001.6596967.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Orgiazzi-Billon-Galland, Isabelle. "Fantasmatic Dynamics of the Family: A Projective Approach and Psychosis." Rorschachiana 24, no. 1 (January 2000): 54–69. http://dx.doi.org/10.1027/1192-5604.24.1.54.

Full text
Abstract:
Les théories psychanalytique groupalistes sont apparues avec les travaux de S.H. Foulkes sur la notion de groupe matrice, groupe dans lequel se produit une résonance inconsciente entre ses membres: le groupe est une matrice psychique qui permet une communication inconsciente entre ses membres. Pour H. Ezriel, cette résonance est fantasmatique, et dans un groupe, chaque participant tend à projeter son objet fantasmatique inconscient sur les autres participants en essayant de les faire agir selon son désir. Sur ces bases, W.R. Bion théorisera la notion de “présupposés de base,” ces noeuds imaginaires défensifs contre l’angoisse très primaire réactivée par le groupe. En 1976, R. Kaës émet l’hypothèse d’un appareil psychique groupal, puis A. Ruffiot développe le concept d’appareil psychique familial, fondant avec A. Eiguer, J.P. Caillot et G. Decherf une théorie et une pratique psychanalytiques de la thérapie du groupe familial. La psyché n’est pas individuelle, et advient comme résultante des identifications au penser et au fantasmer du groupe familial. A partir des théories portant sur le fonctionnement et les enjeux psychiques des groupes, ce travail se propose de confronter les protocoles du test Rorschach soumis de façon individuelle à chacun des trois membres père – mère – enfant d’une même famille. Le protocole d’un garçon, âgé de 10 ans 3 mois et présentant des difficultés d’adaptation relationnelle importantes, est analysé puis comparé à celui de ses parents pour en dégager les particularités et les similitudes projectives et interroger la dynamique psychique de la triangulation familiale au regard de ces difficultés. A travers l’analyse des protocoles de Rorschach, nous avons ainsi analysé la relation entre l’organization fantasmatique de ce garçon et celle de ses parents afin d’évaluer le sens et la place du symptôme dans l’univers familial. L’analyse du protocole Rorschach de l’enfant est caractérisée par la difficulté d’adaptation à la réalité objective des planches mettant en cause l’intégrité du Moi, l’inefficacité des défenses et la désadaptation au monde réel, avec une incapacité à s’identifier à une image humaine, sans mouvement identificatoire ni relation objectale possible. Or, ce mode de fonctionnement psychique vient s’inscrire au sein d’une organization fantasmatique familiale insuffisamment névrotique de ses parents. En effet, le protocole Rorschach de la mère s’avère marqué par la défaillance du contrôle formel et la la difficulté d’investissement de l’adaptation, compte tenu de la fragilité identitaire du sujet liée à la prégnance d’un noyau prégénital déstabilisant et d’un Moi insuffisamment structuré. L’appréhension d’un objet total bien différencié ne va pas de soi pour le sujet qui renvoie en écho, de façon répétitive, des préoccupations centrés autour de l’intérieur du corps. Le protocole Rorschach du père est un protocole très restrictif, caractérisé par la répression de toute élaboration, sans pôle conflictuel ni référence à la différence, où les ingérences fantasmatiques sont étouffées par l’abrasion massive des représentations comme des affects. La relation à l’autre est réprimée dans ce vide associatif, sans possibilité notamment d’assumer la position virile. Ainsi se dégage à partir du matériel clinique recueilli, une correspondance et une interaction entre l’élaboration projective de l’enfant et celle de ses deux parents. Il existe un mode de fonctionnement psychique spécifique dans une dynamique familiale dominée par: la faiblesse du Moi de la mère, faiblesse relayée et amplifiée par l’enfant, qui s’avère insuffisamment filtrée et contenue par un fonctionnement psychique paternel caractérisé par le blocage et l’exclusion de toute élaboration. Le problème que nous avons voulu poser dans ce travail peut ainsi mettre en évidence une compréhension inter projective, inter générationnelle et intra familiale qui rend compte de traces, de dépôts de l’élaboration parentale dans l’élaboration fantasmatique individuelle, à travers un processus de filiation psychique se déroulant au-delà de la transmission biologique des corps et de la consanguinité.
APA, Harvard, Vancouver, ISO, and other styles
22

Meenakshi, Arunachalam R., and Muniasamy Kaliraja. "g- Inverses of Interval Valued Fuzzy Matrices." Journal of Mathematical and Fundamental Sciences 45, no. 1 (March 30, 2013): 83–92. http://dx.doi.org/10.5614/j.math.fund.sci.2013.45.1.7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

kumar, R. Vijaya. "s-g INVERSE OF s-NORMAL MATRICES." International Journal of Mathematics Trends and Technology 39, no. 4 (November 25, 2016): 240–44. http://dx.doi.org/10.14445/22315373/ijmtt-v39p531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Björklund, Michael, and Alexander Engström. "The g-theorem matrices are totally nonnegative." Journal of Combinatorial Theory, Series A 116, no. 3 (April 2009): 730–32. http://dx.doi.org/10.1016/j.jcta.2008.07.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Gregory, D. A., S. Kirkland, and N. J. Pullman. "Power convergent boolean matrices." Linear Algebra and its Applications 179 (January 1993): 105–17. http://dx.doi.org/10.1016/0024-3795(93)90323-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Hews, Joshua, and Leo Livshits. "Groups of Matrices That Act Monopotently." Electronic Journal of Linear Algebra 32 (February 6, 2017): 423–37. http://dx.doi.org/10.13001/1081-3810.3479.

Full text
Abstract:
In the present article, the authors continue the line of inquiry started by Cigler and Jerman, who studied the separation of eigenvalues of a matrix under an action of a matrix group. The authors consider groups \Fam{G} of matrices of the form $\left[\small{\begin{smallmatrix} G & 0\\ 0& z \end{smallmatrix}}\right]$, where $z$ is a complex number, and the matrices $G$ form an irreducible subgroup of $\GL(\C)$. When \Fam{G} is not essentially finite, the authors prove that for each invertible $A$ the set $\Fam{G}A$ contains a matrix with more than one eigenvalue. The authors also consider groups $\Fam{G}$ of matrices of the form $\left[\small{\begin{smallmatrix} G & x\\ 0& 1 \end{smallmatrix}}\right]$, where the matrices $G$ comprise a bounded irreducible subgroup of $\GL(\C)$. When \Fam{G} is not finite, the authors prove that for each invertible $A$ the set $\Fam{G}A$ contains a matrix with more than one eigenvalue.
APA, Harvard, Vancouver, ISO, and other styles
27

Teranishi, Yasuo. "The ring of invariants of matrices." Nagoya Mathematical Journal 104 (December 1986): 149–61. http://dx.doi.org/10.1017/s0027763000022728.

Full text
Abstract:
We denote by M(n) the space of all n × n-matrices with their coefficients in the complex number field C and by G the group of invertible matrices GL(n, C). Let W = M(n)i be the vector space of l-tuples of n × ra-matrices. We denote by ρ: G → GL(W) a rational representation of G defined as follows:if S ∈ G, A(i) ∈ M(n) (i = 1, 2, …, l).
APA, Harvard, Vancouver, ISO, and other styles
28

Balbuena, C., D. Ferrero, X. Marcote, and I. Pelayo. "Algebraic properties of a digraph and its line digraph." Journal of Interconnection Networks 04, no. 04 (December 2003): 377–93. http://dx.doi.org/10.1142/s0219265903000933.

Full text
Abstract:
Let G be a digraph, LG its line digraph and A(G) and A(LG) their adjacency matrices. We present relations between the Jordan Normal Form of these two matrices. In addition, we study the spectra of those matrices and obtain a relationship between their characteristic polynomials that allows us to relate properties of G and LG, specifically the number of cycles of a given length.
APA, Harvard, Vancouver, ISO, and other styles
29

Tao, G., and P. A. Ioannou. "Necessary and sufficient conditions for strictly positive real matrices." IEE Proceedings G Circuits, Devices and Systems 137, no. 5 (1990): 360. http://dx.doi.org/10.1049/ip-g-2.1990.0057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Chang, Ju-Wei, and Yuan-Pern Lee. "The C2N2a3Σ+u → X1Σ+g chemiluminescence in matrices." Journal of Molecular Structure 157, no. 1-3 (March 1987): 155–65. http://dx.doi.org/10.1016/0022-2860(87)87090-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Ganikhodzhaev, Rasul, Farrukh Mukhamedov, and Mansoor Saburov. "G-decompositions of matrices and related problems I." Linear Algebra and its Applications 436, no. 5 (March 2012): 1344–66. http://dx.doi.org/10.1016/j.laa.2011.08.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Hill, A. T. "G-matrices for algebraically stable general linear methods." Numerical Algorithms 53, no. 2-3 (May 12, 2009): 281–92. http://dx.doi.org/10.1007/s11075-009-9299-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

in Chen, Huan, and Marjan Sheibani Abdolyousefi. "The g-Drazin inverses of special operator matrices." Operators and Matrices, no. 1 (2021): 151–62. http://dx.doi.org/10.7153/oam-2021-15-11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Francesco, P. Di, P. Ginsparg, and J. Zinn-Justin. "2D gravity and random matrices." Physics Reports 254, no. 1-2 (March 1995): 1–133. http://dx.doi.org/10.1016/0370-1573(94)00084-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Rosnawati, Mrs R. "APLIKASI MATRIKS HANKEL PADA PERHITUNGAN RESULTAN DUA POLINOMIAL." Jurnal Pengajaran Matematika dan Ilmu Pengetahuan Alam 3, no. 1 (January 13, 2015): 71. http://dx.doi.org/10.18269/jpmipa.v3i1.381.

Full text
Abstract:
Let F be a field, f and g in F[x], with degre f is n and degre g is m. Computing resultant two polynomials with Hankel matrics give a size of matrics less than Sylvester method, that is maximum n or m.Keyword : resultan, Hankel matrics, Sylvester method
APA, Harvard, Vancouver, ISO, and other styles
36

Fiedler, Miroslav, and Thomas L. Markham. "Some connections between the Drazin inverse, P-matrices, and the closure of inverse M-matrices." Linear Algebra and its Applications 132 (April 1990): 163–72. http://dx.doi.org/10.1016/0024-3795(90)90061-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Garcia-Garzon, Abad, and Garrido. "Searching for G: A New Evaluation of SPM-LS Dimensionality." Journal of Intelligence 7, no. 3 (June 28, 2019): 14. http://dx.doi.org/10.3390/jintelligence7030014.

Full text
Abstract:
There has been increased interest in assessing the quality and usefulness of short versions of the Raven’s Progressive Matrices. A recent proposal, composed of the last twelve matrices of the Standard Progressive Matrices (SPM-LS), has been depicted as a valid measure of g. Nonetheless, the results provided in the initial validation questioned the assumption of essential unidimensionality for SPM-LS scores. We tested this hypothesis through two different statistical techniques. Firstly, we applied exploratory graph analysis to assess SPM-LS dimensionality. Secondly, exploratory bi-factor modelling was employed to understand the extent that potential specific factors represent significant sources of variance after a general factor has been considered. Results evidenced that if modelled appropriately, SPM-LS scores are essentially unidimensional, and that constitute a reliable measure of g. However, an additional specific factor was systematically identified for the last six items of the test. The implications of such findings for future work on the SPM-LS are discussed.
APA, Harvard, Vancouver, ISO, and other styles
38

Tismenetsky, Miron. "Factorizations of Hermitian block Hankel matrices." Linear Algebra and its Applications 166 (March 1992): 45–63. http://dx.doi.org/10.1016/0024-3795(92)90269-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Pizarro, Antonio. "Matrices over a discrete valuation ring." Linear Algebra and its Applications 167 (April 1992): 247–49. http://dx.doi.org/10.1016/0024-3795(92)90357-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Barker, George Phillip. "Automorphisms of triangular matrices over graphs." Linear Algebra and its Applications 160 (January 1992): 63–74. http://dx.doi.org/10.1016/0024-3795(92)90438-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Berele, Allan. "Matrices with involution and invariant theory." Journal of Algebra 135, no. 1 (November 1990): 139–64. http://dx.doi.org/10.1016/0021-8693(90)90154-g.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Barker, Brittany S., Patrick C. Phillips, and Stevan J. Arnold. "A TEST OF THE CONJECTURE THAT G-MATRICES ARE MORE STABLE THAN B-MATRICES." Evolution 64, no. 9 (September 2010): 2601–13. http://dx.doi.org/10.1111/j.1558-5646.2010.01023.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Hu, Xiaoxue, and Grace Kalaso. "Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs." Journal of Mathematics 2021 (June 22, 2021): 1–4. http://dx.doi.org/10.1155/2021/6621029.

Full text
Abstract:
Let G be a graph with Laplacian matrix L G . Denote by per L G the permanent of L G . In this study, we investigate the problem of computing the permanent of the Laplacian matrix of nonbipartite graphs. We show that the permanent of the Laplacian matrix of some classes of nonbipartite graphs can be formulated as the composite of the determinants of two matrices related to those Laplacian matrices. In addition, some recursion formulas on per L G are deduced.
APA, Harvard, Vancouver, ISO, and other styles
44

Vieira, Luís. "Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph." 4open 2 (2019): 21. http://dx.doi.org/10.1051/fopen/2019017.

Full text
Abstract:
Let G be a primitive strongly regular graph G such that the regularity is less than half of the order of G and A its matrix of adjacency, and let 𝒜 be the real Euclidean Jordan algebra of real symmetric matrices of order n spanned by the identity matrix of order n and the natural powers of A with the usual Jordan product of two symmetric matrices of order n and with the inner product of two matrices being the trace of their Jordan product. Next the spectra of two Hadamard series of 𝒜 associated to A2 is analysed to establish some conditions over the spectra and over the parameters of G.
APA, Harvard, Vancouver, ISO, and other styles
45

Ngondiep, Eric. "How to determine the eigenvalues of g-circulant matrices." Operators and Matrices, no. 3 (2018): 797–822. http://dx.doi.org/10.7153/oam-2018-12-48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Alhevaz, Abdollah, Maryam Baghipur, Hilal A. Ganie, and Yilun Shang. "The Generalized Distance Spectrum of the Join of Graphs." Symmetry 12, no. 1 (January 15, 2020): 169. http://dx.doi.org/10.3390/sym12010169.

Full text
Abstract:
Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D ( G ) and diagonal matrix of the vertex transmissions T r ( G ) . We determine the spectrum of the join of two graphs and of the join of a regular graph with another graph, which is the union of two different regular graphs. Moreover, thanks to the symmetry of the matrices involved, we study the generalized distance spectrum of the graphs obtained by generalization of the join graph operation through their eigenvalues of adjacency matrices and some auxiliary matrices.
APA, Harvard, Vancouver, ISO, and other styles
47

Vlach, M. "LU decomposition and forward-backward substitution of recursive bordered block diagonal matrices." IEE Proceedings G (Electronic Circuits and Systems) 132, no. 1 (1985): 24. http://dx.doi.org/10.1049/ip-g-1.1985.0005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Hall, Frank J., Zhongshan Li, Caroline T. Parnass, and Miroslav Rozložník. "Sign patterns of J-orthogonal matrices." Special Matrices 5, no. 1 (October 26, 2017): 225–41. http://dx.doi.org/10.1515/spma-2017-0016.

Full text
Abstract:
Abstract This paper builds upon the results in the article “G-matrices, J-orthogonal matrices, and their sign patterns", Czechoslovak Math. J. 66 (2016), 653-670, by Hall and Rozloznik. A number of further general results on the sign patterns of the J-orthogonal matrices are proved. Properties of block diagonal matrices and their sign patterns are examined. It is shown that all 4 × 4 full sign patterns allow J-orthogonality. Important tools in this analysis are Theorem 2.2 on the exchange operator and Theorem 3.2 on the characterization of J-orthogonal matrices in the paper “J-orthogonal matrices: properties and generation", SIAM Review 45 (3) (2003), 504-519, by Higham. As a result, it follows that for n ≤4 all n×n full sign patterns allow a J-orthogonal matrix as well as a G-matrix. In addition, the 3 × 3 sign patterns of the J-orthogonal matrices which have zero entries are characterized.
APA, Harvard, Vancouver, ISO, and other styles
49

Ferreyra, David, Marina Lattanzi, Fabián Levis, and Nestor Thome. "Solving an Open Problem About the G-Drazin Partial Order." Electronic Journal of Linear Algebra 36, no. 36 (February 8, 2020): 55–66. http://dx.doi.org/10.13001/ela.2020.4965.

Full text
Abstract:
G-Drazin inverses and the G-Drazin partial order for square matrices have been both recently introduced by Wang and Liu. They proved the following implication: if A is below B under the G-Drazin partial order then any G-Drazin inverse of B is also a G-Drazin inverse of A. However, this necessary condition could not be stated as a characterization and the validity (or not) of the converse implication was posed as an open problem. In this paper, we solve completely this problem. We show that the converse, in general, is false and we provide a form to construct counterexamples. We also prove that the converse holds under an additional condition (which is also necessary) as well as for some special cases of matrices.
APA, Harvard, Vancouver, ISO, and other styles
50

Putcha, Mohan S. "A Semigroup Approach to Linear Algebraic Groups III. Buildings." Canadian Journal of Mathematics 38, no. 3 (June 1, 1986): 751–68. http://dx.doi.org/10.4153/cjm-1986-039-1.

Full text
Abstract:
Introduction. Let K be an algebraically closed field, G = SL(3, K) the group of 3 × 3 matrices over K of determinant 1. Let denote the monoid of all 3 × 3 matrices over K. If e is an idempotent in , thenare opposite parabolic subgroups of G in the usual sense [1], [28]. However the mapdoes not exhaust all pairs of opposite parabolic subgroups of G. Now consider the representation ϕ:G → SL(6, K) given by
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography