<p>Aqui, são desenvolvidos métodos de ordem m que conservam a forma dos primeira<br />ordem. Métodos têm uma taxa convergência maior sua versão primeira ordem.<br />Esses subsequências seu método precursor, onde alguns benefícios do uso<br />de processadores vetoriais e paralelos podem ser explorados. Os resultados numéricos obtidos com as<br />implementações mostr...

This paper presented a simple and efficient algorithm for multi-focus image fusion, which used a multiresolution signal decomposition scheme called Laplacian pyramid method. The principle of Laplacian pyramid transform is introduced, and based on it the fusion strategy is described in detail. The method mainly composed of three steps. Firstly, the Laplacian pyramids of each source image are dec...

We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of Θ( √ n) noncospectral unicyclic graphs on n vertices with the same Laplacian energy.

A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the edges between the neighborhood and the non-neighborhood of v. Two graphs are Seidel complement equivalent if one can be obtained from the other by a sequence of Seidel complementations. In this paper we introduce the ne...

The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent studies, the Laplacian hypergraphs, a generalization matrix, has introduced. this article, based on definition, we derive bounds depending pair-degree, maximum degree, and first Zagreb index for greatest eigenvalue energy r-uniform regular hypergraphs. As result these bounds, Nordhaus–Gaddum type ...

The integral fractional Laplacian of order $s \in (0,1)$ is a nonlocal operator. It known that solutions to the Dirichlet problem involving such an operator exhibit algebraic boundary singularity regardless domain regularity. This, in turn, deteriorates global regularity and as result convergence rate numerical solutions. For finite element discretizations, we derive local error estimates $H^s$...