Related papers: Using covariance extension equation to solve the N…
We study interpolation L-systems realizing finite Nevanlinna-Pick data sets and analyze their structural and quantitative characteristics. Explicit formulas are derived for the c-entropy and dissipation coefficient, two intrinsic invariants…
The covariance evolution is a system of differential equations with respect to the covariance of the number of edges connecting to the nodes of each residual degree. Solving the covariance evolution, we can derive distributions of the…
Chandrasekaran, Parrilo and Willsky (2010) proposed a convex optimization problem to characterize graphical model selection in the presence of unobserved variables. This convex optimization problem aims to estimate an inverse covariance…
The systems of nonlinear Volterra integral equations of the first kind with jump discontinuous kernels are studied. The iterative numerical method for such nonlinear systems is proposed. Proposed method employs the modified…
We propose the numerical methods for solution of the weakly regular linear and nonlinear evolutionary (Volterra) integral equation of the first kind. The kernels of such equations have jump discontinuities along the continuous curves…
We apply the Linear Delta Expansion (LDE) to the Lindstedt-Poincare (``distorted time'') method to find improved approximate solutions to nonlinear problems. We find that our method works very well for a wide range of parameters in the case…
We extend our Nevanlinna-Pick theorem for Hardy algebras and their representations to cover interpolation at the absolutely continuous points of the boundaries of their discs of representations. The Lyapunov order plays a crucial role in…
We propose certain approach of solving two-dimensional non-stationary and stationary advection-diffusion-reaction boundary value problems through their reduction to the set of corresponding one-dimensional problems. This method leverages…
In this paper, we first propose a new Levenberg-Marquardt method for solving constrained (and not necessarily square) nonlinear systems. Basically, the method combines the unconstrained Levenberg-Marquardt method with a type of feasible…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
A new method is introduced for studying boundary value problems for a class of linear PDEs with {\it variable} coefficients. This method is based on ideas recently introduced by the author for the study of boundary value problems for PDEs…
The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and…
It is very elementary to observe that functions interpolating an extremal two-point Pick problem on the polydisc are just left inverses to complex geodesics. In the present article we show that the same property holds for a three-point Pick…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The underlying synthesis problem, however, is challenging and…
In this paper a novel hybrid approach for compensating the distortion of any interpolation has been proposed. In this hybrid method, a modular approach was incorporated in an iterative fashion. By using this approach we can get drastic…
We establish new analytic and numerical results on a general class of rational operator Nevanlinna functions that arise e.g. in modelling photonic crystals. The capability of these dielectric nano-structured materials to control the flow of…
In this paper we define a non-iterative transformation method for an Extended Blasius Problem. The original non-iterative transformation method, which is based on scaling invariance properties, was defined for the classical Blasius problem…
This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly…
In this paper we use a Variational Quantum Algorithm to solve Initial Value Problems with the Implicit Crank-Nicolson and the Method of Lines (MoL) evolution schemes. The unknown functions use a spectral decomposition with the Fourier…