The distance to cubic symmetry class as a polynomial optimization problem
From MaRDI portal
(Redirected from Publication:6608102)
The distance to cubic symmetry class as a polynomial optimization problem (scientific article; zbMATH DE number 7915974)
The distance to cubic symmetry class as a polynomial optimization problem (scientific article; zbMATH DE number 7915974)
Recommendations
- Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
- The closest elastic tensor of arbitrary symmetry to an elasticity tensor of lower symmetry
- Distances of stiffnesses to symmetry classes
- On obtaining effective transversely isotropic elasticity tensors
- Invariant properties for finding distance in space of elasticity tensors
Cites work
- A note on the decomposition of tensors into traceless symmetric tensors
- A Study on Gröbner Basis with Inexact Input
- A theory of the yielding and plastic flow of anisotropic metals
- Algorithms in invariant theory
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An introduction to differential manifolds. Translated from the 2nd French edition by Jonathan Upjohn
- An introduction to polynomial and semi-algebraic optimization
- Characterization of the symmetry class of an elasticity tensor using polynomial covariants
- Determination of the symmetries of an experimentally determined stiffness tensor: Application to acoustic measurements
- Distances of stiffnesses to symmetry classes
- Effective elasticity tensors in context of random errors
- Generalized Euclidean distances for elasticity tensors
- Global optimization of polynomials over real algebraic sets
- HARMONIC DECOMPOSITION OF THE ANISOTROPIC ELASTICITY TENSOR
- Harmonic factorization and reconstruction of the elasticity tensor
- scientific article; zbMATH DE number 4163072 (Why is no real title available?)
- scientific article; zbMATH DE number 48327 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1235200 (Why is no real title available?)
- scientific article; zbMATH DE number 1022379 (Why is no real title available?)
- scientific article; zbMATH DE number 1150724 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Identifying symmetry classes of elasticity tensors using monoclinic distance function
- Inequalities defining orbit spaces
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Leveling with Lagrange: an alternate view of constrained optimization
- Manifolds, tensor analysis, and applications.
- On anisotropic polynomial relations for the elasticity tensor
- On obtaining effective orthotropic elasticity tensors
- On obtaining effective transversely isotropic elasticity tensors
- On the polynomial invariants of the elasticity tensor
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- PROPERTIES OF THE ANISOTROPIC ELASTICITY TENSOR
- Quantitative generalized Bertini-Sard theorem for smooth affine varieties
- Recovering the normal form and symmetry class of an elasticity tensor
- Semidefinite optimization
- Semidefinite Programming
- Sums of squares, moment matrices and optimization over polynomials
- Symmetry classes for elasticity tensors
- The closest elastic tensor of arbitrary symmetry to an elasticity tensor of lower symmetry
- The geometry of spontaneous symmetry breaking
Cited in
(1)
This page was built for publication: The distance to cubic symmetry class as a polynomial optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608102)
