Convergence analysis of optimization-based domain decomposition methods for a bonded structure (Q2463604): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apnum.2006.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974583664 / rank
 
Normal rank

Revision as of 22:22, 19 March 2024

scientific article
Language Label Description Also known as
English
Convergence analysis of optimization-based domain decomposition methods for a bonded structure
scientific article

    Statements

    Convergence analysis of optimization-based domain decomposition methods for a bonded structure (English)
    0 references
    0 references
    14 December 2007
    0 references
    Two optimization-based domain decomposition methods for a bonded structure are studied. They are the least squares conjugate gradient method and the Uzawa conjugate gradient method. Using the Steklov-Poincaré operator, it has been shown that both methods solve the same underlying linear equation with a symmetric and coercive operator. The convergence analysis is developed using the properties of the trace operator associated to the coupled problem. Numerical experiments show that the Lagrangian multiplier approach is more efficient than the least squares approach based on the \(L^2\)-norm.
    0 references
    domain decomposition
    0 references
    bonded structure
    0 references
    Steklov-Poincaré operator
    0 references
    least squares conjugate gradient method
    0 references
    Uzawa conjugate gradient method
    0 references
    numerical experiments
    0 references

    Identifiers

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