Search

A large number of free boundary problems can be formulated as linear-complementarity problems. In this paper, we propose an inexact alternating direction method of multipliers for solving linear complementarity problem arising from free boundary problems by using the special structure of these problems. The convergence of our proposed method is proved. Numerical results show that the proposed method is feasible and effective, and it is significantly faster than modified alternating direction implicit algorithm and many other methods, especially when dimension of the problem being solved is large. [ABSTRACT FROM AUTHOR]

The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade (Knyazev et al. in Numerical solution of PDE eigenvalue problems, vol 56. Mathematisches Forschungsinstitut, Oberwolfach, ). Here we present an new algorithm based on slicing the spectrum that takes advantage of the rank structure of resolvent matrices in order to compute $$m$$ eigenvalues of the generalized symmetric eigenvalue problem in $${\fancyscript{O}}(nm\log ^\alpha n)$$ operations, where $$\alpha >0$$ is a small constant. [ABSTRACT FROM AUTHOR]