Related papers: On the Cholesky method
We give a new description of classical Yang-Mills theory by coupling a two-dimensional chiral CFT (which gives the tree-level S-matrix of Yang-Mills theory at genus zero) to a background non-abelian gauge field. The resulting model is…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
In this paper, we propose a new approach to justify a round-off error impact on the accuracy of the linear least squares (LS) solution using Cholesky decomposition. This decomposition is widely employed to inverse a matrix in the linear…
The description of weakly bound electronic states is especially difficult with atomic orbital basis sets. The diffuse atomic basis functions that are necessary to describe the extended electronic state generate significant linear…
We propose a new asymptotic test for the separability of a covariance matrix. The null distribution is valid in wide matrix elliptical model that includes, in particular, both matrix Gaussian and matrix $t$-distribution. The test is fast to…
Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a…
For each $n \geq 1$ and sign pattern $\epsilon \in \{ \pm 1 \}^n$, we introduce a cone of real symmetric matrices $LPM_n(\epsilon)$: those with leading principal $k \times k$ minors of signs $\epsilon_k$. These cones are pairwise disjoint…
Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…
In the context of isogeometric analysis, we consider two discretization approaches that make the resulting stiffness matrix nonsymmetric even if the differential operator is self-adjoint. These are the collocation method and the…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
Let S be a closed orientable surface of genus at least two, and let C be an arbitrary (complex) projective structure on S. We show that there is a decomposition of S into pairs of pants and cylinders such that the restriction of C to each…
Placed slightly out of dynamical equilibrium, an isolated stellar system quickly returns towards a steady virialized state. We study this process of collisionless relaxation using the matrix method of linear response theory. We show that…
We present a simple method to decompose the Green forms corresponding to a large class of interesting symmetric Dirichlet forms into integrals over symmetric positive semi-definite and finite range (properly supported) forms that are…
A general sieve method for groups is formulated. It enables one to "measure" subsets of a finitely generated group. As an application we show that if $\Gamma$ is a finitely generated non virtually-solvable linear group of characteristic…
We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than…
We present a method for linear stability analysis of systems with parametric uncertainty formulated in the stochastic Galerkin framework. Specifically, we assume that for a model partial differential equation, the parameter is given in the…
We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic…
A decomposition principle for nonlinear dynamic compartmental systems is introduced in the present paper. This theory is based on the mutually exclusive and exhaustive, analytical and dynamic, novel system and subsystem partitioning…
In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…