1997
DOI: 10.1090/conm/204/02629
|View full text |Cite
|
Sign up to set email alerts
|

Sobolev gradients and boundary conditions for partial differential equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2004
2004
2004
2004

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…We interpret this algorithm in the continuous case as a (projected) Sobolev gradient [23] and show that it preserves the degree. We then give the discretization of the algorithm by P 1 finite element discretization: in numerical interpretation, the algorithm is a (projected) gradient computed with a preconditionned conjugate gradient method.…”
Section: Sobolev Gradient For Harmonic Mapsmentioning
confidence: 99%
See 1 more Smart Citation
“…We interpret this algorithm in the continuous case as a (projected) Sobolev gradient [23] and show that it preserves the degree. We then give the discretization of the algorithm by P 1 finite element discretization: in numerical interpretation, the algorithm is a (projected) gradient computed with a preconditionned conjugate gradient method.…”
Section: Sobolev Gradient For Harmonic Mapsmentioning
confidence: 99%
“…By interpreting this algorithm as a Sobolev gradient [23] with step-size 1 on a Riemannian submanifold, we develop a Newton algorithm and conjugate gradient algorithm [20] for Riemannian manifolds. In the appendix, we give a proof of the quadratic convergence of the Newton algorithm for manifolds in a general setting.…”
Section: Introductionmentioning
confidence: 99%