The relaxed-polar mechanism of locally optimal Cosserat rotations for an idealized nanoindentation and comparison with 3D-EBSD experiments

The rotation ${\rm polar}(F) \in {\rm SO}(3)$ arises as the unique orthogonal factor of the right polar decomposition $F = {\rm polar}(F) \cdot U$ of a given invertible matrix $F \in {\rm GL}^+(3)$. In the context of nonlinear elasticity Grioli (1940) discovered a geometric variational characterization of ${\rm polar}(F)$ as a unique energy-minimizing rotation. In preceding works, we have analyzed a generalization of Grioli's variational approach with weights (material parameters) $\mu > 0$ and $\mu_c \geq 0$ (Grioli: $\mu = \mu_c$). The energy subject to minimization coincides with the Cosserat shear-stretch contribution arising in any geometrically nonlinear, isotropic and quadratic Cosserat continuum model formulated in the deformation gradient field $F := \nabla\varphi: \Omega \to {\rm GL}^+(3)$ and the microrotation field $R: \Omega \to {\rm SO}(3)$. The corresponding set of non-classical energy-minimizing rotations $${\rm rpolar}^\pm_{\mu,\mu_c}(F) := \substack{{\rm argmin}\\ R\,\in\,{\rm SO(3)}} \Big\{ W_{\mu, \mu_c}(R\,;F) := \mu\, || {\rm sym}(R^TF - 1)||^2 + \mu_c\, ||{\rm skew}(R^TF - 1)||^2 \Big\}$$ represents a new relaxed-polar mechanism. Our goal is to motivate this mechanism by presenting it in a relevant setting. To this end, we explicitly construct a deformation mapping $\varphi_{\rm nano}$ which models an idealized nanoindentation and compare the corresponding optimal rotation patterns ${\rm rpolar}^\pm_{1,0}(F_{\rm nano})$ with experimentally obtained 3D-EBSD measurements of the disorientation angle of lattice rotations due to a nanoindentation in solid copper. We observe that the non-classical relaxed-polar mechanism can produce interesting counter-rotations. A possible link between Cosserat theory and finite multiplicative plasticity theory on small scales is also explored.Comment: 28 pages, 11 figure

Rational Maps, Monopoles and Skyrmions

We discuss the similarities between BPS monopoles and Skyrmions, and point to an underlying connection in terms of rational maps between Riemann spheres. This involves the introduction of a new ansatz for Skyrme fields. We use this to construct good approximations to several known Skyrmions, including all the minimal energy configurations up to baryon number nine, and some new solutions such as a baryon number seventeen Skyrme field with the truncated icosahedron structure of a buckyball. The new approach is also used to understand the low-lying vibrational modes of Skyrmions, which are required for quantization. Along the way we discover an interesting Morse function on the space of rational maps which may be of use in understanding the Sen forms on the monopole moduli spaces.Comment: 35pp including four figures, typos corrected, appearing in Nuclear Physics

Symmetric indefinite triangular factorization revealing the rank profile matrix

We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} = \mathbf{L}\mathbf{D}\mathbf{L}^T$ where $\mathbf{P}$ is a permutation matrix, $\mathbf{L}$ is lower triangular with a unit diagonal and $\mathbf{D}$ is symmetric block diagonal with $1{\times}1$ and $2{\times}2$ antidiagonal blocks. The novel algorithm requires $O(n^2r^{\omega-2})$ arithmetic operations. Furthermore, experimental results demonstrate that our algorithm can even be slightly more than twice as fast as the state of the art unsymmetric Gaussian elimination in most cases, that is it achieves approximately the same computational speed. By adapting the pivoting strategy developed in the unsymmetric case, we show how to recover the rank profile matrix from the permutation matrix and the support of the block-diagonal matrix. There is an obstruction in characteristic $2$ for revealing the rank profile matrix which requires to relax the shape of the block diagonal by allowing the 2-dimensional blocks to have a non-zero bottom-right coefficient. This relaxed decomposition can then be transformed into a standard $\mathbf{P}\mathbf{L}\mathbf{D}\mathbf{L}^T\mathbf{P}^T$ decomposition at a negligible cost

Analytic, Group-Theoretic Density Profiles for Confined, Correlated N-Body Systems

Confined quantum systems involving $N$ identical interacting particles are to be found in many areas of physics, including condensed matter, atomic and chemical physics. A beyond-mean-field perturbation method that is applicable, in principle, to weakly, intermediate, and strongly-interacting systems has been set forth by the authors in a previous series of papers. Dimensional perturbation theory was used, and in conjunction with group theory, an analytic beyond-mean-field correlated wave function at lowest order for a system under spherical confinement with a general two-body interaction was derived. In the present paper, we use this analytic wave function to derive the corresponding lowest-order, analytic density profile and apply it to the example of a Bose-Einstein condensate.Comment: 15 pages, 2 figures, accepted by Physics Review A. This document was submitted after responding to a reviewer's comment

The Quaternion-Based Spatial Coordinate and Orientation Frame Alignment Problems

We review the general problem of finding a global rotation that transforms a given set of points and/or coordinate frames (the "test" data) into the best possible alignment with a corresponding set (the "reference" data). For 3D point data, this "orthogonal Procrustes problem" is often phrased in terms of minimizing a root-mean-square deviation or RMSD corresponding to a Euclidean distance measure relating the two sets of matched coordinates. We focus on quaternion eigensystem methods that have been exploited to solve this problem for at least five decades in several different bodies of scientific literature where they were discovered independently. While numerical methods for the eigenvalue solutions dominate much of this literature, it has long been realized that the quaternion-based RMSD optimization problem can also be solved using exact algebraic expressions based on the form of the quartic equation solution published by Cardano in 1545; we focus on these exact solutions to expose the structure of the entire eigensystem for the traditional 3D spatial alignment problem. We then explore the structure of the less-studied orientation data context, investigating how quaternion methods can be extended to solve the corresponding 3D quaternion orientation frame alignment (QFA) problem, noting the interesting equivalence of this problem to the rotation-averaging problem, which also has been the subject of independent literature threads. We conclude with a brief discussion of the combined 3D translation-orientation data alignment problem. Appendices are devoted to a tutorial on quaternion frames, a related quaternion technique for extracting quaternions from rotation matrices, and a review of quaternion rotation-averaging methods relevant to the orientation-frame alignment problem. Supplementary Material covers extensions of quaternion methods to the 4D problem.Comment: This replaces an early draft that lacked a number of important references to previous work. There are also additional graphics elements. The extensions to 4D data and additional details are worked out in the Supplementary Material appended to the main tex

On Linear Congestion Games with Altruistic Social Context

We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework, given a real matrix $\Gamma=(\gamma_{ij})$ specifying a particular social context, each player $i$ aims at optimizing a linear combination of the payoffs of all the players in the game, where, for each player $j$, the multiplicative coefficient is given by the value $\gamma_{ij}$. We give a broad characterization of the social contexts for which pure Nash equilibria are always guaranteed to exist and provide tight or almost tight bounds on their prices of anarchy and stability. In some of the considered cases, our achievements either improve or extend results previously known in the literature

Regularized Multivariate Regression Models with Skew-\u3cem\u3et\u3c/em\u3e Error Distributions

We consider regularization of the parameters in multivariate linear regression models with the errors having a multivariate skew-t distribution. An iterative penalized likelihood procedure is proposed for constructing sparse estimators of both the regression coefficient and inverse scale matrices simultaneously. The sparsity is introduced through penalizing the negative log-likelihood by adding L1-penalties on the entries of the two matrices. Taking advantage of the hierarchical representation of skew-t distributions, and using the expectation conditional maximization (ECM) algorithm, we reduce the problem to penalized normal likelihood and develop a procedure to minimize the ensuing objective function. Using a simulation study the performance of the method is assessed, and the methodology is illustrated using a real data set with a 24-dimensional response vector