Generalized block triangular preconditioner for symmetric saddle point problems

Wu, Shi-Liang; Huang, Ting-Zhu; Li, Cui-Xia
June 2009
Computing;Jun2009, Vol. 84 Issue 3/4, p183
Academic Journal
In this paper, spectral properties and computational performance of a generalized block triangular preconditioner for symmetric saddle point problems are discussed in detail. We will provide estimates for the region containing both the nonreal and the real eigenvalues and generalize the results of Simoncini (Appl Numer Math 49:63�80, 2004) and Cao (Appl Numer Math 57:899�910, 2007). Finally, numerical experiments of the model Stokes problem are reported.


Related Articles

  • Saddle points of the potential energy surface for HCCF determined by an algebraic approach. Wang, X.; Ding, S. // European Physical Journal D -- Atoms, Molecules, Clusters & Opti;Jun2004, Vol. 29 Issue 3, p337 

    The potential energy surface of the tetratomic molecule HCCF is determined by the U(4) algebraic method. The combination coefficients in the Hamiltonian are gotten from fitting the spectroscopic data. The molecular properties, such as, force constants and dissociation energies, are obtained in...

  • A short note on the Q-linear convergence of the steepest descent method. Ya-xiang Yuan // Mathematical Programming;Jun2010, Vol. 123 Issue 2, p339 

    This short note gives the sharp bound for the Q-linear convergence rate of the iterates generated by the steepest descent method with exact line searches when the objective function is strictly convex quadratic.

  • Hybridization of Adaptive Differential Evolution and Two Local Search Techniques with a Restart Strategy: Some Preliminary Experimental Results. Khanum, Rashida Adeeb; Salhi, Abdellah; Jan, Muhammad Asif // Annual International Conference on Advanced Topics in Artificial;2012, p62 

    Classical optimization methods like Steepest Descent Method (SDM) and Broyden-Fletcher-Goldfarb-Shanno (BFGS) can solve many optimization problems. However, in case of new complex optimization problems (e.g., CEC2005 and CEC2010) with many local optima, they usually do not find the global...

  • Regularized extragradient method for searching for an equilibrium point in two-person saddle-point games. Artem'eva, L. // Computational Mathematics & Mathematical Physics;Apr2012, Vol. 52 Issue 4, p495 

    A two-person saddle-point game with approximately given input data is examined. Since, in games of this type, the search for an equilibrium point is unstable with respect to perturbations in the input data, two variants of the regularized extragradient method are proposed. Their convergence is...

  • Tail probability approximations for Student's t-statistics. Wang Zhou; Bing-Yi Jing // Probability Theory & Related Fields;Dec2006, Vol. 136 Issue 4, p541 

    In this paper, we derive saddlepoint approximations for Student's t-statistics for strongly nonlattice random variables without moment conditions. Under very mild conditions, we show that saddlepoint equations always have solutions.

  • A RESONANCE PROBLEM FOR THE P-LAPLACIAN IN RN. Buenrostro, Gustavo Izquierdo; López Garza, Gabriel // Electronic Journal of Differential Equations;2005, Vol. 2005, p1 

    We show the existence of a weak solution for the problem -Δpu = λ1h(x)|u|p-2u + a(x)g(u) + f(x), u ∈ D1, p(ℝN), where, 2 < p < N, λ1 the radially symmetric weight h(x) = h(|x|). In this problem, g(s) is a bounded function for all s ∈ ℝ, a ∈ L(p*)'(ℝN)...

  • SADDLE-POINT OF A FUNCTION.  // Encyclopedia of Operations Research & Management Science;2001, p733 

    This entry provides information on the saddle-point of a function.

  • SADDLE-POINT OF A GAME.  // Encyclopedia of Operations Research & Management Science;2001, p733 

    This entry provides information on the saddle-point of a game.

  • Interior projection-like methods for monotone variational inequalities. Auslender, Alfred; Teboulle, Marc // Mathematical Programming;Sep2005, Vol. 104 Issue 1, p39 

    We propose new interior projection type methods for solving monotone variational inequalities. The methods can be viewed as a natural extension of the extragradient and hyperplane projection algorithms, and are based on using non Euclidean projection-like maps. We prove global convergence...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics