共查询到20条相似文献,搜索用时 15 毫秒
1.
Existence and uniqueness of splittings for stationary iterative methods with applications to alternating methods 总被引:3,自引:0,他引:3
Summary. Given a nonsingular matrix , and a matrix of the same order, under certain very mild conditions, there is a unique splitting , such that . Moreover, all properties of the splitting are derived directly from the iteration matrix . These results do not hold when the matrix is singular. In this case, given a matrix and a splitting such that , there are infinitely many other splittings corresponding to the same matrices and , and different splittings can have different properties. For instance, when is nonnegative, some of these splittings can be regular splittings, while others can be only weak splittings. Analogous results
hold in the symmetric positive semidefinite case. Given a singular matrix , not for all iteration matrices there is a splitting corresponding to them. Necessary and sufficient conditions for the existence of such splittings are
examined. As an illustration of the theory developed, the convergence of certain alternating iterations is analyzed. Different
cases where the matrix is monotone, singular, and positive (semi)definite are studied.
Received September 5, 1995 / Revised version received April 3, 1996 相似文献
2.
Recently, Lee et al. [Young-ju Lee, Jinbiao Wu, Jinchao Xu, Ludmil Zikatanov, On the convergence of iterative methods for semidefinite linear systems, SIAM J. Matrix Anal. Appl. 28 (2006) 634-641] introduce new criteria for the semi-convergence of general iterative methods for semidefinite linear systems based on matrix splitting. The new conditions generalize the classical notion of P-regularity introduced by Keller [H.B. Keller, On the solution of singular and semidefinite linear systems by iterations, SIAM J. Numer. Anal. 2 (1965) 281-290]. In view of their results, we consider here stipulations on a splitting A=M-N, which lead to fixed point systems such that, the iterative scheme converges to a weighted Moore-Penrose solution to the system Ax=b. Our results extend the result of Lee et al. to a more general case and we also show that it requires less restrictions on the splittings than Keller’s P-regularity condition to ensure the convergence of iterative scheme. 相似文献
3.
In this paper, we will present the block splitting iterative methods with general weighting matrices for solving linear systems of algebraic equations Ax=b when the coefficient matrix A is symmetric positive definite of block form, and establish the convergence theories with respect to the general weighting matrices but special splittings. Finally, a numerical example shows the advantage of this method. 相似文献
4.
H-Splittings and two-stage iterative methods 总被引:1,自引:0,他引:1
Summary Convergence of two-stage iterative methods for the solution of linear systems is studied. Convergence of the non-stationary method is shown if the number of inner iterations becomes sufficiently large. TheR
1-factor of the two-stage method is related to the spectral radius of the iteration matrix of the outer splitting. Convergence is further studied for splittings ofH-matrices. These matrices are not necessarily monotone. Conditions on the splittings are given so that the two-stage method is convergent for any number of inner iterations.This work was supported in part by a Temple University Summer Research Fellowship. 相似文献
5.
Yongzhong Song 《Numerische Mathematik》2002,92(3):563-591
Summary. This paper investigates the comparisons of asymptotic rates of convergence of two iteration matrices. On the basis of nonnegative
matrix theory, comparisons between two nonnegative splittings and between two parallel multisplitting methods are derived.
When the coefficient matrix A is Hermitian positive (semi)definite, comparison theorems about two P-regular splittings and
two parallel multisplitting methods are proved.
Received April 4, 1998 / Revised version received October 18, 1999 / Published online November 15, 2001 相似文献
6.
Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations 总被引:3,自引:0,他引:3
Summary We discuss block matrices of the formA=[A
ij
], whereA
ij
is ak×k symmetric matrix,A
ij
is positive definite andA
ij
is negative semidefinite. These matrices are natural block-generalizations of Z-matrices and M-matrices. Matrices of this type arise in the numerical solution of Euler equations in fluid flow computations. We discuss properties of these matrices, in particular we prove convergence of block iterative methods for linear systems with such system matrices. 相似文献
7.
Matthias Bolten Stephanie Friedhoff Matthias Heming 《Linear algebra and its applications》2011,434(11):2225-2243
Classical algebraic multigrid theory relies on the fact that the system matrix is positive definite. We extend this theory to cover the positive semidefinite case as well, by formulating semiconvergence results for these singular systems. For the class of irreducible diagonal dominant singular M-matrices we show that the requirements of the developed theory hold and that the coarse level systems are still of the same class, if the C/F-splitting is good enough. An important example for matrices that are irreducible diagonal dominant M-matrices are Laplacians of graphs. Recent shape optimizing methods for graph partitioning require to solve singular linear systems involving these Laplacians. We present convergence results as well as experimental results for numerous graphs arising from finite element discretizations with up to 106 vertices. 相似文献
8.
Standard Galerkin finite element methods or finite difference methods for singular perturbation problems lead to strongly unsymmetric matrices, which furthermore are in general notM-matrices. Accordingly, preconditioned iterative methods such as preconditioned (generalized) conjugate gradient methods, which have turned out to be very successful for symmetric and positive definite problems, can fail to converge or require an excessive number of iterations for singular perturbation problems.This is not so much due to the asymmetry, as it is to the fact that the spectrum can have both eigenvalues with positive and negative real parts, or eigenvalues with arbitrary small positive real parts and nonnegligible imaginary parts. This will be the case for a standard Galerkin method, unless the meshparameterh is chosen excessively small. There exist other discretization methods, however, for which the corresponding bilinear form is coercive, whence its finite element matrix has only eigenvalues with positive real parts; in fact, the real parts are positive uniformly in the singular perturbation parameter.In the present paper we examine the streamline diffusion finite element method in this respect. It is found that incomplete block-matrix factorization methods, both on classical form and on an inverse-free (vectorizable) form, coupled with a general least squares conjugate gradient method, can work exceptionally well on this type of problem. The number of iterations is sometimes significantly smaller than for the corresponding almost symmetric problem where the velocity field is close to zero or the singular perturbation parameter =1.The 2
nd
author's research was sponsored by Control Data Corporation through its PACER fellowship program.The 3
rd
author's research was supported by the Netherlands organization for scientific research (NWO).On leave from the Institute of Mathematics, Academy of Science, 1090 Sofia, P.O. Box 373, Bulgaria. 相似文献
9.
M. Rajesh Kannan 《Aequationes Mathematicae》2017,91(4):619-633
In this article we introduce the notion of P-proper splitting for square matrices. For an inconsistent linear system of equations \(Ax =b\), we associate an iterative method based on a P-proper splitting of A, which if convergent, converges to the best least squares solution of this system. We extend a result of Stein, using which we prove that if A is positive semidefinite, then the said iterative method converges. Also, we generalize Sylvester’s law of inertia and as an application of this generalization we establish some properties of P-proper splittings. Finally, we prove a comparison theorem for iterative methods associated with P-proper splittings of a positive semidefinite matrix. 相似文献
10.
In this paper, we study the numerical computation of the errors in linear systems when using iterative methods. This is done
by using methods to obtain bounds or approximations of quadratic formsu
T
A
−1
u whereA is a symmetric positive definite matrix andu is a given vector. Numerical examples are given for the Gauss-Seidel algorithm.
Moreover, we show that using a formula for theA-norm of the error from Dahlquist, Golub and Nash [1978] very good bounds of the error can be computed almost for free during
the iterations of the conjugate gradient method leading to a reliable stopping criterion.
The work of the first author was partially supported by NSF Grant CCR-950539. 相似文献
11.
Summary. Weighted max-norm bounds are obtained for Algebraic Additive Schwarz Iterations with overlapping blocks for the solution
of Ax = b, when the coefficient matrix A is an M-matrix. The case of inexact local solvers is also covered. These bounds are analogous to those that exist using A-norms when the matrix A is symmetric positive definite. A new theorem concerning P-regular splittings is presented which provides a useful tool for the A-norm bounds. Furthermore, a theory of splittings is developed to represent Algebraic Additive Schwarz Iterations. This representation
makes a connection with multisplitting methods. With this representation, and using a comparison theorem, it is shown that
a coarse grid correction improves the convergence of Additive Schwarz Iterations when measured in weighted max norm.
Received March 13, 1998 / Revised version received January 26, 1999 相似文献
12.
The rank-one modification algorithm of theLDM
t factorization was given by Bennett [1]. His method, however, could break down even when the matrix is nonsingular and well-conditioned. We introduce a pivoting strategy for avoiding possible break-down as well as for suppressing error growth in the modification process. The method is based on a symbolic formula of the rank-one modification of the factorization of a possibly singular nonsymmetric matrix. A new symbolic formula is also obtained for the inverses of the factor matrices. Repeated application of our method produces theLDM
t-like product form factorization of a matrix. A numerical example is given to illustrate our pivoting method. An incomplete factorization algorithm is also introduced for updating positive definite matrix useful in quasi-Newton methods, in which the Fletcher and Powell algorithm [2] and the Gill, Murray and Saunders algorithm [4] are usually used.This paper is presented at the Japan SIAM Annual Meeting held at University of Tokyo, Japan, October 7–9, 1991. 相似文献
13.
Zhong‐Zhi Bai 《Numerical Linear Algebra with Applications》2010,17(6):917-933
For the large sparse linear complementarity problems, by reformulating them as implicit fixed‐point equations based on splittings of the system matrices, we establish a class of modulus‐based matrix splitting iteration methods and prove their convergence when the system matrices are positive‐definite matrices and H+‐matrices. These results naturally present convergence conditions for the symmetric positive‐definite matrices and the M‐matrices. Numerical results show that the modulus‐based relaxation methods are superior to the projected relaxation methods as well as the modified modulus method in computing efficiency. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
14.
Ulla Miekkala 《BIT Numerical Mathematics》1993,33(3):485-495
With any undirected, connected graphG containing no self-loops one can associate the Laplacian matrixL(G). It is also the (singular) admittance matrix of a resistive network with all conductances taken to be unity. While solving the linear system involved, one of the vertices is grounded, so the coefficient matrix is a principal submatrix ofL which we will call the grounded Laplacian matrixL
1. In this paper we consider iterative solutions of such linear systems using certain regular splittings ofL
1 and derive an upper bound for the spectral radius of the iteration matrix in terms of the properties of the graphG.This work was supported by the Academy of Finland 相似文献
15.
Summary In this paper we study linear stationary iterative methods with nonnegative iteration matrices for solving singular and consistent systems of linear equationsAx=b. The iteration matrices for the schemes are obtained via regular and weak regular splittings of the coefficients matrixA. In certain cases when only some necessary, but not sufficient, conditions for the convergence of the iterations schemes exist, we consider a transformation on the iteration matrices and obtain new iterative schemes which ensure convergence to a solution toAx=b. This transformation is parameter-dependent, and in the case where all the eigenvalues of the iteration matrix are real, we show how to choose this parameter so that the asymptotic convergence rate of the new schemes is optimal. Finally, some applications to the problem of computing the stationary distribution vector for a finite homogeneous ergodic Markov chain are discussed.Research sponsored in part by US Army Research Office 相似文献
16.
Summary. It is well known that any nonsingular M–matrix admits an LU factorization into M–matrices (with L and U lower and upper triangular respectively) and any singular M–matrix is permutation similar to an M–matrix which admits an
LU factorization into M–matrices. Varga and Cai establish necessary and sufficient conditions for a singular M–matrix (without
permutation) to allow an LU factorization with L nonsingular. We generalize these results in two directions. First, we find necessary and sufficient conditions for the existence
of an LU factorization of a singular M-matrix where L and U are both permitted to be singular. Second, we establish the minimal block structure that a block LU factorization of a singular
M–matrix can have when L and U are M–matrices.
Received November 21, 1994 / Revised version received August 4, 1997 相似文献
17.
Semiconvergence of nonnegative splittings for singular matrices 总被引:1,自引:0,他引:1
Yongzhong Song 《Numerische Mathematik》2000,85(1):109-127
Summary. In this paper, we discuss semiconvergence of the matrix splitting methods for solving singular linear systems. The concepts
that a splitting of a matrix is regular or nonnegative are generalized and we introduce the terminologies that a splitting
is quasi-regular or quasi-nonnegative. The equivalent conditions for the semiconvergence are proved. Comparison theorem on
convergence factors for two different quasi-nonnegative splittings is presented. As an application, the semiconvergence of
the power method for solving the Markov chain is derived. The monotone convergence of the quasi-nonnegative splittings is
proved. That is, for some initial guess, the iterative sequence generated by the iterative method introduced by a quasi-nonnegative
splitting converges towards a solution of the system from below or from above.
Received August 19, 1997 / Revised version received August 20, 1998 / Published online January 27, 2000 相似文献
18.
Pablo Guerrero-García Ángel Santos-Palomo 《Journal of Computational and Applied Mathematics》2010,233(5):1232-1237
We describe how to maintain the triangular factor of a sparse QR factorization when columns are added and deleted and Q cannot be stored for sparsity reasons. The updating procedures could be thought of as a sparse counterpart of Reichel and Gragg’s package QRUP. They allow us to solve a sequence of sparse linear least squares subproblems in which each matrix Bk is an independent subset of the columns of a fixed matrix A, and Bk+1 is obtained by adding or deleting one column. Like Coleman and Hulbert [T. Coleman, L. Hulbert, A direct active set algorithm for large sparse quadratic programs with simple bounds, Math. Program. 45 (1989) 373-406], we adapt the sparse direct methodology of Björck and Oreborn of the late 1980s, but without forming ATA, which may be only positive semidefinite. Our Matlab 5 implementation works with a suitable row and column numbering within a static triangular sparsity pattern that is computed in advance by symbolic factorization of ATA and preserved with placeholders. 相似文献
19.
The symmetric procrustes problem 总被引:3,自引:0,他引:3
Nicholas J. Higham 《BIT Numerical Mathematics》1988,28(1):133-143
The following symmetric Procrustes problem arises in the determination of the strain matrix of an elastic structure: find the symmetric matrixX which minimises the Frobenius (or Euclidean) norm ofAX — B, whereA andB are given rectangular matrices. We use the singular value decomposition to analyse the problem and to derive a stable method for its solution. A perturbation result is derived and used to assess the stability of methods based on solving normal equations. Some comparisons with the standard, unconstrained least squares problem are given. 相似文献