The Associativity of Infinite Matrix Multiplication, Revisited

Author(s):  
Michael Maltenfort
2019 ◽  
Vol 126 (1) ◽  
pp. 41-52 ◽  
Author(s):  
Daniel P. Bossaller ◽  
Sergio R. López-Permouth

2000 ◽  
Vol 653 ◽  
Author(s):  
Samuel Forest

AbstractThe mechanics of generalized continua provides an efficient way of introducing intrinsic length scales into continuum models of materials. A Cosserat framework is presented here to descrine the mechanical behavior of crystalline solids. The first application deals with the problem of the stress field at a crak tip in Cosserat single crystals. It is shown that the strain localization patterns developping at the crack tip differ from the classical picture : the Cosserat continuum acts as a bifurcation mode selector, whereby kink bands arising in the classical framework disappear in generalized single crystal plasticity. The problem of a Cosserat elastic inclusion embedded in an infinite matrix is then considered to show that the stress state inside the inclusion depends on its absolute size lc. Two saturation regimes are observed : when the size R of the inclusion is much larger than a characteristic size of the medium, the classical Eshelby solution is recovered. When R is much small than the inclusion, a much higher stress is reached (for an inclusion stiffer than the matrix) that does not depend on the size any more. There is a transition regime for which the stress state is not homogeneous inside the inclusion. Similar regimes are obtained in the study of grain size effects in polycrystalline aggregates of Cosserat grains.


Author(s):  
Yaniv Aspis ◽  
Krysia Broda ◽  
Alessandra Russo ◽  
Jorge Lobo

We introduce a novel approach for the computation of stable and supported models of normal logic programs in continuous vector spaces by a gradient-based search method. Specifically, the application of the immediate consequence operator of a program reduct can be computed in a vector space. To do this, Herbrand interpretations of a propositional program are embedded as 0-1 vectors in $\mathbb{R}^N$ and program reducts are represented as matrices in $\mathbb{R}^{N \times N}$. Using these representations we prove that the underlying semantics of a normal logic program is captured through matrix multiplication and a differentiable operation. As supported and stable models of a normal logic program can now be seen as fixed points in a continuous space, non-monotonic deduction can be performed using an optimisation process such as Newton's method. We report the results of several experiments using synthetically generated programs that demonstrate the feasibility of the approach and highlight how different parameter values can affect the behaviour of the system.


1983 ◽  
Author(s):  
I. V. Ramakrishnan ◽  
P. J. Varman

2002 ◽  
Vol 109 (8) ◽  
pp. 763
Author(s):  
Sung Soo Kim ◽  
Richard Johnsonbaugh ◽  
Ronald E. Prather ◽  
Donald Knuth

Sign in / Sign up

Export Citation Format

Share Document