Related papers: A numerical method for the solution of relaxed one…
In this paper we describe how to improve the performance of the symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth one case. By…
We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…
We consider the harmonic balance method for finding approximate periodic solutions of the Lorenz system. When developing software that implements the described method, the math package Maxima was chosen. The drawbacks of symbolic…
The present article is a part of the study of solvable Leibniz algebras with a given nilradical. In this paper solvable Leibniz algebras, whose nilradicals is naturally graded quasi-filiform algebra and the complemented space to the…
This work develops new numerical methods for the solution of the tomography problem in domains with reflecting obstacles. We compare the solution's performance for Lambertian reflection, for classical tomography with unbroken rays and for…
Consider the scattering of a time-harmonic plane wave by a rigid obstacle embedded in a homogeneous and isotropic elastic medium in two dimensions. In this paper, a novel boundary integral formulation is proposed and its highly accurate…
In the present paper a numerical method is developed to approximate the solution of two-dimensional NLS equation in the presence of a singular potential. The method leads to Lyapunov-Syslvester algebraic operators that are shown to be…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
This work proposes and analyzes a fully discrete numerical scheme for solving the Landau-Lifshitz-Gilbert (LLG) equation, which achieves fourth-order spatial accuracy and third-order temporal accuracy.Spatially, fourth-order accuracy is…
Adaptive Finite Element Method (adaptivity) is known to be an effective numerical tool for some ill-posed problems. The key advantage of the adaptivity is the image improvement with local mesh refinements. A rigorous proof of this property…
In this work numerical methods for solving Einstein's equations are developed and applied to the study of inhomogeneous cosmological models. A two-dimensional computer code is described which implements two advanced numerical methods:…
Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…
Nonconvex optimization problems with an L1-constraint are ubiquitous, and are found in many application domains including: optimal control of hybrid systems, machine learning and statistics, and operations research. This paper shows that…
A complete p-adic Khintchine type theorem for approximation by p-adic algebraic numbers is established.
This paper introduces a novel algorithm for Mixed-Integer Nonlinear Programming (MINLP) problems with multilinear interpolations of look-up tables. These problems arise when objective or constraints contain black-box functions only known at…
A numerical method is developed leading to algebraic systems based on generalized Lyapunov-Sylvester operators to approximate the solution of two-dimensional Boussinesq equation. It consists of an order reduction method and a finite…
In this paper, we propose a numerical method for verifying the positiveness of solutions to semilinear elliptic equations. We provide a sufficient condition for a solution to an elliptic equation to be positive in the domain of the…
This paper develops a probabilistic numerical method for solution of partial differential equations (PDEs) and studies application of that method to PDE-constrained inverse problems. This approach enables the solution of challenging inverse…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…