Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems. Stokes control (Q503349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Owe Axelsson / rank
 
Normal rank
Property / review text
 
The authors investigate the optimal control of Navier-Stokes equations and concentrate on the arising linear system that can be compressed after eliminating the control function. They apply an efficient block matrix preconditioner and the condition number of the so precontioned matrix is bounded by 2 under certain contions. They show that their preconditioner has a better performance in terms of the number of iterations and execution time than other preconditioners on the same problem. This article is well written, structured and explained, it contains seven sections: Section 1 on Introduction, Section 2 formulates the control problems with a PDE contraint, Section 3 is about the precontioner and condition number bounds, in Section 4 a summary of some other preconditioning methods is presented, Section 5 covers a summary of computional complexity of the preconditioners, Section 6 contains the numerical results, Section 7 on Conclusion.
Property / review text: The authors investigate the optimal control of Navier-Stokes equations and concentrate on the arising linear system that can be compressed after eliminating the control function. They apply an efficient block matrix preconditioner and the condition number of the so precontioned matrix is bounded by 2 under certain contions. They show that their preconditioner has a better performance in terms of the number of iterations and execution time than other preconditioners on the same problem. This article is well written, structured and explained, it contains seven sections: Section 1 on Introduction, Section 2 formulates the control problems with a PDE contraint, Section 3 is about the precontioner and condition number bounds, in Section 4 a summary of some other preconditioning methods is presented, Section 5 covers a summary of computional complexity of the preconditioners, Section 6 contains the numerical results, Section 7 on Conclusion. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Başak Akteke-Öztürk / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49J20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 76D05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F08 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49M25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6674008 / rank
 
Normal rank
Property / zbMATH Keywords
 
PDE-constrained optimization problems
Property / zbMATH Keywords: PDE-constrained optimization problems / rank
 
Normal rank
Property / zbMATH Keywords
 
finite elements
Property / zbMATH Keywords: finite elements / rank
 
Normal rank
Property / zbMATH Keywords
 
iterative solution methods
Property / zbMATH Keywords: iterative solution methods / rank
 
Normal rank
Property / zbMATH Keywords
 
preconditioning
Property / zbMATH Keywords: preconditioning / rank
 
Normal rank
Property / zbMATH Keywords
 
Navier-Stokes equations
Property / zbMATH Keywords: Navier-Stokes equations / rank
 
Normal rank
Property / zbMATH Keywords
 
computional complexity
Property / zbMATH Keywords: computional complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical result
Property / zbMATH Keywords: numerical result / rank
 
Normal rank

Revision as of 00:55, 1 July 2023

scientific article
Language Label Description Also known as
English
Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems. Stokes control
scientific article

    Statements

    Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems. Stokes control (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2017
    0 references
    The authors investigate the optimal control of Navier-Stokes equations and concentrate on the arising linear system that can be compressed after eliminating the control function. They apply an efficient block matrix preconditioner and the condition number of the so precontioned matrix is bounded by 2 under certain contions. They show that their preconditioner has a better performance in terms of the number of iterations and execution time than other preconditioners on the same problem. This article is well written, structured and explained, it contains seven sections: Section 1 on Introduction, Section 2 formulates the control problems with a PDE contraint, Section 3 is about the precontioner and condition number bounds, in Section 4 a summary of some other preconditioning methods is presented, Section 5 covers a summary of computional complexity of the preconditioners, Section 6 contains the numerical results, Section 7 on Conclusion.
    0 references
    PDE-constrained optimization problems
    0 references
    finite elements
    0 references
    iterative solution methods
    0 references
    preconditioning
    0 references
    Navier-Stokes equations
    0 references
    computional complexity
    0 references
    numerical result
    0 references

    Identifiers

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