In this paper, we consider the Newton–Schur method in Hilbert space and obtain quadratic convergence. For symmetric elliptic eigenvalue problem discretized by standard finite element nonoverlapping domain decomposition method, use Steklov–Poincaré operator to reduce on into nonlinear subproblem , which is union of subdomain boundaries. We prove that convergence rate for where constant independe...

A domain decomposition method based on a simple change of basis on the interfaces and vertices is presented. It is shown that this leads to an effective preconditioner compared to the ones previously considered, such as the preconditioner by Bramble, Pasciak, and Schatz (BPS) [Math. Comp., 47 (1986), pp. 103-134], and the hierarchical basis domain decomposition (HBDD) preconditioner by Smith an...

Domain decomposition methods used for solving linear systems are strongly related to dynamic substructuring methods commonly used to build a reduced model. In this study we investigate some theoretical relations between the methods. In particular we discuss the conceptual similarities between the Schur Complement solvers and the Craig-Bampton substructuring techniques, both for their primal and...

Abstract: The paper reviews different methods of orthogonalization of constraints adopted in multibody dynamics formulations. A new approach, based on Schur decomposition, has been herein proposed. All the methods have been implemented in the MATLAB computing environnement and CPU times required for a simple simulation have been recorded.

in this paper, we conduct a comparative study between the homotopy perturbation method (hpm) and adomian’s decomposition method (adm) for analytic treatment of nonlinear volterra integral equations, and we show that the hpm with a specific convex homotopy is equivalent to the adm for these type of equations.

This paper presents an algorithm for the static output feedback stabilization problem. The algorithm is iterative in nature and is based on alternating projection ideas. The main computational component of each iteration of the algorithm is a Schur matrix decomposition and the solution of a standard least squares problem. The paper contains computational results illustrating the effectiveness o...

The distribution of Coxeter descents and block number over the set fully commutative elements in hyperoctahedral group B n , FC ( ) is studied this paper. We prove that associated Chow quasi-symmetric generating function equal to a non-negative sum products two Schur functions. proof involves decomposition into disjoint union two-sided Barbash–Vogan combinatorial cells, type extension Rubey’s d...