No abstract

In this paper, we study the Legendre spectral element method for solving the sine-Gordon equation in one dimension. Firstly, we discretize the equation by Legendre spectral element in space and then discretize the time by the second-order leap-frog method. We study the stability and convergence of the method and show the convergence of our method. Finally, we show the results with numerical examples. MSC: 65M70; 65M06; 74G15

In this article we will discuss the solution of elliptic optimal control problem. First, by using the finite element method we obtain the discrete form of the problem. The obtained discrete problem is actually a large scale constrained optimization problem. Solving this optimization problem with traditional methods is difficult and requires a lot of CPU time and memory. But split Bergman method converts the constrained problem to an unconstrained, and hence it saves time and memory requirement. Then we use the split Bregman method for solving this problem, and examples show the speed and accuracy of split Bregman methods for solving this type of problems. We also use the SQP method for solving the examples and compare with split Bregman method.