Publishing House SB RAS:

Publishing House SB RAS:

Address of the Publishing House SB RAS:
Morskoy pr. 2, 630090 Novosibirsk, Russia



Advanced Search

Numerical Analysis and Applications

2017 year, number 1

1.
An approximate solution of the prediction problem for stochastic jump-diffusion systems

T.A. Averina1,2, K.A. Rybakov3
1Institute of Computational Mathematics and Mathematical Geophysics SB RAS, pr. Acad. Lavrentieva 6, Novosibirsk, 630090, Russia
2Novosibirsk State University, Pirogova st., 2, Novosibirsk, 630090, Russia
3Moscow Aviation Institute, Volokolamskoye sh. 4, A-80, GSP-3, Moscow, 125993, Russia
Keywords: апостериорная плотность вероятности, ветвящиеся процессы, метод статистических испытаний, оптимальная фильтрация, прогнозирование, стохастическая система, уравнение Дункана-Мортенсена-Закаи, уравнение Колмогорова-Феллера, branching processes, conditional density, Duncan-Mortensen-Zakai equation, Kolmogorov-Feller equation, Monte Carlo method, optimal filtering problem, prediction problem, stochastic jump-diffusion system

Abstract >>
In this paper we discuss the evolution of the new approach to the prediction problem for nonlinear stochastic differential systems with a Poisson component. The proposed approach is based on reducing the prediction problem to the analysis of stochastic jump-diffusion systems with terminating and branching paths. The solution of the prediction problem can be approximately found by using numerical methods for solving stochastic differential equations and methods for modeling inhomogeneous Poisson flows.



2.
On pseudopolynomial-time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

A.E. Galashov1, A.V. Kel'manov1,2
1Novosibirsk State University, Pirogova st., 2, Novosibirsk, 630090, Russia
2Sobolev Institute of Mathematics, Acad. Koptyug avenue, 4, Novosibirsk, 630090, Russia
Keywords: поиск подмножеств, кластерный анализ, евклидово пространство, минимум суммы квадратов расстояний, NP-трудная задача, точный псевдополинимиальный алгоритм, Euclidean space, subsets search, clustering, NP-hard problem, exact pseudopolynomial-time algorithm

Abstract >>
We consider a strongly NP-hard problem of finding a family of disjoint subsets with given cardinalities in a finite set of points from the Euclidean space. A minimum of the sum over all required subsets of the sum of the squared distances from the elements of these subsets to their geometric centers is used as a search criterion. We have proved that if the coordinates of the input points are integer, and the space dimension and the number of required subsets are fixed (i.e. bounded by some constants), then the problem is a pseudopolynomial-time solvable one.



3.
The assessment of tsunami heights above the parabolic bottom relief within the wave-ray approach

An.G. Marchuk
Institute of Computational Mathematics and Mathematical Geophysics SB RAS, pr. Acad. Lavrentieva 6, Novosibirsk, 630090, Russia
Keywords: распространение цунами, уравнения мелкой воды, волновой луч, кинематика волнового фронта, tsunami propagation, shallow-water equations, wave ray, wavefront kinematics

Abstract >>
In this paper, the kinematics of the tsunami wave ray and the wavefront above an uneven bottom is studied. The formula to determine the wave height along a ray tube has been obtained. The exact analytical solution for the wave-ray trajectory above the parabolic bottom topography has been derived. Within the wave-ray approach this solution gives the possibility to determine the tsunami wave heights in an area with a parabolic bottom relief. The distribution of the wave-height maxima in the area with the parabolic bottom was compared to the one obtained by the numerical computation with a shallow-water model.



4.
Numerical simulations for a two-scale model in a porous medium

H.S. Mahato
University of Georgia, 30602 Athens, USA
Keywords: периодическая среда, двухмасштабная модель, усреднение, численное моделирование, periodic medium, two-scale model, averaging, numerical simulations

Abstract >>
This paper deals with numerical simulations of a system of diffusion-reaction equations in the context of a porous medium. We start by giving a microscopic model and then an upscaled version (i.e., homogenized or continuum model) of it from previous works of the author. Since with the help of homogenization we obtain a macroscopic description of a model which is microscopically heterogeneous, via these numerical simulations we show that this macroscopic description approximates the microscopic model, which contains heterogeneities and oscillating terms at the pore scale, such as diffusion coefficients.



5.
A modified dual scheme for solving an elastic crack problem

R.V. Namm, G.I. Tsoy
Computer Centre of Far Eastern Branch RAS, Kim Yu Chena st., 65, Habarovsk, 680063, Russia
Keywords: упругая задача с трещиной, схема двойственности, модифицированный функционал Лагранжа, функционал чувствительности, соотношение двойственности, слабая полунепрерывность снизу, elastic crack problem, duality scheme, modified Lagrangian functional, sensitivity functional, duality relation, weak lower semicontinuity

Abstract >>
The dual scheme for solving a crack problem in terms of displacements is considered. The dual solution method is based on a modified Lagrangian functional. In addition, the method convergence is investigated under natural assumptions on H1-regularity of the crack problem solution. The duality relation for the primal and dual problems has been proposed.



6.
Semilocal convergence of a continuation method in Banach spaces

M. Prashanth, S. Motsa
University of Kawazulu-Natal, Private Bag X01, Scottsville 3209, Pietermaritzburg, South Africa
Keywords: метод Галлея, выпуклое ускорение метода Ньютона, метод продолжения, банахово пространство, условие Липшица, производная Фреше, Halley's method, convex acceleration of Newton's method, continuation method, Banach space, Lipschitz condition, FrГ©chet derivative

Abstract >>
This paper is concerned with the semilocal convergence of a continuation method between two third-order iterative methods, namely, Halley's method and the convex acceleration of Newton's method, also known as super-Halley's method. This convergence analysis is discussed using a recurrence relations approach. This approach simplifies the analysis and leads to improved results. The convergence is established under the assumption that the second Fréchet derivative satisfies the Lipschitz continuity condition. An existence-uniqueness theorem is given. Also, a closed form of error bounds is derived in terms of a real parameter α ∈ [0,1]. Two numerical examples are worked out to demonstrate the efficiency of our approach. On comparing the existence and uniqueness region and error bounds for the solution obtained by our analysis with those obtained by using majorizing sequences [15], we observed that our analysis gives better results. Further, we observed that for particular values of α our analysis reduces to Halley's method (α = 0) and convex acceleration of Newton's method (α = 1), respectively, with improved results.



7.
Numerical simulation of the equilibrium of an elastic two-layer structure with a crack

E.M. Rudoy, N.A. Kazarinov, V.Yu. Slesarenko
Lavrentyev Institute of Hydrodynamics of SB RAS, Lavrentyev str., 15, Novosibirsk, 630090, Russia
Keywords: двухслойная конструкция, трещина, условие непроникания, вариационное неравенство, метод декомпозиции области, алгоритм Удзавы, two-layer structure, crack, non-penetration condition, variational inequality, domain decomposition method, Uzawa algorithm

Abstract >>
The equilibrium problem for two elastic bodies pasted together along some curve is considered. There exists a crack on a part of the curve. Nonlinear boundary conditions providing a mutual non-penetration between crack faces are set. The main objective of the paper is to construct and to approve an algorithm for the numerical solution of the equilibrium problem. The algorithm is based on the two approaches: the domain decomposition method and the Uzawa method. The numerical experiment illustrates the efficiency of the algorithm.



8.
Twoand three-point with memory methods for solving nonlinear equations

N. Choubey1, J.P. Jaiswal2
1Oriental Institute of Science and Technology, Bhopal, M.P. India-462021
2Maulana Azad National Institute of Technology, Bhopal, M.P. India-462051
Keywords: итерационный метод, схема без памяти, схема с памятью, вычислительная эффективность, численный результат, iterative method, without memory scheme, with memory scheme, computational efficiency, numerical result

Abstract >>
The main objective and inspiration in the construction of two- and three-point with memory methods is to attain the ut computational efficiency without any additional function evaluations. At this juncture, we have modified the existing fourth and eighth order without memory methods with optimal order of convergence by means of different approximations of self-accelerating parameters. The parameters are calculated by a Hermite interpolating polynomial, which accelerates the order of convergence of the without memory methods. In particular, the R-order convergence of the proposed two- and three-step with memory methods is increased from four to five and eight to ten. One more advantage of these methods is that the condition f'(x) ≠ 0 in the neighborhood of the required root, imposed on Newton's method, can be removed. Numerical comparison is also stated to confirm the theoretical results.



9.
About semi-orthogonal spline-wavelets with derivatives, and the algorithm with splitting

B.M. Shumilov
Tomsk State University of Architecture and Building, pl. Solyanaya, 2, Tomsk, 634003, Russia
Keywords: B-сплайны, вейвлеты, неявные соотношения разложения, B-splines, wavelets, implicit decomposition relations

Abstract >>
This paper deals with the use of a scalar product with derivatives for constructing semi-orthogonal spline-wavelets. The reduction of supports of such wavelets in comparison with classical semi-orthogonal wavelets is shown. For the splines of the 3rd degree, the algorithm of wavelet-transformation in the form of the solution to a three-diagonal system of the linear equations with strict diagonal prevalence has been obtained. The results of numerical experiments on the calculation of derivatives of a discretely set function are presented.