The Lame Class

The Lame class defines a Lame equation problem:

$$-(\mu (u\hackscore{i,j}+u\hackscore{j,i})+\lambda u\hackscore{k,k}\delta\hackscore{ij})\hackscore{j} = F\hackscore{i}-\sigma\hackscore{ij,j}$$ (97)

with natural boundary conditions:

$$n\hackscore{j}(\mu \; (u\hackscore{i,j}+u\hackscore{j,i})+\lambda... ...e{k,k}\delta\hackscore{ij}) = f\hackscore{i}+n\hackscore{j}\sigma\hackscore{ij}$$ (98)

and constraint

$$u\hackscore{i}=r\hackscore{i} q\hackscore{i}>0$$ (99)

$\mu$ , $\lambda$ have to be a scalar Data object in the general FunctionSpace, $F$ has to be a vector Data object in the general FunctionSpace, $\sigma$ has to be a tensor Data object in the general FunctionSpace, $f$ must be a vector Data object in the boundary FunctionSpace, and $q$ and $r$ must be a vector Data object in the solution FunctionSpace or must be mapped or interpolated into the particular FunctionSpace.