A high-order parallel finite difference algorithm (Q864780): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.05.216 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039811935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group explicit methods for parabolic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternating segment Crank-Nicolson scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: General difference schemes with intrinsic parallelism for nonlinear parabolic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Finite Difference Domain Decomposition Algorithm for Numerical Solution of the Heat Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit/Implicit, Conservative Domain Decomposition Procedures for Parabolic Problems Based on Block-Centered Finite Differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain decomposition algorithm based on the group explicit formula for the heat equation / rank
 
Normal rank

Latest revision as of 14:12, 25 June 2024

scientific article
Language Label Description Also known as
English
A high-order parallel finite difference algorithm
scientific article

    Statements

    A high-order parallel finite difference algorithm (English)
    0 references
    0 references
    0 references
    0 references
    13 February 2007
    0 references
    The authors present a high-order parallel finite difference algorithm for the heat equation, and prove its stability and convergence in \(L^2\)-norm. The convergence rate of the method is of order three and the time step can be taken as at least \(1+{\sqrt{6}\over 3}\) times that of the classical explicit scheme. They also give numerical results to show that the stability condition and convergence rate are sharp, and the accuracy is better than in several methods presented before.
    0 references
    0 references
    high-order parallel finite difference algorithm
    0 references
    alternating methods
    0 references
    domain decomposition methods
    0 references
    heat equation
    0 references
    convergence
    0 references
    stability
    0 references
    numerical results
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references