نتایج جستجو برای: schur complement
تعداد نتایج: 74110 فیلتر نتایج به سال:
Based on a particular node ordering and corresponding block decomposition of the matrix we analyse an e cient, algebraic multilevel preconditioner for the iterative solution of nite element discretizations of elliptic boundary value problems. Thereby an analysis of a new version of block-factorization preconditioning methods is presented. The approximate factorization requires an approximation ...
Schur complements provide a convenient tool for proving the operator valued version of the classical (single variable) Fejér-Riesz problem. It also enables the factorization of multivariable trigonometric polynomials which are strictly positive. A result of Scheiderer implies that in two variables, nonnegative scalar valued trigonometric polynomials have sums of squares decompositions, Using a ...
We consider the class of doubly diagonally dominant matrices (A = [ ajj] E C”, ‘, la,,1 l”jjl > Ck+ i laiklCk+ jlajkl. i #j) and its subclasses. We give necessary and sufficient conditions in terms of the directed graph for an irreducibly doubly diagonally dominant matrix to be a singular matrix or to be an H-matrix. As in the case of diagonal dominance, we show that the Schur complements of do...
For any continuous bilinear form defined on a pair of Hilbert spaces satisfying the compatibility Ladyshenskaya-Babušca-Brezzi condition, symmetric Schur complement operators can be defined on each of the two Hilbert spaces. In this paper, we find bounds for the spectrum of the Schur operators only in terms of the compatibility and continuity constants. In the light of the new spectral results ...
In this paper we study the computational performance of variants of an algebraic additive Schwarz preconditioner for the Schur complement for the solution of large sparse linear systems. In earlier works, the local Schur complements were computed exactly using a sparse direct solver. The robustness of the preconditioner comes at the price of this memory and time intensive computation that is th...
Multidisciplinary design optimization (MDO) problems are engineering design problems that require the consideration of the interaction between several design disciplines. Due to certain organizational aspects of MDO problems, decomposition algorithms are often the only feasible solution approach. Two natural decomposition approaches to the MDO problem are bilevel decomposition algorithms and Sc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید