The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
Tuning the alternating Schwarz method to the exterior problems is the subject of this paper. We present the original algorithm and we propose a modification of it, so that the solution of the subproblem involving the condition at infinity has an explicit integral representation formulas while the solution of the other subproblem, set in a bounded domain, is approximated by classical variational methods. We investigate many of the advantages of the new Schwarz approach: a geometrical convergence...
Tuning the alternating Schwarz method to the exterior problems is the subject of this paper. We present the original algorithm and we propose a modification of it, so that the solution of the subproblem involving the condition at infinity has an explicit integral representation formulas while the solution of the other subproblem, set in a bounded domain, is approximated by classical variational methods. We investigate many of the advantages of the new Schwarz approach: a geometrical convergence...
Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken P1 function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the L2 norm, under the sufficient condition that the...
Cell-centered and vertex-centered finite volume schemes for the Laplace equation with homogeneous Dirichlet boundary conditions are considered on a triangular mesh and on the Voronoi diagram associated to its vertices. A broken P1 function is constructed from the solutions of both schemes. When the domain is two-dimensional polygonal convex, it is shown that this reconstruction converges with second-order accuracy towards the exact solution in the L2 norm, under the sufficient condition that the...
In this paper the solution of a finite element approximation of a linear obstacle plate problem is investigated. A simple version of an interior point method and a block pivoting algorithm have been proposed for the solution of this problem. Special purpose implementations of these procedures are included and have been used in the solution of a set of test problems. The results of these experiences indicate that these procedures are quite efficient to deal with these instances and compare favourably...
We investigate the stability of Bravais lattices and their Cauchy–Born approximations under periodic perturbations. We formulate a general interaction law and derive its Cauchy–Born continuum limit. We then analyze the atomistic and Cauchy–Born stability regions, that is, the sets of all matrices that describe a stable Bravais lattice in the atomistic and Cauchy–Born models respectively. Motivated by recent results in one dimension on the stability of atomistic/continuum coupling methods, we analyze...
We investigate the stability of Bravais lattices and their Cauchy–Born approximations under periodic perturbations. We formulate a general interaction law and derive its Cauchy–Born continuum limit. We then analyze the atomistic and Cauchy–Born stability regions, that is, the sets of all matrices that describe a stable Bravais lattice in the atomistic and Cauchy–Born models respectively. Motivated by recent results in one dimension on the stability of atomistic/continuum coupling methods,...