An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems (Q1064037): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large, structured linear complementarity problems: the block partitioned case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Convex Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a basic iterative method for the implicit complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Implicit Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of the theory of lubrication governed by a variational inequality / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01442196 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033798957 / rank
 
Normal rank

Latest revision as of 09:55, 30 July 2024

scientific article
Language Label Description Also known as
English
An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
scientific article

    Statements

    An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems (English)
    0 references
    0 references
    1985
    0 references
    The ADI algorithm of Peaceman-Rachford is adapted to solve linear complementarity problems arising from free boundary problems. Convergence is shown under usual assumptions. The choice of acceleration parameters is discussed. The efficiency of the method is demonstrated by two examples: (1) porous flow through a dam; (2) the journal bearing problem. The ADI algorithm turns out to be significantly faster than modified SOR algorithms.
    0 references
    alternating direction implicit algorithm
    0 references
    comparison of methods
    0 references
    ADI algorithm
    0 references
    Peaceman-Rachford
    0 references
    linear complementarity problems
    0 references
    Convergence
    0 references
    acceleration parameters
    0 references
    porous flow through a dam
    0 references
    journal bearing problem
    0 references
    SOR algorithms
    0 references
    0 references

    Identifiers

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