1965
DOI: 10.21136/am.1965.102941
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of numerical processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1968
1968
2010
2010

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…In particular, u will be smooth on Ω if f is smooth on Ω. This well-posedness result is especially useful in practice for the numerical approximation of the solution u of Equation (1), see for example [6,12,16] among many possible references. In practice, however, it is rarely the case that Ω is smooth.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, u will be smooth on Ω if f is smooth on Ω. This well-posedness result is especially useful in practice for the numerical approximation of the solution u of Equation (1), see for example [6,12,16] among many possible references. In practice, however, it is rarely the case that Ω is smooth.…”
Section: Introductionmentioning
confidence: 99%
“…If ((p") с D{Ä) and {Ä(p^ is a complete sequence in Я then ((/>") is a complete sequence in Я^. These statements are evident from (1,3).…”
Section: Finite Dimensional Approximationsmentioning
confidence: 84%
“…Let N be a compact set in Я. Then {cp^ с Я^2 is an almost optimal least square approximation of (1,1)…”
Section: Theorem 11 Under the Above Assumptions éF\a-^) = еп^'ла-щ A-% а-ч") =Hni-mentioning
confidence: 99%
See 2 more Smart Citations