Related papers: Direct solution of piecewise linear systems
An extension of the algebraic-geometric method for nonlinear integrable PDE's is shown to lead to new piecewise smooth weak solutions of a class of $N$-component systems of nonlinear evolution equations. This class includes, among others,…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
The Gaussian Elimination with Partial Pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due to roundoff errors can be very significant, empirical…
Discontinuous Finite Element Methods (DFEM) have been widely used for solving $S_n$ radiation transport problems in participative and non-participative media. In the DFEM $S_n$ methodology, the transport equation is discretized into a set…
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements,…
We discuss different cases of dissipative Hamiltonian differential-algebraic equations and the linear algebraic systems that arise in their linearization or discretization. For each case we give examples from practical applications. An…
We study the one-dimensional totally asymmetric simple exclusion process in contact with two reservoirs including also a fugacity at one boundary. The eigenvectors and the eigenvalues of the corresponding Markov matrix are computed using…
We consider the problem of decomposing tensor powers of the fundamental level 1 highest weight representation $V$ of the affine Kac-Moody algebra $\g(E_9)$. We describe an elementary algorithm for determining the decomposition of the…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
In this paper, we discussed the unique solvability of the two absolute value matrix equations. The unique solvability condition $\rho (\vert A^{-1} B \vert)<1$ is provided for the generalized absolute value matrix equation (GAVME) $AX + B…
Quantifier elimination (QE) is an important problem that has numerous applications. Unfortunately, QE is computationally very hard. Earlier we introduced a generalization of QE called $\mathit{partial}$ QE (or PQE for short). PQE allows to…
In this paper, we present a novel semi-implicit numerical scheme for the stochastic Cahn--Hilliard equation driven by multiplicative noise. By reformulating the original equation into an equivalent stochastic scalar auxiliary variable…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
A method for the numerical solution of variable order (VO) fractional differential equations (FDE) is presented. The method applies to linear as well as to nonlinear VO-FDEs. The Caputo type VO fractional derivative is employed. First, an…
Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this…
The Bayesian approach has proved to be a coherent approach to handle ill posed Inverse problems. However, the Bayesian calculations need either an optimization or an integral calculation. The maximum a posteriori (MAP) estimation requires…
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. The computational complexity of VCSPs depends on the set of allowed cost functions in the input. Recently, the computational…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…