English
Related papers

Related papers: Cholesky decomposition for symmetric matrices over…

200 papers

We construct GLSM invariants for a general choice of stability in both the narrow and broad sector cases and prove they form a Cohomological Field Theory. This is obtained by forming the analogue of a virtual fundamental class which lives…

Algebraic Geometry · Mathematics 2021-03-23 David Favero , Bumsig Kim

For a given matrix, we are interested in computing GR decompositions $A=GR$, where $G$ is an isometry with respect to given scalar products. The orthogonal QR decomposition is the representative for the Euclidian scalar product. For a…

Numerical Analysis · Mathematics 2020-06-12 Peter Benner , Carolin Penke

In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered $n$-element set $[n]$ (using this notion to give a combinatorial characterization for quasi-commuting minors of a quantum…

Combinatorics · Mathematics 2016-09-20 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

This paper presents a new algorithm for generating random inverse-Wishart matrices that directly generates the Cholesky factor of the matrix without computing the factorization. Whenever parameterized in terms of a precision matrix…

Computation · Statistics 2023-10-25 Seth D. Axen

These are notes for my talk at ICCM 2010, Beijing. We survey some results, obtained jointly with Pavlo Pylyavskyy, concerning the ring of loop symmetric functions. Motivations from networks on surfaces, total positivity, crystal graphs, and…

Combinatorics · Mathematics 2012-08-28 Thomas Lam

Large kernel systems are prone to be ill-conditioned. Pivoted Cholesky decomposition (PCD) render a stable and efficient solution to the systems without a perturbation of regularization. This paper proposes a new PCD algorithm by tuning…

Numerical Analysis · Mathematics 2019-04-29 Dishi Liu , Hermann G. Matthies

Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors…

Neural and Evolutionary Computing · Computer Science 2008-12-18 Pierre Courrieu

Based on any chiral vertex operator algebra satisfying a suitable finiteness condition, the semisimplicity of the zero-mode algebra as well as a regularity for induced modules, we construct conformal field theory over the projective line…

Quantum Algebra · Mathematics 2007-05-23 Kiyokazu Nagatomo , Akihiro Tsuchiya

We generalize and extend the Conley-Morse-Forman theory for combinatorial multivector fields introduced in \cite{Mr2017}. The generalization consists in dropping the restrictive assumption in \cite{Mr2017} that every multivector has a…

Dynamical Systems · Mathematics 2024-09-18 Michał Lipiński , Jacek Kubica , Marian Mrozek , Thomas Wanner

In this paper we prove the global convergence of the complex Jacobi method for Hermitian matrices for a large class of generalized serial pivot strategies. For a given Hermitian matrix $A$ of order $n$ we find a constant $\gamma<1$…

Numerical Analysis · Mathematics 2024-03-19 Vjeran Hari , Erna Begovic

We introduce the concept of a holomorphic field theory on any complex manifold in the language of the Batalin-Vilkovisky formalism. When the complex dimension is one, this setting agrees with that of chiral conformal field theory. Our main…

Mathematical Physics · Physics 2020-02-26 Brian R. Williams

The article is devoted to the representation theory of locally compact infinite-dimensional group $\mathbb{GLB}$ of almost upper-triangular infinite matrices over the finite field with $q$ elements. This group was defined by S.K., A.V., and…

Representation Theory · Mathematics 2014-04-08 Vadim Gorin , Sergei Kerov , Anatoly Vershik

We present methods for computing the generalized polar decomposition of a matrix based on the dynamically weighted Halley (DWH) iteration. This method is well established for computing the standard polar decomposition. A stable…

Numerical Analysis · Mathematics 2021-04-15 Peter Benner , Yuji Nakatsukasa , Carolin Penke

As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectural features on these…

Mathematical Software · Computer Science 2008-06-12 Alfredo Buttari , Julien Langou , Jakub Kurzak , Jack Dongarra

The emergence of low precision floating-point arithmetic in computer hardware has led to a resurgence of interest in the use of mixed precision numerical linear algebra. For linear systems of equations, there has been renewed enthusiasm for…

Numerical Analysis · Mathematics 2024-02-22 Jennifer Scott , Miroslav Tůma

In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…

Combinatorics · Mathematics 2024-09-24 Amanda Burcroff , Kyungyong Lee , Lang Mou

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

We generalise the expansion formulae of Musiker, Schiffler and Williams, obtained for cluster algebras from orientable surfaces, to a larger class of coefficients which we call principal laminations. In doing so, for any quasi-cluster…

Combinatorics · Mathematics 2020-01-01 Jon Wilson

We introduce the geometric mean and the parallel sum of completely positive (CP) maps on von Neumann algebras, based on the Pusz--Woronowicz theory of positive sesquilinear forms. We provide a concrete characterization via a block matrix…

Operator Algebras · Mathematics 2026-05-08 Rui Okayasu

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

Rings and Algebras · Mathematics 2022-04-15 Salvatore Tringali
‹ Prev 1 8 9 10 Next ›