Related papers: Singular Values using Cholesky Decomposition
We extend to higher dimensions some of the valuative analysis of singularities of plurisubharmonic (psh) functions developed by the last two authors. Following Kontsevich and Soibelman we describe the geometry of the space V of all…
Convergence results are stated for the variational iteration method applied to solve an initial value problem for a system of ordinary differential equations.
Recent work in the field of signal processing has shown that the singular value decomposition of a matrix with entries in certain real algebras can be a powerful tool. In this article we show how to generalise the QR decomposition and SVD…
The reliability is of the most importance when employing a numerical method to solve the eigenvalue integral equations. In this paper, we present one type of particular singularities (pseudosingularities) existing in eigenvalue integral…
Low-rank approximation of images via singular value decomposition is well-received in the era of big data. However, singular value decomposition (SVD) is only for order-two data, i.e., matrices. It is necessary to flatten a higher order…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
Special values of the Lommel functions allow the calculation of Fresnel like integrals. These closed form expressions along with their asymptotic values are reported.
The main object of this work is to show how some rather elementary techniques based upon certain inverse pairs of symbolic operators would lead us easily to several decomposition formulas associated with confluent hypergeometric functions…
Randomized block Krylov subspace methods form a powerful class of algorithms for computing the extreme eigenvalues of a symmetric matrix or the extreme singular values of a general matrix. The purpose of this paper is to develop new…
We introduce a new Macaulay 2 package, SimplicialDecomposability, which works in conjunction with the extant package SimplicialComplexes in order to compute a shelling order, if one exists, of a specified simplicial complex. Further,…
We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
In this article some explicit estimates on the decay of the convolutive inverse of a sequence are proved. They are derived from the functional calculus for Sobolev algebras. Applications include localization in spline-type spaces and…
Game-theoretic formulations of feature importance have become popular as a way to "explain" machine learning models. These methods define a cooperative game between the features of a model and distribute influence among these input elements…
We define the Kloosterman sum for $SL_4$ over the Kloosterman set via the Bruhat decomposition and stratify the Kloosterman set using the reduced word decomposition of the Weyl group element. The Kloosterman sum for an $SL_4$-long word is…
This paper discusses clustering and latent semantic indexing (LSI) aspects of the singular value decomposition (SVD). The purpose of this paper is twofold. The first is to give an explanation on how and why the singular vectors can be used…
We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…
Numerical solving differential equations with fractional derivatives requires elimination of the singularity which is inherent in the standard definition of fractional derivatives. The method of integration by parts to eliminate this…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
In this paper a survey is given of application of a method based on Grunsky coefficients for obtaining different estimates (some sharp) for the general class of univalent functions where no analytical characterisation exists. More…