Related papers: Further study on tensor absolute value equations
We study a nonlinear transport equation defined on an oriented network where the velocity field depends not only on the state variable, but also on the solution itself. We prove existence, uniqueness and continuous dependence results for…
We propose a new kind of stochastic absolute value equations involving absolute values of variables. By utilizing an equivalence relation to stochastic bilinear program, we investigate the expected value formulation for the proposed…
Efforts are underway to improve the design and sensitivity of gravitational waves detectors, with the hope that the next generation of these detectors will observe a gravitational wave signal. Such a signal will not only provide information…
Invariance has recently proven to be a powerful inductive bias in machine learning models. One such class of predictive or generative models are tensor networks. We introduce a new numerical algorithm to construct a basis of tensors that…
In this paper we focus on the problem of completion of multidimensional arrays (also referred to as tensors) from limited sampling. Our approach is based on a recently proposed tensor-Singular Value Decomposition (t-SVD) [1]. Using this…
This article develops a new algorithm named TTRISK to solve high-dimensional risk-averse optimization problems governed by differential equations (ODEs and/or PDEs) under uncertainty. As an example, we focus on the so-called Conditional…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…
We present a brief survey on the modern tensor numerical methods for multidimensional stationary and time-dependent partial differential equations (PDEs). The guiding principle of the tensor approach is the rank-structured separable…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
This paper introduces a new mathematical framework for analysis and optimization of tensor expressions within an enclosing loop. Tensors are multi-dimensional arrays of values. They are common in high performance computing (HPC) and machine…
In this work, we discuss the polarization contents of Einstein-\ae ther theory and the generalized tensor-vector-scalar (TeVeS) theory, as both theories have a normalized timelike vector field. We derive the linearized equations of motion…
To better understand the algebra $\mathcal{M}_n$ of all $n\times n$ complex matrices, we explore the class of accretive matrices. This class has received renowned attention in recent years due to its role in complementing those results…
The exactly integrable systems connected with semisimple series $A$ for arbitrary grading are presented in explicit form. Their general solutions are expressed in terms of the matrix elements of various fundamental representations of $A_n$…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
The method is proposed for the study of many-point boundary value problems for systems of nonlinear ODE, by reducing them to special equivalent integral equations, and allows us [in contrast with the known method [1]] to consider boundary…
Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced…
This paper presents high-order numerical methods for solving boundary value problems associated with the Lane-Emden equation, which frequently arises in astrophysics and various nonlinear models. A major challenge in studying this equation…
Invex programs are a special kind of non-convex problems which attain global minima at every stationary point. While classical first-order gradient descent methods can solve them, they converge very slowly. In this paper, we propose new…
We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…