Loading...
Please wait, while we are loading the content...
Similar Documents
Domain decomposition algorithms for first-order system least squares methods
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Pavarino, Luca F. |
| Copyright Year | 1996 |
| Description | Least squares methods based on first-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces, which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods. |
| File Size | 718803 |
| Page Count | 24 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19960020436 |
| Archival Resource Key | ark:/13960/t10p60h2x |
| Language | English |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Numerical Analysis Finite Element Method Elliptic Differential Equations Algorithms Operators Mathematics Least Squares Method Scalars Schwartz Method Galerkin Method Convergence Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
