| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 472918 | Computers & Mathematics with Applications | 2006 | 8 Pages |
Abstract
Operator preconditioning offers a general recipe for constructing preconditioners for discrete linear operators that have arisen from a Galerkin approach. The key idea is to employ matching Galerkin discretizations of operators of complementary mapping properties. If these can be found, the resulting preconditioners will be robust with respect to the choice of the bases for trial and test spaces. I survey the application of operator preconditioning to finite elements and boundary elements.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
