The steepest descent algorithm without line search for \(p\)-Laplacian (Q278924)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6574430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The steepest descent algorithm without line search for \(p\)-Laplacian |
scientific article; zbMATH DE number 6574430 |
Statements
The steepest descent algorithm without line search for \(p\)-Laplacian (English)
0 references
27 April 2016
0 references
\(p\)-Laplacian
0 references
continuation method
0 references
finite element approximation
0 references
steepest descent algorithm
0 references
multigrid solver
0 references
numerical experiment
0 references
0.7748494148254395
0 references
0.7745034694671631
0 references
0.7517052888870239
0 references
0.7477869987487793
0 references
0.735624372959137
0 references
