'GROUP-COMPLETION', LOCAL COEFFICIENT SYSTEMS AND PERFECTION

2013 ◽  
Vol 64 (3) ◽  
pp. 795-803 ◽  
Author(s):  
O. Randal-Williams
Keyword(s):  
Local Coefficient ◽  
Group Completion

Local coefficient of friction, sub-surface stresses and temperature distribution during sliding contact

2010 ◽  
Vol 38 (1) ◽  
pp. 44 ◽  
Author(s):  
A. Jourani ◽  
M. Bigerelle ◽  
L. Petit ◽  
H. Zahouani
Keyword(s):  
Temperature Distribution ◽  
Coefficient Of Friction ◽  
Sliding Contact ◽  
Local Coefficient ◽  
Surface Stresses

Small Group Completion of Formative Tasks Questionnaire

1990 ◽  
Author(s):  
Janice H. Schopler ◽  
Maeda J. Galinsky
Keyword(s):  
Small Group ◽  
Group Completion

HIGHER -THEORY OF FORMS I. FROM RINGS TO EXACT CATEGORIES

2019 ◽  
pp. 1-69 ◽  
Author(s):  
Marco Schlichting
Keyword(s):  
Form Parameter ◽  
Hermitian Forms ◽  
Group Completion ◽  
Theory Of Forms ◽  
Exact Sequences ◽  
Exact Categories

We prove the analog for the $K$ -theory of forms of the $Q=+$ theorem in algebraic $K$ -theory. That is, we show that the $K$ -theory of forms defined in terms of an $S_{\bullet }$ -construction is a group completion of the category of quadratic spaces for form categories in which all admissible exact sequences split. This applies for instance to quadratic and hermitian forms defined with respect to a form parameter.

Ap-benzyne tom-benzyne conversion through a 1,2-shift of a phenyl group. Completion of the benzyne cascade

2004 ◽  
Vol 17 (9) ◽  
pp. 798-806 ◽  
Author(s):  
Alexei L. Polishchuk ◽  
Kevin L. Bartlett ◽  
Lee A. Friedman ◽  
Maitland Jones
Keyword(s):  
Phenyl Group ◽  
Group Completion

Homology fibrations and the ?group-completion? theorem

1976 ◽  
Vol 31 (3) ◽  
pp. 279-284 ◽  
Author(s):  
D. McDuff ◽  
G. Segal
Keyword(s):  
Group Completion ◽  
Completion Theorem

A Method of Determining the Local Coefficient of Heat Transfer

1943 ◽  
Vol 46 (320) ◽  
pp. 754-755
Author(s):  
Kiyosi YAMAGATA ◽  
Kenjiro SIRAKAWA
Keyword(s):  
Heat Transfer ◽  
Local Coefficient

Monoid Presentations and Associated Groupoids

1998 ◽  
Vol 08 (02) ◽  
pp. 141-152 ◽  
Author(s):  
N. D. Gilbert
Keyword(s):  
Fundamental Group ◽  
Group Completion ◽  
Monoid Presentation ◽  
Fundamental Groupoid ◽  
Monoid Structure

We consider properties of a 2-complex associated by Squier to a monoid presentation. We show that the fundamental groupoid admits a monoid structure, and we establish a relationship between its group completion and the fundamental group of the 2-complex. We also treat a modified complex, due to Pride, for monoid presentations of groups, and compute the structure of the fundamental groupoid in this setting.

Whitney-sums (fibre-joins) in over space theory and obstruction theory for cohomology with local coefficients

1990 ◽  
Vol 115 (3-4) ◽  
pp. 359-365 ◽  
Author(s):  
John W. Rutter
Keyword(s):  
Obstruction Theory ◽  
Space Theory ◽  
Connected Space ◽  
Local Coefficient ◽  
General Properties ◽  
Local Coefficients ◽  
Simply Connected ◽  
Cohomology With Local Coefficients ◽  
Cohomology Sequence

SynopsisThe generalised Whitney sum (fibre-join) and the h-fibre-join can be defined in topM, the category of spaces over M. We note here some general properties of these constructions, and, as a specific example, we consider the relation between them and the extensions to the topM category of the top h-fibre-sequences F∗ΩB→E ∪ CF→B determined by top fibrations F→E→B. As an application we obtain the truncated local coefficient cohomology sequence for a top fibration which is topM principal fibration: this situation applies, for example, to the various stages of the Postnikov decomposition of a non-simply connected space X, and in this case we have M = K1(π1(X)).

scholarly journals Parallel Multiprojection Preconditioned Methods Based on Subspace Compression

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Byron E. Moutafis ◽  
Christos K. Filelis-Papadopoulos ◽  
George A. Gravvanis
Keyword(s):  
Linear Systems ◽  
Adjacency Matrix ◽  
Sparse Linear Systems ◽  
Breadth First Search ◽  
Compression Technique ◽  
New Approach ◽  
Local Coefficient ◽  
Preconditioned Iterative ◽  
Comparative Results ◽  
Average Size

During the last decades, the continuous expansion of supercomputing infrastructures necessitates the design of scalable and robust parallel numerical methods for solving large sparse linear systems. A new approach for the additive projection parallel preconditioned iterative method based on semiaggregation and a subspace compression technique, for general sparse linear systems, is presented. The subspace compression technique utilizes a subdomain adjacency matrix and breadth first search to discover and aggregate subdomains to limit the average size of the local linear systems, resulting in reduced memory requirements. The depth of aggregation is controlled by a user defined parameter. The local coefficient matrices use the aggregates computed during the formation of the subdomain adjacency matrix in order to avoid recomputation and improve performance. Moreover, the rows and columns corresponding to the newly formed aggregates are ordered last to further reduce fill-in during the factorization of the local coefficient matrices. Furthermore, the method is based on nonoverlapping domain decomposition in conjunction with algebraic graph partitioning techniques for separating the subdomains. Finally, the applicability and implementation issues are discussed and numerical results along with comparative results are presented.

Sign in / Sign up

Export Citation Format

Share Document