Related papers: A note on the Sassenfeld criterion and its relatio…
In this paper, we present a local convergence analysis of the self-consistent field (SCF) iteration using the density matrix as the state of a fixed-point iteration. Sufficient and almost necessary conditions for local convergence are…
When massless particles are involved, the traditional scattering matrix ($S$-matrix) does not exist: it has no rigorous non-perturbative definition and has infrared divergences in its perturbative expansion. The problem can be traced to the…
This paper is concerned with singular matrix difference equations of mixed order. The existence and uniqueness of initial value problems for these equations are derived, and then the classification of them is obtained with a similar…
We associate a graded monoidal supercategory $\mathcal{H}\mathit{eis}_{F,k}$ to every graded Frobenius superalgebra $F$ and integer $k$. These categories, which categorify a broad range of lattice Heisenberg algebras, recover many…
Pre-conditioning is a well-known concept that can significantly improve the convergence of optimization algorithms. For noise-free problems, where good pre-conditioners are not known a priori, iterative linear algebra methods offer one way…
Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution…
A general sufficient condition for the convergence of subsequences of solutions of non-autonomous, nonlinear difference equations and systems is obtained. For higher order equations the delay sizes and patterns play essential roles in…
In this note we exploit polynomial preconditioners for the Conjugate Gradient method to solve large symmetric positive definite linear systems in a parallel environment. We put in connection a specialized Newton method to solve the matrix…
Over the past decade, various matrix completion algorithms have been developed. Thresholded singular value decomposition (SVD) is a popular technique in implementing many of them. A sizable number of studies have shown its theoretical and…
In this paper, we present a constructive proof of Herschfeld's Convergence Theorem. Our formulation differs from Herschfeld's in a few ways: We consider radicals that nest transfinitely many times, as these are essential to the proof;…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…
A preconditioning theory is presented which establishes sufficient conditions for multiplicative and additive Schwarz algorithms to yield self-adjoint positive definite preconditioners. It allows for the analysis and use of non-variational…
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…
In the context of mod-Gaussian convergence, as defined previously in our work with J. Jacod, we obtain lower bounds for local probabilities for a sequence of random vectors which are approximately Gaussian with increasing covariance. This…
Let $\u_{1\times n}$, $\X_{n\times n}$, and $\v_{n\times 1}$ be matrices of indeterminates, $\Adj \X$ be the classical adjoint of $\X$, and $H(n)$ be the ideal $I_1(\u\X)+I_1(\X\v)+I_1(\v\u-\Adj \X)$. Vasconcelos has conjectured that $H(n)$…
The addition of tunnel barriers to open chaotic systems, as well as representing more general physical systems, leads to much richer semiclassical dynamics. In particular, we present here a complete semiclassical treatment for these…
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this…
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…