A tree-based dataflow model for the unsymmetric multifrontal method.
An iterative procedure containing two parameters for linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numeric example is given as an illustration.
The paper is devoted to the computation of two-phase flows in a porous medium when applying the two-fluid approach. The basic formulation is presented first, together with the main properties of the model. A few basic analytic solutions are then provided, some of them corresponding to solutions of the one-dimensional Riemann problem. Three distinct Finite-Volume schemes are then introduced. The first two schemes, which rely on the Rusanov scheme, are shown to give wrong approximations in some...
We design an abstract setting for the approximation in Banach spaces of operators acting in duality. A typical example are the gradient and divergence operators in Lebesgue-Sobolev spaces on a bounded domain. We apply this abstract setting to the numerical approximation of Leray-Lions type problems, which include in particular linear diffusion. The main interest of the abstract setting is to provide a unified convergence analysis that simultaneously covers (i) all usual boundary conditions, (ii)...
We consider the singular boundary value problem where is a given continuous function defined on the set which can have a time singularity at and a space singularity at . Moreover, , , and , , are real constants such that , whereas . The main aim of this paper is to discuss the existence of solutions to the above problem and apply the general results to cover certain classes of singular problems arising in the theory of shallow membrane caps, where we are especially interested in...
The Lanczos method for solving systems of linear equations is implemented by using some recurrence relationships between polynomials of a family of formal orthogonal polynomials or between those of two adjacent families of formal orthogonal polynomials. A division by zero can occur in these relations, thus producing a breakdown in the algorithm which has to be stopped. In this paper, three strategies to avoid this drawback are discussed: the MRZ and its variants, the normalized and unnormalized...
The discretisation of the Oseen problem by finite element methods may suffer in general from two shortcomings. First, the discrete inf-sup (Babuška-Brezzi) condition can be violated. Second, spurious oscillations occur due to the dominating convection. One way to overcome both difficulties is the use of local projection techniques. Studying the local projection method in an abstract setting, we show that the fulfilment of a local inf-sup condition between approximation and projection spaces...
In this paper we consider the eigenvalue problem for positive definite symmetric matrices. Convergence properties for the zero shift method and the shift Cholesky method both in restoring and in non restoring version are deduced from the convergence properties of triangular matrices sequences. For general matrices we obtain some results on the convergence speed of the Cholesky method as a function of the chosen shift. These results follow from the absolute convergence of numerical series associated...