920 resultados para Numerical Operator


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Implementações dos métodos de migração diferença finita e Fourier (FFD) usam fatoração direcional para acelerar a performance e economizar custo computacional. Entretanto essa técnica introduz anisotropia numérica que podem erroneamente posicionar os refletores em mergulho ao longo das direções em que o não foi aplicado a fatoração no operador de migração. Implementamos a migração FFD 3D, sem usar a técnica do fatoração direcional, no domínio da frequência usando aproximação de Padé complexa. Essa aproximação elimina a anisotropia numérica ao preço de maior custo computacional buscando a solução do campo de onda para um sistema linear de banda larga. Experimentos numéricos, tanto no modelo homogêneo e heterogêneo, mostram que a técnica da fatoração direcional produz notáveis erros de posicionamento dos refletores em meios com forte variação lateral de velocidade. Comparamos a performance de resolução do algoritmo de FFD usando o método iterativo gradiente biconjugado estabilizado (BICGSTAB) e o multifrontal massively parallel direct solver (MUMPS). Mostrando que a aproximação de Padé complexa é um eficiente precondicionador para o BICGSTAB, reduzindo o número de iterações em relação a aproximação de Padé real. O método iterativo BICGSTAB é mais eficiente que o método direto MUMPS, quando usamos apenas um termo da expansão de Padé complexa. Para maior ângulo de abertura do operador, mais termos da série são requeridos no operador de migração, e neste caso, a performance do método direto é mais eficiente. A validação do algoritmo e as propriedades da evolução computacional foram avaliadas para a resposta ao impulso do modelo de sal SEG/EAGE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Nos últimos anos tem-se verificado um interesse crescente no desenvolvimento de algoritmos de imageamento sísmico com a finalidade de obter uma imagem da subsuperfície da terra. A migração pelo método de Kirchhoff, por exemplo, é um método de imageamento muito eficiente empregado na busca da localização de refletores na subsuperficie, quando dispomos do cálculo dos tempos de trânsito necessários para a etapa de empilhamento, sendo estes obtidos neste trabalho através da solução da equação eiconal. Primeiramente, é apresentada a teoria da migração de Kirchhoff em profundidade baseada na teoria do raio, sendo em seguida introduzida a equação eiconal, através da qual são obtidos os tempos de trânsitos empregados no empilhamento das curvas de difrações. Em seguida é desenvolvido um algoritmo de migração em profundidade fazendo uso dos tempos de trânsito obtidos através da equação eiconal. Finalmente, aplicamos este algoritmo a dados sintéticos contendo ruído aditivo e múltiplas e obtemos como resultado uma seção sísmica na profundidade. Através dos experimentos feitos neste trabalho observou-se que o algoritmo de migração desenvolvido mostrou-se bastante eficiente e eficaz na reconstrução da imagem dos refletores.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents numerical modeling of a turbulent natural gas flow through a non-premixed industrial burner of a slab reheating furnace. The furnace is equipped with diffusion side swirl burners capable of utilizing natural gas or coke oven gas alternatively through the same nozzles. The study is focused on one of the burners of the preheating zone. Computational Fluid Dynamics simulation has been used to predict the burner orifice turbulent flow. Flow rate and pressure at burner upstream were validated by experimental measurements. The outcomes of the numerical modeling are analyzed for the different turbulence models in terms of pressure drop, velocity profiles, and orifice discharge coefficient. The standard, RNG, and Realizable k-epsilon models and Reynolds Stress Model (RSM) have been used. The main purpose of the numerical investigation is to determine the turbulence model that more consistently reproduces the experimental results of the flow through an industrial non-premixed burner orifice. The comparisons between simulations indicate that all the models tested satisfactorily and represent the experimental conditions. However, the Realizable k-epsilon model seems to be the most appropriate turbulence model, since it provides results that are quite similar to the RSM and RNG k-epsilon models, requiring only slightly more computational power than the standard k-epsilon model. (C) 2014 Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Vertex operators in string theory me in two varieties: integrated and unintegrated. Understanding both types is important for the calculation of the string theory amplitudes. The relation between them is a descent procedure typically involving the b-ghost. In the pure spinor formalism vertex operators can be identified as cohomology classes of an infinite-dimensional Lie superalgebra formed by covariant derivatives. We show that in this language the construction of the integrated vertex from an unintegrated vertex is very straightforward, and amounts to the evaluation of the cocycle on the generalized Lax currents.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Numerical INJection Analysis (NINJA) project is a collaborative effort between members of the numerical relativity and gravitational-wave (GW) astrophysics communities. The purpose of NINJA is to study the ability to detect GWs emitted from merging binary black holes (BBH) and recover their parameters with next-generation GW observatories. We report here on the results of the second NINJA project, NINJA-2, which employs 60 complete BBH hybrid waveforms consisting of a numerical portion modelling the late inspiral, merger, and ringdown stitched to a post-Newtonian portion modelling the early inspiral. In a 'blind injection challenge' similar to that conducted in recent Laser Interferometer Gravitational Wave Observatory (LIGO) and Virgo science runs, we added seven hybrid waveforms to two months of data recoloured to predictions of Advanced LIGO (aLIGO) and Advanced Virgo (AdV) sensitivity curves during their first observing runs. The resulting data was analysed by GW detection algorithms and 6 of the waveforms were recovered with false alarm rates smaller than 1 in a thousand years. Parameter-estimation algorithms were run on each of these waveforms to explore the ability to constrain the masses, component angular momenta and sky position of these waveforms. We find that the strong degeneracy between the mass ratio and the BHs' angular momenta will make it difficult to precisely estimate these parameters with aLIGO and AdV. We also perform a large-scale Monte Carlo study to assess the ability to recover each of the 60 hybrid waveforms with early aLIGO and AdV sensitivity curves. Our results predict that early aLIGO and AdV will have a volume-weighted average sensitive distance of 300 Mpc (1 Gpc) for 10M circle dot + 10M circle dot (50M circle dot + 50M circle dot) BBH coalescences. We demonstrate that neglecting the component angular momenta in the waveform models used in matched-filtering will result in a reduction in sensitivity for systems with large component angular momenta. This reduction is estimated to be up to similar to 15% for 50M circle dot + 50M circle dot BBH coalescences with almost maximal angular momenta aligned with the orbit when using early aLIGO and AdV sensitivity curves.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Convergence to a period one fixed point is investigated for both logistic and cubic maps. For the logistic map the relaxation to the fixed point is considered near a transcritical bifurcation while for the cubic map it is near a pitchfork bifurcation. We confirmed that the convergence to the fixed point in both logistic and cubic maps for a region close to the fixed point goes exponentially fast to the fixed point and with a relaxation time described by a power law of exponent -1. At the bifurcation point, the exponent is not universal and depends on the type of the bifurcation as well as on the nonlinearity of the map.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The FENE-CR model is investigated through a numerical algorithm to simulate the time-dependent moving free surface flow produced by a jet impinging on a flat surface. The objective is to demonstrate that by increasing the extensibility parameter L, the numerical solutions converge to the solutions obtained with the Oldroyd-B model. The governing equations are solved by an established free surface flow solver based on the finite difference and marker-and-cell methods. Numerical predictions of the extensional viscosity obtained with several values of the parameter L are presented. The results show that if the extensibility parameter L is sufficiently large then the extensional viscosities obtained with the FENE-CR model approximate the corresponding Oldroyd-B viscosity. Moreover, the flow from a jet impinging on a flat surface is simulated with various values of the extensibility parameter L and the fluid flow visualizations display convergence to the Oldroyd-B jet flow results.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are identifyed using simple models (linear) fitted to the data. Then, we run a global optimization algorithm starting its population inside the promising region. The proposed approach with this heuristic criterion of population initialization has shown relevant results for tests using hard benchmark functions.