Name
Abstract | ||
|---|---|---|
An iterative algorithm that approximates the polyconvex envelope fpc of a given function $f:{\mathbb{R}}^{n\times m} \to {\mathbb{R}}$, i.e., the largest function below f which is convex in all minors, is established. Also presented are a rigorous error analysis with a focus on reliability and optimal orders of convergence, an efficient strategy that reduces the large number of unknowns, as well as numerical experiments. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/S0036142903428840 | SIAM J. Numerical Analysis |
Keywords | Field | DocType |
microstructures,order of convergence,calculus of variations,microstructure,iterative algorithm,calculus of variation | Convergence (routing),Mathematical optimization,Mathematical analysis,Iterative method,Calculus of variations,Regular polygon,Adaptive algorithm,Numerical analysis,Mathematics | Journal |
Volume | Issue | ISSN |
43 | 1 | 0036-1429 |
Citations | PageRank | References |
4 | 1.20 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sören Bartels | 1 | 355 | 56.90 |