1984
DOI: 10.1137/1.9781611970869
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Solution of Elliptic Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
42
0
6

Year Published

1989
1989
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(52 citation statements)
references
References 0 publications
1
42
0
6
Order By: Relevance
“…(6) and inhomogeneous mixed boundary conditions. Finite element discretization of the boundary value problem produces a linear system of equations, which has a unique solution [20]. Although the rank of this system of linear equations is large (the number of equations is equal to the number of pixels in the reconstruction area), the left-hand side coefficient matrix is very sparse and a solution can be obtained extremely quickly.…”
Section: Phase-retrieval Boundary Value Problem and A Priori Informationmentioning
confidence: 99%
“…(6) and inhomogeneous mixed boundary conditions. Finite element discretization of the boundary value problem produces a linear system of equations, which has a unique solution [20]. Although the rank of this system of linear equations is large (the number of equations is equal to the number of pixels in the reconstruction area), the left-hand side coefficient matrix is very sparse and a solution can be obtained extremely quickly.…”
Section: Phase-retrieval Boundary Value Problem and A Priori Informationmentioning
confidence: 99%
“…conjugate-gradient (CG) type -iterative schemes. Like the classical stationary Richardson and Frankel (alias second-order Richardson) schemes (Birkhoff and Lynch, 1984, chpt. 5) they effectively generate an approximate solution of the governing elliptic problem, say (15), recurrently by linearly combining the initial guess φ ′ 0 with the subsequent iterates of the initial residual error, r 0 = L(φ ′ 0 ) − R, under the linear operator L, such that…”
Section: Highlights Of the Elliptic Solvermentioning
confidence: 99%
“…Smolarkiewicz and Margolin, 2000, and references therein) may be more appealing to a physicist. Just like the first-and second-order Richardson methods may be viewed as discrete integrations of the heat and damped oscillation equations (Birkhoff and Lynch, 1984, sections 4.9 and 4.15, respectively), the preconditioned GCR(k) algorithm can be derived 6 by augmenting BVPs of the preceding section with a kth-order damped oscillation equation…”
Section: Highlights Of the Elliptic Solvermentioning
confidence: 99%
“…To construct schemes with an improved convergence defect, it is tempting to use a technique based on locally condensing rectangular meshes. So, in the case of regular boundary value problems whose solutions have singularities, an improvement of the accuracy of a discrete solution can be achieved by means of a priori and/or a posteriori local refinement of a rectangular mesh in those subdomains where the errors of the discrete solution are larger (see, e.g., [1,3,13]). …”
Section: Is Said To Be Unimprovable With Respect To the Values Ofmentioning
confidence: 99%
“…The use of a technique developed to improve the accuracy of the solutions in the case of regular boundary value problems (e.g., the technique of a priori/a posteriori adaptive meshes; see [1,3,6] and bibliography therein), turns out to be ineffective in the case of singularly perturbed problems (see [10] and the statement of Theorem 4.1 in Section 4). Therefore, the quest for conditions necessary (and for specific discrete methods also sufficient) for the ε-uniform convergence of numerical methods, for problems with moving transition layers is relevant.…”
Section: Introductionmentioning
confidence: 99%