Related papers: Universal algorithms for solving the matrix Bellma…
In this paper, we introduce a tensor neural network based machine learning method for solving the elliptic partial differential equations with random coefficients in a bounded physical domain. With the help of tensor product structure, we…
This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements.…
A tropical (or min-plus) semiring is a set $\mathbb{Z}$ (or $\mathbb{Z \cup \{\infty\}}$) endowed with two operations: $\oplus$, which is just usual minimum, and $\odot$, which is usual addition. In tropical algebra the vector $x$ is a…
An explicit formula is given for a fundamental solution for a class of semielliptic operators. The fundamental solution is used to investigate properties of these operators as mappings between weighted function spaces. Necessary and…
In this paper, we present an algorithm for computing a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in several variables. This algorithm is a generalization of a method developed for…
We generalize a recently proposed algebraic method in order to treat non-Hermitian Hamiltonians. The approach is applied to several quadratic Hamiltonians studied earlier by other authors. Instead of solving the Schr\"odinger equation we…
The goal of this paper is to present an overview of the software collection for the solution of linear and nonlinear semidefinite optimization problems PENNON. In the first part we present theoretical and practical details of the underlying…
Symmetries play an critical role in finding analytic solutions to nonlinear differential equations. A symmetry is a mapping of the solutions of the differential equation into the solutions and have been studied extensively for over a…
In this paper, we study Hessian equations and complex quotient equations on closed Hermitian manifolds. We directly derive the uniform estimate for the admissible solution. As an application, we solve general Hessian equations on closed…
We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…
To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration…
A general issue in computational optimization is to develop combinatorial algorithms for semidefinite programming. We address this issue when the base field is nonarchimedean. We provide a solution for a class of semidefinite feasibility…
This paper considers universal Hilbert space operators in the sense of Rota, and gives criteria for universality of semigroups in the context of uniformly continuous semigroups and contraction semigroups. Specific examples are given.…
An unconstrained optimization problem is formulated in terms of tropical mathematics to minimize a functional that is defined on a vector set by a matrix and calculated through multiplicative conjugate transposition. For some particular…
A new technique for approximating the entire solution set for a nonlinear system of relations (nonlinear equations, inequalities, etc. involving algebraic, smooth, or even continuous functions) is presented. The technique is to first plot…
We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings and semifields with idempotent addition. Given a set of samples, each consisting of the input and…
In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman-Morrison-Woodbury formula. The implementation of the algorithm…
In quantum theory, the so-called "spinless Salpeter equation," the relativistic generalization of the nonrelativistic Schroedinger equation, is used to describe both bound states of scalar particles and the spin-averaged spectra of bound…
Matrix scaling and matrix balancing are two basic linear-algebraic problems with a wide variety of applications, such as approximating the permanent, and pre-conditioning linear systems to make them more numerically stable. We study the…
We define a formal framework for the study of algebras of type Max-plus, Min-Plus, tropical algebras, and more generally algebras over a commutative idempotent semi-field. This work is motivated by the increasingly diversified use of these…