Related papers: Contour Integration for Eigenvector Nonlinearities
We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The…
We study the enclosure method for the p-Calder\'on problem, which is a nonlinear generalization of the inverse conductivity problem due to Calder\'on that involves the p-Laplace equation. The method allows one to reconstruct the convex hull…
We generalize $\epsilon$-pseudospectra and the associated computational algorithms to the generalized eigenvalue problem. Rank one perturbations are used to determine the $\epsilon$-pseudospectra.
Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…
We present a novel, log-radius profile representation for convex curves and define a new operation for combining the shape features of curves. Unlike the standard, angle profile-based methods, this operation accurately combines the shape…
The nonlinear integral equation P(x)=\int_alpha^beta dy w(y) P(y) P(x+y) is investigated. It is shown that for a given function w(x) the equation admits an infinite set of polynomial solutions P(x). For polynomial solutions, this nonlinear…
It is shown that large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems, can be solved by the method of order completion. The solutions obtained can be assimilated with Hausdorff…
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.…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…
We study the generalized eigenvalue problem in $\mathbb{R}^N$ for a general convex nonlinear elliptic operator which is locally elliptic and positively $1$-homogeneous. Generalizing article of Berestycki and Rossi in [Comm. Pure Appl. Math.…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
A feature of certain ensembles of random matrices is that the corresponding measure is invariant under conjugation by unitary matrices. Study of such ensembles realised by matrices with Gaussian entries leads to statistical quantities…
We establish a general convergence theory of the Rayleigh--Ritz method and the refined Rayleigh--Ritz method for computing some simple eigenpair $(\lambda_{*},x_{*})$ of a given analytic regular nonlinear eigenvalue problem (NEP). In terms…
We consider the numerical computation of resonances for metallic grating structures with dispersive media and small slit holes. The underlying eigenvalue problem is nonlinear and the mathematical model is multiscale due to the existence of…
The problem of computing differential constraints for a family of evolution PDEs is discussed from a constructive point of view. A new method, based on the existence of generalized characteristics for evolution vector fields, is proposed in…
We will employ the method of contour integration to investigate the parity results of non-embedded cyclotomic multiple $t$-values, which we refer to as cyclotomic Euler $T$-sums. We can provide explicit parity formulas for the linear and…
The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others.…
In this paper, we propose a smoothing method to solve nonlinear complementarity problems involving P 0-functions. We propose a nonparametric algorithm to solve the nonlinear corresponding system of equations and prove some global and local…
Interior eigenvalue problems for large-scale sparse Hermitian matrices are fundamental in computational science. We propose an adaptive polynomial filtering strategy based on Chebyshev expansion of a step function, integrated into a…