Adaptive algorithms for scalar non-convex variational problems

DOI10.1016/S0168-9274(97)00089-5zbMath0894.65029WikidataQ127861546 ScholiaQ127861546MaRDI QIDQ1379037

Petr Plecháč, Carsten Carstensen

Publication date: 7 September 1998

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical examplesadaptive algorithmsnon-convex variational problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40)

Related Items

A comparison of classical and new finite element methods for the computation of laminate microstructure ⋮ On the Numerical Modeling of Deformations of Pressurized Martensitic Thin Films ⋮ Stability of microstructure for tetragonal to monoclinic martensitic transformations ⋮ Stability of microstructures for some martensitic transformations

Uses Software

• tn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fine phase mixtures as minimizers of energy
• On the non-locality of quasiconvexity
• Newton-Type Minimization via the Lanczos Method
• On the Convergence of Finite-Element Approximations of a Relaxed Variational Problem
• Optimal-Order Error Estimates for the Finite Element Approximation of the Solution of a Nonconvex Variational Problem
• Proposed experimental tests of a theory of fine microstructure and the two-well problem
• Numerical Approximations in Variational Problems with Potential Wells
• A Posteriori Error Estimates for Nonlinear Problems. Finite Element Discretizations of Elliptic Equations
• A necessary and sufficient condition for nonattainment and formation of microstructure almost everywhere in scalar variational problems
• Strong Convergence of Numerical Solutions to Degenerate Variational Problems
• Numerical solution of the scalar double-well problem allowing microstructure
• Direct methods in the calculus of variations