اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultidomain spectral method for the Gauss hypergeometric function
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a multidomain spectral approach for Fuchsian ordinary differential equations in the particular case of the hypergeometric equation. Our hybrid approach uses Frobenius method and Moebius transformations in the vicinity of each of the singular points of the hypergeometric equation, which leads to a natural decomposition of the real axis into domains. In each domain, solutions to the hypergeometric equation are constructed via the well-conditioned ultraspherical spectral method. The solutions are matched at the domain boundaries to lead to a solution which is analytic on the whole compactified real line $mathbb{R}cup {infty}$, except for the singular points and cuts of the Riemann surface on which the solution is defined. The solution is further extended to the whole Riemann sphere by using the same approach for ellipses enclosing the singularities. The hypergeometric equation is solved on the ellipses with the boundary data from the real axis. This solution is continued as a harmonic function to the interior of the disk by solving the Laplace equation in polar coordinates with an optimal complexity Fourier--ultraspherical spectral method.
قيم البحث
اقرأ أيضاً
We consider the 2+1 and 3+1 scalar wave equations reduced via a helical Killing field, respectively referred to as the 2-dimensional and 3-dimensional helically reduced wave equation (HRWE). The HRWE serves as the fundamental model for the mixed-type
PDE arising in the periodic standing wave (PSW) approximation to binary inspiral. We present a method for solving the equation based on domain decomposition and spectral approximation. Beyond describing such a numerical method for solving strictly linear HRWE, we also present results for a nonlinear scalar model of binary inspiral. The PSW approximation has already been theoretically and numerically studied in the context of the post-Minkowskian gravitational field, with numerical simulations carried out via the eigenspectral method. Despite its name, the eigenspectral technique does feature a finite-difference component, and is lower-order accurate. We intend to apply the numerical method described here to the theoretically well-developed post-Minkowski PSW formalism with the twin goals of spectral accuracy and the coordinate flexibility afforded by global spectral interpolation.
Gauss hypergeometric functions with a dihedral monodromy group can be expressed as elementary functions, since their hypergeometric equations can be transformed to Fuchsian equations with cyclic monodromy groups by a quadratic change of the argument
variable. The paper presents general elementary expressions of these dihedral hypergeometric functions, involving finite bivariate sums expressible as terminating Appells F2 or F3 series. Additionally, trigonometric expressions for the dihedral functions are presented, and degenerate cases (logarithmic, or with the monodromy group Z/2Z) are considered.
The Gauss{} hypergeometric function shows a recursive structure which resembles those found in conformal blocks. We compare it with the recursive structure of the conformal block in boundary/crosscap conformal field theories that is obtained from the
representation theory. We find that the pole structure perfectly agrees but the recursive structure in the Gauss{} hypergeometric function is slightly ``off-shell.
The randomized Gauss--Seidel method and its extension have attracted much attention recently and their convergence rates have been considered extensively. However, the convergence rates are usually determined by upper bounds, which cannot fully refle
ct the actual convergence. In this paper, we make a detailed analysis of their convergence behaviors. The analysis shows that the larger the singular value of $A$ is, the faster the error decays in the corresponding singular vector space, and the convergence directions are mainly driven by the large singular values at the beginning, then gradually driven by the small singular values, and finally by the smallest nonzero singular value. These results explain the phenomenon found in the extensive numerical experiments appearing in the literature that these two methods seem to converge faster at the beginning. Numerical examples are provided to confirm the above findings.
We present a novel greedy Gauss-Seidel method for solving large linear least squares problem. This method improves the greedy randomized coordinate descent (GRCD) method proposed recently by Bai and Wu [Bai ZZ, and Wu WT. On greedy randomized coordin
ate descent methods for solving large linear least-squares problems. Numer Linear Algebra Appl. 2019;26(4):1--15], which in turn improves the popular randomized Gauss-Seidel method. Convergence analysis of the new method is provided. Numerical experiments show that, for the same accuracy, our method outperforms the GRCD method in term of the computing time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
