Related papers: Solving singular generalized eigenvalue problems. …
In this article, we study the singular case of an homogeneous generalized discrete time system with given initial conditions. We consider the matrix pencil singular and provide necessary and sufficient conditions for existence and…
Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…
In this work, we observe that many existing self-supervised learning algorithms can be both unified and generalized when seen through the lens of equivariant representations. Specifically, we introduce a general framework we call…
In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we given an affirmative result showing that…
We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…
We propose an augmented Lagrangian-type algorithm for the solution of generalized Nash equilibrium problems (GNEPs). Specifically, we discuss the convergence properties with regard to both feasibility and optimality of limit points. This is…
We study the generalized eigenvalue problem on the whole space for a class of integro-differential elliptic operators. The nonlocal operator is over a finite measure, but this has no particular structure. Some of our results even hold for…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
This paper deals with differential pencils possessing a term depending on the unknown function with a fixed argument. We deduce the so called main equation together with its fine structure for the spectral problem. Then, according to the…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This paper mainly investigates the classic resonant cavity problem with anisotropic and nonconductive media, which is a linear vector Maxwell's eigenvalue problem. The finite element method based on edge element of the lowest-order and…
We propose an eigensolver and the corresponding package, GCGE, for solving large scale eigenvalue problems. This method is the combination of damping idea, subspace projection method and inverse power method with dynamic shifts. To reduce…
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…
The rational QZ method generalizes the QZ method by implicitly supporting rational subspace iteration. In this paper we extend the rational QZ method by introducing shifts and poles of higher multiplicity in the Hessenberg pencil, which is…
Ever increasing computational power will require methods for automatic programming. We present an alternative to genetic programming, based on a general model of thinking and learning. The advantage is that evolution takes place in the…
We propose the generalized quadrature methods for numerical solution of singular integral equation of Abel type. We overcome the singularity using the analytical calculation of the singular integral expression. The problem of solution of…
Self-supervised learning has become a popular approach in recent years for its ability to learn meaningful representations without the need for data annotation. This paper proposes a novel image augmentation technique, overlaying images,…
We study linear pencils of curves on normal surface singularities. Using the minimal good resolution of the pencil, we describe the topological type of generic elements of the pencil and characterize the behaviour of special elements. Then…