[关闭]
@lyc102 2018-01-15T00:45:29.000000Z 字数 2803 阅读 1014

Energy minimization

math


Energy Minimization: the Method

Consider
where

Now we replace by as the first order approximation of the quadratic function, i.e.,

Note that
We then obtain a quadratic form

Obviously is convex as a quadratic form. It is a good approximaiton of as a quadratic function is approximated by its linear Taylor series. We then let

Goal

Energy Stable


We write as

As a quadratic energy minimization, the energy decreased in is
which can be proved by the Taylor series of at the minimum point .
The first part is


The difference is

We skip the -norm part, as we skip the parameter in the definition of which will dominate the energy.

Write out the quadratic form as a function of and check when it is positive. My computation shows that when it is positive, we have

So consider the time dependent problem and introduced a time discretization . Namely consider the evolution problem

When is small, then should be close to and thus can control the derivation. How small is the ? Write out the Euler equation for

Not quite right. If we add a quadratic term into , then the energy decreated is more. The coefficient will be like

Discrete Maximum Principle

If , i.e., the discrete maximum principle holds, then from the figure But unfortunately, we can't prove the discrete maximum principle as a lineared is used.

We can modify our minimization problem to a constraint minimization problem


The energy is quadratic and the constraint is a convex set. So the minimizer exists and unique. This known as obstacle problem and fast (multigrid) methods exists. If we let

We still have . Now since , we have and thus .

添加新批注
在作者公开此批注前,只有你和作者可见。
回复批注