Related papers: Variational Characterization of Monotone Nonlinear…
CoVariance Neural Networks (VNNs) perform convolutions on the graph determined by the covariance matrix of the data, which enables expressive and stable covariance-based learning. However, covariance matrices are typically dense, fail to…
Our goal is to efficiently compute low-dimensional latent coordinates for nodes in an input graph -- known as graph embedding -- for subsequent data processing such as clustering. Focusing on finite graphs that are interpreted as uniform…
We investigate the monotonicity method for fractional semilinear elliptic equations with power type nonlinearities. We prove that if-and-only-if monotonicity relations between coefficients and the derivative of the Dirichlet-to-Neumann map…
In this paper we mainly investigate the strong and weak well-posedness of a class of McKean-Vlasov stochastic (partial) differential equations. The main existence and uniqueness results state that we only need to impose some local…
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…
In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizations of M-matrices, our result establishes NP-hardness of…
It is common in machine learning and statistics to use symmetries derived from expert knowledge to simplify problems or improve performance, using methods like data augmentation or penalties. In this paper we consider the unsupervised and…
In this paper we take a quasi-Newton approach to nonlinear eigenvalue problems (NEPs) of the type $M(\lambda)v=0$, where $M:\mathbb{C}\rightarrow\mathbb{C}^{n\times n}$ is a holomorphic function. We investigate which types of approximations…
This paper studies formulations of second-order elliptic partial differential equations in nondivergence form on convex domains as equivalent variational problems. The first formulation is that of Smears \& S\"uli [SIAM J.\ Numer.\ Anal.\…
Anisotropic mesh adaptation is studied for the linear finite element solution of eigenvalue problems with anisotropic diffusion operators. The M-uniform mesh approach is employed with which any nonuniform mesh is characterized…
The notion of quasi-Fej\'er monotonicity has proven to be an efficient tool to simplify and unify the convergence analysis of various algorithms arising in applied nonlinear analysis. In this paper, we extend this notion in the context of…
This paper discusses some of the physical properties of plane symmetric self-similar solutions of the first kind (i.e., homothetic solutions). We are interested in calculating the expansion, the acceleration, the rotation, the shear tensor,…
The modeling of electric machines and power transformers typically involves systems of nonlinear magnetostatics or -quasistatics, and their efficient and accurate simulation is required for the reliable design, control, and optimization of…
To study convergence of SMACOF we introduce a modification mSMACOF that rotates the configurations from each of the SMACOF iterations to principal components. This modification, called mSMACOF, has the same stress values as SMACOF in each…
In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the…
This article is concerned with the numerical solution of convex variational problems. More precisely, we develop an iterative minimisation technique which allows for the successive enrichment of an underlying discrete approximation space in…
We introduce steerable neural ordinary differential equations on homogeneous spaces $M=G/H$. These models constitute a novel geometric extension of manifold neural ordinary differential equations (NODEs) that transport associated feature…
In this paper, we consider the second-order cone tensor eigenvalue complementarity problem (SOCTEiCP) and present three different reformulations to the model under consideration. Specifically, for the general SOCTEiCP, we first show its…
Random samples are extensively used to summarize massive data sets and facilitate scalable analytics. Coordinated sampling, where samples of different data sets "share" the randomization, is a powerful method which facilitates more accurate…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…