27 resultados para Almost Convergence


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a 3-dimensional Riemannian manifold V with a metric g and an a±nor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we construct an infinite series of circulant metrics which are successively almost conformaly related. In this case we get some properties.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 47H04, 65K10.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 60J80.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 41A05.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Л. И. Каранджулов, Н. Д. Сиракова - В работата се прилага методът на Поанкаре за решаване на почти регулярни нелинейни гранични задачи при общи гранични условия. Предполага се, че диференциалната система съдържа сингулярна функция по отношение на малкия параметър. При определени условия се доказва асимптотичност на решението на поставената задача.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AMS subject classification: 65J15, 47H04, 90C30.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AMS subject classification: 49N35,49N55,65Lxx.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classi cation: 60J80, 60F25.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 60G18, 60E07

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 41A25, 41A36, 40G15.