English
Related papers

Related papers: Continuation Methods for Computing Z-/H-eigenpairs…

200 papers

Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the…

Combinatorics · Mathematics 2016-01-13 Anders Nedergaard Jensen

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

Numerical Analysis · Mathematics 2015-05-14 Diego Armentano , Carlos Beltrán , Peter Bürgisser , Felipe Cucker , Michael Shub

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

Numerical Analysis · Mathematics 2014-10-02 Peter Bürgisser , Felipe Cucker

Using standard calculus, explicit formulas for the one-dimensional continuous and discrete homotopy operators are derived. It is shown that these formulas are equivalent to those in terms of Euler operators obtained from the variational…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 W. Hereman , B. Deconinck , L. D. Poole

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

Optimization and Control · Mathematics 2014-11-20 Jinyan Fan , Anwa Zhou

In this paper, we define a new notion of "freely tracing property by free chains" on $G$-like continua and we prove that a positive topological entropy homeomorphism on a $G$-like continuum admits a Cantor set $Z$ such that every tuple of…

Dynamical Systems · Mathematics 2017-03-20 Hisao Kato

We introduce a Kojima-Megiddo-Mizuno type continuation method for solving tensor complementarity problems. We show that there exists a bounded continuation trajectory when the tensor is strictly semi-positive and any limit point tracing the…

Optimization and Control · Mathematics 2018-03-06 Lixing Han

Let $A$ be a unital simple separable exact C$^*$-algebra which is approximately divisible and of real rank zero. We prove that the set of positive elements in $A$ with a fixed non-compact Cuntz class has vanishing homotopy groups. Combined…

Operator Algebras · Mathematics 2022-10-27 Andrew S. Toms

By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…

Computational Geometry · Computer Science 2014-04-01 Ana Romero , Jónathan Heras , Julio Rubio , Francis Sergeraert

A number of modern learning tasks involve estimation from heterogeneous information sources. This includes classification with labeled and unlabeled data as well as other problems with analogous structure such as competitive (game…

Machine Learning · Computer Science 2013-01-07 Adrian Corduneanu , Tommi S. Jaakkola

We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…

Symbolic Computation · Computer Science 2009-01-26 Alin Bostan , Muhammad Chowdhury , Joris van der Hoeven , Eric Schost

Linear systems with a tensor product structure arise naturally when considering the discretization of Laplace type differential equations or, more generally, multidimensional operators with separable coefficients. In this work, we focus on…

Numerical Analysis · Mathematics 2023-11-03 Stefano Massei , Leonardo Robol

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Representation Theory · Mathematics 2021-05-06 Jiuzhao Hua

In this paper, it is proved that (strict) copositivity of a symmetric tensor $\mathcal{A}$ is equivalent to the fact that every principal sub-tensor of $\mathcal{A}$ has no a (non-positive) negative $H^{++}$-eigenvalue. The necessary and…

Optimization and Control · Mathematics 2022-02-09 Yisheng Song , Liqun Qi

The power method is a basic method for computing the dominant eigenpair of a matrix. In this paper, we propose a structure-preserving power-like method for computing the dominant conjugate pair of purely imaginary eigenvalues and the…

Numerical Analysis · Mathematics 2024-09-10 Qingqing Zheng

We give a construction of classifiers for double negation stable h-propositions in a variety of cubical set models of homotopy type theory and cubical type theory. This is used to give some relative consistency results: classifiers for…

Logic · Mathematics 2022-10-03 Andrew W. Swan

For a positively presented group G, we provide a criterion for two tuples of positive group generators of G to be Hurwitz equivalent or Hurwitz-conjugation equivalent. We also present an algorithmic approach to solve the Hurwitz equivalence…

Group Theory · Mathematics 2014-06-11 Tetsuya Ito

We give a particular choice of the higher Eilenberg-MacLane maps by a recursive formula.This choice leads to a simple description of the homotopy operations for simplicial Z/2-algebras.

Algebraic Topology · Mathematics 2007-05-23 Marcel Bokstedt , Iver Ottosen

In this paper we compute the cohomology of certain special cases of nilpotent algebras in a complex \zt-graded vector space of arbitrary finite dimension. These algebras are generalizations of the only two nontrivial complex 2-dimensional…

Rings and Algebras · Mathematics 2010-05-24 Christopher DeCleene , Michael Penkava , Mitch Phillipson

We present a new continuation algorithm to find all nondegenerate real solutions to a system of polynomial equations. Unlike homotopy methods, it is not based on a deformation of the system; instead, it traces real curves connecting the…

Algebraic Geometry · Mathematics 2009-09-01 Dan Bates , Frank Sottile
‹ Prev 1 3 4 5 6 7 10 Next ›