Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The hierarchical basis multigrid method (1988)
    Springer
    Numerische Mathematik 52 (1988), S. 427-458 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; 65F35 ; 65N20 ; 65N30 ; CR:G1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We derive and analyze the hierarchical basis-multigrid method for solving discretizations of self-adjoint, elliptic boundary value problems using piecewise linear triangular finite elements. The method is analyzed as a block symmetric Gauß-Seidel iteration with inner iterations, but it is strongly related to 2-level methods, to the standard multigridV-cycle, and to earlier Jacobi-like hierarchical basis methods. The method is very robust, and has a nearly optimal convergence rate and work estimate. It is especially well suited to difficult problems with rough solutions, discretized using highly nonuniform, adaptively refined meshes.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01462238
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A class of iterative methods for solving saddle point problems (1989)
    Springer
    Numerische Mathematik 56 (1989), S. 645-666 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; 65N20 ; 65N30 ; CR: G 1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We consider the numerical solution of indefinite systems of linear equations arising in the calculation of saddle points. We are mainly concerned with sparse systems of this type resulting from certain discretizations of partial differential equations. We present an iterative method involving two levels of iteration, similar in some respects to the Uzawa algorithm. We relate the rates of convergence of the outer and inner iterations, proving that, under natural hypotheses, the outer iteration achieves the rate of convergence of the inner iteration. The technique is applied to finite element approximations of the Stokes equations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01405194
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...