Related papers: Using vector divisions in solving linear complemen…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
In this article, we propose a splitting algorithm to find zeros of the sum of four maximally monotone operators in real Hilbert spaces. In particular, we consider a Lipschitzian operator, a cocoercive operator, and a linear composite term.…
The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…
We present an efficient preconditioner for linear problems $A x=y$. It guarantees monotonic convergence of the memory-efficient fixed-point iteration for all accretive systems of the form $A = L + V$, where $L$ is an approximation of $A$,…
In this paper we describe a method to solve the linear non-homogeneous fractional differential equations (FDE), composed with Jumarie type Fractional Derivative, and describe this method developed by us, to find out Particular Integrals,…
We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions, linear right hand side functions, and a constant coefficient matrix, as well as their symmetric dual. We search for…
A shift-invariant system is a collection of functions $\{g_{m,n}\}$ of the form $g_{m,n}(k) = g_m(k-an)$. Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual…
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set…
A simple yet effective numerical method using orthogonal hybrid functions consisting of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal triangular functions is proposed to solve numerically fractional…
In this paper, we propose a smoothing method to solve nonlinear complementarity problems involving P 0-functions. We propose a nonparametric algorithm to solve the nonlinear corresponding system of equations and prove some global and local…
In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…
In this paper, by making use of properties of elliptic functions, we describe meromorphic solutions of Fermat-type functional equations $f(z)^{n}+f(L(z))^{m}=1$ over the complex plane $\mathbb{C}$, where $L(z)$ is a nonconstant entire…
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…
The paper aims to show the equivalency between nonlinear complementarity problem and the system of nonlinear equations. We propose a homotopy method with vector parameter $\lambda$ in finding the solution of nonlinear complementarity…
The main goal of this article is to show a new method to solve some Fractional Order Integral Equations (FOIE), more precisely the ones which are linear, have constant coefficients and all the integration orders involved are rational. The…
In this paper we study the operator inequality \phi(X)\leq X and the operator equation \phi(X)= X, where \phi is a w^*-continuous positive (resp. completely positive) linear map on B(H). We show that their solutions are in one-to-one…
In this article we establish error bound for linear complementarity problem with $P$-matrix using plus function. We introduce a fundamental quantity associated with a $P$-matrix and show how this quantity is useful in deriving error bounds…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
We present a globally convergent SQP-type method with the least constraint violation for nonlinear semidefinite programming. The proposed algorithm employs a two-phase strategy coupled with a line search technique. In the first phase, a…
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…