### A Capacitance Matrix Method for Dirichlet Problem on Polygon Region.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

The development of iterative methods for solving linear algebraic equations has brought the question of when the employment of these methods is more advantageous than the use of the direct ones. In the paper, a comparison of the direct and iterative methods is attempted. The methods are applied to solving a certain class of boundary-value problems for elliptic partial differential equations which are used for the numerical modeling of electromagnetic fields in geophysics. The numerical experiments...

A necessary and sufficient to guarantee feasibility of the interval Gaussian algorithms for a class of matrices. We apply the interval Gaussian algorithm to an $n\times n$ interval matrix $\left[A\right]$ the comparison matrix $\u2329\left[A\right]\u232a$ of which is irreducible and diagonally dominant. We derive a new necessary and sufficient criterion for the feasibility of this method extending a recently given sufficient criterion.

We outline a solution method for mixed finite element discretizations based on dissecting the problem into three separate steps. The first handles the inhomogeneous constraint, the second solves the flux variable from the homogeneous problem, whereas the third step, adjoint to the first, finally gives the Lagrangian multiplier. We concentrate on aspects involved in the first and third step mainly, and advertise a multi-level method that allows for a stable computation of the intermediate and final...