Recent advances have shown that block recursive approximate factorizations provide among the best preconditioners for solving elasticity equations on large 3D meshes such as arising in geomechanical applications. However, to get full efficiency of these methods, a wide range of implementation...

Conference Paper

Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408–3426, <CitationRef CitationID="CR25">2010</CitationRef>; Peng et...</citationref>

In this paper, we propose a new correction strategy for some first-order primal-dual algorithms arising from solving, e.g., total variation image restoration. With this strategy, we can prove the convergence of the algorithm under more flexible conditions than those proposed most recently. Some...

We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1 It can easily deal with a wide range of dynamic systems including stiff differential equations and systems giving rise...