Related papers: Further study on tensor absolute value equations
Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an absolute value equation. It is equivalent to the general linear complementarity problem, and thus NP hard…
We consider linear systems of equations and inequalities with coefficients varying inside given intervals. We define their solutions (so called AE solutions) and solvability (so called AE solvability) by using forall-exists quantification…
The SOR-like iteration method for solving the absolute value equations~(AVE) of finding a vector $x$ such that $Ax - |x| - b = 0$ with $\nu = \|A^{-1}\|_2 < 1$ is investigated. The convergence conditions of the SOR-like iteration method…
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…
Tensor networks are a class of algorithms aimed at reducing the computational complexity of high-dimensional problems. They are used in an increasing number of applications, from quantum simulations to machine learning. Exploiting data…
The numerical approximation of partial differential equations (PDEs) poses formidable challenges in high dimensions since classical grid-based methods suffer from the so-called curse of dimensionality. Recent attempts rely on a combination…
A new class of affine scaling matrices for the interior point Newton-type methods is considered to solve the nonlinear systems with simple bounds. We review the essential properties of a scaling matrix and consider several well-known…
In this paper, we mainly develop the well-known vector and matrix polynomial extrapolation methods in tensor framework. To this end, some new products between tensors are defined and the concept of positive definitiveness is extended for…
This study investigates the effectiveness of Genetic Algorithms (GAs) in solving both linear and nonlinear systems of equations, comparing their performance to traditional methods such as Gaussian Elimination, Newton's Method, and…
We present a method to solve initial and boundary value problems using artificial neural networks. A trial solution of the differential equation is written as a sum of two parts. The first part satisfies the boundary (or initial) conditions…
In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…
Tensor structured Markov chains are part of stochastic models of many practical applications, e.g., in the description of complex production or telephone networks. The most interesting question in Markov chain models is the determination of…
A multigrid method is proposed for solving nonlinear eigenvalue problems by the finite element method. With this new scheme, solving nonlinear eigenvalue problem is decomposed to a series of solutions of linear boundary value problems on…
Pricing multi-asset options via the Black-Scholes PDE is limited by the curse of dimensionality: classical full-grid solvers scale exponentially in the number of underlyings and are effectively restricted to three assets. Practitioners…
Tensor network techniques, known for their low-rank approximation ability that breaks the curse of dimensionality, are emerging as a foundation of new mathematical methods for ultra-fast numerical solutions of high-dimensional Partial…
Affine variational inequalities (AVI) are an important problem class that generalize systems of linear equations, linear complementarity problems and optimality conditions for quadratic programs. This paper describes PATHAVI, a…
By means of topological methods, we provide new results on the existence, non-existence, localization and multiplicity of nontrivial solutions for systems of perturbed Hammerstein integral equations. In order to illustrate our theoretical…
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\boldsymbol{v}$ over a fixed field $\mathbb{F}$ for a specified…
Variational autoencoders (VAEs) are a powerful class of deep generative latent variable model for unsupervised representation learning on high-dimensional data. To ensure computational tractability, VAEs are often implemented with a…
A fixed-time stable dynamical system for solving the extended vertical linear complementarity problem (EVLCP) is developed. The system is based on the reformulation of EVLCP as a special case of a new kind of generalized absolute value…