Log in

Relevant bibliographies by topics / Matrice partitions

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Matrice partitions'

Author: Grafiati

Published: 22 June 2023

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Matrice partitions.'

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.

Journal articles on the topic "Matrice partitions"

1

Carayol, Cécile. "La Ligne rouge de Hans Zimmer. Matrice d’un « nouvel Hollywood » électro-minimaliste et contemplatif." Revue musicale OICRM 5, no. 2 (2018): 79–102. http://dx.doi.org/10.7202/1054148ar.

Full text

Abstract:

À travers une étude comparative de plusieurs films au contexte narratif contemplatif comme La Ligne Rouge (Terrence Malick, 1998), partition-matrice qui a marqué une nette évolution dans l’esthétique zimmerienne, Hannibal (Ridley Scott, 2001), Da Vinci Code (de Ron Howard, 2006) « synthèse la plus raffinée des influences du minimalisme » (Berthomieu 2013, p. 698), jusqu’à des partitions que Hans Zimmer a composées pour Christopher Nolan comme Inception (2010) et Interstellar (2014), cet article montre de quelle manière Zimmer parvient pleinement à imposer un nouveau courant musical à Hollywood

APA, Harvard, Vancouver, ISO, and other styles

2

Tomescu, Mihaela Aurelia, Lorentz Jäntschi, and Doina Iulia Rotaru. "Figures of Graph Partitioning by Counting, Sequence and Layer Matrices." Mathematics 9, no. 12 (2021): 1419. http://dx.doi.org/10.3390/math9121419.

Full text

Abstract:

A series of counting, sequence and layer matrices are considered precursors of classifiers capable of providing the partitions of the vertices of graphs. Classifiers are given to provide different degrees of distinctiveness for the vertices of the graphs. Any partition can be represented with colors. Following this fundamental idea, it was proposed to color the graphs according to the partitions of the graph vertices. Two alternative cases were identified: when the order of the sets in the partition is relevant (the sets are distinguished by their positions) and when the order of the sets in t

APA, Harvard, Vancouver, ISO, and other styles

3

Lambkin, Christine L. "Partitioned Bremer support localises significant conflict in bee flies (Diptera : Bombyliidae : Anthracinae)." Invertebrate Systematics 18, no. 4 (2004): 351. http://dx.doi.org/10.1071/is04004.

Full text

Abstract:

Partitioned Bremer support examination of combined cladistic analyses indicates nodes at which the support from the partitions differs, and also identifies the location of character disagreement generated by the combination of data matrices. Significant character incongruence was found between mtDNA sequence data and adult morphological characters from three tribes of bee flies (Diptera : Bombyliidae : Anthracinae : Villini, Anthracini, Exoprosopini). Partitioned Bremer support quantitatively reveals the location of significant conflict between characters from the different partitions. Examina

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Yi, Xinwang Liu, Jiyuan Liu, et al. "Fusion Multiple Kernel K-means." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 8 (2022): 9109–17. http://dx.doi.org/10.1609/aaai.v36i8.20896.

Full text

Abstract:

Multiple kernel clustering aims to seek an appropriate combination of base kernels to mine inherent non-linear information for optimal clustering. Late fusion algorithms generate base partitions independently and integrate them in the following clustering procedure, improving the overall efficiency. However, the separate base partition generation leads to inadequate negotiation with the clustering procedure and a great loss of beneficial information in corresponding kernel matrices, which negatively affects the clustering performance. To address this issue, we propose a novel algorithm, termed

APA, Harvard, Vancouver, ISO, and other styles

5

Adm, Mohammad, Shaun Fallat, Karen Meagher, Shahla Nasserasr, Sarah Plosker, and Boting Yang. "Achievable multiplicity partitions in the inverse eigenvalue problem of a graph." Special Matrices 7, no. 1 (2019): 276–90. http://dx.doi.org/10.1515/spma-2019-0022.

Full text

Abstract:

Abstract Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen. If G has n vertices, then the multiplicities of the eigenvalues of any matrix in 𝒮 (G) partition n; this is called a multiplicity partition. We study graphs for which a multiplicity partition with only two integers is possible. The graphs G for which there is a matrix in 𝒮 (G) with partitions [n − 2, 2] have been characterized. We find families of graphs G

APA, Harvard, Vancouver, ISO, and other styles

6

Liu, Jiyuan, Xinwang Liu, Siwei Wang, Sihang Zhou, and Yuexiang Yang. "Hierarchical Multiple Kernel Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (2021): 8671–79. http://dx.doi.org/10.1609/aaai.v35i10.17051.

Full text

Abstract:

Current multiple kernel clustering algorithms compute a partition with the consensus kernel or graph learned from the pre-specified ones, while the emerging late fusion methods firstly construct multiple partitions from each kernel separately, and then obtain a consensus one with them. However, both of them directly distill the clustering information from kernels or graphs to partition matrices, where the sudden dimension drop would result in loss of advantageous details for clustering. In this paper, we provide a brief insight of the aforementioned issue and propose a hierarchical approach to

APA, Harvard, Vancouver, ISO, and other styles

7

Zoghlami, Mohamed Ali, Minyar Sassi Hidri, and Rahma Ben Ayed. "Consensus-Driven Cluster Analysis: Top-Down and Bottom-Up Based Split-and-Merge Classifiers." International Journal on Artificial Intelligence Tools 26, no. 04 (2017): 1750018. http://dx.doi.org/10.1142/s021821301750018x.

Full text

Abstract:

Consensus clustering is used in data analysis to generate stable results out of a set of partitions delivered by stochastic methods. Typically, the goal is searching for the socalled median (or consensus) partition, i.e. the partition that is most similar, on average, to all the input partitions. In this paper we address the problem of combining multiple fuzzy clusterings without access to the underlying features of the data while basing on inter-clusters similarity. We are concerned of top-down and bottom-up based consensus-driven fuzzy clustering while splitting and merging worst clusters. T

APA, Harvard, Vancouver, ISO, and other styles

8

Dalfó, Cristina, and Miquel Àngel Fiol. "A general method to obtain the spectrum and local spectra of a graph from its regular partitions." Electronic Journal of Linear Algebra 36, no. 36 (2020): 446–60. http://dx.doi.org/10.13001/ela.2020.5225.

Full text

Abstract:

It is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also the local spectra, of a graph from the quotient matrices of some of its regular partitions, is proposed. Moreover, from such partitions, the $C$-local multiplicities of any class of vertices $C$ is also determined, and some applications of these parameters in the characterization of completely regular codes and their inner distributions are described. As examples, it is show

APA, Harvard, Vancouver, ISO, and other styles

9

Shen, Shuhui, and Xiaojun Zhang. "Constructions of Goethals–Seidel Sequences by Using k-Partition." Mathematics 11, no. 2 (2023): 294. http://dx.doi.org/10.3390/math11020294.

Full text

Abstract:

In this paper, we are devoted to finding Goethals–Seidel sequences by using k-partition, and based on the finite Parseval relation, the construction of Goethals–Seidel sequences could be transformed to the construction of the associated polynomials. Three different structures of Goethals–Seidel sequences will be presented. We first propose a method based on T-matrices directly to obtain a quad of Goethals–Seidel sequences. Next, by introducing the k-partition, we utilize two classes of 8-partitions to obtain a new class of polynomials still remaining the same (anti)symmetrical properties, with

APA, Harvard, Vancouver, ISO, and other styles

10

Benatia, Akrem, Weixing Ji, Yizhuo Wang, and Feng Shi. "Sparse matrix partitioning for optimizing SpMV on CPU-GPU heterogeneous platforms." International Journal of High Performance Computing Applications 34, no. 1 (2019): 66–80. http://dx.doi.org/10.1177/1094342019886628.

Full text

Abstract:

Sparse matrix–vector multiplication (SpMV) kernel dominates the computing cost in numerous applications. Most of the existing studies dedicated to improving this kernel have been targeting just one type of processing units, mainly multicore CPUs or graphics processing units (GPUs), and have not explored the potential of the recent, rapidly emerging, CPU-GPU heterogeneous platforms. To take full advantage of these heterogeneous systems, the input sparse matrix has to be partitioned on different available processing units. The partitioning problem is more challenging with the existence of many s

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Matrice partitions"

1

Quéré, Romain. "Quelques propositions pour la comparaison de partitions non strictes." Phd thesis, Université de La Rochelle, 2012. http://tel.archives-ouvertes.fr/tel-00950514.

Full text

Abstract:

Cette thèse est consacrée au problème de la comparaison de deux partitions non strictes (floues/probabilistes, possibilistes) d'un même ensemble d'individus en plusieurs clusters. Sa résolution repose sur la définition formelle de mesures de concordance reprenant les principes des mesures historiques développées pour la comparaison de partitions strictes et trouve son application dans des domaines variés tels que la biologie, le traitement d'images, la classification automatique. Selon qu'elles s'attachent à observer les relations entre les individus décrites par chacune des partitions ou à qu

APA, Harvard, Vancouver, ISO, and other styles

2

Barsukov, Alexey. "On dichotomy above Feder and Vardi's logic." Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. https://tel.archives-ouvertes.fr/tel-04100704.

Full text

Abstract:

On dit d'un sous-ensemble de NP qu'il présente une dichotomie s'il contient des problèmes qui sont soit résolubles en temps polynomial (dans Ptime), soit difficiles (NP-complets). La classe des problèmes de satisfaction de contraintes (CSP) finis est un sous-ensemble bien connu de NP qui présente une telle dichotomie. La classe de complexité NP n'a pas de dichotomie à moins que P = NP. Pour ces deux classes, il existe des logiques qui leur sont associées. -- NP est capturé par la logique Existentielle du second ordre (ESO) par le théorème de Fagin, c'est-à-dire qu'un problème est dans NP si et

APA, Harvard, Vancouver, ISO, and other styles

3

Fonseca, Tiago. "Matrices à signes alternants, boucles denses et partitions planes." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00521884.

Full text

Abstract:

Cette thèse est consacrée à l'étude d'identités qu'on observe à l'interface entre le domaine des modèles intégrables en physique statistique et la combinatoire. L'histoire a commencé quand Mills, Robbins et Rumsey étudiaient des Matrices à Signes Alternants (ASM). En 1982, ils proposèrent une formule d'énumération. Pendant qu'ils cherchaient une preuve de cette formule ils découvrirent l'existence d'autres objets comptés par la même formule : les Partitions Planes Totalement Symétriques Auto-Complémentaires (TSSCPP). C'est seulement quelques années plus tard que Zeilberger fut capable de prouv

APA, Harvard, Vancouver, ISO, and other styles

4

Dinis, Da Fonseca Tiago. "Matrices de signe alternant, boucles denses et partitions planes." Paris 6, 2010. http://www.theses.fr/2010PA066281.

Full text

Abstract:

Cette thèse est consacrée à l'étude d'identités qu'on observe à l'interface entre le domaine des modèles intégrables en physique statistique et la combinatoire. L'histoire commence quand Mills, Robbins et Rumsey étudiaient des Matrices de Signe Alternant (ASM). En 1982, ils proposèrent une formule d'énumeration. Pendant qu'ils cherchaient une preuve de cette formule ils découvrirent l'existence d'autres objets comptés par la même formule : les Partitions Planes Totalement Symétriques Auto-Complementaires (TSSCPP). C'est seulement quelques années plus tard que Zeilberger fut capable de prouver

APA, Harvard, Vancouver, ISO, and other styles

5

Cheballah, Hayat. "Combinatoire des matrices à signes alternants et des partitions planes." Paris 13, 2011. http://www.theses.fr/2011PA132054.

Full text

Abstract:

Cette thèse se situe dans le domaine de la combinatoire bijective et est consacrée à la construction d’une bijection explicite entre deux familles d’objets combinatoires : les matrices à signes alternants (ASMs) et les partitions planes totalement symétriques auto-complémentaires (TSSCPPs). L’histoire a commencé lorsque Milis, Robbins et Rumsey étudiaient les ASMs et proposèrent une formule d’énumération en 1982. Durant leurs recherches, ils découvrirent l’existence d’autres objets comptés par la même formule : les TSSCPPs. Dix ans plus tard, une preuve non bijective de l’équiénumération de ce

APA, Harvard, Vancouver, ISO, and other styles

6

Pierce, Virgil. "The asymptotic expansion of the partition function of random matrices." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280566.

Full text

Abstract:

We explore two methods for calculating the Taylor Coefficients of the terms of the asymptotic expansion of the partition function of random matrices for specific even potentials. The first of these methods applies to the leading order term. We show that this term has an elementary form in terms of a solution to an algebraic equation. This generates a general formula for the Taylor Coefficients of this term. Next we exploit the relationship between orthogonal polynomials and the Toda Lattice Equations to derive ODE's for the general terms of the expansion of the partition function of random mat

APA, Harvard, Vancouver, ISO, and other styles

7

Cabanal-Duvillard, Thierry. "Probabilités libres et calcul stochastique : application aux grandes matrices aléatoires." Paris 6, 1999. http://www.theses.fr/1999PA066594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Thüne, Mario. "Eigenvalues of Matrices and Graphs." Doctoral thesis, Universitätsbibliothek Leipzig, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-120713.

Full text

Abstract:

The interplay between spectrum and structure of graphs is the recurring theme of the three more or less independent chapters of this thesis. The first chapter provides a method to relate the eigensolutions of two matrices, one being the principal submatrix of the other, via an arbitrary annihilating polynomial. This is extended to lambda-matrices and to matrices the entries of which are rational functions in one variable. The extension may be interpreted as a possible generalization of other known techniques which aim at reducing the size of a matrix while preserving the spectral information.

APA, Harvard, Vancouver, ISO, and other styles

9

Bagatini, Alessandro. "Matrix representation for partitions and Mock Theta functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2016. http://hdl.handle.net/10183/150232.

Full text

Abstract:

Neste trabalho, com base em representações por matrizes de duas linhas para alguns tipos de partição (algumas já conhecidas e outras novas), identificamos propriedades sugeridas por classificá-las de acordo com a soma dos elementos de sua segunda linha. Esta soma sempre fornece alguma propriedade da partição relacionada. Se considerarmos versões sem sinal de algumas funções Mock Theta, seu termo geral pode ser interpretado como função geradora para algum tipo de partição com restrições. Para retornar aos coeficientes originais, é possível definir um peso para cada matriz e depois somá-las para

APA, Harvard, Vancouver, ISO, and other styles

10

Bas, Erdeniz Ozgun. "Load-Balancing Spatially Located Computations using Rectangular Partitions." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306909831.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Matrice partitions"

1

Claudio, Procesi, ed. Topics in hyperplane arrangements, polytopes and box-splines. Springer, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Saff, E. B., Douglas Patten Hardin, Brian Z. Simanek, and D. S. Lubinsky. Modern trends in constructive function theory: Conference in honor of Ed Saff's 70th birthday : constructive functions 2014, May 26-30, 2014, Vanderbilt University, Nashville, Tennessee. American Mathematical Society, 2016.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Su, Zhonggen. Random Matrices and Random Partitions Normal Convergence. World Scientific Publishing Co Pte Ltd, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Parametric state space structuring. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guhr, Thomas. Replica approach in random matrix theory. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.8.

Full text

Abstract:

This article examines the replica method in random matrix theory (RMT), with particular emphasis on recently discovered integrability of zero-dimensional replica field theories. It first provides an overview of both fermionic and bosonic versions of the replica limit, along with its trickery, before discussing early heuristic treatments of zero-dimensional replica field theories, with the goal of advocating an exact approach to replicas. The latter is presented in two elaborations: by viewing the β = 2 replica partition function as the Toda lattice and by embedding the replica partition functi

APA, Harvard, Vancouver, ISO, and other styles

6

Keating, Jon, and Nina Snaith. Random permutations and related topics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.25.

Full text

Abstract:

This article considers some topics in random permutations and random partitions highlighting analogies with random matrix theory (RMT). An ensemble of random permutations is determined by a probability distribution on Sn, the set of permutations of [n] := {1, 2, . . . , n}. In many ways, the symmetric group Sn is linked to classical matrix groups. Ensembles of random permutations should be given the same treatment as random matrix ensembles, such as the ensembles of classical compact groups and symmetric spaces of compact type with normalized invariant measure. The article first describes the

APA, Harvard, Vancouver, ISO, and other styles

7

Marino, Marcos. Quantum chromodynamics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.32.

Full text

Abstract:

This article focuses on chiral random matrix theories with the global symmetries of quantum chromodynamics (QCD). In particular, it explains how random matrix theory (RMT) can be applied to the spectra of the Dirac operator both at zero chemical potential, when the Dirac operator is Hermitian, and at non-zero chemical potential, when the Dirac operator is non-Hermitian. Before discussing the spectra of these Dirac operators at non-zero chemical potential, the article considers spontaneous symmetry breaking in RMT and the QCD partition function. It then examines the global symmetries of QCD, ta

APA, Harvard, Vancouver, ISO, and other styles

8

Concini, Corrado De, and Claudio Procesi. Topics in Hyperplane Arrangements, Polytopes and Box-Splines. Springer London, Limited, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Matrice partitions"

1

Hildenbrandt, Regina. "Partitions-requirements-matrices." In Operations Research Proceedings 2001. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-50282-8_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Beck, J., and J. Spencer. "Balancing Matrices with Line Shifts II." In Irregularities of Partitions. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-61324-1_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Fuzhen. "Partitioned Matrices." In Universitext. Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4757-5797-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hackbusch, Wolfgang. "Matrix Partition." In Hierarchical Matrices: Algorithms and Analysis. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47324-5_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Harville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra From a Statistician’s Perspective. Springer New York, 1997. http://dx.doi.org/10.1007/0-387-22677-x_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Harville, David A. "Submatrices and Partitioned Matrices." In Matrix Algebra: Exercises and Solutions. Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0181-3_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, Fuzhen. "Partitioned Matrices, Rank, and Eigenvalues." In Universitext. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1099-7_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Abed, Fidaa, Ioannis Caragiannis, and Alexandros A. Voudouris. "Near-Optimal Asymmetric Binary Matrix Partitions." In Mathematical Foundations of Computer Science 2015. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48054-0_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Alon, Noga, Michal Feldman, Iftah Gamzu, and Moshe Tennenholtz. "The Asymmetric Matrix Partition Problem." In Web and Internet Economics. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45046-4_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kuang, Da, Jaegul Choo, and Haesun Park. "Nonnegative Matrix Factorization for Interactive Topic Modeling and Document Clustering." In Partitional Clustering Algorithms. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09259-1_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Matrice partitions"

1

Sankhavara, C. D., and H. J. Shukla. "Influence of Partition Location on Natural Convection in a Partitioned Enclosure." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72093.

Full text

Abstract:

In this study, Natural convection heat transfer and fluid flow of square partitioned enclosure with two partitions protruding centrally from the end walls of an enclosure have been analysed numerically using finite element method. The enclosure has opposite isothermal walls at different temperatures. The thickness and length of the partitions is fixed and equal to 1/10 and 1/4 of width of the enclosure respectively. Computation for Rayleigh number in the range of 104 to 106 has been conducted. The influence of different thermal boundary conditions at the end walls and at the partitions is incl

APA, Harvard, Vancouver, ISO, and other styles

2

Kang, Zhao, Zipeng Guo, Shudong Huang, et al. "Multiple Partitions Aligned Clustering." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/375.

Full text

Abstract:

Multi-view clustering is an important yet challenging task due to the difficulty of integrating the information from multiple representations. Most existing multi-view clustering methods explore the heterogeneous information in the space where the data points lie. Such common practice may cause significant information loss because of unavoidable noise or inconsistency among views. Since different views admit the same cluster structure, the natural space should be all partitions. Orthogonal to existing techniques, in this paper, we propose to leverage the multi-view information by fusing partit

APA, Harvard, Vancouver, ISO, and other styles

3

Gobel, Andreas, Leslie Ann Goldberg, Colin McQuillan, David Richerby, and Tomoyuki Yamakami. "Counting List Matrix Partitions of Graphs." In 2014 IEEE Conference on Computational Complexity (CCC). IEEE, 2014. http://dx.doi.org/10.1109/ccc.2014.14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Langr, Daniel, and Ivan Šimeček. "On Memory Footprints of Partitioned Sparse Matrices." In 2017 Federated Conference on Computer Science and Information Systems. IEEE, 2017. http://dx.doi.org/10.15439/2017f70.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Qiu, Chen, and Jian S. Dai. "Constraint Stiffness Construction and Decomposition of a SPS Orthogonal Parallel Mechanism." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46811.

Full text

Abstract:

This paper investigates both stiffness analysis and synthesis problems using a physical prototype of one SPS orthogonal parallel mechanism. This parallel mechanism is supported with line-type constraint limbs. In the stiffness analysis, a reciprocal relationship between motions and wrenches is used to design layouts of constraint limbs and construct the corresponding stiffness matrix. In the stiffness synthesis, the developed stiffness matrix is decomposed to obtain configurations of constraint limbs based on existing synthesis algorithms, including direct-recursion and matrix-partition approa

APA, Harvard, Vancouver, ISO, and other styles

6

Sugino, Fumihiko. "U-duality from matrix membrane partition function." In STRING THEORY; 10th Tohwa University International Symposium on String Theory. AIP, 2002. http://dx.doi.org/10.1063/1.1454380.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lin, Po Ting, Yu-Cheng Chou, Mark Christian E. Manuel, and Kuan Sung Hsu. "Investigation of Numerical Performance of Partitioning and Parallel Processing of Markov Chain (PPMC) for Complex Design Problems." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34652.

Full text

Abstract:

Divide-and-conquer strategies have been utilized to perform evaluation calculations of complex network systems, such as reliability analysis of a Markov chain. This paper focuses on partitioning of Markov chain for a multi-modular redundant system and the fast calculation using parallel processing. The complexity of Markov chain is first reduced by eliminating the connections with low transition probabilities associated with a threshold parameter. The transition probability matrix is then reordered and partitioned such that a worse-case reliability is evaluated through the calculations in only

APA, Harvard, Vancouver, ISO, and other styles

8

Fabregat-Traver, Diego, Paolo Bientinesi, Theodore E. Simos, George Psihoyios, and Ch Tsitouras. "Automatic Generation of Partitioned Matrix Expressions for Matrix Operations." In ICNAAM 2010: International Conference of Numerical Analysis and Applied Mathematics 2010. AIP, 2010. http://dx.doi.org/10.1063/1.3498598.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Strofylas, Giorgos A., Georgios I. Mazanakis, Sotirios S. Sarakinos, Georgios N. Lygidakis, and Ioannis K. Nikolos. "On the Use of Improved Radial Basis Functions Methods in Fluid-Structure Interaction Simulations." In ASME 2016 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/imece2016-66412.

Full text

Abstract:

The development of an efficient partitioned FSI coupling scheme is reported in this paper, aimed to facilitate interaction between an open-source CSD software package and an in-house academic CFD code. The coupling procedure is based on Radial Basis Functions (RBFs) interpolation for both information transfer and mesh deformation, entailing no dependence on connectivities, and hence making it applicable to different type or even intersecting grids. However, the method calls for increased computational resources in its initial formulation; to alleviate this deficiency, appropriate acceleration

APA, Harvard, Vancouver, ISO, and other styles

10

Chou, Chiu-Chih, Thong Nguyen, and Jose E. Schutt-Aine. "Impact of Partition Schemes in Loewner Matrix Macromodeling." In 2020 IEEE Electrical Design of Advanced Packaging and Systems (EDAPS). IEEE, 2020. http://dx.doi.org/10.1109/edaps50281.2020.9312918.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Matrice partitions"

1

Brenan, J. M., K. Woods, J. E. Mungall, and R. Weston. Origin of chromitites in the Esker Intrusive Complex, Ring of Fire Intrusive Suite, as revealed by chromite trace element chemistry and simple crystallization models. Natural Resources Canada/CMSS/Information Management, 2021. http://dx.doi.org/10.4095/328981.

Full text

Abstract:

To better constrain the origin of the chromitites associated with the Esker Intrusive Complex (EIC) of the Ring of Fire Intrusive Suite (RoFIS), a total of 50 chromite-bearing samples from the Black Thor, Big Daddy, Blackbird, and Black Label chromite deposits have been analysed for major and trace elements. The samples represent three textural groups, as defined by the relative abundance of cumulate silicate phases and chromite. To provide deposit-specific partition coefficients for modeling, we also report on the results of laboratory experiments to measure olivine- and chromite-melt partiti

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!