Related papers: Singular Values using Cholesky Decomposition
We present numerical solutions for differential equations by expanding the unknown function in terms of Chebyshev polynomials and solving a system of linear equations directly for the values of the function at the extrema (or zeros) of the…
Let $x=a+ib$ be a complex number, so we have the following inequality $$(1/\sqrt{2})|a+b|\leq |x|\leq |a|+|b|$$ We give an operator version of above inequality. Also we obtain some results for normal operators.
We define certain higher-dimensional Dedekind sums that generalize the classical Dedekind-Rademacher sums, and show how to compute them effectively using a generalization of the continued-fraction algorithm. We present two applications.…
We show an effective method to compute the \L ojasiewicz exponent of an arbitrary sheaf of ideals of $\OO_X$, where $X$ is a non-singular scheme. This method is based on the algorithm of resolution of singularities.
We present the singular Euler--Maclaurin expansion, a new method for the efficient computation of large singular sums that appear in long-range interacting systems in condensed matter and quantum physics. In contrast to the traditional…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness…
The notion of singular reduction operators, i.e., of singular operators of nonclassical (conditional) symmetry, of partial differential equations in two independent variables is introduced. All possible reductions of these equations to…
In this work, we introduce a novel numerical method for solving initial value problems associated with a given differential. Our approach utilizes a spline approximation of the theoretical solution alongside the integral formulation of the…
We present a calculation of spectroscopic factors within coupled-cluster theory. Our derivation of algebraic equations for the one-body overlap functions are based on coupled-cluster equation-of-motion solutions for the ground and excited…
In this work we show how the Multiplicity Polar Theorem can be used to calculate Chern numbers for a collection of 1-forms.
We consider an $\ell_1$-regularized inverse problem where both the forward and regularization operators have a Kronecker product structure. By leveraging this structure, a joint decomposition can be obtained using generalized singular value…
There is a space of vector-valued nonsymmetric Jack polynomials associated with any irreducible representation of a symmetric group. Singular polynomials for the smallest singular values are constructed in terms of the Jack polynomials. The…
We propose three kinds of explicit formulas for the elliptic lambda function by the elliptic modular function. Further, we derive incredible cubic identities as a corollary of our explicit formulas and evaluate some singular values of the…
The main focus of this work is the study of several cones relating the eigenvalues or singular values of a matrix to those of its off-diagonal blocks.
The problem of evaluating potential integrals on planar triangular elements has been addressed using a polar coordinate decomposition. The resulting formulae are general, exact, easily implemented, and have only one special case, that of a…
This research introduces a new method for the transition from partial to ordinary differential equations that is based on the Kolmogorov superposition theorem. In this paper, we discuss the numerical implementation of the Kolmogorov theorem…
A method for obtaining discretization formulas for the derivatives of a function is presented, which relies on a generalization of divided differences. These modified divided differences essentially correspond to a change of the dependent…
Algorithms for computing rational generating functions of solutions of one-dimensional difference equations are well-known and easy to implement. We propose an algorithm for computing rational generating functions of solutions of…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…