Related papers: Theoretical and Computable Optimal Subspace Expans…
We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of…
In mathematical modelling, the data and solutions are represented as measurable functions and their quality is oftentimes captured by the membership to a certain function space. One of the core questions for an analysis of a model is the…
Making sense of Wasserstein distances between discrete measures in high-dimensional settings remains a challenge. Recent work has advocated a two-step approach to improve robustness and facilitate the computation of optimal transport, using…
We consider random matrices of the form $H = W + \lambda V$, $\lambda\in\mathbb{R}^+$, where $W$ is a real symmetric or complex Hermitian Wigner matrix of size $N$ and $V$ is a real bounded diagonal random matrix of size $N$ with i.i.d.\…
Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often…
Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
We propose a method for designing accurate interpolation formulas on the real axis for the purpose of function approximation in weighted Hardy spaces. In particular, we consider the Hardy space of functions that are analytic in a strip…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
In this paper, we consider the optimal design of photonic crystal band structures for two-dimensional square lattices. The mathematical formulation of the band gap optimization problem leads to an infinite-dimensional Hermitian eigenvalue…
This paper presents a method for computing eigenvalues and eigenvectors for some types of nonlinear eigenvalue problems. The main idea is to approximate the functions involved in the eigenvalue problem by rational functions and then apply a…
In this paper, we derive an asymptotic error expansion for the eigenvalue approximations by the lowest order Raviart-Thomas mixed finite element method for the general second order elliptic eigenvalue problems. Extrapolation based on such…
A type of parallel augmented subspace scheme for eigenvalue problems is proposed by using coarse space in the multigrid method. With the help of coarse space in multigrid method, solving the eigenvalue problem in the finest space is…
In this manuscript we study the following optimization problem: given a bounded and regular domain $\Omega\subset \mathbb{R}^N$ we look for an optimal shape for the "$\mathrm{W}-$vanishing window" on the boundary with prescribed measure…
We propose subspace methods for 3-parameter eigenvalue problems. Such problems arise when separation of variables is applied to separable boundary value problems; a particular example is the Helmholtz equation in ellipsoidal and…
Studying the optoelectronic structure of materials can require the computation of several thousands of the smallest positive eigenpairs of a pseudo-hermitian Hamiltonian. Iterative eigensolvers may be preferred over direct methods for this…
In this paper we study optimization problems for Neumann eigenvalues $\mu_k$ among convex domains with a constraint on the diameter or the perimeter. We work mainly in the plane, though some results are stated in higher dimension. We study…
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the…
In this paper, by introducing a class of relaxed filtered Krylov subspaces, we propose the relaxed filtered Krylov subspace method for computing the eigenvalues with the largest real parts and the corresponding eigenvectors of non-symmetric…