On preconditioning Schur complement and Schur complement preconditioning.
On properties of some matrix splittings.
On quadratic convergence bounds for the J-symmetric Jacobi method.
On reducing bandwidth of matrices in the Go-Away algorithm for regular grids.
On relations between right and left eigenvectors of nonselfadjoint matrix pencils
On selection of interface weights in domain decomposition methods
Different choices of the averaging operator within the BDDC method are compared on a series of 2D experiments. Subdomains with irregular interface and with jumps in material coefficients are included into the study. Two new approaches are studied along three standard choices. No approach is shown to be universally superior to others, and the resulting recommendation is that an actual method should be chosen based on properties of the problem.
On Semiiterative Methods Generated by Faber Polynomials.
On sharp quadratic convergence bounds for the serial Jacobi methods.
On solving linear algebraic equations with an ill-conditioned matrix
On some extensions of the accelerated overrelaxation (AOR) theory.
On some Modifications of the Nekrassov Method for Numerical Solution of Linear Systems of Equations
A modification of the Nekrassov method for finding a solution of a linear system of algebraic equations is given and a numerical example is shown.* This paper is partly supported by project IS–M–4 of Department for Scientific Research, Paisii Hilendarski University of Plovdiv.
On Some new Inclusion Theorems for the Eigenvalues of Partitioned Matrices.
On spectral variations under bounded real matrix perturbations.
On the Analysis of the Unsymmetric Successive Overrelaxation Method when Applied to p-Cyclic Matrices.
On the approximation numbers of large Toeplitz matrices.
On the Approximative Construction of the Eigenvectors Corresponding to a Pair of Complex Conjugated Eigenvalues
On the Augmented System Approach to Sparse Least-Squares Problems.
On the belonging of a perturbed vector to a subspace from a numerical view point.
On the Characterization of Least Upper Bound Norms in Matrix Space.
On the choice of iteration parameters in the Stone incomplete factorization
The paper is concerned with the iterative solution of sparse linear algebraic systems by the Stone incomplete factorization. For the sake of clarity, the algorithm of the Stone incomplete factorization is described and, moreover, some properties of the method are derived in the paper. The conclusion is devoted to a series of numerical experiments focused on the choice of iteration parameters in the Stone method. The model problem considered showe that we can, in general, choose appropriate values...