On the strong stability of operator-difference schemes in time-integral norms.
We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix . It falls in the category of inner-outer iteration methods and aims to reduce the costs of matrix-vector products with within its inner iteration. This is done by choosing an approximation of , and then, based on both and , to define a sequence of matrices that increasingly better approximate...
In a crystalline algorithm, a tangential velocity is used implicitly. In this short note, it is specified for the case of evolving plane curves, and is characterized by using the intrinsic heat equation.
The contact between two membranes can be described by a system of variational inequalities, where the unknowns are the displacements of the membranes and the action of a membrane on the other one. We first perform the analysis of this system. We then propose a discretization, where the displacements are approximated by standard finite elements and the action by a local postprocessing. Such a discretization admits an equivalent mixed reformulation. We prove the well-posedness of the discrete problem...
In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that...