We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs/outputs at the boundary can be represented as the full contraction of a tensor ne...

One of the oldest methods for computing an eigenvector of a matrix F is based on the solution of a set of homogeneous equations which can be traced back to the times of Cauchy The principal di culty of this approach was identi ed by Wilkinson We remove this obstacle and analyse the viability of this classical method The key to the analysis is provided by the reciprocals of the diagonal elements...

This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...

Nonlinear vibration behavior of beam is an important issue of structural engineering. In this study, a mathematical modeling of a forced nonlinear vibration of Euler-Bernoulli beam resting on nonlinear elastic foundation is presented. The nonlinear vibration behavior of the beam is investigated by using a modified multi-level residue harmonic balance method. The main advantage of the method is ...