Related papers: On a New Algorithm for the Computation of Enclosur…
We show that the multitude of applications of the Weyl-Titchmarsh m-function leads to a multitude of different functions in the theory of orthogonal polynomials on the unit circle that serve as analogs of the m-function.
This paper is concerned with methods for numerical computation of eigenvalue enclosures. We examine in close detail the equivalence between an extension of the Lehmann-Maehly-Goerisch method developed a few years ago by Zimmermann and…
In this paper we give simplified formulas for certain polynomials which arise in some new Titchmarsh-Weyl m-functions for the radial part of the separated Hydrogen atom on the half line and two independent programs for generating them using…
The Weyl closure is a basic operation in algebraic analysis: it converts a system of differential operators with rational coefficients into an equivalent system with polynomial coefficients. In addition to encoding finer information on the…
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
We present a robust algorithm that computes (maximally localized) Wannier functions (WFs) without the need of providing an initial guess. Instead, a suitable starting point is constructed automatically from so-called local orbitals which…
I present a simple dynamic programming algorithm for the evaluation of operators in a wide range of superconformal algebras. Special care is taken to describe the computation of the Gram matrix. A Mathematica package, Weaver.m, is provided…
In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of $m$ polynomial equations in $n$ variables over the finite field $\FF_q$ of $q$ elements, for $m$ large. The…
We derive sufficient conditions for the existence of the Weber formal solution of the corresponding integral equation, related to the familiar Weber-Orr integral transforms. This gives a solution to the old Weber-Titchmarsh problem (posed…
In this paper, we give necessary and sufficient conditions for weighted $L^2$ estimates with matrix-valued measures of well localized operators. Namely, we seek estimates of the form: \[ \| T(\mathbf{W} f)\|_{L^2(\mathbf{V})} \le…
We present a MATLAB function for the numerical evaluation of the Faddeyeva function w(z). The function is based on a newly developed accurate algorithm. In addition to its higher accuracy, the software provides a flexible accuracy vs…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
This survey provides a self-contained account of $M$-estimation of multivariate scatter. In particular, we present new proofs for existence of the underlying $M$-functionals and discuss their weak continuity and differentiability. This is…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
Denote by $T_n^d(A)$ an upper triangular operator matrix of dimension $n$ whose diagonal entries are given and the others are unknown. In this article we provide necessary and sufficient conditions for various types of Fredholm and Weyl…
Tyler's M-estimator is a well known procedure for robust and heavy-tailed covariance estimation. Tyler himself suggested an iterative fixed-point algorithm for computing his estimator however, it requires super-linear (in the size of the…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
The notion of a Weyl module, previously defined for the untwisted affine algebras, is extended here to the twisted affine algebras. We describe an identification of the Weyl modules for the twisted affine algebras with suitably chosen Weyl…