Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles: DFG German National Licenses  (2)
  • Mathematics Subject Classification (1991):65N30  (1)
  • Schwarz Alternating Method  (1)
Source
  • Articles: DFG German National Licenses  (2)
Material
Years
Keywords
  • 1
    ISSN: 1572-9125
    Keywords: 65N30 ; 65J10 ; 35J20 ; 15A18 ; Orthogonal Projections ; Parallel Computing ; Domain Decomposition ; Grid Refinement ; Schwarz Alternating Method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Many parallel iterative algorithms for solving symmetric, positive definite problems proceed by solving in each iteration, a number of independent systems on subspaces. The convergence of such methods is determined by the spectrum of the sums of orthogonal projections on those subspaces, while the convergence of a related sequential method is determined by the spectrum of the product of complementary projections. We study spectral properties of sums of orthogonal projections and in the case of two projections, characterize the spectrum of the sum completely in terms of the spectrum of the product.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 73 (1996), S. 473-487 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains plus a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number $C (1+\log (H/h))^\gamma$ , $\gamma=2$ or $3$ ,where $h$ is the characteristic element size and $H$ subdomain size.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...