Block diagonally preconditioned PIU methods of saddle point problem (Q979272): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2009.11.033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013412024 / rank | |||
Normal rank | |||
Revision as of 21:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Block diagonally preconditioned PIU methods of saddle point problem |
scientific article |
Statements
Block diagonally preconditioned PIU methods of saddle point problem (English)
0 references
25 June 2010
0 references
The authors propose and theoretically analyze a block diagonally preconditioned PIU method for solving large sparse saddle point problems. They also give some rules for the choices of the preconditioners and the \((1,1)\) block splitting matrix of the PIU method.
0 references
preconditioner
0 references
PIU method
0 references
convergence
0 references
large sparse saddle point problems
0 references
