Related papers: Accurate Solutions of Polynomial Eigenvalue Proble…
The paper aims to propose a suitable method in finding the solution of tensor complementarity problem. The tensor complementarity problem is a subclass of nonlinear complementarity problems for which the involved function is defined by a…
We propose an iterative method to find pointwise growth exponential growth rates in linear problems posed on essentially one-dimensional domains. Such pointwise growth rates capture pointwise stability and instability in extended systems…
The self-consistent procedure in electronic structure calculations is revisited using a highly efficient and robust algorithm for solving the non-linear eigenvector problem i.e. H({{\psi}}){\psi} = E{\psi}. This new scheme is derived from a…
Implicit inverse problems, in which noisy observations of a physical quantity are used to infer a nonlinear functional applied to an associated function, are inherently ill posed and often exhibit non uniqueness of solutions. Such problems…
Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…
The Homotopy Perturbation Method (HPM) is used to solve the Burgers-Huxley non-linear differential equations. Three case study problems of Burgers-Huxley are solved using the HPM and the exact solutions are obtained. The rapid convergence…
In this work, Lienard equations are considered. The limit cycles of these systems are studied by applying the homotopy analysis method. The amplitude and frequency obtained with this methodology are in good agreement with those calculated…
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…
Often the easiest way to discretize an ordinary or partial differential equation is by a rectangular numerical method, in which n basis functions are sampled at m>>n collocation points. We show how eigenvalue problems can be solved in this…
We consider nonlinear eigenvalue problems to compute all eigenvalues in a bounded region on the complex plane. Based on domain decomposition and contour integrals, two robust and scalable parallel multi-step methods are proposed. The first…
Quadratically constrained quadratic programs (QCQPs) are ubiquitous in optimization: Such problems arise in applications from operations research, power systems, signal processing, chemical engineering, and portfolio theory, among others.…
The aim of this paper is to propose an efficient adaptive finite element method for eigenvalue problems based on the multilevel correction scheme and inverse power method. This method involves solving associated boundary value problems on…
Many important systems across biology, engineering, physics, and economics are characterized by polynomial ordinary differential equations (ODEs), yet analytical solutions are rare. We develop a framework for identifying and solving a broad…
Travelling and rotating waves are ubiquitous phenomena observed in time dependent PDEs modelling the combined effect of dissipation and non-linear interaction. From an abstract viewpoint they appear as relative equilibria of an equivariant…
We show that (i) any constrained polynomial optimization problem (POP) has an equivalent formulation on a variety contained in an Euclidean sphere and (ii) the resulting semidefinite relaxations in the moment-SOS hierarchy have the constant…
The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions.…
Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph.…
A new algorithm for solving the solution of the linear-quadratic optimization problem (LQP) with unseparated boundary conditions in the continuous case is given. Using the properties of symmetry of the corresponding Hamiltonian matrix, the…
In this paper, we discuss the solution of a Quadratic Eigenvalue Complementarity Problem (QEiCP) by using Difference of Convex (DC) programming approaches. We first show that QEiCP can be represented as dc programming problem. Then we…
Solving real-time quadratic programming (QP) is a ubiquitous task in control engineering, such as in model predictive control and control barrier function-based QP. In such real-time scenarios, certifying that the employed QP algorithm can…