Computing the best constant in the Sobolev inequality for a ball.
dc.contributor.author | Ercole, Grey | |
dc.contributor.author | Espírito Santo, Júlio César do | |
dc.contributor.author | Martins, Eder Marinho | |
dc.date.accessioned | 2018-11-22T13:27:47Z | |
dc.date.available | 2018-11-22T13:27:47Z | |
dc.date.issued | 2017 | |
dc.description.abstract | Let B1 be the unit ball of R N , N ≥ 2, and let p ? = N p/(N − p) if 1 < p < N and p ? = ∞ if p ≥ N. For each q ∈ [1, p? ) let wq ∈ W1,p 0 (B1) be the positive function such that kwqkLq(B1) = 1 and λq(B1) := min ( k∇uk p Lp(B1) kuk p Lq(B1) : 0 6≡ u ∈ W1,p 0 (B1) ) = k∇wqk p Lp(B1) . In this paper we develop an iterative method for obtaining the pair (λq(B1), wq), starting from w1. Since w1 is explicitly known, the method is computationally practical, as our numerical tests show. 2010 Mathematics Subject Classification. 34L16; 35J25; 65N25 Keywords: Best Sobolev constant; extremal functions; inverse iteration method; p-Laplacian. | pt_BR |
dc.identifier.citation | ENCOLE, G.; ESPÍRITO SANTO, J. C do.; MARTINS, E. M. Computing the best constant in the Sobolev inequality for a ball. Applicable Analysis, v. 1, p. 1-17, 2018. Disponível em: <https://www.tandfonline.com/doi/full/10.1080/00036811.2017.1422723>. Acesso em: 16 jun. 2018. | pt_BR |
dc.identifier.issn | 1563504X | |
dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/10560 | |
dc.identifier.uri2 | https://www.tandfonline.com/doi/full/10.1080/00036811.2017.1422723 | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | restrito | pt_BR |
dc.title | Computing the best constant in the Sobolev inequality for a ball. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
Arquivos
Pacote original
1 - 1 de 1
Nenhuma Miniatura Disponível
- Nome:
- ARTIGO_ComputingBestConstant.pdf
- Tamanho:
- 817.67 KB
- Formato:
- Adobe Portable Document Format
Licença do pacote
1 - 1 de 1
Nenhuma Miniatura Disponível
- Nome:
- license.txt
- Tamanho:
- 924 B
- Formato:
- Item-specific license agreed upon to submission
- Descrição: