اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNumerical recovery of location and residue of poles of meromorphic functions
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a method able to recover location and residue of poles of functions meromorphic in a half--plane from samples of the function on the real positive semi-axis. The function is assumed to satisfy appropriate asymptotic conditions including, in particular, that required by Carlsons theorem. The peculiar features of the present procedure are: (i) it does not make use of the approximation of meromorphic functions by rational functions; (ii) it does not use the standard methods of regularization of ill-posed problems. The data required for the determination of the pole parameters (i.e., location and residue) are the approximate values of the meromorphic function on a finite set of equidistant points on the real positive semi-axis. We show that this method is numerically stable by proving that the algorithm is convergent as the number of data points tends to infinity and the noise on the input data goes to zero. Moreover, we can also evaluate the degree of approximation of the estimates of pole location and residue which we obtain from the knowledge of a finite number of noisy samples.
قيم البحث
اقرأ أيضاً
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the quasiseparable s
tructure under diagonal shifting and inversion. This algorithm is applied to compute various functions of matrices. Numerical experiments show that this approach is fast and numerically robust.
We give conditions characterizing holomorphic and meromorphic functions in the unit disk of the complex plane in terms of certain weak forms of the maximum principle. Our work is directly inspired by recent results of John Wermer, and by the theory o
f the projective hull of a compact subset of complex projective space developed by Reese Harvey and Blaine Lawson.
In this paper, we first extend the micro-macro decomposition method for multiscale kinetic equations from the BGK model to general collisional kinetic equations, including the Boltzmann and the Fokker-Planck Landau equations. The main idea is to use
a relation between the (numerically stiff) linearized collision operator with the nonlinear quadratic ones, the laters stiffness can be overcome using the BGK penalization method of Filbet and Jin for the Boltzmann, or the linear Fokker-Planck penalization method of Jin and Yan for the Fokker-Planck Landau equations. Such a scheme allows the computation of multiscale collisional kinetic equations efficiently in all regimes, including the fluid regime in which the fluid dynamic behavior can be correctly computed even without resolving the small Knudsen number. A distinguished feature of these schemes is that although they contain implicit terms, they can be implemented explicitly. These schemes preserve the moments (mass, momentum and energy) exactly thanks to the use of the macroscopic system which is naturally in a conservative form. We further utilize this conservation property for more general kinetic systems, using the Vlasov-Amp{e}re and Vlasov-Amp{e}re-Boltzmann systems as examples. The main idea is to evolve both the kinetic equation for the probability density distribution and the moment system, the later naturally induces a scheme that conserves exactly the moments numerically if they are physically conserved.
In this paper we study $L_2$-norm sampling discretization and sampling recovery of complex-valued functions in RKHS on $D subset R^d$ based on random function samples. We only assume the finite trace of the kernel (Hilbert-Schmidt embedding into $L_2
$) and provide several concrete estimates with precise constants for the corresponding worst-case errors. In general, our analysis does not need any additional assumptions and also includes the case of non-Mercer kernels and also non-separable RKHS. The fail probability is controlled and decays polynomially in $n$, the number of samples. Under the mild additional assumption of separability we observe improved rates of convergence related to the decay of the singular values. Our main tool is a spectral norm concentration inequality for infinite complex random matrices with independent rows complementing earlier results by Rudelson, Mendelson, Pajor, Oliveira and Rauhut.
This paper deals with simulation of flow and transport in porous media such as transport of groundwater contaminants. We first discuss how macro scale equations are derived and which terms have to be closed by models. The transport of tracers is stro
ngly influenced by pore scale velocity structure and large scale inhomogeneities in the permeability field. The velocity structure on the pore scale is investigated by direct numerical simulations of the 3D velocity field in a random sphere pack. The velocity probability density functions are strongly skewed, including some negative velocities. The large probability for very small velocities might be the reason for non-Fickian dispersion in the initial phase of contaminant transport. We present a method to determine large scale distributions of the permeability field from point-wise velocity measurements. The adjoint-based optimisation algorithm delivers fully satisfying agreement between input and estimated permeability fields. Finally numerical methods for convection dominated tracer transports are investigated from a theoretical point of view. It is shown that high order Finite Element Methods can reduce or even eliminate non-physical oscillations in the solution without introducing additional numerical diffusivity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
