Related papers: Palindromic linearization and numerical solution o…
The paper represents the method for construction of the families of particular solutions to some new classes of $(n+1)$ dimensional nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic…
Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…
The quantized Knizhnik-Zamolodchikov equations associated with the trigonometric R-matrix or the rational R-matrix of the A-type are considered. Jackson integral representations for solutions of these equations are described. Asymptotic…
We propose a new class of short matrix recurrences for the solution of nonsymmetric linear equations of the type $\mathbf{A}_1\mathbf{X}\mathbf{B}_1+\ldots+\mathbf{A}_p\mathbf{X}\mathbf{B}_p=CD^T$. These iterative methods combine local…
To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we need to find the correct solutions out of numerous combinations of rotations or piece locations. Solving this kind of combinatorial optimization problem is a very…
Modelling real world systems frequently requires the solution of systems of nonlinear equations. A number of approaches have been suggested and developed for this computational problem. However, it is also possible to attempt solutions…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
Let $T$ be a self-adjoint operator on a complex Hilbert space $\mathcal{H}$. We give a sufficient and necessary condition for $T$ to be the pencil $\lambda P+Q$ of a pair $( P, Q)$ of projections at some point…
In this chapter we are examining several iterative methods for solving nonlinear eigenvalue problems. These arise in variational image-processing, graph partition and classification, nonlinear physics and more. The canonical eigenproblem we…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some…
In this work, we consider symmetric positive definite pencils depending on two parameters. That is, we are concerned with the generalized eigenvalue problem $A(x)-\lambda B(x)$, where $A$ and $B$ are symmetric matrix valued functions in…
Our problem is to accurately solve linear systems on a general purpose graphics processing unit with double double and quad double arithmetic. The linear systems originate from the application of Newton's method on polynomial systems.…
A new iterative method for solving large scale symmetric nonlinear eigenvalue problems is presented. We firstly derive an infinite dimensional symmetric linearization of the nonlinear eigenvalue problem, then we apply the indefinite Lanczos…
We deal with the problem of description of nonsingular pairs of compatible flat metrics for the general $N$-component case. We describe the scheme of the integrating the nonlinear equations describing nonsingular pairs of compatible flat…
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…
Fitting a matrix of a given rank to data in a least squares sense can be done very effectively using 2nd order methods such as Levenberg-Marquardt by explicitly optimizing over a bilinear parameterization of the matrix. In contrast, when…
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face…
We present recent results on the enumeration of $q$-coloured planar maps, where each monochromatic edge carries a weight $\nu$. This is equivalent to weighting each map by its Tutte polynomial, or to solving the $q$-state Potts model on…
In this paper we the formulation of inverse problems as constrained minimization problems and their iterative solution by gradient or Newton type. We carry out a convergence analysis in the sense of regularization methods and discuss…