اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient Solution of Parameter Dependent Quasiseparable Systems and Computation of Meromorphic Matrix Functions
116
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 structure 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 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, i
n 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.
This paper develops and analyzes a general iterative framework for solving parameter-dependent and random diffusion problems. It is inspired by the multi-modes method of [7,8] and the ensemble method of [19] and extends those methods into a more gene
ral and unified framework. The main idea of the framework is to reformulate the underlying problem into another problem with a parameter-independent diffusion coefficient and a parameter-dependent (and solution-dependent) right-hand side, a fixed-point iteration is then employed to compute the solution of the reformulated problem. The main benefit of the proposed approach is that an efficient direct solver and a block Krylov subspace iterative solver can be used at each iteration, allowing to reuse the $LU$ matrix factorization or to do an efficient matrix-matrix multiplication for all parameters, which in turn results in significant computation saving. Convergence and rates of convergence are established for the iterative method both at the variational continuous level and at the finite element discrete level under some structure conditions. Several strategies for establishing reformulations of parameter-dependent and random diffusion problems are proposed and their computational complexity is analyzed. Several 1-D and 2-D numerical experiments are also provided to demonstrate the efficiency of the proposed iterative method and to validate the theoretical convergence results.
Recent studies have demonstrated improved skill in numerical weather prediction via the use of spatially correlated observation error covariance information in data assimilation systems. In this case, the observation weighting matrices (inverse error
covariance matrices) used in the assimilation may be full matrices rather than diagonal. Thus, the computation of matrix-vector products in the variational minimization problem may be very time-consuming, particularly if the parallel computation of the matrix-vector product requires a high degree of communication between processing elements. Hence, we introduce a well-known numerical approximation method, called the fast multipole method (FMM), to speed up the matrix-vector multiplications in data assimilation. We explore a particular type of FMM that uses a singular value decomposition (SVD-FMM) and adjust it to suit our new application in data assimilation. By approximating a large part of the computation of the matrix-vector product, the SVD-FMM technique greatly reduces the computational complexity compared with the standard approach. We develop a novel possible parallelization scheme of the SVD-FMM for our application, which can reduce the communication costs. We investigate the accuracy of the SVD-FMM technique in several numerical experiments: we first assess the accuracy using covariance matrices that are created using different correlation functions and lengthscales; then investigate the impact of reconditioning the covariance matrices on the accuracy; and finally examine the feasibility of the technique in the presence of missing observations. We also provide theoretical explanations for some numerical results. Our results show that the SVD-FMM technique has potential as an efficient technique for assimilation of a large volume of observational data within a short time interval.
An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is presented t
o approximately map the Riemann matrix to the Siegel fundamental domain. The shortest vector of the lattice generated by the Riemann matrix is identified exactly, and the algorithm ensures that its length is larger than $sqrt{3}/2$. The approach is based on a previous algorithm by Deconinck et al. using the LLL algorithm for lattice reductions. Here, the LLL algorithm is replaced by exact Minkowski reductions for small genus and an exact identification of the shortest lattice vector for larger values of the genus.
Evaluating the log-sum-exp function or the softmax function is a key step in many modern data science algorithms, notably in inference and classification. Because of the exponentials that these functions contain, the evaluation is prone to overflow a
nd underflow, especially in low precision arithmetic. Software implementations commonly use alternative formulas that avoid overflow and reduce the chance of harmful underflow, employing a shift or another rewriting. Although mathematically equivalent, these variants behave differently in floating-point arithmetic. We give rounding error analyses of different evaluation algorithms and interpret the error bounds using condition numbers for the functions. We conclude, based on the analysis and numerical experiments, that the shifted formulas are of similar accuracy to the unshifted ones and that the shifted softmax formula is typically more accurate than a division-free variant.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
