A note on block preconditioner for generalized saddle point matrices with highly singular (1,1) block

In this paper, we present a block triangular preconditioner for generalized saddle point matrices whose coefficient matrices have singular (1,1) blocks. Theoretical analysis shows that all the eigenvalues of the preconditioned matrix are strongly clustered when choosing an optimal parameter. Numerical experiments are given to demonstrate the efficiency of the presented preconditioner.     

On block preconditioners for saddle point problems with singular or indefinite (1, 1) block

We discuss a class of preconditioning methods for the iterative solution of symmetric algebraic saddle point problems, where the (1, 1) block matrix may be indefinite or singular. Such problems may arise, e.g. from discrete approximations of certain partial differential equations, such as the Maxwell time harmonic equations. We prove that, under mild assumptions on the underlying problem, a class of block preconditioners (including block diagonal, triangular and symmetric indefinite preconditioners) can be chosen in a way which guarantees that the convergence rate of the preconditioned conjugate residuals method is independent of the discretization mesh parameter. We provide examples of such preconditioners that do not require additional scaling. Copyright © 2010 John Wiley & Sons, Ltd.     

A method for verifying the accuracy of numerical solutions of symmetric saddle point linear systems

A fast numerical verification method is proposed for evaluating the accuracy of numerical solutions for symmetric saddle point linear systems whose diagonal blocks of the coefficient matrix are semidefinite matrices. The method is based on results of an algebraic analysis of a block diagonal preconditioning. Some numerical experiments are present to illustrate the usefulness of the method.     

A comparative study of null‐space factorizations for sparse symmetric saddle point systems

Null‐space methods for solving saddle point systems of equations have long been used to transform an indefinite system into a symmetric positive definite one of smaller dimension. A number of independent works in the literature have identified that we can interpret a null‐space method as a matrix factorization. We review these findings, highlight links between them, and bring them into a unified framework. We also investigate the suitability of using null‐space factorizations to derive sparse direct methods and present numerical results for both practical and academic problems.     

Modified block preconditioner for generalized saddle point matrices with highly singular(1,1) blocks

ABSTRACT

In this paper, based on the preconditioners presented by Zhang [A new preconditioner for generalized saddle matrices with highly singular(1,1) blocks. Int J Comput Maths. 2014;91(9):2091-2101], we consider a modified block preconditioner for generalized saddle point matrices whose coefficient matrices have singular (1,1) blocks. Moreover, theoretical analysis gives the eigenvalue distribution, forms of the eigenvectors and the minimal polynomial. Finally, numerical examples show the eigenvalue distribution with the presented preconditioner and confirm our analysis.     

A class of block alternating splitting implicit iteration methods for double saddle point linear systems

In the framework of a special block alternating splitting implicit (BASI) iteration scheme for generalized saddle point problems, we establish some new iteration methods for solving double saddle point problems by means of a suitable partitioning strategy. Convergence analysis of the corresponding BASI iteration methods indicates that they are convergent unconditionally under certain weak requirements for the related matrix splittings, which are satisfied directly for our specific application to double saddle point problems. Numerical examples for liquid crystal director and time-harmonic eddy current models are presented to demonstrate the efficiency of the proposed BASI preconditioners to accelerate the GMRES method.     

A comparison of overlapping Schwarz methods and block preconditioners for saddle point problems

Three domain decomposition methods for saddle point problems are introduced and compared. The first two are block‐diagonal and block‐triangular preconditioners with diagonal blocks approximated by an overlapping Schwarz technique with positive definite local and coarse problems. The third is an overlapping Schwarz preconditioner based on indefinite local and coarse problems. Numerical experiments show that while all three methods are numerically scalable, the last method is almost always the most efficient. Copyright © 2000 John Wiley & Sons, Ltd.     

A symmetric design with parameters 2-(49, 16, 5)

A symmetric 2-design with parameters (v, k, λ) = (49, 16, 5) is constructed. Both this design and its residual, a design with parameters (v, b, r, k, λ) = (33, 48, 16, 11, 5), seem to be new. The derived designs do not have repeated blocks. The group of the design is cyclic of order 15. There is no polarity.     

Homoclinic orbits for a class of first-order nonperiodic asymptotically quadratic Hamiltonian systems with spectrum point zero

In this paper, we study the existence and multiplicity of homoclinic orbits for a class of first-order nonperiodic Hamiltonian systems. By applying two recent critical point theorems for strongly indefinite functionals, we give some new criteria to guarantee that Hamiltonian systems with asymptotically quadratic terms and spectrum point zero have at least one and a finite number of pairs of homoclinic orbits under some adequate conditions, respectively.     

A mixed finite element method for nonlinear elasticity: two-fold saddle point approach and a-posteriori error estimate

Summary. We extend the applicability of stable mixed finite elements for linear plane elasticity, such as PEERS, to a mixed variational formulation of hyperelasticity. The present approach is based on the introduction of the strain tensor as a further unknown, which yields a two-fold saddle point nonlinear operator equation for the corresponding weak formulation. We provide the uniqueness of solution for the continuous and discrete schemes, and derive the usual Cea estimate for the associated error. Finally, a reliable a-posteriori error estimate, based on the solution of local Dirichlet problems, and well suited for adaptive computations, is also given. Received August 5, 2000 / Published online August 17, 2001     

Existence and multiplicity of nonzero periodic solution with saddle point character for some nonautonomous second order systems

The purpose of this paper is to study the existence and multiplicity of nonzero periodic solutions with saddle point character for the following nonautonomous second order systems:

     

The existence of symmetric block designs with parameters (41, 16, 6) and (66, 26, 10)

In [1, 2] it is indicated that the existence of block designs with parameters (41, 16, 6) and (66, 26, 10) is still unknown. The purpose of this paper is to prove the existence of block designs with these parameters. The idea for the construction of these block designs is to assume that they admit certain automorphism group.     

A symmetric 2-(160, 54, 18) design

We give a construction for a symmetric 2-(160, 54, 18) design that effectively uses the incidence matrix of the design of the hyperplanes in PG(3, 3) as a tactical decomposition. This is the first design ever found with these parameters. © 1993 John Wiley & Sons, Inc.     

A real-valued block conjugate gradient type method for solving complex symmetric linear systems with multiple right-hand sides

We consider solving complex symmetric linear systems with multiple right-hand sides. We assume that the coefficient matrix has indefinite real part and positive definite imaginary part. We propose a new block conjugate gradient type method based on the Schur complement of a certain 2-by-2 real block form. The algorithm of the proposed method consists of building blocks that involve only real arithmetic with real symmetric matrices of the original size. We also present the convergence property of the proposed method and an efficient algorithmic implementation. In numerical experiments, we compare our method to a complex-valued direct solver, and a preconditioned and nonpreconditioned block Krylov method that uses complex arithmetic.