12 research outputs found

    Computing the sinp\sin_{p} function via the inverse power method

    Full text link
    In this paper, we discuss a new iterative method for computing sinp\sin_{p}. This function was introduced by Lindqvist in connection with the unidimensional nonlinear Dirichlet eigenvalue problem for the pp-Laplacian. The iterative technique was inspired by the inverse power method in finite dimensional linear algebra and is competitive with other methods available in the literature

    Eigenvalues and eigenfunctions of the Laplacian via inverse iteration with shift

    Full text link
    In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary condition for arbitrary bounded domains ΩRN\Omega\subset R^{N}. This method, which has a direct functional analysis approach, does not approximate the eigenvalues of the Laplacian as those of a finite linear operator. It is based on the uniform convergence away from nodal surfaces and can produce a simple and fast algorithm for computing the eigenvalues with minimal computational requirements, instead of using the ubiquitous Rayleigh quotient of finite linear algebra. Also, an alternative expression for the Rayleigh quotient in the associated infinite dimensional Sobolev space which avoids the integration of gradients is introduced and shown to be more efficient. The method can also be used in order to produce the spectral decomposition of any given function uL2(Ω)u\in L^{2}(\Omega).Comment: In this version the numerical tests in Section 6 were considerably improved and the Section 5 entitled "Normalization at each step" was introduced. Moreover, minor adjustments in the Section 1 (Introduction) and in the Section 7 (Fi nal Comments) were made. Breno Loureiro Giacchini was added as coautho

    Computing the first eigenpair of the p-Laplacian via inverse iteration of sublinear supersolutions

    Full text link
    We introduce an iterative method for computing the first eigenpair (λp,ep)(\lambda_{p},e_{p}) for the pp-Laplacian operator with homogeneous Dirichlet data as the limit of (μq,uq)(\mu_{q,}u_{q}) as qpq\rightarrow p^{-}, where uqu_{q} is the positive solution of the sublinear Lane-Emden equation Δpuq=μquqq1-\Delta_{p}u_{q}=\mu_{q}u_{q}^{q-1} with same boundary data. The method is shown to work for any smooth, bounded domain. Solutions to the Lane-Emden problem are obtained through inverse iteration of a super-solution which is derived from the solution to the torsional creep problem. Convergence of uqu_{q} to epe_{p} is in the C1C^{1}-norm and the rate of convergence of μq\mu_{q} to λp\lambda_{p} is at least O(pq)O(p-q). Numerical evidence is presented.Comment: Section 5 was rewritten. Jed Brown was added as autho

    Calculadora Matricial

    No full text
    Educação Superior::Ciências Exatas e da Terra::MatemáticaCalculadora que realiza diversas operações matriciaisTer conhecimento de operações com matrize
    corecore