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
  • space decomposition  (2)
  • Parallel splitting method  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 427-440 
    ISSN: 1572-9265
    Keywords: 65B05 ; 65N30 ; Parallel splitting method ; parabolic problem ; parallel LOD method ; global extrapolation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Extrapolation with a parallel splitting method is discussed. The parallel splitting method reduces a multidimensional problem into independent one-dimensional problems and can improve the convergence order of space variables to an order as high as the regularity of the solution permits. Therefore, in order to match the convergence order of the space variables, a high order method should also be used for the time integration. Second and third order extrapolation methods are used to improve the time convergence and it was found that the higher order extrapolation method can produce a more accurate solution than the lower order extrapolation method, but the convergence order of high order extrapolation may be less than the actual order of the extrapolation. We also try to show a fact that has not been studied in the literature, i.e. when the extrapolation is used, it may decrease the convergence of the space variables. The higher the order of the extrapolation method, the more it decreases the convergence of the space variables. The global extrapolation method also improves the parallel degree of the parallel splitting method. Numerical tests in the paper are done in a domain of a unit circle and a unit square.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 27-46 
    ISSN: 0749-159X
    Keywords: Parallel ; domain decomposition ; parabolic equation ; space decomposition ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the parabolic equation, then by suitably choosing the space decomposition, only O(| log τ |) steps of iteration at each time level are needed, where τ is the time-step size. Applications to overlapping domain decomposition and to a two-level method are given for a second-order parabolic equation. The analysis shows that only a one-element overlap is needed. Discussions about iterative and noniterative methods for parabolic equations are presented. A method that combines the two approaches and utilizes some of the good properties of the two approaches is tested numerically. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 27-46, 1998
    Additional Material: 1 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 14 (1998), S. 717-737 
    ISSN: 0749-159X
    Keywords: parallel ; domain decomposition ; nonlinear ; elliptic equation ; space decomposition ; Mathematics and Statistics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The space decomposition could be a multigrid or domain decomposition method. We explain the detailed procedure to implement our algorithms for a two-level overlapping domain decomposition method and estimate the needed constants. Numerical tests are reported for linear as well as nonlinear elliptic problems. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 717-737, 1998
    Additional Material: 7 Ill.
    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...