The standard Schur complement equation based implementation of interior-point methods for second order cone programming may encounter stability problems in the computation of search directions, and as a consequence, accurate approximate optimal solutions are sometimes not attainable. Based on the eigenvalue decomposition of the (1, 1) block of the augmented equation, a reduced augmented equatio...

A preconditioner for iterative solution of the interface problem in Schur Complement Domain Decomposition Methods is presented. This preconditioner is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann-Neumann preconditioner and its variants, and handles correctly the flux splitting among subdomains that shar...

Let Hn,r be the Ariki-Koike algebra associated to the complex reflection group Sn (Z/rZ)n, and let S(Λ) be the cyclotomic q-Schur algebra associated to Hn,r, introduced by Dipper, James and Mathas. For each p = (r1, . . . , rg) ∈ Zg>0 such that r1 + · · · + rg = r, we define a subalgebra Sp of S(Λ) and its quotient algebra S. It is shown that Sp is a standardly based algebra and S is a cellular...

We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We introduce a class of parallel preconditioning techniques for general sparse linear systems based on a two level block ILU factorization strategy. We give some new data structures and strategies to construct loca...

We present nonoverlapping domain decomposition techniques applied to a two-stage NumerovGalerkin finite element model of the shallow water equations over a limited-area domain. The Schur complement matrix formulation is employed and a modified interface matrix approach is proposed to handle the coupling between subdomains. The resulting nonsymmetric Schur complement matrices, modified interface...

In 1981, G. D. James proved two theorems about the decomposition matrices of Schur algebras involving the removal of the first row or column from a Young diagram. He established corresponding results for the symmetric group using the Schur functor. We apply James’ techniques to prove that row removal induces an injection on the corresponding Ext between simple modules for the Schur algebra. We ...

The goal of this paper is the construction of a data-sparse approximation to the Schur complement on the interface corresponding to FEM and BEM approximations of an elliptic equation by domain decomposition. Using the hierarchical (H-matrix) formats we elaborate the approximate Schur complement inverse in an explicit form. The required cost O(NΓ log NΓ) is almost linear in NΓ – the number of de...

We present an efficient and novel procedure to design two-dimensional (2D) linear-phase IIR filters with less hardware resource. A 2D linear-phase FIR filter prototype is first designed using semidefinite programming (SDP). The prototype filter is then decomposed into modular structures via Schur decomposition method (SDM). Each section is reduced into IIR structures using a novel digital syste...